Scholarlink

<p>Efficient navigation across complex maps is a critical challenge in domains such as GPS systems, robotics, and sustainable logistics. Optimal route planning plays a key role in minimizing resource consumption, reducing environmental impact, and improving overall navigation efficiency. This study evaluates and compares the A-Star and Dijkstra algorithms to determine the most effective approach for shortest path computation in map-based routing. Our analysis examines both algorithms under identical map configurations, considering computational complexity, memory usage, and execution time. The results indicate that A-Star generally outperforms Dijkstra’s algorithm in identifying the shortest and most efficient route. While Dijkstra’s algorithm guarantees optimality, it requires more memory and a higher number of iterations, making it less efficient in large-scale scenarios. Empirical findings reveal that the time complexity of Dijkstra’s algorithm is O(V²), completing in 0.22&#xa0;s, whereas A-Star achieves a faster execution time of 0.07&#xa0;s with a time complexity of O(E). Regarding space complexity, Dijkstra consumes O(V + E) memory, using 179,241 to 190,961 bytes, while A-Star requires less, at O(V), using 159,287 to 163,919 bytes. These insights provide a comparative framework for selecting the appropriate algorithm based on map characteristics and computational efficiency. Our findings contribute to the development of sustainable pathfinding solutions, facilitating energy-efficient transportation and logistics.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Exploring Algorithmic Efficiency of A-Star and Dijkstra for Optimal Route Planning in Green Transportation

  • 期刊论文

  • 发表日期：

    2025年5月16日

查看全文
  • A. M. Elshaer,
  • Rania A. Elmanfaloty,
  • Ehab Abou-Bakr,
  • Mahmoud Elrakaiby,
  • Khaled Saada

摘要

Efficient navigation across complex maps is a critical challenge in domains such as GPS systems, robotics, and sustainable logistics. Optimal route planning plays a key role in minimizing resource consumption, reducing environmental impact, and improving overall navigation efficiency. This study evaluates and compares the A-Star and Dijkstra algorithms to determine the most effective approach for shortest path computation in map-based routing. Our analysis examines both algorithms under identical map configurations, considering computational complexity, memory usage, and execution time. The results indicate that A-Star generally outperforms Dijkstra’s algorithm in identifying the shortest and most efficient route. While Dijkstra’s algorithm guarantees optimality, it requires more memory and a higher number of iterations, making it less efficient in large-scale scenarios. Empirical findings reveal that the time complexity of Dijkstra’s algorithm is O(V²), completing in 0.22 s, whereas A-Star achieves a faster execution time of 0.07 s with a time complexity of O(E). Regarding space complexity, Dijkstra consumes O(V + E) memory, using 179,241 to 190,961 bytes, while A-Star requires less, at O(V), using 159,287 to 163,919 bytes. These insights provide a comparative framework for selecting the appropriate algorithm based on map characteristics and computational efficiency. Our findings contribute to the development of sustainable pathfinding solutions, facilitating energy-efficient transportation and logistics.