En el problema de path planning sobre grafos tipo grilla, una de las principales técnicas de preprocesamiento del estado del arte son los subgoal graphs. Estos grafos consisten en un subconjunto de nodos importantes ...

In Real-Time Heuristic Search (RTHS) we are given a search graph G, a heuristic, and an objective, which is to find a path from a start node to a given goal node in G. As such, one does not impose any trajectory constraints ...

This doctoral thesis was designed and implemented using a strategy of explorer agents and a management and monitoring system to obtain the shortest and safest paths. The strategy was simulated using Matlab R2016 in 10 test ...