A “retraction” method for planning the motion of a disc
From MaRDI portal
Publication:3219802
DOI10.1016/0196-6774(85)90021-5zbMath0556.68051OpenAlexW1965440866MaRDI QIDQ3219802
Colm P. O'Dunlaing, Chee-Keng Yap
Publication date: 1985
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0196-6774(85)90021-5
algorithmroboticsgeneralized Voronoi diagrammotion-planningcollision-free continuous motionconnected pathobstacle-avoiding motion
Related Items
On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles, Planning a purely translational motion of a convex object in two- dimensional space using generalized Voronoi diagrams, An O(n log n) algorithm for the Voronoi diagram of a set of simple curve segments, Soft Subdivision Search in Motion Planning, II: Axiomatics, Generalized Voronoi diagrams for a ladder. II: Efficient construction of the diagram, Symbolic treatment of geometric degeneracies, Simplified Voronoi diagrams, On-line motion planning: Case of a planar rod, Coordinated motion planning for two independent robots, A new efficient motion-planning algorithm for a rod in two-dimensional polygonal space, KINETIC COLLISION DETECTION FOR SIMPLE POLYGONS, A compact piecewise-linear Voronoi diagram for convex sites in the plane, A tight lower bound for the complexity of path-planning for a disc, On fast planning of suboptimal paths amidst polygonal obstacles in plane, Voronoi-like partition of lattice in cellular automata, The visibility-Voronoi complex and its applications, Construction of optimal programmed paths for the motion of a robotic manipulator, A survey of motion planning and related geometric algorithms, Learning metric-topological maps for indoor mobile robot navigation, Multi-robot motion planning for unit discs with revolving areas, The complexity of planar compliant motion planning under uncertainty, Stability of solutions in problems of computational geometry, Characterization of contour elements that generate abstract Voronoi diagrams, A convex polygon among polygonal obstacle: Placement and high-clearance motion, Constructing the Voronoi diagram of a set of line segments in parallel, On the general motion-planning problem with two degrees of freedom, An efficient motion-planning algorithm for a convex polygonal object in two-dimensional polygonal space, Moving a disc between polygons, Rods and Rings: Soft Subdivision Planner for R^3 x S^2., Swap conditions for dynamic Voronoi diagrams for circles and line segments, The complexity of the free space for motion planning amidst fat obstacles, The complexity of the free space for a robot moving amidst fat obstacles, Approximating Voronoi Diagrams of Convex Sites in Any Dimension, On soft predicates in subdivision motion planning
