Abstract: In this paper, we propose a variant of the anytime hybrid A* algorithm that generates a fast but suboptimal solution before progressively optimizing the paths to find the shortest ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results