Space D*: Um Algoritmo para Path Planning Multi-Robo^s

Renan MaffeiSilvia BotelhoLuan SilveiraPaulo Drews Jr.Nelson Duarte FilhoAlessandro BichoFelipe AlmeidaMatheus Longaray

This paper describes a new method of path planning for multiple robots in unknown environments. The method, called Space D*, is based on two algorithms: the D*, which is a incremental graph search algorithm and the Space Colonization algorithm, previously used to simulate crowd behaviors. The major contribution of the proposed method is the focus on generating paths in spacious environments to help facilitate the control of robots, and thus pre- senting itself in a viable way for use in real environments. The results obtained validates the approach and show the advantage in relation to D* method.

Caso o link acima esteja inválido, faça uma busca pelo texto completo na Web: Buscar na Web

Biblioteca Digital Brasileira de Computação - Contato:
     Mantida por: