A dynamization of the all pairs least cost path problem
Proceedings on STACS 85 2nd annual symposium on theoretical aspects of computer science
Artificial Intelligence - Special issue on knowledge representation
On the computational complexity of dynamic graph problems
Theoretical Computer Science
Algorithms for a temporal decoupling problem in multi-agent planning
Eighteenth national conference on Artificial intelligence
A new approach to dynamic all pairs shortest paths
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Gaining efficiency and flexibility in the simple temporal problem
TIME '96 Proceedings of the 3rd Workshop on Temporal Representation and Reasoning (TIME'96)
Distributing the control of a temporal network among multiple agents
AAMAS '03 Proceedings of the second international joint conference on Autonomous agents and multiagent systems
Group decision making and temporal reasoning
Group decision making and temporal reasoning
COORDINATORS: Coordination Managers for First Responders
AAMAS '04 Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems - Volume 3
Worst-case update times for fully-dynamic all-pairs shortest paths
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Distributed management of flexible times schedules
Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems
The Knowledge Engineering Review
| Hi-index | 0.00 |
A temporal constraint management system (TCMS) is a temporal network together with algorithms for managing the constraints in that network over time. This paper presents a practical TCMS, called MYSYSTEM, that efficiently handles the propagation of the kinds of temporal constraints commonly found in real-time applications, while providing constant-time access to “all-pairs, shortest-path” information that is extremely useful in many applications. The temporal network in MYSYSTEM includes special time-points for dealing with the passage of time and eliminating the need for certain common forms of constraint propagation. The constraint propagation algorithm in MYSYSTEM maintains a restricted set of entries in the associated all-pairs, shortest-path matrix by incrementally propagating changes to the network either from adding a new constraint or strengthening, weakening or deleting an existing constraint. The paper presents empirical evidence to support the claim that MYSYSTEM is scalable to real-time planning, scheduling and acting applications.