Book chapter
Constraint Propagation for Domain Bounding in Distributed Task Scheduling
Principles and Practice of Constraint Programming - CP 2006, pp 756-760
2006
Abstract
The coordinated management of inter-dependent plans or schedules belonging to different agents is a complex, real-world problem arising in diverse domains such as disaster rescue, small-team reconnaissance, and security patrolling. The problem is inherently a distributed one; no single agent has a global view and must make local scheduling decisions through collaboration with other agents to ensure a high quality global schedule. A key step towards addressing this problem is to devise appropriate distributed representations. The Coordinators Task Analysis Environmental Modeling and Simulation (C_tæms) language is a representation that was jointly designed by several multi-agent systems researchers explicitly for multi-agent task scheduling problems [1,2,3,4]. C_tæms is an extremely challenging class of scheduling problem which is able to model the distributed aspects of the problem.
Metrics
3 Record Views
2 citations in Scopus
Details
- Title
- Constraint Propagation for Domain Bounding in Distributed Task Scheduling
- Creators
- Evan A. Sultanik - Drexel UniversityPragnesh Jay Modi - Drexel UniversityWilliam C. Regli - Drexel University
- Publication Details
- Principles and Practice of Constraint Programming - CP 2006, pp 756-760
- Series
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg; Berlin, Heidelberg
- Resource Type
- Book chapter
- Language
- English
- Web of Science ID
- WOS:000241582400064
- Scopus ID
- 2-s2.0-33750347546
- Other Identifier
- 991019357763604721
InCites Highlights
Data related to this publication, from InCites Benchmarking & Analytics tool:
- Web of Science research areas
- Computer Science, Theory & Methods