Cellular Automata model is a powerful instrument used in many applications. In this paper we present a Reactive Path-Planning Algorithm for a non-holonomic robot moving on a 2D surface based on Multilayered Cellular Automata. The robot considered has a preferential motion direction and has to move using smoothed trajectories, without stopping and turning in place, and with a minimum steering radius. We have implemented a new algorithm based on a directional (anisotropic) propagation of repulsive and attracting potential values in a Multilayered Cellular Automata model. The algorithm finds all the optimal trajectories following the minimum valley of a potential hypersurface embedded in a 4D space, built respecting the imposed constraints. Our approach results to be distributed and incremental: whenever changing the initial or the final pose, or the obstacles distribution, the automata start evolving towards a new global steady state, looking for a new set of solutions. Because it reacts to obstacles distribution changes, it can be also used in unknown or dynamical environments in combination with a world modeler. The path-planning algorithm is applicable on a wide class of vehicles kinematics, selected changing a set of weights

Marchese, F. (2001). Reactive path-planning: a directional diffusion algorithm on multilayered cellular automata. In S. Bandini, T. Worsch (a cura di), Theory and Practical Issues on Cellular Automata (pp. 81-89). Berlin : Springer-Verlag.

Reactive path-planning: a directional diffusion algorithm on multilayered cellular automata

Marchese, FMG
2001

Abstract

Cellular Automata model is a powerful instrument used in many applications. In this paper we present a Reactive Path-Planning Algorithm for a non-holonomic robot moving on a 2D surface based on Multilayered Cellular Automata. The robot considered has a preferential motion direction and has to move using smoothed trajectories, without stopping and turning in place, and with a minimum steering radius. We have implemented a new algorithm based on a directional (anisotropic) propagation of repulsive and attracting potential values in a Multilayered Cellular Automata model. The algorithm finds all the optimal trajectories following the minimum valley of a potential hypersurface embedded in a 4D space, built respecting the imposed constraints. Our approach results to be distributed and incremental: whenever changing the initial or the final pose, or the obstacles distribution, the automata start evolving towards a new global steady state, looking for a new set of solutions. Because it reacts to obstacles distribution changes, it can be also used in unknown or dynamical environments in combination with a world modeler. The path-planning algorithm is applicable on a wide class of vehicles kinematics, selected changing a set of weights
Capitolo o saggio
path planning, mobile robots, cellular automata
English
Theory and Practical Issues on Cellular Automata
Bandini, S; Worsch, T
2001
1-85233-388-X
Springer-Verlag
81
89
Marchese, F. (2001). Reactive path-planning: a directional diffusion algorithm on multilayered cellular automata. In S. Bandini, T. Worsch (a cura di), Theory and Practical Issues on Cellular Automata (pp. 81-89). Berlin : Springer-Verlag.
none
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/10281/17282
Citazioni
  • Scopus ND
  • ???jsp.display-item.citation.isi??? 0
Social impact