Journal ArticleDOI
Temporal constraint networks
TLDR
It is shown that the STP, which subsumes the major part of Vilain and Kautz's point algebra, can be solved in polynomial time and the applicability of path consistency algorithms as preprocessing of temporal problems is studied, to demonstrate their termination and bound their complexities.About:
This article is published in Artificial Intelligence.The article was published on 1991-05-01. It has received 1989 citations till now. The article focuses on the topics: Constraint satisfaction problem & Constraint satisfaction.read more
Citations
More filters
Proceedings Article
Generalized planning with loops under strong fairness constraints
TL;DR: It is shown that planning for reachability and maintenance goals is EXPTIME-complete in this setting, that is, it has the same complexity as conditional planning in nondeterministic domains (without strong fairness constraints).
Book
Systematic Organisation of Information in Fuzzy Systems
TL;DR: This work presents new evolutions and progresses in the domain of information processing and organization in and by fuzzy systems and other types of systems using uncertain information.
Proceedings ArticleDOI
Distributing the control of a temporal network among multiple agents
TL;DR: This paper argues for STNs augmented to accommodate the real-time execution of tasks and introduces a more general conception of distributing control of a temporal network, one that is able to accommodate not only networks partially controlled by Nature, but also networks controlled by multiple agents.
Proceedings Article
Multi-Agent Management of Joint Schedules
TL;DR: An incremental scheduling framework designed to support joint management of inter-dependent schedules by multiple executing agents and which promotes solution stability and tends to minimize the ripple effect of change across agent schedules is described.
Journal ArticleDOI
Vehicle routing with transportable resources: using carpooling and walking for on-site services
TL;DR: This innovative formulation allows managers to reduce the size of the vehicle fleet while keeping the number of workers stable and, surprisingly, decreasing the overall driving distance simultaneously.
References
More filters
Book
The Design and Analysis of Computer Algorithms
Alfred V. Aho,John E. Hopcroft +1 more
TL;DR: This text introduces the basic data structures and programming techniques often used in efficient algorithms, and covers use of lists, push-down stacks, queues, trees, and graphs.
Journal Article
Maintaining knowledge about temporal intervals
TL;DR: An interval-based temporal logic is introduced, together with a computationally effective reasoning algorithm based on constraint propagation, which is notable in offering a delicate balance between space and time.
Journal ArticleDOI
Maintaining knowledge about temporal intervals
TL;DR: In this paper, an interval-based temporal logic is introduced, together with a computationally effective reasoning algorithm based on constraint propagation, which is notable in offering a delicate balance between time and space.
Journal ArticleDOI
Combinatorial optimization: algorithms and complexity
TL;DR: This clearly written, mathematically rigorous text includes a novel algorithmic exposition of the simplex method and also discusses the Soviet ellipsoid algorithm for linear programming; efficient algorithms for network flow, matching, spanning trees, and matroids; the theory of NP-complete problems; approximation algorithms, local search heuristics for NPcomplete problems, more.
Journal ArticleDOI
Consistency in Networks of Relations
TL;DR: The primary aim is to provide an accessible, unified framework, within which to present the algorithms including a new path consistency algorithm, to discuss their relationships and the may applications, both realized and potential of network consistency algorithms.