Skip to main content

ETHNOS_APP

Home • Search • Journals • List 0

Improved A* Navigation Path-Planning Algorithm Based on Hexagonal Grid

Bibliographic Data

ID22032536
AuthorsZehua An (Hohai University), Xiaoping Rui (0000-0002-7764-4272, Hohai University, corresponding author), Chaojie Gao (Hohai University)
Year2024
Volume13
Issue5
Pages166
Publication date2024-05-16
Open AccessYes
TypeARTICLE
VenueISPRS International Journal of Geo-Information (JOURNAL)
Journal identifiersISSN: 2220-9964 • E-ISSN: 2220-9964
PublisherMDPI AG (PUBLISHER • IT)
DOI10.3390/ijgi13050166
OpenAlexW4396952369
LanguageEN
Citations received1
References cited11

Navigation systems are extensively used in everyday life, but the conventional A* algorithm has several limitations in path planning applications within these systems, such as low degrees of freedom in path planning, inadequate consideration of the effects of special regions, and excessive nodes and turns. Addressing these limitations, an enhanced A* algorithm was proposed using regular hexagonal grid mapping. First, the approach to map modeling using hexagonal grids was described. Subsequently, the A* algorithm was refined by optimizing the calculation of movement costs, thus allowing the algorithm to integrate environmental data more effectively and flexibly adjust node costs while ensuring path optimality. A quantitative method was also introduced to assess map complexity and adaptive heuristics that decrease the number of traversed nodes and increase the search speed. Moreover, a turning penalty measure was implemented to minimize unnecessary turns on the planned paths. Simulation results confirmed that the improved A* algorithm exhibits superior performance, which can dynamically adjust movement costs, enhance search efficiency, reduce turns, improve overall path planning quality, and solve critical path planning issues in navigation systems, greatly aiding the development and design of these systems and making them better suited to meet modern navigation requirements

Algorithm · Any-angle path planning · Distributed computing · Grid · Heuristics · Hexagonal crystal system · Hexagonal tiling · Mathematical optimization · Motion planning · Shortest path problem · Computer Science · Data Management and Algorithms · Engineering · Mathematics · Robotic Path Planning Algorithms · Robotics and Sensor-Based Localization · Artificial Intelligence · Theoretical Computer Science

  • Adversarial Obstacle Placement with Spatial Point Processes for Optimal Path Disruption

    Open Access•Li Zhou, Elvan Ceyhan et al.•ISPRS International Journal of…•2025

  • A Formal Basis for the Heuristic Determination of Minimum Cost Paths

    Open Access•Peter Hart, Nils J Nilsson et al.•IEEE Transactions on Systems…•1968

Citations per year1
Citation span2025 - 2025 (1)
Highly citedNo

Tools

Open DOIOpen Access
Ethnos_APP • Open Source Project • MIT License • Frontend v2.0.0 • Privacy and Cookies • API Documentation: api.ethnos.app/docs • API Source Code: GitHub • DOI: 10.5281/zenodo.17049435 • Frontend Source Code: GitHub • DOI: 10.5281/zenodo.17050053 • cruz.rio.br • Expectantes Misericordiae