The True Shortest Path of Obstacle Grid Graph Is Solved by SGP Vertex Extraction and Filtering Algorithm

• Published in: Algorithms Vol. 18; no. 7; p. 400
• Main Authors: Zhang, Yijie, Chen, Jizhou
• Format: Journal Article
• Language: English
• Published: Basel MDPI AG 01.07.2025
• Subjects: Algorithms; Analysis; Barriers; Filtration; Genetic algorithms; Heuristic; Heuristic methods; Nodes; obstacle grid map; Optimization; Shortest-path problems; the shortest grid path; the true shortest path; Traveling salesman problem
• ISSN: 1999-4893; 1999-4893
• DOI: 10.3390/a18070400

In the obstacle grid map, due to the limitations in search direction imposed by classical path algorithms and meta-heuristic algorithms, the shortest paths are not the true shortest paths (TSPs) but rather the shortest grid paths (SGPs). This paper introduces an SGP vertex extraction and filtering algorithm (SGPVEFA) that identifies key nodes within SGPs. After screening, these nodes yield TSPs under the same conditions. Through various experiments, the shortest path length searched by the SGPVEFA proposed in this paper can be used to search for the real shortest path, and it also has advantages in comparison with recent new algorithms. With the increase in map scale and obstacle rate, the advantages of this path algorithm are more significant.