Search

To link to full-text access for this article, visit this link: http://dx.doi.org/10.1016/j.robot.2007.01.003 Byline: Dennis Bruijnen, Jeroen van Helvoort, Rene van de Molengraft Abstract: In this work an algorithm is proposed for path planning in a rapidly changing environment. The algorithm is computationally cheap and generates a sub-optimal smooth path with bounds on the allowed velocity, acceleration, and jerk. The algorithm is designed for holonomic omniwheel platforms. It outperforms potential field algorithms regarding both convergence and optimality. Furthermore, it is able to adapt fast in a rapidly changing environment due to the low computational cost in the order of ms for a single update, in contrast with computationally more expensive methods such as wavefront algorithms and global optimization methods, where the computational cost is mostly on the order of seconds. The algorithm will be tested via simulations and experiments. Author Affiliation: Control Systems Technology group, Technische Universiteit Eindhoven, Eindhoven, The Netherlands Article History: Received 27 October 2005; Accepted 24 January 2007