An Efficient Approach to Do Multi-agent Planning
- 10.2991/csic-15.2015.103How to use a DOI?
- AI planning, Multi-agent system, Graph structure
Multi-agent planning is a difficult, yet under investigated class of planning problems. In the cooperative assumption, agents plan to achieve their individual goals independently, communicate with each other by continually sending and receiving messages from other agents. However, finding a globally consistent plan requires agents to interact with each other, which is time-consuming. In this paper, we describe a general framework that extracts the graph structure from causal constraints between agents in solving multi-agent planning problems to reduce the effort of repeatedly searching agents' consistent local plans and we theoretical analytically show that our approach can efficiently solve multi-agent planning problems with very complicated coupling level.
- © 2015, the Authors. Published by Atlantis Press.
- Open Access
- This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).
Cite this article
TY - CONF AU - Lin Zeng AU - Lei Li PY - 2015/07 DA - 2015/07 TI - An Efficient Approach to Do Multi-agent Planning BT - Proceedings of the 2015 International Conference on Computer Science and Intelligent Communication PB - Atlantis Press SP - 425 EP - 428 SN - 2352-538X UR - https://doi.org/10.2991/csic-15.2015.103 DO - 10.2991/csic-15.2015.103 ID - Zeng2015/07 ER -