Approximation algorithms for curvature-constrained shortest paths
暂无分享,去创建一个
[1] Gordon T. Wilfong. Motion planning for an autonomous vehicle , 1988, Proceedings. 1988 IEEE International Conference on Robotics and Automation.
[2] Richard Cole,et al. Visibility Problems for Polyhedral Terrains , 2018, J. Symb. Comput..
[3] Thomas Ottmann,et al. Algorithms for Reporting and Counting Geometric Intersections , 1979, IEEE Transactions on Computers.
[4] J. Canny,et al. Nonholonomic Motion Planning , 1992 .
[5] Michel Taïx,et al. Efficient motion planners for nonholonomic mobile robots , 1991, Proceedings IROS '91:IEEE/RSJ International Workshop on Intelligent Robots and Systems '91.
[6] J. Reif,et al. Approximate Kinodynamic Planning Using L2-norm Dynamic Bounds , 1990 .
[7] Franco P. Preparata. A Note on Locating a Set of Points in a Planar Subdivision , 1979, SIAM J. Comput..
[8] Thierry Fraichard. Smooth trajectory planning for a car in a structured world , 1991, Proceedings. 1991 IEEE International Conference on Robotics and Automation.
[9] L. Shepp,et al. OPTIMAL PATHS FOR A CAR THAT GOES BOTH FORWARDS AND BACKWARDS , 1990 .
[10] B. M. Fulk. MATH , 1992 .
[11] K. K. Nambiar,et al. Foundations of Computer Science , 2001, Lecture Notes in Computer Science.
[12] Kenneth L. Clarkson,et al. Approximation algorithms for shortest path motion planning , 1987, STOC.
[13] V. Kostov,et al. The Planar motion with bounded derivative of the curvature and its suboptimal paths , 1994 .
[14] Jean-Daniel Boissonnat,et al. A note on shortest paths in the plane subject to a constraint on the derivative of the curvature , 1994 .
[15] B. Donald,et al. Near-optimal kinodynamic planning for robots with coupled dynamics bounds , 1989, Proceedings. IEEE International Symposium on Intelligent Control 1989.
[16] Jean-Paul Laumond,et al. Finding Collision-Free Smooth Trajectories for a Non-Holonomic Mobile Robot , 1987, IJCAI.
[17] Jean-Claude Latombe. A Fast Path Planner for a Car-Like Indoor Mobile Robot , 1991, AAAI.
[18] Bruce Randall Donald,et al. On the complexity of kinodynamic planning , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.
[19] Pankaj K. Agarwal,et al. Motion planning for a steering-constrained robot through moderate obstacles , 1995, STOC '95.
[20] E. Cockayne,et al. Plane Motion of a Particle Subject to Curvature Constraints , 1975 .
[21] Jean-Daniel Boissonnat,et al. Shortest paths of bounded curvature in the plane , 1992, Proceedings 1992 IEEE International Conference on Robotics and Automation.
[22] Jean-Daniel Boissonnat,et al. Accessibility region for a car that only moves forwards along optimal paths , 1993 .
[23] V. Kostov,et al. Suboptimal Paths in the Problem of a Planar Motion With Bounded Derivative of the Curvature , 1993 .
[24] H. Sussmann. Shortest 3-dimensional paths with a prescribed curvature bound , 1995, Proceedings of 1995 34th IEEE Conference on Decision and Control.
[25] John F. Canny,et al. Using skeletons for nonholonomic path planning among obstacles , 1992, Proceedings 1992 IEEE International Conference on Robotics and Automation.
[26] Jean-Paul Laumond,et al. A motion planner for car-like robots based on a mixed global/local approach , 1990, EEE International Workshop on Intelligent Robots and Systems, Towards a New Frontier of Applications.
[27] Micha Sharir,et al. Planning, geometry, and complexity of robot motion , 1986 .
[28] L. Dubins. On Curves of Minimal Length with a Constraint on Average Curvature, and with Prescribed Initial and Terminal Positions and Tangents , 1957 .
[29] John F. Canny,et al. An exact algorithm for kinodynamic planning in the plane , 1990, SCG '90.
[30] Gordon T. Wilfong,et al. Planning constrained motion , 1988, STOC '88.
[31] Jirí Matousek,et al. On range searching with semialgebraic sets , 1992, Discret. Comput. Geom..
[32] Micha Sharir,et al. Algorithmic motion planning in robotics , 1991, Computer.
[33] John F. Canny,et al. Planning smooth paths for mobile robots , 1989, Proceedings, 1989 International Conference on Robotics and Automation.
[34] John F. Canny,et al. Some algebraic and geometric computations in PSPACE , 1988, STOC '88.
[35] Jean-Daniel Boissonnat,et al. Shortest path synthesis for Dubins non-holonomic robot , 1994, Proceedings of the 1994 IEEE International Conference on Robotics and Automation.
[36] Gordon T. Wilfong. Shortest paths for autonomous vehicles , 1989, Proceedings, 1989 International Conference on Robotics and Automation.
[37] Micha Sharir,et al. Motion Planning in the Presence of Moving Obstacles , 1985, FOCS.
[38] Richard M. Murray,et al. A motion planner for nonholonomic mobile robots , 1994, IEEE Trans. Robotics Autom..
[39] Micha Sharir,et al. On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles , 1986, Discret. Comput. Geom..
[40] John F. Canny,et al. New lower bound techniques for robot motion planning problems , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).