Optimal piecewise linear motion of an object among obstacles
From MaRDI portal
Recommendations
- An efficient and simple motion planning algorithm for a ladder amidst polygonal barriers
- A new efficient motion-planning algorithm for a rod in two-dimensional polygonal space
- A note on the Papadimitriou-Silverberg algorithm for planning optimal piecewise-linear motion of a ladder
- Shortest paths in the plane with polygonal obstacles
- Efficient Motion Planning for an L-Shaped Object
Cites work
- scientific article; zbMATH DE number 3951430 (Why is no real title available?)
- scientific article; zbMATH DE number 43279 (Why is no real title available?)
- A note on two problems in connexion with graphs
- An algorithm for shortest-path motion in three dimensions
- Fibonacci heaps and their uses in improved network optimization algorithms
- Finding minimum rectilinear distance paths in the presence of barriers
- On the piano movers' problem: V. The case of a rod moving in three-dimensional space amidst polyhedral obstacles
- On the “piano movers'” problem I. The case of a two-dimensional rigid polygonal body moving amidst polygonal barriers
Cited in
(9)- An approximation algorithm ford1-optimal motion of a rod robot with fixed rotations
- Fastest path across constrained moving rectilinear obstacles
- An algorithmic approach to some problems in terrain navigation
- Shortest paths for line segments
- An efficient and simple motion planning algorithm for a ladder amidst polygonal barriers
- Characterizing the shortest path of an object among obstacles
- Lower bounds on moving a ladder in two and three dimensions
- A note on the Papadimitriou-Silverberg algorithm for planning optimal piecewise-linear motion of a ladder
- Mountain Climbing, Ladder Moving, and the Ring-Width of a Polygon
This page was built for publication: Optimal piecewise linear motion of an object among obstacles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1098643)
