The complexity of planar compliant motion planning under uncertainty

DOI10.1007/BF01840394MaRDI QIDQ911278zbMATH OpenOpenAlexFDO

Authors Bruce Randall Donald

Publication date 1990

Published in Algorithmica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01840394

zbMATH Keywords

computational complexitymotion planningrobotcontrol uncertaintygeometrical theory of planning

Mathematics Subject Classification ID

Computing methodologies and applications (68U99) Analysis of algorithms and problem complexity (68Q25) Artificial intelligence (68T99) Complexity of computation (including implicit computational complexity) (03D15)

Recommendations

• An efficient algorithm for one-step planar compliant motion planning with uncertainty
• Efficiently Planning Compliant Motion in the Plane
• Complexity of nonholonomic motion planning
• scientific article; zbMATH DE number 2002586
• Complexity of control-affine motion planning
• Motion Planning Under Uncertainty with Complex Agents and Environments via Hybrid Search
• On the motion planning problem, complexity, entropy, and nonholonomic interpolation
• Algorithmic and complexity issues of robot motion in an uncertain environment
• Sequential parametrized motion planning and its complexity
• Path planning for robots under stochastic uncertainty^*

Cites work

• A geometric approach to error detection recovery for robot motion planning with uncertainty
• A search algorithm for motion planning with six degrees of freedom
• A “retraction” method for planning the motion of a disc
• Complexity of deciding Tarski algebra
• Dynamic path planning for a planar articulated robot arm moving amidst unknown obstacles
• Generalized Voronoi diagrams for a ladder. II: Efficient construction of the diagram
• Generalized voronoi diagrams for moving a ladder. I: Topological analysis
• On multiple moving objects
• Reducing Multiple Object Motion Planning to Graph Searching
• Simplified Voronoi diagrams
• Spatial Planning: A Configuration Space Approach
• Visibility of disjoint polygons

Cited in

(11)

• Planning and control of meso-scale manipulation tasks with uncertainties
• Hardness of uncertain segment cover, contiguous SAT and visibility with uncertain obstacles
• A geometric approach to error detection recovery for robot motion planning with uncertainty
• Landmark-based robot navigation
• On information invariants in robotics
• Input-sensitive compliant motion in the plane
• Efficiently Planning Compliant Motion in the Plane
• An efficient algorithm for one-step planar compliant motion planning with uncertainty
• scientific article; zbMATH DE number 797437 (Why is no real title available?)
• scientific article; zbMATH DE number 4185052 (Why is no real title available?)
• Reaching a goal with directional uncertainty

This page was built for publication: The complexity of planar compliant motion planning under uncertainty

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