Effect of metrics on A based algorithms performance

The subject of the paper is to analyze the possibilities of A* based algorithms performance regarding to the metric used to calculate the distances between two objects. The following algorithms have been selected: A*, IDA* (Iterative-Deepening A*) a SMA* (Simplified Memory-Bounded A*). Experimentall...

Full description

Saved in:
Bibliographic Details
Published inAIP conference proceedings Vol. 1978; no. 1
Main Author Volna, Eva
Format Journal Article Conference Proceeding
LanguageEnglish
Published Melville American Institute of Physics 10.07.2018
Subjects
Algorithms
Shortest-path problems
Online AccessGet full text

Cover

More Information
Summary:The subject of the paper is to analyze the possibilities of A* based algorithms performance regarding to the metric used to calculate the distances between two objects. The following algorithms have been selected: A*, IDA* (Iterative-Deepening A*) a SMA* (Simplified Memory-Bounded A*). Experimentally, the ability of these algorithms was studied considering to find the shortest path to the target, their ability to deal effectively with obstacles and two tests were focused on testing the load and its influence on the algorithm run. Each of the tests was also aimed at comparing the influence of Euclidean and Manhattan distances, the selection of which in some cases had a major impact on the effectiveness of the algorithm. All achieved results were summarized in the conclusion.
Bibliography:ObjectType-Conference Proceeding-1
SourceType-Conference Papers & Proceedings-1
content type line 21
ISSN:0094-243X
1551-7616
DOI:10.1063/1.5043704