{"type":"ScholarlyArticle","title":"Implicitly Coordinated Multi-Agent Path Finding under Destination Uncertainty: Success Guarantees and Computational Complexity (Extended Abstract)","authors":[{"name":"Bernhard Nebel","slug":"bernhard-nebel","given":"Bernhard","family":"Nebel","affiliation":"Albert-Ludwigs-Universität , Freiburg , Germany"},{"name":"Thomas Bolander","slug":"thomas-bolander","given":"Thomas","family":"Bolander","affiliation":"Technical University of Denmark , Lyngby , Denmark"},{"name":"Thorsten Engesser","slug":"thorsten-engesser","given":"Thorsten","family":"Engesser","affiliation":"Albert-Ludwigs-Universität , Freiburg , Germany"},{"name":"Robert Mattmüller","slug":"robert-mattmuller","given":"Robert","family":"Mattmüller","affiliation":"Albert-Ludwigs-Universität , Freiburg , Germany"}],"abstract":"In multi-agent path finding, it is usually\r\nassumed that planning is performed centrally and\r\nthat the destinations of the agents are common\r\nknowledge. We will drop both assumptions and analyze under which conditions it can be guaranteed\r\nthat the agents reach their respective destinations\r\nusing implicitly coordinated plans without communication.","doi":"10.24963/ijcai.2019/890","url":"https://ijcai.org/proceedings/2019/890","pdf":"https://ijcai.org/proceedings/2019/0890.pdf","markdown":"https://ijcai.org/proceedings/2019/890.md","bibtex":"https://ijcai.org/proceedings/2019/bibtex/890","volume":{"slug":"2019","title":"Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2019","url":"https://ijcai.org/proceedings/2019/","year":2019,"location":"Macao","dates":"10-16 August 2019","editors":"Sarit Kraus","isbn":"978-0-9992411-4-1","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2019"},"section":"Journal track","track":"Journal track","number":890,"pages":{"first":6372,"last":6376},"keywords":["Agent-based and Multi-agent Systems: Multi-agent Planning","Agent-based and Multi-agent Systems: Coordination and Cooperation","Planning and Scheduling: Distributed;Multi-agent Planning"],"videos":[],"references":[{"position":1,"raw":"[Andersen et al., 2012] Mikkel Birkegaard Andersen, Thomas Bolander, and Martin Holm Jensen. Conditional epistemic planning. In Logics in Artificial Intelligence -13th European Conference (JELIA-12), pages 94-106, 2012.","title":"Conditional epistemic planning","authors":"Andersen","year":"2012","venue":"Logics in Artificial Intelligence -13th European Conference (JELIA-12)","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Bolander and Andersen, 2011] Thomas Bolander and Mikkel Birkegaard Andersen. Epistemic planning for single and multi-agent systems. Journal of Applied Non-Classical Logics, 21(1):9-34, 2011.","title":"Epistemic planning for single and multi-agent systems","authors":"Andersen Bolander, Thomas Bolander, Mikkel Birkegaard Andersen","year":"2011","venue":"Journal of Applied Non-Classical Logics","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Bolander et al., 2018] Thomas Bolander, Thorsten En- gesser, Robert Mattmüller, and Bernhard Nebel. Better ea- ger than lazy? How agent types impact the successfulness of implicit coordination. In Principles of Knowledge Rep- resentation and Reasoning: Proceedings of the Sixteenth International Conference (KR-18), pages 445-453, 2018.","title":"Better eager than lazy? How agent types impact the successfulness of implicit coordination","authors":"Thomas Bolander, Thorsten Engesser, Robert Mattmüller, Bernhard Nebel","year":"2018","venue":"Principles of Knowledge Representation and Reasoning: Proceedings of the Sixteenth International Conference (KR-18)","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Botea et al., 2018] Adi Botea, Davide Bonusi, and Pavel Surynek. Solving multi-agent path finding on strongly biconnected digraphs. J. Artif. Intell. Res., 62:273-314, 2018.","title":"Solving multi-agent path finding on strongly biconnected digraphs","authors":"Adi Botea, Davide Bonusi, Pavel Surynek","year":"2018","venue":"J. Artif. Intell. Res","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Brenner and Nebel, 2009] Michael Brenner and Bernhard Nebel. Continual planning and acting in dynamic multi- agent environments. Autonomous Agents and Multi-Agent Systems, 19(3):297-331, 2009.","title":"Continual planning and acting in dynamic multiagent environments","authors":"Nebel Brenner, Michael Brenner, Bernhard Nebel","year":"2009","venue":"Autonomous Agents and Multi-Agent Systems","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Cáp et al., 2015] Michal Cáp, Jirí Vokrínek, and Alexander Kleiner. Complete decentralized method for on-line multi- robot trajectory planning in well-formed infrastructures. In Proceedings of the Twenty-Fifth International Conference on Automated Planning and Scheduling, ICAPS-15, pages 324-332, 2015.","title":"Complete decentralized method for on-line multirobot trajectory planning in well-formed infrastructures","authors":"Cáp","year":"2015","venue":"Proceedings of the Twenty-Fifth International Conference on Automated Planning and Scheduling, ICAPS-15","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[de Wilde et al., 2014] Boris de Wilde, Adriaan ter Mors, and Cees Witteveen. Push and rotate: a complete multi- agent pathfinding algorithm. J. Artif. Intell. Res., 51:443- 492, 2014.","title":"Push and rotate: a complete multiagent pathfinding algorithm","authors":"De Wilde","year":"2014","venue":"J. Artif. Intell. Res","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[desJardins et al., 1999] Marie desJardins, Edmund H. Dur- fee, Charles L. Ortiz, Jr., and Michael Wolverton. A survey of research in distributed, continual planning. AI Maga- zine, 20(4):13-22, 1999.","title":"A survey of research in distributed, continual planning","authors":"Marie Desjardins, Edmund H Durfee, Charles L Ortiz, Jr, Michael Wolverton","year":"1999","venue":"AI Magazine","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Dresner and Stone, 2008] Kurt M. Dresner and Peter Stone. A multiagent approach to autonomous intersection man- agement. J. Artif. Intell. Res., 31:591-656, 2008.","title":"A multiagent approach to autonomous intersection management","authors":"Kurt M Dresner, Peter Stone","year":"2008","venue":"J. Artif. Intell. Res","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Engesser et al., 2017] Thorsten Engesser, Thomas Bolan- der, Robert Mattmüller, and Bernhard Nebel. Coopera- tive epistemic multi-agent planning for implicit coordina- tion. In Proceedings of the Ninth Workshop on Methods for Modalities (M4MICLA-17), pages 75-90, 2017.","title":"Cooperative epistemic multi-agent planning for implicit coordination","authors":"Thorsten Engesser, Thomas Bolander, Robert Mattmüller, Bernhard Nebel","year":"2017","venue":"Proceedings of the Ninth Workshop on Methods for Modalities (M4MICLA-17)","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Felner et al., 2017] Ariel Felner, Roni Stern, Solomon Eyal Shimony, Eli Boyarski, Meir Goldenberg, Guni Sharon, Nathan R. Sturtevant, Glenn Wagner, and Pavel Surynek. Search-based optimal solvers for the multi-agent pathfind- ing problem: Summary and challenges. In Proceedings of the Tenth International Symposium on Combinatorial Search (SOCS-17), pages 29-37, 2017.","title":"Search-based optimal solvers for the multi-agent pathfinding problem: Summary and challenges","authors":"Ariel Felner, Roni Stern, Solomon Eyal Shimony, Eli Boyarski, Meir Goldenberg, Guni Sharon, Nathan R Sturtevant, Glenn Wagner, Pavel Surynek","year":"2017","venue":"Proceedings of the Tenth International Symposium on Combinatorial Search (SOCS-17)","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Glover, 1986] Fred Glover. Future paths for integer pro- gramming and links to artificial intelligence. Computers & OR, 13(5):533-549, 1986.","title":"Future paths for integer programming and links to artificial intelligence","authors":"Fred Glover, Glover","year":"1986","venue":"Computers & OR","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Gmytrasiewicz and Doshi, 2005] Piotr J. Gmytrasiewicz and Prashant Doshi. A framework for sequential plan- ning in multi-agent settings. J. Artif. Intell. Res., 24:49-79, 2005.","title":"A framework for sequential planning in multi-agent settings","authors":"Piotr J Gmytrasiewicz, Prashant Doshi","year":"2005","venue":"J. Artif. Intell. Res","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Goldman and Zilberstein, 2004] Claudia V. Goldman and Shlomo Zilberstein. Decentralized control of cooperative systems: Categorization and complexity analysis. J. Artif. Intell. Res., 22:143-174, 2004.","title":"Decentralized control of cooperative systems: Categorization and complexity analysis","authors":"Claudia V Goldman, Shlomo Zilberstein","year":"2004","venue":"J. Artif. Intell. Res","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Hatzack and Nebel, 2013] Wolfgang Hatzack and Bernhard Nebel. Solving the operational traffic control problem. In A. Cesta, editor, Proceedings of the 6th European Confer- ence on Planning (ECP-01), Toledo, Spain, 2013. AAAI Press.","title":"Solving the operational traffic control problem","authors":"Nebel Hatzack, Wolfgang Hatzack, Bernhard Nebel","year":"2013","venue":"Proceedings of the 6th European Conference on Planning (ECP-01)","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Kornhauser et al., 1984] Daniel Kornhauser, Gary L. Miller, and Paul G. Spirakis. Coordinating pebble motion on graphs, the diameter of permutation groups, and applications. In 25th Annual Symposium on Foundations of Computer Science (FOCS-84), pages 241-250, 1984.","title":"Coordinating pebble motion on graphs, the diameter of permutation groups, and applications","authors":"Daniel Kornhauser, Gary L Miller, Paul G Spirakis","year":"1984","venue":"25th Annual Symposium on Foundations of Computer Science (FOCS-84)","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Lawrence and Bulitko, 2013] Ramon Lawrence and Vadim Bulitko. Database-driven real-time heuristic search in video-game pathfinding. IEEE Trans. Comput. Intellig. and AI in Games, 5(3):227-241, 2013.","title":"Database-driven real-time heuristic search in video-game pathfinding","authors":"Ramon Lawrence, Vadim Bulitko","year":"2013","venue":"IEEE Trans. Comput. Intellig. and AI in Games","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Löwe et al., 2011] Benedikt Löwe, Eric Pacuit, and An- dreas Witzel. DEL planning and some tractable cases. In Logic, Rationality, and Interaction -Third International Workshop (LORI-11), pages 179-192, 2011.","title":"DEL planning and some tractable cases","authors":"Benedikt Löwe, Eric Pacuit, Andreas Witzel","year":"2011","venue":"Logic, Rationality, and Interaction -Third International Workshop (LORI-11)","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Luna and Bekris, 2011] Ryan Luna and Kostas E. Bekris. Push and swap: Fast cooperative path-finding with com- pleteness guarantees. In Proceedings of the 22nd Interna- tional Joint Conference on Artificial Intelligence (IJCAI- 11), pages 294-300, 2011.","title":"Push and swap: Fast cooperative path-finding with completeness guarantees","authors":"Ryan Luna, Kostas E Bekris","year":"2011","venue":"Proceedings of the 22nd International Joint Conference on Artificial Intelligence (IJCAI-11)","doi":null,"url":null,"internal_url":"/proceedings/2011/59"},{"position":20,"raw":"[Ma and Koenig, 2017] Hang Ma and Sven Koenig. AI buz- zwords explained: multi-agent path finding (MAPF). AI Matters, 3(3):15-19, 2017.","title":"AI buzzwords explained: multi-agent path finding (MAPF)","authors":"Ma, Koenig, Hang Ma, Sven Koenig","year":"2017","venue":"AI Matters","doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Muise et al., 2015] Christian J. Muise, Vaishak Belle, Paolo Felli, Sheila A. McIlraith, Tim Miller, Adrian R. Pearce, and Liz Sonenberg. Planning over multi-agent epistemic states: A classical planning approach. In Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intel- ligence (AAAI-15), pages 3327-3334, 2015.","title":"Planning over multi-agent epistemic states: A classical planning approach","authors":"Christian J Muise, Vaishak Belle, Paolo Felli, Sheila A Mcilraith, Tim Miller, Adrian R Pearce, Liz Sonenberg","year":"2015","venue":"Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence (AAAI-15)","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Ratner and Warmuth, 1986] Daniel Ratner and Manfred K. Warmuth. Finding a shortest solution for the N × N exten- sion of the 15-puzzle is intractable. In Proceedings of the 5th National Conference on Artificial Intelligence (AAAI- 86), pages 168-172, 1986.","title":"Finding a shortest solution for the N × N extension of the 15-puzzle is intractable","authors":"Daniel Ratner, Manfred K Warmuth","year":"1986","venue":"Proceedings of the 5th National Conference on Artificial Intelligence (AAAI-86)","doi":null,"url":null,"internal_url":null},{"position":23,"raw":"[Surynek, 2010] Pavel Surynek. An optimization variant of multi-robot path planning is intractable. In Proceedings of the Twenty-Fourth Conference on Artificial Intelligence (AAAI-10), 2010.","title":"Pavel Surynek. An optimization variant of multi-robot path planning is intractable","authors":"Surynek","year":"2010","venue":"Proceedings of the Twenty-Fourth Conference on Artificial Intelligence (AAAI-10)","doi":null,"url":null,"internal_url":null},{"position":24,"raw":"[van den Berg et al., 2008] Jur P. van den Berg, Ming C. Lin, and Dinesh Manocha. Reciprocal velocity obstacles for real-time multi-agent navigation. In 2008 IEEE Interna- tional Conference on Robotics and Automation (ICRA-08), pages 1928-1935, 2008.","title":"Reciprocal velocity obstacles for real-time multi-agent navigation","authors":"Van Den Berg","year":"2008","venue":"IEEE International Conference on Robotics and Automation (ICRA-08)","doi":null,"url":null,"internal_url":null},{"position":25,"raw":"[Wang and Botea, 2011] Ko-Hsin Cindy Wang and Adi Botea. MAPP: A scalable multi-agent path planning al- gorithm with tractability and completeness guarantees. J. Artif. Intell. Res., 42:55-90, 2011.","title":"MAPP: A scalable multi-agent path planning algorithm with tractability and completeness guarantees","authors":"Cindy Ko-Hsin, Adi Wang, Botea","year":"2011","venue":"J. Artif. Intell. Res","doi":null,"url":null,"internal_url":null},{"position":26,"raw":"[Wurman et al., 2008] Peter R. Wurman, Raffaello D'Andrea, and Mick Mountz. Coordinating hun- dreds of cooperative, autonomous vehicles in warehouses. AI Magazine, 29(1):9-20, 2008.","title":"Coordinating hundreds of cooperative, autonomous vehicles in warehouses","authors":"R Peter, Wurman, Mick Raffaello D'andrea, Mountz","year":"2008","venue":"AI Magazine","doi":null,"url":null,"internal_url":null},{"position":27,"raw":"[Yu and LaValle, 2013] Jingjin Yu and Steven M. LaValle. Structure and intractability of optimal multi-robot path planning on graphs. In Proceedings of the Twenty-Seventh Conference on Artificial Intelligence (AAAI-13), 2013.","title":"Structure and intractability of optimal multi-robot path planning on graphs","authors":"Lavalle ; ] Jingjin Yu, Steven M Yu, Lavalle","year":"2013","venue":"Proceedings of the Twenty-Seventh Conference on Artificial Intelligence (AAAI-13)","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}