Structure and Intractability of Optimal Multi-Robot Path Planning on Graphs
暂无分享,去创建一个
[1] Steven M. LaValle,et al. Planning optimal paths for multiple robots on graphs , 2012, 2013 IEEE International Conference on Robotics and Automation.
[2] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[3] Steven M. LaValle,et al. Multi-agent Path Planning and Network Flow , 2012, WAFR.
[4] D A N I E L R A T N E R A N D M A N F R E D W A R M,et al. The ( n 2-1 )-Puzzle and Related Relocation Problems , 2008 .
[5] Richard E. Korf,et al. Complete Algorithms for Cooperative Pathfinding Problems , 2011, IJCAI.
[6] Paul G. Spirakis,et al. Coordinating Pebble Motion on Graphs, the Diameter of Permutation Groups, and Applications , 2015, FOCS.
[7] Pavel Surynek,et al. An Optimization Variant of Multi-Robot Path Planning Is Intractable , 2010, AAAI.
[8] Oded Goldreich. Finding the Shortest Move-Sequence in the Graph-Generalized 15-Puzzle Is NP-Hard , 2011, Studies in Complexity and Cryptography.
[9] Refael Hassin,et al. Multi-Color Pebble Motion on Graphs , 2009, Algorithmica.
[10] Samuel Loyd,et al. Mathematical Puzzles of Sam Loyd , 1959 .
[11] Malcolm Ross Kinsella Ryan. Exploiting Subgraph Structure in Multi-Robot Path Planning , 2008, J. Artif. Intell. Res..
[12] Manfred K. Warmuth,et al. NxN Puzzle and Related Relocation Problem , 1990, J. Symb. Comput..