Algorithms for a temporal decoupling problem in multi-agent planning

Proceedings of the National Conference on Artificial Intelligence

Volumn , Issue , 2002, Pages 468-475

  Hunsberger, Luke ^a  

^a HARVARD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ARTIFICIAL INTELLIGENCE; PLANNING; PROBLEM SOLVING; THEOREM PROVING;

MULTI-AGENT PLANNING; TEMPORAL DECOUPLING PROBLEMS (TDP);

MULTI AGENT SYSTEMS;

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

References (7)

1. Cormen, T. H.; Leiserson, C. E.; and Rivest, R. L. 1990. Introduction to Algorithms. Cambridge, MA: The MIT Press.
2. Dechter, R.; Mein, L; and Pearl, J. 1991. Temporal constraint networks. Artificial Intelligence 49:61-95.
3. Hunsberger, L., and Grosz, B. J. 2000. A combinatorial auction for collaborative planning. In Fourth International Conference on MultiAgent Systems (ICMAS-2000), 151-158. IEEE Computer Society.
4. Hunsberger, L. 2002. Generating bids for group-related actions in the context of prior commitments. In Intelligent Agents VIII, volume 2333 of LNAI. Springer-Verlag.
5. Morris, P., and Muscettola, N. 2000. Execution of temporal plans with uncertainty. In Proc. of the 17th National Conference on Artificial Intelligence (AAAI-2000), 491-496.
6. Tsamardinos, I.; Muscettola, N.; and Morris, P. 1998. Fast transformation of temporal plans for efficient execution. In Proc. of the 15th Nat'l. Conf. on AI (AAAI-98). 254-261.
7. Tsamardinos, I. 2000. Reformulating temporal plans for efficient execution. Master's thesis, Univ. of Pittsburgh.