Multiagent Planning by Plan Set Intersection and Plan Verification

Jan Jakubův, Jan Tožička, Antonín Komenda

2015

Abstract

Multiagent planning is a coordination technique used for deliberative acting of a team of agents. One of vital planning techniques uses declarative description of agents’ plans based on Finite State Machines and their later coordination by intersection of such machines with successive verification of the resulting joint plans. In this work, we firstly propose to use projections of agents’ actions directly for multiagent planning based on iterative building of a coordinated multiagent plan. Secondly, we describe integration of the static analysis provided by process calculi type systems for approximate verification of exchanged local plans. Finally, we compare our approach with current state-of-the-art planner on an extensive benchmark set.

References

  1. Bhattacharya, S., Kumar, V., and Likhachev, M. (2010). Search-based path planning with homotopy class constraints. In Felner, A. and Sturtevant, N. R., editors, SOCS. AAAI Press.
  2. Brafman, R. and Domshlak, C. (2008). From One to Many: Planning for Loosely Coupled Multi-Agent Systems. In Proceedings of ICAPS'08, volume 8, pages 28-35.
  3. Fikes, R. and 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, pages 608-620.
  4. Hopcroft, J. E., Motwani, R., and Ullman, J. D. (2006). Introduction to Automata Theory, Languages, and Computation (3rd Edition). Addison-Wesley Longman Publishing Co., Inc., Boston, MA, USA.
  5. Jakubu°v, J. and Wells, J. B. (2010). Expressiveness of generic process shape types. In TGC'10, volume 6084 of LNCS, pages 103-119. Springer.
  6. Makholm, H. and Wells, J. B. (2005). Instant polymorphic type systems for mobile process calculi: Just add reduction rules and close. In ESOP'05, volume 3444 of LNCS, pages 389-407. Springer.
  7. Nissim, R. and Brafman, R. I. (2012). Multi-agent A* for parallel and distributed systems. In Proc. of AAMAS'12, AAMAS 7812, pages 1265-1266, Richland, SC.
  8. S?tolba, M. and Komenda, A. (2014). Relaxation heuristics for multiagent planning. In Proceedings of ICAPS'14.
  9. Torren˜o, A., Onaindia, E., and Sapena, s. (2014). Fmap: Distributed cooperative multi-agent planning. Applied Intelligence, 41(2):606-626.
  10. Toz?ic?ka, J., Jakubu°v, J., Durkota, K., Komenda, A., and Pe?chouc?ek, M. (2014a). Multiagent Planning Supported by Plan Diversity Metrics and Landmark Actions. In Proceedings ICAART'14.
  11. Toz?ic?ka, J., Jakubu°v, J., and Komenda, A. (2014b). Generating Multi-Agent Plans by Distributed Intersection of Finite State Machines. In Proceedings ECAI'14, pages 1111-1112.
Download


Paper Citation


in Harvard Style

Jakubův J., Tožička J. and Komenda A. (2015). Multiagent Planning by Plan Set Intersection and Plan Verification . In Proceedings of the International Conference on Agents and Artificial Intelligence - Volume 2: ICAART, ISBN 978-989-758-074-1, pages 173-182. DOI: 10.5220/0005222101730182


in Bibtex Style

@conference{icaart15,
author={Jan Jakubův and Jan Tožička and Antonín Komenda},
title={Multiagent Planning by Plan Set Intersection and Plan Verification},
booktitle={Proceedings of the International Conference on Agents and Artificial Intelligence - Volume 2: ICAART,},
year={2015},
pages={173-182},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0005222101730182},
isbn={978-989-758-074-1},
}


in EndNote Style

TY - CONF
JO - Proceedings of the International Conference on Agents and Artificial Intelligence - Volume 2: ICAART,
TI - Multiagent Planning by Plan Set Intersection and Plan Verification
SN - 978-989-758-074-1
AU - Jakubův J.
AU - Tožička J.
AU - Komenda A.
PY - 2015
SP - 173
EP - 182
DO - 10.5220/0005222101730182