Path Planning Methods for Four-Way Shuttles in Dynamic Environments Based on A* and CBS Algorithms

Jiansha Lu (), Qihao Jin, Jun Yuan, Jianping Ma, Jin Qi and Yiping Shao
Additional contact information
Jiansha Lu: School of Mechanical Engineering, Zhejiang University of Technology, Hangzhou 310023, China
Qihao Jin: School of Mechanical Engineering, Zhejiang University of Technology, Hangzhou 310023, China
Jun Yuan: Zhongce Rubber Group Co., Ltd., Hangzhou 310018, China
Jianping Ma: Zhongce Rubber Group Co., Ltd., Hangzhou 310018, China
Jin Qi: Zhongce Rubber Group Co., Ltd., Hangzhou 310018, China
Yiping Shao: School of Mechanical Engineering, Zhejiang University of Technology, Hangzhou 310023, China

Mathematics, 2025, vol. 13, issue 10, 1-28

Abstract: In the four-way shuttle system, the efficiency of path planning directly affects the overall effectiveness of logistics and warehousing operations. Traditional path planning methods for multiple four-way shuttles do not take into account the fact that the map status will change as the inbound and outbound tasks are completed. To address this issue, a path planning algorithm for dynamic environments based on an improved Conflict-Based Search (CBS) mechanism is proposed. Firstly, by introducing turning constraints and a node expansion strategy, the A* algorithm is improved, reducing the number of turns and optimizing the node expansion process. Secondly, based on the improved A* algorithm, a path planning algorithm for dynamic environments based on CBS is designed. This algorithm adopts the inbound/outbound task priority strategy and the nearby-task priority strategy to resolve conflicts. It effectively manages the changes in the map status by establishing and maintaining a “ChangeList” and revises the path set of the four-way shuttles. Based on the layout of the intelligent vertical warehouse with four-way shuttles of a certain enterprise, simulation experiments were carried out using a rasterized map. The algorithm was compared with the DCBS-PFM and RRT-A algorithms, verifying the effectiveness and superiority of the algorithm.

Keywords: four-way shuttle; path planning; A* algorithm; CBS algorithm (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2025
References: Add references at CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/2227-7390/13/10/1588/pdf (application/pdf)
https://www.mdpi.com/2227-7390/13/10/1588/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jmathe:v:13:y:2025:i:10:p:1588-:d:1654014

Access Statistics for this article

Mathematics is currently edited by Ms. Emma He

More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().