Multi-Agent Path Finding on Ozobots

Roman Barták, Ivan Krasicenko, Jirí Svancara

IJCAI 2019 pp. 6491-6493

doi:10.24963/IJCAI.2019/933 /ijcai/2019/bartak2019ijcai-multi/

Abstract

Multi-agent path finding (MAPF) is the problem to find collision-free paths for a set of agents (mobile robots) moving on a graph. There exists several abstract models describing the problem with various types of constraints. The demo presents software to evaluate the abstract models when the plans are executed on Ozobots, small mobile robots developed for teaching programming. The software allows users to design the grid-like maps, to specify initial and goal locations of robots, to generate plans using various abstract models implemented in the Picat programming language, to simulate and to visualise execution of these plans, and to translate the plans to command sequences for Ozobots.

PDF IJCAI Semantic Scholar

Cite

Text

Barták et al. "Multi-Agent Path Finding on Ozobots." International Joint Conference on Artificial Intelligence, 2019. doi:10.24963/IJCAI.2019/933

Markdown

[Barták et al. "Multi-Agent Path Finding on Ozobots." International Joint Conference on Artificial Intelligence, 2019.](https://mlanthology.org/ijcai/2019/bartak2019ijcai-multi/) doi:10.24963/IJCAI.2019/933

BibTeX

@inproceedings{bartak2019ijcai-multi,
  title     = {{Multi-Agent Path Finding on Ozobots}},
  author    = {Barták, Roman and Krasicenko, Ivan and Svancara, Jirí},
  booktitle = {International Joint Conference on Artificial Intelligence},
  year      = {2019},
  pages     = {6491-6493},
  doi       = {10.24963/IJCAI.2019/933},
  url       = {https://mlanthology.org/ijcai/2019/bartak2019ijcai-multi/}
}