In the present work, it is described a fast Motion-Planner for Mobile Robots moving on natural terrains. The planner is very flexible: it can be use on a wide class of vehicles with different kinematics, and with generic shapes (even with concavity and holes). Because of these characteristics, it could be applied for the assembly planning in the manufacturing industry, as in the Piano Mover's problems. Considering robots moving with smoothed trajectories on variable terrains, we have developed this algorithm based on a anisotropic propagation of attraction potentials on a non-euclidean manifold. The optimal collision-free trajectories are found following the minimum valley of a potential hypersurface embedded in a 4D space. Thanks to the underlying Multilayered Cellular Automata architecture, it is a distributed approach. This planner turn out to be very fast, allowing to react to the dynamics of the environment, evolving toward new solutions every time the obstacles' positions changes.
Marchese, F. (2005). A Reactive Planner for Mobile Robots with Generic Shapes and Kinematics on Variable Terrains. In 2005 International Conference on Advanced Robotics, ICAR '05, Proceedings (pp.23-30). IEEE Robotics and Automation Society [10.1109/ICAR.2005.1507386].
A Reactive Planner for Mobile Robots with Generic Shapes and Kinematics on Variable Terrains
MARCHESE, FABIO MARIO GUIDO
2005
Abstract
In the present work, it is described a fast Motion-Planner for Mobile Robots moving on natural terrains. The planner is very flexible: it can be use on a wide class of vehicles with different kinematics, and with generic shapes (even with concavity and holes). Because of these characteristics, it could be applied for the assembly planning in the manufacturing industry, as in the Piano Mover's problems. Considering robots moving with smoothed trajectories on variable terrains, we have developed this algorithm based on a anisotropic propagation of attraction potentials on a non-euclidean manifold. The optimal collision-free trajectories are found following the minimum valley of a potential hypersurface embedded in a 4D space. Thanks to the underlying Multilayered Cellular Automata architecture, it is a distributed approach. This planner turn out to be very fast, allowing to react to the dynamics of the environment, evolving toward new solutions every time the obstacles' positions changes.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.