Complete Algorithms for Cooperative Pathfinding Problems

@inproceedings{Standley2011CompleteAF,
  title={Complete Algorithms for Cooperative Pathfinding Problems},
  author={Trevor Scott Standley and Richard E. Korf},
  booktitle={IJCAI},
  year={2011}
}
Problems that require multiple agents to follow non-interfering paths from their current states to their respective goal states are called cooperative pathfinding problems. We present the first complete algorithm for finding these paths that is sufficiently fast for real-time applications. Furthermore, our algorithm offers a trade-off between running time and solution quality. We then refine our algorithm into an anytime algorithm that first quickly finds a solution, and then uses any remaining… CONTINUE READING

Similar Papers

Citations

Publications citing this paper.
SHOWING 1-10 OF 91 CITATIONS, ESTIMATED 76% COVERAGE

Compact Representations of Cooperative Path-Finding as SAT Based on Matchings in Bipartite Graphs

  • 2014 IEEE 26th International Conference on Tools with Artificial Intelligence
  • 2014
VIEW 9 EXCERPTS
CITES METHODS
HIGHLY INFLUENCED

An iterative approach for makespan-minimized multi-agent path planning in discrete space

  • Autonomous Agents and Multi-Agent Systems
  • 2014
VIEW 4 EXCERPTS
CITES METHODS
HIGHLY INFLUENCED

Planning optimal paths for multiple robots on graphs

  • 2013 IEEE International Conference on Robotics and Automation
  • 2013
VIEW 4 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

Time-expanded graph-based propositional encodings for makespan-optimal solving of cooperative path finding problems

  • Annals of Mathematics and Artificial Intelligence
  • 2017
VIEW 5 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

Altruistic coordination for multi-robot cooperative pathfinding

VIEW 5 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

FILTER CITATIONS BY YEAR

2011
2019

CITATION STATISTICS

  • 13 Highly Influenced Citations

  • Averaged 13 Citations per year over the last 3 years

References

Publications referenced by this paper.
SHOWING 1-10 OF 21 REFERENCES

In AIIDE

David Silver. Cooperative pathfinding
  • pages 117–122,
  • 2005
VIEW 13 EXCERPTS
HIGHLY INFLUENTIAL

In AAAI

Trevor Standley. Finding optimal solutions to cooperative problems
  • pages 173–178,
  • 2010
VIEW 7 EXCERPTS
HIGHLY INFLUENTIAL

An application of pebble motion on graphs to abstract multi - robot path planning

P. Svestka, M. H. Overmars, Ko-Hsin Cindy Wang
  • ICTAI
  • 2009

In ICTAI

Pavel Surynek. An application of pebble motion on graphs planning
  • pages 151–158,
  • 2009
VIEW 1 EXCERPT

In AAMAS 2008 Volume 3

M. Renee Jansen, Nathan R. Sturtevant. A new approach to cooperative pathfinding
  • pages 1401–1404,
  • 2008

In ICAPS

Ko-Hsin Cindy Wang, Adi Botea. Fast, memory-efficient multi-agent pathfinding
  • pages 380–387,
  • 2008
VIEW 2 EXCERPTS