A general, fully distributed multi-agent planning algorithm

Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS

Volumn 3, Issue , 2010, Pages 1323-1330

  Nissim, Raz ^a   Brafman, Ronen I ^a   Domshlak, Carmel ^b  

^a BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

^b Technion   (Israel)

Author keywords

Distributed Constraint Satisfaction; Distributed Problem Solving; Multi Agent Planning; Single Agent Planning

Indexed keywords

AUTONOMOUS AGENTS; CONSTRAINT SATISFACTION PROBLEMS; PROBLEM SOLVING;

DISTRIBUTED CONSTRAINT SATISFACTION; DISTRIBUTED CSP; DISTRIBUTED PROBLEM SOLVING; LOCAL PLANNING; MULTI-AGENT PLANNING; PLANNING ALGORITHMS; PLANNING DOMAINS; PLANNING PROBLEM; SINGLE-AGENT; SINGLE-AGENT PLANNING;

MULTI AGENT SYSTEMS;

EID: 84899430659     PISSN: 15488403     EISSN: 15582914     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (12)

1. Brafman, R. I., and Domshlak, C. 2006. Factored planning: How, when, and when not. In AAAI, 809-814.
2. Brafman, R. I., and Domshlak, C. 2008. From One to Many: Planning for Loosely Coupled Multi-Agent Systems. In Proc. of the 18th ICAPS, 28-35.
3. Hoffman, J. and Nebel, B. 2001. The FF Planning System: Fast Plan Generation Through Heuristic Search. In Journal of Artificial Intelligence Research, Volume 14, 253-302.
4. Fikes, R. Nilsson, N. 1971. STRIPS: A new approach to the application of theorem proving to problem solving. In Proc. of the 2nd International Joint Conference on Artificial Intelligence, 608-620.
5. Yokoo, M., Durfee, E., Ishida, T., Kuwabara, K. 1998. The Distributed Constraint Satisfaction Problem: Formalization and Algorithms. In IEEE Trans, on Data and Kn. Eng., 10(5), 673-685.
6. Haralick, R.M., Elliott, G.L. 1980. Increasing tree search efficiency for constraint satisfaction problems. In Artificial Intelligence 14, 263-314.
7. Zhu, L., Givan, R. 2004. Heuristic Planning via Roadmap Deduction. In IPC-4, 64-66.
8. Zivan, R. and Meisels, A. 2007. Asynchronous Forward-checking for DisCSPs. In Constraints, 12, 131-150.
9. Prosser, P. 1993. Hybrid Algorithms for the Constraint Satisfaction Problem. In Computational Intelligence, Volume 9, Number 3, 268-299.
10. Meisels, A., et al. 2002. Comparing performance of Distributed Constraints Processing Algorithms. In Proc. DCR Workshop, AAMAS, 86-93.
11. Kishimoto, A., Fukunaga, A. and Botea, A. 2009. Scalable, Parallel Best-First Search for Optimal Sequential Planning. In Proc. of the 19th ICAPS, 201-208.
12. The international Planning Competition, ICAPS, http:/7ipc.inforrriatik. uni-lYeiburg.de/