Path Planning Based on Improved Bidirectional A * Algorithm

Le résumé fourni par la source

With the rapid expansion of warehouse scale, traditional path planning algorithms suffer from critical limitations in computational efficiency and path smoothness within complex dynamic environments. This work proposes an enhanced bidirectional A * algorithm integrating a discarded domain search strategy to dynamically optimize node expansion scope, effectively reducing computational redundancy by 20%. Combined with Gaussian filtering for eliminating sharp path discontinuities, the method significantly enhances operational stability. Experimental results demonstrate that compared to conventional bidirectional A * algorithms, the improved approach achieves a 20% reduction in path search time while substantially improving path smoothness. These findings provide an efficient and reliable solution for intelligent warehouse navigation systems. Future work will focus on implementing this methodology in dynamic environments and practical warehousing applications.

Ce résumé expose les affirmations des auteurs. BNTIC ne l’interprète pas comme une validation indépendante des résultats.