Realtime motion path generation using subtargets in a rapidly changing environment

Authors:
Dennis Bruijnen;Jeroen van Helvoort;René van de Molengraft
Affiliations:
Control Systems Technology group, Technische Universiteit Eindhoven, Eindhoven, The Netherlands;Control Systems Technology group, Technische Universiteit Eindhoven, Eindhoven, The Netherlands;Control Systems Technology group, Technische Universiteit Eindhoven, Eindhoven, The Netherlands
Venue:
Robotics and Autonomous Systems
Year:
2007

Citing 3
Cited 1

Omni-drive Robot Motion on Curved Paths: The Fastest Path between Two Points Is Not a Straight-Line

AI '02 Proceedings of the 15th Australian Joint Conference on Artificial Intelligence: Advances in Artificial Intelligence
An Algorithm for Robot Path Planning with Cellular Automata

Proceedings of the Fourth International Conference on Cellular Automata for Research and Industry: Theoretical and Practical Issues on Cellular Automata
The focussed D* algorithm for real-time replanning

IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 2

Cognitive concepts in autonomous soccer playing robots

Cognitive Systems Research

Quantified Score

Hi-index	0.00

Visualization

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.