{"type":"ScholarlyArticle","title":"Bringing Multi-agent Path Finding Closer to Reality","authors":[{"name":"Jiří Švancara","slug":"jiri-svancara","given":"Jiří","family":"Švancara","affiliation":"Charles University , Czech Republic"}],"abstract":"Multi-agent path finding is the problem of navigating multiple agents from their current locations to their goal locations in such a way that there are no collisions between the agents. The classical definition of the problem assumes that the set of agents is unchangeable, and that the distances in the graph are homogeneous. \r\nWe propose to add to the problem specification a set of new attributes to bring it closer to the real world. These attributes include varying distances, number of agents that can occupy an edge or node, and dynamic appearance of new agents.","doi":"10.24963/ijcai.2018/837","url":"https://ijcai.org/proceedings/2018/837","pdf":"https://ijcai.org/proceedings/2018/0837.pdf","markdown":"https://ijcai.org/proceedings/2018/837.md","bibtex":"https://ijcai.org/proceedings/2018/bibtex/837","volume":{"slug":"2018","title":"Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2018","url":"https://ijcai.org/proceedings/2018/","year":2018,"location":"Stockholm","dates":"13-19 July 2018","editors":"Jérôme Lang","isbn":"978-0-9992411-2-7","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2018"},"section":"Doctoral Consortium","track":"Doctoral Consortium","number":837,"pages":{"first":5787,"last":5788},"keywords":["Agent-based and Multi-agent Systems: Multi-agent Planning","Robotics and Vision: Motion and Path Planning"],"videos":[],"references":[{"position":1,"raw":"[Barták et al., 2018] Roman Barták, J. Svancara, and M. Vlk. A scheduling-based approach to multi-agent path finding with weighted and capacitated arcs. In To appear in Proceedings of AAMAS 2018, Stockholm, Sweden, July 11-13, 2018, 2018.","title":"A scheduling-based approach to multi-agent path finding with weighted and capacitated arcs","authors":"Barták","year":"2018","venue":"To appear in Proceedings of AAMAS 2018","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Ryan, 2008] Malcolm Ross Kinsella Ryan. Exploiting sub- graph structure in multi-robot path planning. J. Artif. In- tell. Res., 31:497-542, 2008.","title":"Exploiting subgraph structure in multi-robot path planning","authors":"Malcolm Ross, Kinsella Ryan","year":"2008","venue":"J. Artif. Intell. Res","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Sharon et al., 2011] Guni Sharon, Roni Stern, Meir Gold- enberg, and Ariel Felner. The increasing cost tree search for optimal multi-agent pathfinding. In Toby Walsh, ed- itor, IJCAI 2011, Proceedings of the 22nd International Joint Conference on Artificial Intelligence, Barcelona, Catalonia, Spain, July 16-22, 2011, pages 662-667.","title":"The increasing cost tree search for optimal multi-agent pathfinding","authors":"Guni Sharon, Roni Stern, Meir Goldenberg, Ariel Felner","year":"2011","venue":"IJCAI 2011, Proceedings of the 22nd International Joint Conference on Artificial Intelligence","doi":null,"url":null,"internal_url":"/proceedings/2011/117"},{"position":4,"raw":"IJ- CAI/AAAI, 2011.","title":"IJ-CAI/AAAI","authors":null,"year":"2011","venue":null,"doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Surynek, 2010] Pavel Surynek. An optimization variant of multi-robot path planning is intractable. In Maria Fox and David Poole, editors, Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence, AAAI 2010, Atlanta, Georgia, USA, July 11-15, 2010. AAAI Press, 2010.","title":"Pavel Surynek. An optimization variant of multi-robot path planning is intractable","authors":"Surynek","year":"2010","venue":"Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence, AAAI 2010","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Surynek, 2014] Pavel Surynek. Compact representations of cooperative path-finding as SAT based on matchings in bipartite graphs. In 26th IEEE International Conference on Tools with Artificial Intelligence, ICTAI 2014, Limas- sol, Cyprus, November 10-12, 2014, pages 875-882. IEEE Computer Society, 2014.","title":"Pavel Surynek. Compact representations of cooperative path-finding as SAT based on matchings in bipartite graphs","authors":"Surynek","year":"2014","venue":"26th IEEE International Conference on Tools with Artificial Intelligence, ICTAI 2014","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Svancara and Surynek, 2017] Jiri Svancara and Pavel Surynek. New flow-based heuristic for search algorithms solving multi-agent path finding. In H. Jaap van den Herik, Ana Paula Rocha, and Joaquim Filipe, editors, Pro- ceedings of the 9th International Conference on Agents and Artificial Intelligence, ICAART 2017, Volume 2, Porto, Portugal, February 24-26, 2017., pages 451-458.","title":"New flow-based heuristic for search algorithms solving multi-agent path finding","authors":"Surynek Svancara, Jiri Svancara, Pavel Surynek","year":"2017","venue":"Proceedings of the 9th International Conference on Agents and Artificial Intelligence, ICAART 2017","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"SciTePress, 2017.","title":null,"authors":"Scitepress","year":"2017","venue":null,"doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}