Collision-free path planning

vi

[1]  Vincent Hayward,et al.  Fast collision detection scheme by recursive decomposition of a manipulator workspace , 1986, Proceedings. 1986 IEEE International Conference on Robotics and Automation.

[2]  Frank L. Lewis,et al.  Robot Control: Dynamics, Motion Planning, and Analysis , 1992 .

[3]  Oussama Khatib,et al.  Real-Time Obstacle Avoidance for Manipulators and Mobile Robots , 1986 .

[4]  A. A. Maciejewski,et al.  Obstacle Avoidance , 2005 .

[5]  Mark H. Overmars,et al.  A probabilistic learning approach to motion planning , 1995 .

[6]  Chee-Keng Yap,et al.  AnO(n logn) algorithm for the voronoi diagram of a set of simple curve segments , 1987, Discret. Comput. Geom..

[7]  Christian Laugier,et al.  Path-velocity decomposition revisited and applied to dynamic trajectory planning , 1993, [1993] Proceedings IEEE International Conference on Robotics and Automation.

[8]  Tomás Lozano-Pérez,et al.  Spatial Planning: A Configuration Space Approach , 1983, IEEE Transactions on Computers.

[9]  David M. Mount.  Intersection detection and separators for simple polygons , 1992, SCG '92.

[10]  J. Latombe,et al.  On nonholonomic mobile robots and optimal maneuvering , 1989, Proceedings. IEEE International Symposium on Intelligent Control 1989.

[11]  Charles W. Warren,et al.  Global path planning using artificial potential fields , 1989, Proceedings, 1989 International Conference on Robotics and Automation.

[12]  Jadran Lenarčič,et al.  Advances in Robot Kinematics and Computational Geometry , 1994 .

[13]  A. James Stewart.  Local Robustness and its Application to Polyhedral Intersection , 1994, Int. J. Comput. Geom. Appl..

[14]  Micha Sharir,et al.  Planning, geometry, and complexity of robot motion , 1986 .

[15]  Gordon T. Wilfong.  Motion planning for an autonomous vehicle , 1988, Proceedings. 1988 IEEE International Conference on Robotics and Automation.

[16]  David G. Kirkpatrick,et al.  Efficient computation of continuous skeletons , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[17]  Rae A. Earnshaw,et al.  Theoretical Foundations of Computer Graphics and CAD , 1988, NATO ASI Series.

[18]  M. Overmars,et al.  Approximating generalized Voronoi diagrams in any dimension , 1995 .

[19]  J. T. Shwartz,et al.  On the Piano Movers' Problem : III , 1983 .

[20]  John F. Canny,et al.  Collision Detection for Moving Polyhedra , 1986, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[21]  Micha Sharir,et al.  An Efficient and Simple Motion Planning Algorithm for a Ladder Amidst Polygonal Barriers , 1987, J. Algorithms.

[22]  Michael Ian Shamos,et al.  Computational geometry: an introduction , 1985 .

[23]  Jean-Paul Laumond,et al.  Metric induced by the shortest paths for a car-like mobile robot , 1993, Proceedings of 1993 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS '93).

[24]  Masatoshi Okutomi,et al.  Decision of robot movement by means of a potential field , 1986, Adv. Robotics.

[25]  Kang G. Shin,et al.  Minimum-time control of robotic manipulators with geometric path constraints , 1985 .

[26]  E. J.,et al.  ON THE COMPLEXITY OF MOTION PLANNING FOR MULTIPLE INDEPENDENT OBJECTS ; PSPACE HARDNESS OF THE " WAREHOUSEMAN ' S PROBLEM " . * * ) , 2022 .

[27]  Micha Sharir,et al.  On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles , 1986, Discret. Comput. Geom..

[28]  Martin Held,et al.  Evaluation of Collision Detection Methods for Virtual Reality Fly-Throughs , 1995 .

[29]  Joost N. Kok,et al.  Motion planning using a colored Kohonen network , 1993 .

[30]  Pierre Tournassoud,et al.  Motion planning for a mobile robot with a kinematic constraint , 1988, Proceedings. 1988 IEEE International Conference on Robotics and Automation.

[31]  John Canny,et al.  The complexity of robot motion planning , 1988 .

