Algorithmic Foundations of Robotics X pp 89-104 | Cite as

From Discrete to Continuous Motion Planning

Part of the Springer Tracts in Advanced Robotics book series (STAR, volume 86)

In this paper, we demonstrate an equivalence between a large class of discrete motion planning problems, and piano mover’s problems, which we refer to as ”continuous motion planning problems”. We first prove that under some assumptions, discrete motion planning in d dimensions can be transformed into continuous motion planning in 2d + 1 dimensions. Then we prove a more specific, similar equivalence for which the number of dimensions of the configuration space does not necessarily have to be increased.We study two simple cases where this theorem applies, and show that it can lead to original and efficient motion planning algorithms, which could probably be applied to a wide range of multi-contact planning problems.We apply this equivalence to a simulation of legged locomotion planning for a hexapod robot.
[null, {"document_url": "https://link.springer.com/chapter/10.1007%2F978-3-642-36279-8_6", "unformatted_src": "https://media.springernature.com/w306/springer-static/cover/book/978-3-642-36279-8.jpg", "src": "https://media.springernature.com/w306/springer-static/cover/book/978-3-642-36279-8.jpg"}, null]