Probabilistic Multi Robot Path Planning in Dynamic Environments: A Comparison between A* and DFS
暂无分享,去创建一个
[1] Malcolm R. K. Ryan. Graph Decomposition for Efficient Multi-Robot Path Planning , 2007, IJCAI.
[2] Mark H. Overmars,et al. Prioritized motion planning for multiple robots , 2005, 2005 IEEE/RSJ International Conference on Intelligent Robots and Systems.
[3] B. Faverjon,et al. Probabilistic Roadmaps for Path Planning in High-Dimensional Con(cid:12)guration Spaces , 1996 .
[4] Steven M. LaValle,et al. Planning algorithms , 2006 .
[5] Enrico Pagello,et al. An experimental study of distributed robot coordination , 2009, Robotics Auton. Syst..
[6] J. Schwartz,et al. On the Piano Movers' Problem: III. Coordinating the Motion of Several Independent Bodies: The Special Case of Circular Bodies Moving Amidst Polygonal Barriers , 1983 .
[7] John F. Canny,et al. A motion planner for multiple mobile robots , 1990, Proceedings., IEEE International Conference on Robotics and Automation.
[8] Tomás Lozano-Pérez,et al. On multiple moving objects , 1986, Proceedings. 1986 IEEE International Conference on Robotics and Automation.
[9] Shital S. Chiddarwar,et al. Conflict free coordinated path planning for multiple robots using a dynamic path modification sequence , 2011, Robotics Auton. Syst..
[10] Mark H. Overmars,et al. Roadmap-based motion planning in dynamic environments , 2004, IEEE Transactions on Robotics.
[11] Malcolm Ryan,et al. Constraint-based multi-robot path planning , 2010, 2010 IEEE International Conference on Robotics and Automation.
[12] G. Swaminathan. Robot Motion Planning , 2006 .
[13] Jean-Claude Latombe,et al. Robot Motion Planning: A Distributed Representation Approach , 1991, Int. J. Robotics Res..
[14] Kostas E. Bekris,et al. Efficient and complete centralized multi-robot path planning , 2011, 2011 IEEE/RSJ International Conference on Intelligent Robots and Systems.
[15] E. J.,et al. ON THE COMPLEXITY OF MOTION PLANNING FOR MULTIPLE INDEPENDENT OBJECTS ; PSPACE HARDNESS OF THE " WAREHOUSEMAN ' S PROBLEM " . * * ) , 2022 .
[16] Anthony Stentz,et al. Optimal and efficient path planning for partially-known environments , 1994, Proceedings of the 1994 IEEE International Conference on Robotics and Automation.
[17] Wolfram Burgard,et al. Finding and Optimizing Solvable Priority Schemes for Decoupled Path Planning Techniques for Teams of Mobile Robots , 2002, PuK.
[18] Anthony Stentz,et al. The Focussed D* Algorithm for Real-Time Replanning , 1995, IJCAI.
[19] Malcolm Ryan. Multi-robot path-planning with subgraphs , 2006 .
[20] J. T. Shwartz,et al. On the Piano Movers' Problem : III , 1983 .
[21] Mark H. Overmars,et al. Coordinated path planning for multiple robots , 1998, Robotics Auton. Syst..
[22] Prasanna Velagapudi,et al. Decentralized prioritized planning in large multirobot teams , 2010, 2010 IEEE/RSJ International Conference on Intelligent Robots and Systems.
[23] Kikuo Fujimura,et al. Time-minimum routes in time-dependent networks , 1995, IEEE Trans. Robotics Autom..
[24] Thierry Fraichard,et al. Trajectory planning in a dynamic workspace: a 'state-time space' approach , 1998, Adv. Robotics.
[25] Stephen J. Buckley,et al. Fast motion planning for multiple moving robots , 1989, Proceedings, 1989 International Conference on Robotics and Automation.