Subdimensional expansion for multirobot path planning

作者: Glenn Wagner , Howie Choset

DOI: 10.1016/J.ARTINT.2014.11.001

关键词: Motion planningMotion (geometry)MathematicsRobotAny-angle path planningPath (graph theory)Mathematical optimizationCurse of dimensionalityCollisionConfiguration space

摘要: … We place multirobot path planning algorithms on a continuum … planning algorithms search the joint configuration space of the multirobot system, guaranteeing that the optimal path will …

参考文章(65)
Ryan Luna, Qandeel Sajid, Kostas E. Bekris, Multi-agent pathfinding with simultaneous execution of single-agent primitives symposium on combinatorial search. pp. 88- 96 ,(2012)
Ariel Felner, Roni Stern, Guni Sharon, Meir Goldenberg, The increasing cost tree search for optimal multi-agent pathfinding international joint conference on artificial intelligence. pp. 662- 667 ,(2011) , 10.5591/978-1-57735-516-8/IJCAI11-117
Malte Helmert, Gabriele Röger, Non-optimal multi-agent pathfinding is solved (since 1984) national conference on artificial intelligence. ,(2012)
David Silver, Cooperative pathfinding national conference on artificial intelligence. pp. 117- 122 ,(2005)
Nathan Sturtevant, Ariel Felner, Roni Stern, Guni Sharon, Conflict-based search for optimal multi-agent path finding national conference on artificial intelligence. pp. 563- 569 ,(2012)
Anna Bramanti-Gregor, Henry W. Davis, Jin Wang, The Advantages of Using Depth and Breadth Components in Heuristic Search. international syposium on methodologies for intelligent systems. pp. 19- 28 ,(1988)
Ryan Luna, Kostas E. Bekris, Push and swap: fast cooperative path-finding with completeness guarantees international joint conference on artificial intelligence. pp. 294- 300 ,(2011) , 10.5591/978-1-57735-516-8/IJCAI11-059
Enrico Pagello, Stefano Carpin, On Parallel RRTs for Multi-robot Systems ,(2002)