Relaxed Dijkstra and A* with linear complexity for robot path planning problems in large-scale grid environments
Although there exist efficient methods to determine an optimal path in a graph, such as Dijkstra and A* algorithms, large instances of the path planning problem need more adequate and efficient techniques to obtain solutions in reasonable time. We propose two new time-linear relaxed versions of Dijk...
| Autor principal: | |
|---|---|
| Outros Autores: | , , , |
| Formato: | article |
| Idioma: | eng |
| Publicado em: |
2016
|
| Texto completo: | http://hdl.handle.net/10400.22/8969 |
| País: | Portugal |
| Oai: | oai:recipp.ipp.pt:10400.22/8969 |