On-line motion planning: Case of a planar rod

DOI10.1007/BF01530886zbMath0875.68767MaRDI QIDQ1356165

O. Diekmann

Publication date: 7 July 1997

Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Mathematics Subject Classification ID

Computing methodologies and applications (68U99) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (2)

Construction of C-space roadmaps from local sensory data. What should the sensors look for? ⋮ Rods and Rings: Soft Subdivision Planner for R^3 x S^2.

Cites Work

• Unnamed Item
• Unnamed Item
• On the Piano Movers problem. II: General techniques for computing topological properties of real algebraic manifolds
• Planning a purely translational motion of a convex object in two- dimensional space using generalized Voronoi diagrams
• 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
• A new efficient motion-planning algorithm for a rod in two-dimensional polygonal space
• Path-planning strategies for a point mobile automaton moving amidst unknown obstacles of arbitrary shape
• Algorithmic and complexity issues of robot motion in an uncertain environment
• On the “piano movers'” problem I. The case of a two-dimensional rigid polygonal body moving amidst polygonal barriers
• A “retraction” method for planning the motion of a disc
• A New Proof that Ω₃ is Zero
• Generalized voronoi diagrams for moving a ladder. I: Topological analysis
• Shape from probing
• Dynamic path planning for a mobile automaton with limited information on the environment
• A Method for Solving Arbitrary-Wall Mazes by Computer

This page was built for publication: On-line motion planning: Case of a planar rod