A variational dynamic programming approach to robot-path planning with a distance-safety criterion
暂无分享,去创建一个
[1] Rodney A. Brooks,et al. Natural decomposition of free space for path planning , 1985, Proceedings. 1985 IEEE International Conference on Robotics and Automation.
[2] D. T. Lee,et al. Generalization of Voronoi Diagrams in the Plane , 1981, SIAM J. Comput..
[3] Tomás Lozano-Pérez,et al. An algorithm for planning collision-free paths among polyhedral obstacles , 1979, CACM.
[4] Meghanad D. Wagh,et al. Robot path planning using intersecting convex shapes: Analysis and simulation , 1987, IEEE J. Robotics Autom..
[5] Charles E. Thorpe,et al. Path Relaxation: Path Planning for a Mobile Robot , 1984, AAAI.
[6] S. Sathiya Keerthi,et al. A fast procedure for computing the distance between complex objects in three-dimensional space , 1988, IEEE J. Robotics Autom..
[7] Kang G. Shin,et al. Selection of near-minimum time geometric paths for robotic manipulators , 1986 .
[8] Elmer G. Gilbert,et al. Distance functions and their application to robot path planning in the presence of obstacles , 1985, IEEE J. Robotics Autom..
[9] Rodney A. Brooks,et al. Solving the Find-Path Problem by Good Representation of Free Space , 1983, Autonomous Robot Vehicles.
[10] S. Kahne,et al. Optimal control: An introduction to the theory and ITs applications , 1967, IEEE Transactions on Automatic Control.
[11] Raja Chatila,et al. Path Planning and Environment Learning in a Mobile Robot System , 1982, ECAI.