The aim of this paper is to describe the architecture of a Path Planner for Mobile Robots based on the paradigm of Cellular Automata. This path planner is very flexible, handling robots with quite different kinematics (omnidirectional, car-like, asymmetrical, etc.), with generic shapes (even with concavities and holes) and with generic cinematic centers locations. It can be applied to flat (Euclidean) Work Space and to natural variable terrains. Thanks to this architecture based a Potential Fields Method, it turns out to be very fast, complete and optimal, allowing to react to the world dynamics (reactive planning), generating new optimal solutions every time the obstacles positions changes.
Marchese, F. (2005). The architecture of a reactive Path-Planner for Mobile Robots based on Cellular Automata. In AI*IA2005: ADVANCES IN ARTIFICIAL INTELLIGENCE, PROCEEDINGS (pp.182-185). BERLIN : SPRINGER-VERLAG BERLIN [10.1007/11558590_19].
The architecture of a reactive Path-Planner for Mobile Robots based on Cellular Automata
MARCHESE, FABIO MARIO GUIDO
2005
Abstract
The aim of this paper is to describe the architecture of a Path Planner for Mobile Robots based on the paradigm of Cellular Automata. This path planner is very flexible, handling robots with quite different kinematics (omnidirectional, car-like, asymmetrical, etc.), with generic shapes (even with concavities and holes) and with generic cinematic centers locations. It can be applied to flat (Euclidean) Work Space and to natural variable terrains. Thanks to this architecture based a Potential Fields Method, it turns out to be very fast, complete and optimal, allowing to react to the world dynamics (reactive planning), generating new optimal solutions every time the obstacles positions changes.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
