论文信息 - OzoMorph: Demonstrating Colored Multi-Agent Path Finding on Real Robots

OzoMorph: Demonstrating Colored Multi-Agent Path Finding on Real Robots

Multi-agent Path Finding (MAPF) deals with finding collision-free paths for a set of agents on a graph, where each agent has its origin and destination. Colored MAPF is a generalization of MAPF, where groups of agents are moving, and the set of destination nodes is specified per group rather than per agent. OzoMorph is software providing an intuitive user interface for specifying Colored MAPF problems, solving them by translation to SAT, and finally visualizing the solution either in a computer simulation or by converting the plans to executable instructions for Ozobot Evo robots.

Roman Barták | Jakub Mestek

[1] Dan Halperin,et al. k-color multi-robot motion planning , 2012, Int. J. Robotics Res..

[2] Roman Barták,et al. Robust Multi-Agent Path Finding and Executing , 2020, J. Artif. Intell. Res..

[3] Steven M. LaValle,et al. Multi-agent Path Planning and Network Flow , 2012, WAFR.

[4] Roman Barták,et al. Modeling and Solving the Multi-agent Pathfinding Problem in Picat , 2017, 2017 IEEE 29th International Conference on Tools with Artificial Intelligence (ICTAI).

[5] Roman Barták,et al. Multi-Agent Path Finding on Real Robots , 2019, AAMAS.

[6] Sven Koenig,et al. Optimal Target Assignment and Path Finding for Teams of Agents , 2016, AAMAS.

[7] Roman Barták,et al. A Scheduling-Based Approach to Multi-Agent Path Finding with Weighted and Capacitated Arcs , 2018, AAMAS.

[8] Pavel Surynek,et al. An Optimization Variant of Multi-Robot Path Planning Is Intractable , 2010, AAAI.

[9] Roni Stern,et al. Multi-Agent Pathfinding: Definitions, Variants, and Benchmarks , 2019, SOCS.

[10] Neng-Fa Zhou,et al. The Picat-SAT Compiler , 2016, PADL.