IEEE

Comparative Analysis of A*, Dijkstra’s, and Breadth-First Search Algorithms: Evaluating Complexity, Optimality, and Efficiency in Shortest Pathfinding

Abstract: This paper presents a comparative analysis of three widely used pathfinding algorithms: A*, Dijistra’s, and Breadth-First Search (BFS). We evaluate these algorithms based on their complexity ...
IEEE

Comparison of Channel Attention Mechanisms and Graph Attention Mechanisms Applied in Multi-Robot Path Planning Based on Graph Neural Networks

Abstract: Graph Neural Networks (GNNs) are applied to multi-robot path planning due to their advantages in learning communication strategies in decentralized multi-intelligence systems, and to ...