A “retraction” method for planning the motion of a disc

DOI10.1016/0196-6774(85)90021-5zbMATH Open0556.68051OpenAlexW1965440866MaRDI QIDQ3219802FDOQ3219802

Authors: Colm P. O'Dunlaing, Chee K. 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

Recommendations

• scientific article; zbMATH DE number 4108220
• On the “piano movers'” problem I. The case of a two-dimensional rigid polygonal body moving amidst polygonal barriers
• scientific article; zbMATH DE number 3945381
• Planning a purely translational motion of a convex object in two- dimensional space using generalized Voronoi diagrams
• Moving a disc between polygons

zbMATH Keywords

algorithmroboticsgeneralized Voronoi diagrammotion-planningcollision-free continuous motionconnected pathobstacle-avoiding motion

Mathematics Subject Classification ID

Artificial intelligence for robotics (68T40)

Cited In (38)

• Rods and Rings: Soft Subdivision Planner for R^3 x S^2.
• On fast planning of suboptimal paths amidst polygonal obstacles in plane
• Planning a purely translational motion of a convex object in two- dimensional space using generalized Voronoi diagrams
• Generalized Voronoi diagrams for a ladder. II: Efficient construction of the diagram
• A survey of motion planning and related geometric algorithms
• An efficient motion-planning algorithm for a convex polygonal object in two-dimensional polygonal space
• On-line motion planning: Case of a planar rod
• A unified approach for robot motion planning with moving polyhedral obstacles
• Coordinated motion planning for two independent robots
• On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles
• The visibility-Voronoi complex and its applications
• A new efficient motion-planning algorithm for a rod in two-dimensional polygonal space
• KINETIC COLLISION DETECTION FOR SIMPLE POLYGONS
• Swap conditions for dynamic Voronoi diagrams for circles and line segments
• Soft subdivision search in motion planning. II: Axiomatics
• The complexity of the free space for a robot moving amidst fat obstacles
• Symbolic treatment of geometric degeneracies
• An O(n log n) algorithm for the Voronoi diagram of a set of simple curve segments
• Voronoi-like partition of lattice in cellular automata
• On soft predicates in subdivision motion planning
• On the general motion-planning problem with two degrees of freedom
• Moving a disc between polygons
• Simplified Voronoi diagrams
• Learning metric-topological maps for indoor mobile robot navigation
• A tight lower bound for the complexity of path-planning for a disc
• A compact piecewise-linear Voronoi diagram for convex sites in the plane
• The complexity of the free space for motion planning amidst fat obstacles
• ON THE PATH PLANNING PROBLEM IN THE VICINITY OF OBSTACLES
• Title not available (Why is that?)
• Multi-robot motion planning for unit discs with revolving areas
• Constructing the Voronoi diagram of a set of line segments in parallel
• Robot motion planning and the single cell problem in arrangements
• The complexity of planar compliant motion planning under uncertainty
• Construction of optimal programmed paths for the motion of a robotic manipulator
• Approximating Voronoi Diagrams of Convex Sites in Any Dimension
• 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

This page was built for publication: A “retraction” method for planning the motion of a disc

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3219802)