An approximation algorithm ford1-optimal motion of a rod robot with fixed rotations
From MaRDI portal
Publication:3423757
DOI10.1080/00207160600847787zbMath1133.68472OpenAlexW2125302094MaRDI QIDQ3423757
Mohammad Ali Abam, Mohammad Ghodsi
Publication date: 15 February 2007
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207160600847787
Control of mechanical systems (70Q05) Robot dynamics and control of rigid bodies (70E60) Approximation algorithms (68W25) Artificial intelligence for robotics (68T40)
Cites Work
- Shortest paths for line segments
- On the Piano Movers problem. II: General techniques for computing topological properties of real algebraic manifolds
- Optimal piecewise linear motion of an object among obstacles
- A new efficient motion-planning algorithm for a rod in two-dimensional polygonal space
- Pseudo approximation algorithms with applications to optimal motion planning
- A note on the Papadimitriou-Silverberg algorithm for planning optimal piecewise-linear motion of a ladder
- On the “piano movers'” problem I. The case of a two-dimensional rigid polygonal body moving amidst polygonal barriers
- On the piano movers' problem: V. The case of a rod moving in three-dimensional space amidst polyhedral obstacles
- An efficient and simple motion planning algorithm for a ladder amidst polygonal barriers
- Approximate Euclidean Shortest Paths in 3-Space
This page was built for publication: An approximation algorithm ford1-optimal motion of a rod robot with fixed rotations
