Author:
Agarwal Pankaj K.,Geft Tzvika,Halperin Dan,Taylor Erin
Funder
California Community Foundation
Israel Science Foundation
Subject
Computational Mathematics,Computational Theory and Mathematics,Control and Optimization,Geometry and Topology,Computer Science Applications
Reference24 articles.
1. Multi-agent pathfinding: definitions, variants, and benchmarks;Stern,2019
2. On the complexity of motion planning for multiple independent objects; PSPACE-hardness of the “warehouseman's problem”;Hopcroft;Int. J. Robot. Res.,1984
3. 1 x 1 rush hour with fixed blocks is PSPACE-complete;Brunner,2021
4. On the hardness of unlabeled multi-robot motion planning;Solovey;Int. J. Robot. Res.,2016
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献