Dual Dijkstra Search for paths with different topologies
暂无分享,去创建一个
[1] Nancy M. Amato,et al. A randomized roadmap method for path and manipulation planning , 1996, Proceedings of IEEE International Conference on Robotics and Automation.
[2] Steven Dubowsky,et al. On computing the global time-optimal motions of robotic manipulators in the presence of obstacles , 1991, IEEE Trans. Robotics Autom..
[3] Jose Luis Esteves dos Santos,et al. A New Shortest Paths Ranking Algorithm , 1999 .
[4] Steven M. LaValle,et al. RRT-connect: An efficient approach to single-query path planning , 2000, Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065).
[5] Lydia E. Kavraki,et al. Randomized preprocessing of configuration for fast path planning , 1994, Proceedings of the 1994 IEEE International Conference on Robotics and Automation.
[6] Edsger W. Dijkstra,et al. A note on two problems in connexion with graphs , 1959, Numerische Mathematik.
[7] Thierry Siméon,et al. Mobility analysis for feasibility studies in CAD models of industrial environments , 1999, Proceedings 1999 IEEE International Conference on Robotics and Automation (Cat. No.99CH36288C).
[8] David Hsu,et al. Randomized single-query motion planning in expansive spaces , 2000 .
[9] Oliver Brock,et al. Decomposition-based motion planning: a framework for real-time motion planning in high-dimensional configuration spaces , 2001, Proceedings 2001 ICRA. IEEE International Conference on Robotics and Automation (Cat. No.01CH37164).
[10] M. R. Rao,et al. Combinatorial Optimization , 1992, NATO ASI Series.