A Survey of Motion Planning and Related Geometric Algorithms

[1]  Micha Sharir,et al.  On the shortest paths between two convex polyhedra , 2018, JACM.

[2]  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..

[3]  Micha Sharir,et al.  Separating two simple polygons by a sequence of translations , 2015, Discret. Comput. Geom..

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

[5]  Joseph O'Rourke,et al.  Lower bounds on moving a ladder in two and three dimensions , 1988, Discret. Comput. Geom..

[6]  Micha Sharir,et al.  Improved lower bounds on the length of Davenport-Schinzel sequences , 1988, Comb..

[7]  Micha Sharir,et al.  On the number of critical free contacts of a convex polygonal object moving in two-dimensional polygonal space , 1987, Discret. Comput. Geom..

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

[9]  Joseph S. B. Mitchell,et al.  The weighted region problem , 1987, SCG '87.

[10]  Joseph S. B. Mitchell,et al.  The Discrete Geodesic Problem , 1987, SIAM J. Comput..

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

[12]  Micha Sharir,et al.  On shortest paths amidst convex polyhedra , 1987, SCG '86.

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

[14]  Tomas Lozano-Perez,et al.  A simple motion-planning algorithm for general robot manipulators , 1986, IEEE J. Robotics Autom..

[15]  Micha Sharir,et al.  On shortest paths in polyhedral spaces , 1986, STOC '84.

[16]  Micha Sharir,et al.  Nonlinearity of davenport—Schinzel sequences and of generalized path compression schemes , 1986, FOCS.

[17]  Leonidas J. Guibas,et al.  Visibility-polygon search and euclidean shortest paths , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[18]  Micha Sharir,et al.  On minima of function, intersection patterns of curves, and davenport-schinzel sequences , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[19]  Micha Sharir,et al.  Motion planning in the presence of moving obstacles , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[20]  Christos H. Papadimitriou,et al.  An Algorithm for Shortest-Path Motion in Three Dimensions , 1985, Inf. Process. Lett..

[21]  Micha Sharir,et al.  An efficient and simple motion planning algorithm for a ladder moving in two-dimensional space amidst polygonal barriers (extended abstract) , 1985, SCG '85.

[22]  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.

[23]  Emo WELZL,et al.  Constructing the Visibility Graph for n-Line Segments in O(n²) Time , 1985, Inf. Process. Lett..

[24]  Micha Sharir,et al.  Intersection and Closest-Pair Problems for a Set of Planar Discs , 1985, SIAM J. Comput..

[25]  D. Mount.  On Finding Shortest Paths on Convex Polyhedra. , 1985 .

[26]  J. Reif,et al.  Shortest Paths in Euclidean Space with Polyhedral Obstacles. , 1985 .

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

[28]  Hiroshi Imai,et al.  Voronoi Diagram in the Laguerre Geometry and its Applications , 1985, SIAM J. Comput..

[29]  J. Schwartz,et al.  On the Piano Movers''Problem V: The Case of a Rod Moving in Three-Dimensional Space amidst Polyhedra , 1984 .

[30]  D. T. Lee,et al.  Euclidean shortest paths in the presence of rectilinear barriers , 1984, Networks.

[31]  R. J. Schilling,et al.  Decoupling of a Two-Axis Robotic Manipulator Using Nonlinear State Feedback: A Case Study , 1984 .

[32]  John E. Hopcroft,et al.  Movement Problems for 2-Dimensional Linkages , 1984, SIAM J. Comput..

[33]  Paul G. Spirakis,et al.  Strong NP-Hardness of Moving Many Discs , 1984, Inf. Process. Lett..

[34]  John E. Hopcroft,et al.  Motion of Objects in Contact , 1984 .

[35]  R. Brooks.  Planning Collision- Free Motions for Pick-and-Place Operations , 1983 .

[36]  J. Schwartz,et al.  Efficient Detection of Intersections among Spheres , 1983 .

[37]  Mikhail J. Atallah,et al.  Dynamic computational geometry , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[38]  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 .

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

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

[41]  J. Schwartz,et al.  On the “piano movers'” problem I. The case of a two‐dimensional rigid polygonal body moving amidst polygonal barriers , 1983 .

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

[43]  John E. Hopcroft,et al.  On the movement of robot arms in 2-dimensional bounded regions , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[44]  Rodney A. Brooks,et al.  Solving the find-path problem by good representation of free space , 1982, IEEE Transactions on Systems, Man, and Cybernetics.

[45]  John H. Reif,et al.  Complexity of the mover's problem and generalizations , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[46]  Tomás Lozano-Pérez,et al.  An algorithm for planning collision-free paths among polyhedral obstacles , 1979, CACM.

[47]  H. Davenport,et al.  A Combinatorial Problem Connected with Differential Equations , 1965 .

[48]  Micha Sharir,et al.  Almost linear upper bounds on the length of general davenport—schinzel sequences , 1987, Comb..

[49]  Hans P. Moravec.  Robot Rover Visual Navigation , 1981 .

[50]  S. M. Udupa,et al.  Collision Detection and Avoidance in Computer Controlled Manipulators , 1977, IJCAI.

[51]  George E. Collins,et al.  Quantifier elimination for real closed fields by cylindrical algebraic decomposition , 1975 .

[52]  E. Szemerédi.  On a problem of Davenport and Schinzel , 1974 .

[53]  H. Davenport.  A combinatorial problem connected with differential equations II , 1971 .

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