Introduction to algorithms
Artificial Intelligence - Special issue on knowledge representation
Fast transformation of temporal plans for efficient execution
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Execution of Temporal Plans with Uncertainty
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
Generating Bids for Group-Related Actions in the Context of Prior Commitments
ATAL '01 Revised Papers from the 8th International Workshop on Intelligent Agents VIII
A Combinatorial Auction for Collaborative Planning
ICMAS '00 Proceedings of the Fourth International Conference on MultiAgent Systems (ICMAS-2000)
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
Distributed management of flexible times schedules
Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems
Flexible approximation of structured interactions in decentralized Markov decision processes
Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 2
A Practical Temporal Constraint Management System for Real-Time Applications
Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
Randomized adaptive spatial decoupling for large-scale vehicle routing with time windows
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
WI-IAT '09 Proceedings of the 2009 IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology - Volume 02
Agreeing on social outcomes using individual CP-nets
Multiagent and Grid Systems - Planning in multiagent systems
Coordination by design and the price of autonomy
Autonomous Agents and Multi-Agent Systems
Concurrently decomposable constraint systems
MATES'09 Proceedings of the 7th German conference on Multiagent system technologies
Optimal temporal decoupling in multiagent systems
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
Partitioning the multiagent simple temporal problem for concurrency and privacy
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
Spatial, temporal, and hybrid decompositions for large-scale vehicle routing with time windows
CP'10 Proceedings of the 16th international conference on Principles and practice of constraint programming
Distributed algorithms for solving the multiagent temporal decoupling problem
The 10th International Conference on Autonomous Agents and Multiagent Systems - Volume 1
Decomposing constraint systems: equivalences and computational properties
The 10th International Conference on Autonomous Agents and Multiagent Systems - Volume 1
The dynamics of intention in collaborative activity
Cognitive Systems Research
Solving the multiagent selection and scheduling problem
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Three
Maximum Flexibility and Optimal Decoupling in Task Scheduling Problems
WI-IAT '12 Proceedings of the The 2012 IEEE/WIC/ACM International Joint Conferences on Web Intelligence and Intelligent Agent Technology - Volume 02
Decoupling the multiagent disjunctive temporal problem
Proceedings of the 2013 international conference on Autonomous agents and multi-agent systems
Flexibility and decoupling in the simple temporal problem
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Distributed reasoning for multiagent simple temporal problems
Journal of Artificial Intelligence Research
| Hi-index | 0.00 |
The Temporal Decoupling Problem (TDP) arises when a group of agents collaborating on a set of temporally-dependent tasks seek to coordinate their execution of those tasks by applying additional temporal constraints sufficient to ensure that agents working on different tasks may operate independently. This paper: (1)formally defines the TDP, (2) presents theorems that give necessary and sufficient conditions for solutions to the TDP, (3)presents a family of sound and complete algorithms for solving the TDP, and (4) compares the performance of several variations of the basic algorithm. Although this work was motivated by a problem in collaborative multi-agent planning, it represents a contribution to the theory of Simple Temporal Networks that is independent of the motivating application.