Best path in mountain environment based on parallel A algorithm and Apache Spark

Pathfinding problem has several applications in our life and widely used in virtual environments. It has different goals such as shortest path, secure path, or optimal path. Pathfinding problem deals with a large amount of data since it considers every point located in 2D or 3D scenes. The number of...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:The Journal of supercomputing Ročník 78; číslo 4; s. 5075 - 5094
Hlavní autoři: Alazzam, Hadeel, AbuAlghanam, Orieb, Sharieh, Ahmad
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York Springer US 01.03.2022
Springer Nature B.V
Témata:
ISSN:0920-8542, 1573-0484
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Pathfinding problem has several applications in our life and widely used in virtual environments. It has different goals such as shortest path, secure path, or optimal path. Pathfinding problem deals with a large amount of data since it considers every point located in 2D or 3D scenes. The number of possibilities in such a problem is huge. Moreover, it depends on determining standards of best path definition. In this paper, we introduce a parallel A* algorithm to find the optimal path using Apache Spark. The proposed algorithm is evaluated in terms of runtime, speedup, efficiency, and cost on a generated dataset with different sizes (small, medium, and large). The generated dataset considers real terrain challenges, such as the slope and obstacles. Hadoop Insight cluster provided by Azure has been used to run the application. The proposed algorithm reached a speedup up to 4.85 running on six worker nodes.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0920-8542
1573-0484
DOI:10.1007/s11227-021-04072-0