Planning optimal paths for multiple robots on graphs

@article{Yu2012PlanningOP,
  title={Planning optimal paths for multiple robots on graphs},
  author={Jingjin Yu and Steven M. LaValle},
  journal={2013 IEEE International Conference on Robotics and Automation},
  year={2012},
  pages={3612-3617}
}
In this paper, we study the problem of optimal multi-robot path planning (MPP) on graphs. We propose two multiflow based integer linear programming (ILP) models that compute minimum last arrival time and minimum total distance solutions for our MPP formulation, respectively. The resulting algorithms from these ILP models are complete and guaranteed to yield true optimal solutions. In addition, our flexible framework can easily accommodate other variants of the MPP problem. Focusing on the time… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-10 OF 64 CITATIONS

Structure and Intractability of Optimal Multi-Robot Path Planning on Graphs

VIEW 6 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Multi-Agent Path Finding with Deadlines

  • IJCAI
  • 2018
VIEW 5 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Optimal Target Assignment and Path Finding for Teams of Agents

VIEW 5 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

Planning, Scheduling and Monitoring for Airport Surface Operations

  • AAAI Workshop: Planning for Hybrid Systems
  • 2016
VIEW 4 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

FILTER CITATIONS BY YEAR

2013
2019

CITATION STATISTICS

  • 9 Highly Influenced Citations

  • Averaged 13 Citations per year from 2017 through 2019

Similar Papers

Loading similar papers…