Bringing Multi-Agent Path Finding Closer to Reality. Svancara, J. In Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS), pages 1784–1785, 2018.
abstract   bibtex   
Multi-agent path finding is the problem of navigating multiple agents, located in a graph, 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. We 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.
@INPROCEEDINGS{JSvan18d, 
 AUTHOR= "J. Svancara",
 TITLE= "Bringing Multi-Agent Path Finding Closer to Reality",
 BOOKTITLE= "Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS)",
 YEAR= "2018",
 PAGES= "1784--1785",
 PDF= "http://ifaamas.org/Proceedings/aamas2018/pdfs/p1784.pdf",
 FLAGS= ":2018:,:jirisvancara:",
 ABSTRACT=
"Multi-agent path finding is the problem of navigating multiple agents,
located in a graph, 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.  We 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."  
}

Downloads: 0