From one to many: Planning for loosely coupled multi-agent systems

ICAPS 2008 - Proceedings of the 18th International Conference on Automated Planning and Scheduling

Volumn , Issue , 2008, Pages 28-35

  Brafman, Ronen I ^a   Domshlak, Carmel ^b  

^a BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

AGENTS; SCHEDULING;

FIXED COUPLINGS; IS PROBLEMS; MIN MAXES; MULTI-AGENT PLANNING; SUB-PLANS; TWO PARAMETERS; UPPER BOUNDS;

MULTI AGENT SYSTEMS;

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

References (16)

1. Amir, E., and Engelhardt, B. 2003. Factored planning. In IJCAI, 929-935.
2. Brafman, R. I., and Domshlak, C. 2006. Factored planning: How, when, and when not. In AAAI, 809-814.
3. Bresina, J.; Dearden, R.; Meuleau, N.; Ramakrishnan, S.; Smith, D.; and Washington, R. 2002. Planning under continuous time and resource uncertainty: A challenge for AI. In UAI, 77-84.
4. Clement, B. J.; Durfee, E. H.; and Barrett, A. C. 2007. Abstract reasoning for planning and coordination. JAIR 28:453-515.
5. Dechter, R. 2003. Constraint Processing. Morgan Kaufmann.
6. Durfee, E. H. 1999. Distributed problem solving and planning. In Multiagent Systems: A Modern Approach to Distributed Artificial Intelligence. 121-164.
7. Erol, K.; Hendler, J.; and Nao, D. S. 1994. HTN planning: Complexity and expressivity. In AAAI, 1123-1128.
8. Fikes, R. E., and Nilsson, N. 1971. STRIPS: A new approach to the application of theorem proving to problem solving. AIJ 2:189-208.
9. Helmert, M. 2003. Complexity results for standard benchmark domains in planning. AIJ 146(2):219-262.
10. Kelareva, E.; Buffet, O.; Huang, J.; and Thiébaux, S. 2007. Factored planning using decomposition trees. In IJCAI, 1942-1947.
11. Knoblock, C. 1994. Automatically generating abstractions for planning. AIJ 68(2):243-302.
12. Moses, Y., and Tennenholtz, M. 1995. Multi-entity models. Machine Intelligence 14:63-88.
13. Seymour, P. D., and Thomas, R. 1993. Graph searching and min-max theorem for tree-width. Journal of Combinatorial Theory 58:22-33.
14. Vidal, V, and Geffner, H. 2006. Branching and pruning: An optimal temporal POCL planner based on constraint programming. AIJ 170(3):298-335.
15. Wilkins, D. E., and Myers, K. 1998. A multiagent planning architecture. In AIPS, 154-162.
16. Yokoo, M. 2001. Distributed Constraint Satisfaction: Foundations of Cooperation in Multi-agent Systems. Springer.