Show simple item record Ferrari, Fabricio 2011-10-28T12:54:57Z 2011-10-28T12:54:57Z 2009
dc.identifier.citation FERRARI, F.. A new parameterized potential family for path planning algorithms. International Journal on Artificial Intelligence Tools, v. 18, n. 6, p. 949-957, 2009. Disponível em: <>. Acesso em: 25 out. 2011. pt_BR
dc.description.abstract In this work, it is proposed a new family of potentials for path planning algorithms, one kind to the goal and other to the obstacles. With these new potentials it is possible to parameterize the potential scale length and strength easily, providing better control over the moving object path characteristics. In this way, the path problem can be treated analytically. For example, the minimum distance between the moving object and the obstacles can be calculated as a function of the potential parameters. Simulations are made to test its ability to guide a vehicle through an obstacle-free path towards the goal. The success rate of the moving object on reaching the goal is compared with the potential parameters and with obstacle configuration and distribution parameters. pt_BR
dc.language.iso eng pt_BR
dc.rights open access pt_BR
dc.subject Autonomous navigation pt_BR
dc.subject Potential theory pt_BR
dc.subject Path planning pt_BR
dc.title A new parameterized potential family for path planning algorithms pt_BR
dc.type article pt_BR

Files in this item

This item appears in the following Collection(s)


  • IMEF - Artigos publicados em periódicos
  • Show simple item record