[32]  Pierre Tournassoud.  Motion planning for a mobile robot with a kinematic constraint , 1988, Geometry and Robotics.

[33]  Jean-Paul Laumond,et al.  Finding Collision-Free Smooth Trajectories for a Non-Holonomic Mobile Robot , 1987, IJCAI.

[34]  Tomás Lozano-Pérez,et al.  On multiple moving objects , 1986, Proceedings. 1986 IEEE International Conference on Robotics and Automation.

[35]  Mark H. Overmars,et al.  Motion Planning for Carlike Robots Using a Probabilistic Learning Approach , 1997, Int. J. Robotics Res..

[36]  Thomas Ottmann,et al.  Algorithms for Reporting and Counting Geometric Intersections , 1979, IEEE Transactions on Computers.

[37]  T. S. Ku,et al.  Model Based Rigid Body Guidance in Presence of Nonconvex Geometric Constraints , 1989 .

[38]  Osamu Takahashi,et al.  Motion planning in a plane using generalized Voronoi diagrams , 1989, IEEE Trans. Robotics Autom..

[39]  L. Shepp,et al.  OPTIMAL PATHS FOR A CAR THAT GOES BOTH FORWARDS AND BACKWARDS , 1990 .

[40]  Cao An Wang.  Collision Detection of a Moving Polygon in the Presence of Polygonal Obstacles in the Plane , 1994, IEEE Trans. Pattern Anal. Mach. Intell..

[41]  Chee Yap,et al.  Algorithmic motion planning , 1987 .

[42]  Chee-Keng Yap,et al.  A "Retraction" Method for Planning the Motion of a Disc , 1985, J. Algorithms.

[43]  Bernard Faverjon.  Object level programming of industrial robots , 1986, Proceedings. 1986 IEEE International Conference on Robotics and Automation.

[44]  Richard M. Murray,et al.  A motion planner for nonholonomic mobile robots , 1994, IEEE Trans. Robotics Autom..

[45]  Hirohisa Hirukawa,et al.  A Collision Avoidance Method for Robot Manipulators based on the Safety First Algorithm and the Potential Function , 1987 .

[46]  Thierry Siméon.  Planning collision free trajectories by a configuration space approach , 1988, Geometry and Robotics.

[47]  Chee-Keng Yap.  How to move a chair through a door , 1987, IEEE J. Robotics Autom..

[48]  Michael Spreng,et al.  Fast Computation of the C-Space of Convex 2D Algebraic Objects , 1995, Int. J. Robotics Res..

[49]  Thierry Siméon,et al.  Trajectory planning and motion control for mobile robots , 1988, Geometry and Robotics.

[50]  J. Schwartz,et al.  On the “piano movers” problem. II. General techniques for computing topological properties of real algebraic manifolds , 1983 .

[51]  Micha Sharir,et al.  An efficient motion-planning algorithm for a convex polygonal object in two-dimensional polygonal space , 1990, Discret. Comput. Geom..

[52]  L. Dubins.  On Curves of Minimal Length with a Constraint on Average Curvature, and with Prescribed Initial and Terminal Positions and Tangents , 1957 .

[53]  Hirohisa Hirukawa,et al.  A collision avoidance method for robot manipulators based on the safety first algorithm and the potential function , 1989, Adv. Robotics.

[54]  Godfried T. Toussaint,et al.  Computing the Width of a Set , 1988, IEEE Trans. Pattern Anal. Mach. Intell..

[55]  Sivan Toledo,et al.  External Polygon Containment Problems , 1994, Comput. Geom..

[56]  Narendra Ahuja,et al.  A potential field approach to path planning , 1992, IEEE Trans. Robotics Autom..

[57]  Alain Pruski,et al.  Multivalue coding: application to autonomous robot path planning with rotations , 1991, Proceedings. 1991 IEEE International Conference on Robotics and Automation.

[58]  John F. Canny,et al.  An exact algorithm for kinodynamic planning in the plane , 1990, SCG '90.

[59]  Leonidas J. Guibas,et al.  A kinetic framework for computational geometry , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[60]  Franco P. Preparata,et al.  Plane-sweep algorithms for intersecting geometric figures , 1982, CACM.

[61]  A. Frank van der Stappen,et al.  Motion planning amidst fat obstacles , 1993 .

[62]  S. Sitharama Iyengar,et al.  A 'retraction' method for learned navigation in unknown terrains for a circular robot , 1991, IEEE Trans. Robotics Autom..

[63]  Seth Hutchinson,et al.  Efficient search and hierarchical motion planning by dynamically maintaining single-source shortest paths trees , 1995, IEEE Trans. Robotics Autom..

[64]  Yutaka Kanayama,et al.  Smooth local path planning for autonomous vehicles , 1989, Proceedings, 1989 International Conference on Robotics and Automation.

[65]  Franco P. Preparata.  Advances in computing research , 1988 .

[66]  P. Souéres,et al.  Shortest paths synthesis for a car-like robot , 1996, IEEE Trans. Autom. Control..

[67]  Micha Sharir,et al.  An efficient algorithm for planning collision-free translational motion of a convex polygonal object in 2-dimensional space amidst polygonal obstacles , 1985, SCG '85.

[68]  Gordon T. Wilfong,et al.  Planning constrained motion , 1988, STOC '88.

[69]  H. Martinez-Alfaro.  Collision-free path planning for robots using B-splines and simulated annealing , 1993 .

[70]  Klara Kedem,et al.  A Convex Polygon Among Polygonal Obstacles: Placement and High-clearance Motion , 1993, Comput. Geom..

[71]  Micha Sharir,et al.  Retraction: A new approach to motion-planning , 1983, STOC.

[72]  Sivan Toledo,et al.  Extremal polygon containment problems , 1991, SCG '91.

[73]  John F. Canny,et al.  Using skeletons for nonholonomic path planning among obstacles , 1992, Proceedings 1992 IEEE International Conference on Robotics and Automation.

[74]  Koichi Kondo,et al.  Collision avoidance by free space enumeration using multiple search strategies , 1989, Adv. Robotics.

[75]  Micha Sharir,et al.  Planning a purely translational motion for a convex object in two-dimensional space using generalized Voronoi diagrams , 2016, Discret. Comput. Geom..

[76]  Jean-Paul Laumond,et al.  Region of accessibility for a car-like robot , 1993, Proceedings of 1993 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS '93).

[77]  J. Schwartz,et al.  On the Complexity of Motion Planning for Multiple Independent Objects; PSPACE- Hardness of the "Warehouseman's Problem" , 1984 .

[78]  John Canny,et al.  Shortest Paths for a Car-like Robot to Manifolds in Configuration Space , 1996, Int. J. Robotics Res..

[79]  D. T. Lee,et al.  Generalization of Voronoi Diagrams in the Plane , 1981, SIAM J. Comput..

[80]  A. Seireg,et al.  Optimal and Conforming Motion of a Point in a Constrained Plane , 1994 .

[81]  Micha Sharir,et al.  Algorithmic motion planning in robotics , 1991, Computer.

[82]  Jean-Claude Latombe,et al.  New heuristic algorithms for efficient hierarchical path planning , 1991, IEEE Trans. Robotics Autom..

[83]  Thierry Fraichard,et al.  Dynamic trajectory planning with dynamic constraints: A 'state-time space' approach , 1993, Proceedings of 1993 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS '93).

[84]  Cherif Ahrikencheikh,et al.  Optimized-Motion Planning: Theory and Implementation , 1994 .

[85]  Narendra Ahuja,et al.  Path planning using the Newtonian potential , 1991, Proceedings. 1991 IEEE International Conference on Robotics and Automation.

[86]  J. Van Leeuwen,et al.  Handbook of theoretical computer science - Part A: Algorithms and complexity; Part B: Formal models and semantics , 1990 .

[87]  Rodney A. Brooks,et al.  A subdivision algorithm in configuration space for findpath with rotation , 1983, IEEE Transactions on Systems, Man, and Cybernetics.

[88]  Bernard Faverjon,et al.  Obstacle avoidance using an octree in the configuration space of a manipulator , 1984, ICRA.

[89]  Micha Sharir,et al.  Efficient algorithms for planning purely translational collision-free motion in two and three dimensions , 1987, Proceedings. 1987 IEEE International Conference on Robotics and Automation.