Multi-Agent Path Finding for Large Agents

@inproceedings{Li2019MultiAgentPF,
  title={Multi-Agent Path Finding for Large Agents},
  author={Jiaoyang Li and Pavel Surynek and Ariel Felner and Hang Ma and T. K. Satish Kumar and Sven Koenig},
  booktitle={AAAI 2019},
  year={2019}
}
Multi-Agent Path Finding (MAPF) has been widely studied in the AI community. For example, Conflict-Based Search (CBS) is a state-of-the-art MAPF algorithm based on a twolevel tree-search. However, previous MAPF algorithms assume that an agent occupies only a single location at any given time, e.g., a single cell in a grid. This limits their applicability in many real-world domains that have geometric agents in lieu of point agents. Geometric agents are referred to as “large” agents because they… CONTINUE READING

References

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

Benchmarks for grid - based pathfind

P. Surynek, A. Felner, R. Stern, E. Boyarski
  • Transactions on Computational Intelligence and AI in Games
  • 2016
VIEW 12 EXCERPTS
HIGHLY INFLUENTIAL

Enhanced Partial Expansion A

  • J. Artif. Intell. Res.
  • 2014
VIEW 11 EXCERPTS
HIGHLY INFLUENTIAL

Benchmarks for Grid-Based Pathfinding

  • IEEE Transactions on Computational Intelligence and AI in Games
  • 2012
VIEW 2 EXCERPTS
HIGHLY INFLUENTIAL

Similar Papers

Loading similar papers…