Movement problems for 2-dimensional linkages
SIAM Journal on Computing
Real-time obstacle avoidance for manipulators and mobile robots
International Journal of Robotics Research
On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles
Discrete & Computational Geometry
An efficient and simple motion planning algorithm for a ladder amidst polygonal barriers
Journal of Algorithms
Moving a ladder in three dimensions: upper and lower bounds
SCG '87 Proceedings of the third annual symposium on Computational geometry
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
On the general motion planning problem with two degrees of freedom
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
Coordinated motion planning for two independent robots
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
Triangles in space or building (and analyzing) castles in the Air
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
Planning algorithm for a convex polygonal object in two-dimensional polygonal space
Discrete & Computational Geometry
An algorithm for planning collision-free paths among polyhedral obstacles
Communications of the ACM
A Simple Motion Planning Algorithm for General Robot Manipulators
A Simple Motion Planning Algorithm for General Robot Manipulators
Collision detection and avoidance in computer controlled manipulators.
Collision detection and avoidance in computer controlled manipulators.
Symbolic and Geometric Connectivity Graph Methods for Route Planning in Digitized Maps
IEEE Transactions on Pattern Analysis and Machine Intelligence
Combinatorial complexity of translating a box in polyhedral 3-space
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
Motion planning in the presence of moving obstacles
Journal of the ACM (JACM)
Randomized robot navigation algorithms
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Extending the Path-Planning Horizon
International Journal of Robotics Research
Physically realistic motion synthesis in animation
Evolutionary Computation
Stabbing Convex Polygons with a Segment or a Polygon
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Engineering Applications of Artificial Intelligence
Algorithmic motion planning: the randomized approach
General Theory of Information Transfer and Combinatorics
Collision avoidance and low-observable navigation in a dynamic environment
Mathematical and Computer Modelling: An International Journal
| Hi-index | 4.10 |
A survey is presented of an approach to motion planning that emphasizes object-oriented, exact, and discrete (or combinatorial) algorithmic techniques in which worst-case asymptotically efficient solutions are being sought. Following a statement of the problem, motion planning in static and known environments is treated. The discussion covers general solutions, lower bounds, the projection method, the retraction method, the expanded obstacles, the single-component approach, and a mobile convex object moving in a 2D polygonal space. Variants of the motion-planning problem are then considered, namely, optimal motion planning, adaptive and exploratory motion planning, motion planning in the presence of moving obstacles, constrained motion planning, motion planning with uncertainty, and general task planning.