A comparison of algorithms for solving the multiagent simple temporal problem

ICAPS 2010 - Proceedings of the 20th International Conference on Automated Planning and Scheduling

Volumn , Issue , 2010, Pages 26-33

  Boerkoel Jr , James C ^a   Durfee, Edmund H ^a  

^a UNIVERSITY OF MICHIGAN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CENTRALIZED APPROACHES; CENTRALIZED SCHEDULING; CONCURRENT COMPUTATION; COUPLED PROBLEMS; MULTI-AGENT; PLANNING PROBLEM; SCHEDULING AGENTS; SIMPLE TEMPORAL PROBLEMS; SOLUTION TIME; SPEED-UPS;

SCALABILITY;

ALGORITHMS;

EID: 78650620364     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (9)

1. Bliek, C., and Sam-Haroud, D. 1999. Path consistency on triangulated constraint graphs. In IJCAI 1999, 456-461.
2. Cesta, A., and Oddi, A. 1996. Gaining efficiency and flexibility in the simple temporal problem. In Int. Workshop on Temporal Representation and Reasoning 1999.
3. Dechter, R.; Meiri, I.; and Pearl, J. 1991. Temporal constraint networks. Artificial Intelligence 49(1-3):61-95.
4. Hunsberger, L. 2002. Algorithms for a temporal decoupling problem in multi-agent planning. In AAAI 2002, 468-475.
5. Kjaerulff, U. 1990. Triangulation of graphs - algorithms giving small total state space. Technical report.
6. Planken, L.; de Weerdt, M.; and van der Krogt, R. 2008. P3c: A new algorithm for the simple temporal problem. In ICAPS 2008, 256-263.
7. Planken, L. 2008. Incrementally solving the stp by enforcing partial path consistency. In PlanSIG 2008, 87-94.
8. Smith, S. F.; Gallagher, A.; Zimmerman, T.; Barbulescu, L.; and Rubinstein, Z. 2007. Distributed management of flexible times schedules. In AAMAS 2007, 472-479.
9. Xu, L., and Choueiry, B. Y. 2003. A new efficient algorithm for solving the simple temporal problem. In 4th Int. Conf. on Temporal Logic 2003, 210-220.