Hierarchical A∗ based path planning — a case study

Autere, Antti

doi:10.1016/s0950-7051(01)00121-6

Cited by 18 publications

(6 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…For future study, researchers are encouraged to apply the basic principles of LDA ⁄ into incremental and/or hierarchical approaches [26] in order to handle partially observable and dynamic environments in real-time; mobile threat sources, mobile targets and dynamic gates, more realistic threat source attacks being among the properties of such environments. Moreover, utilization of non-uniform grid abstractions instead of uniform ones is also highly encouraged, since such improvement are expected to shrink the search space, and contribute to the performance of the algorithm drastically.…”

Section: Conclusion and Future Studymentioning

confidence: 99%

Limited-Damage A*: A path search algorithm that considers damage as a feasibility criterion

Bayili

Polat

2011

Knowledge-Based Systems

View full text Add to dashboard Cite

Section: Conclusion and Future Studymentioning

confidence: 99%

Limited-Damage A*: A path search algorithm that considers damage as a feasibility criterion

Bayili

Polat

2011

Knowledge-Based Systems

View full text Add to dashboard Cite

“…Heuristic search is a general problem solving method applicable to a wide range of tasks [1], [3], [6], [7], [20]. Its efficiency depends on the quality of the heuristic evaluation function.…”

Section: Heuristic Evaluation Functionmentioning

confidence: 99%

Study on Near-Optimal Path Finding Strategies in a Road Network

Shi

Cao

et al. 2008

Journal of Algorithms & Computational Technology

View full text Add to dashboard Cite

In this paper we analyze the existing defects of hierarchical and nonhierarchical path finding algorithm respectively in detail and present a hierarchical path finding algorithm based on the heuristic directing search approach which is used for promoting the nodes of lower level to higher level in the road network. The improved heuristic-hierarchical path finding algorithm was tested on road network of Xi'an city with a two-level hierarchy. The experimental results show that the heuristic based hierarchical path finding algorithm has been found to be over 25 times faster than the Dijkstra's algorithm and the ratio of the highest level road obtained by heuristic based hierarchical path finding algorithm is twice as much as the Dijkstra's algorithm. This means that the hierarchical path finding algorithm is suitable for the status of long-distance between origin and destination (O-D). We also propose a novel yet simple path finding strategy based on a threshold, that is, if the distance of O-D is less than the threshold which was obtained by means of statistical analysis the nonhierarchical path finding algorithm will be used, otherwise we use hierarchical path finding algorithm to find a near-optimal or satisfactory path in city road network. The testing results of Xi'an city road network show that the roads which were found out using this new path finding strategy are easy to be adopted by drivers.

show abstract

“…In an attempt to combine quadtree technique and graphs, Autere (2002) created multiresolution maps, replacing the multisize grids of quadtrees by a graph representation. Two types of edges were used, one connecting neighbouring key places at the same resolution and another connecting configurations of different resolutions.…”

Section: Background and Related Workmentioning

confidence: 99%

Full Issue in PDF / Numéro complet enform PDF

2008

Canadian Journal of Remote Sensing

View full text Add to dashboard Cite

Hierarchical A∗ based path planning — a case study

Cited by 18 publications

References 10 publications

Limited-Damage A*: A path search algorithm that considers damage as a feasibility criterion

Limited-Damage A*: A path search algorithm that considers damage as a feasibility criterion

Study on Near-Optimal Path Finding Strategies in a Road Network

Full Issue in PDF / Numéro complet enform PDF

Contact Info

Product

Resources

About