An approximation algorithm ford1-optimal motion of a rod robot with fixed rotations

DOI10.1080/00207160600847787MaRDI QIDQ3423757zbMATH OpenOpenAlexFDO

Authors Mohammad A. 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

zbMATH Keywords

\(d_1\)-optimal motionapproximation algorithmsrobot motion planningrod robot

Mathematics Subject Classification ID

Artificial intelligence for robotics (68T40) Approximation algorithms (68W25) Robot dynamics and control of rigid bodies (70E60) Control of mechanical systems (70Q05)

Recommendations

• A new efficient motion-planning algorithm for a rod in two-dimensional polygonal space
• An algorithm for efficient computation of dynamics of robotic manipulators
• Construction of optimal programmed paths for the motion of a robotic manipulator
• Optimization of the motion of multilink robots on a horizontal plane
• Recent advances on the algorithmic optimization of robot motion
• Regular approximations of the fastest motion of mobile robot under bounded state variables
• scientific article; zbMATH DE number 4068370
• Optimal rigid body motions. I: Approximate formulation
• Optimal Trajectory Generation for Robotic Manipulators Using Dynamic Programming

Cites work

• 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
• An efficient and simple motion planning algorithm for a ladder amidst polygonal barriers
• Approximate Euclidean Shortest Paths in 3-Space
• On the Piano Movers problem. II: General techniques for computing topological properties of real algebraic manifolds
• 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
• Optimal piecewise linear motion of an object among obstacles
• Pseudo approximation algorithms with applications to optimal motion planning
• Shortest paths for line segments

Cited in

(2)

• A new efficient motion-planning algorithm for a rod in two-dimensional polygonal space
• Optimal motion planning for two square robots in a rectilinear environment

This page was built for publication: An approximation algorithm ford₁-optimal motion of a rod robot with fixed rotations

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