Zhuo Zhou, Liyun Xu, Haoran Qin, Beikun Zhang, Gang Shang, Zhun Xu

A multi-AGV fast path planning method based on improved CBS algorithm in workshops

  • Mechanical Engineering
Save to CiteDrive Show PDF

Automatic guided vehicles (AGVs) are an important component of workshop logistics distribution systems. With the continuous increase in human cost, unmanned workshops are becoming increasingly popular, and an increasing number of AGVs are being applied to workshop logistics distribution systems. However, with the increasing number of AGVs in the workshop, planning a path quickly for each AGV is challenging, and the response time of multi-AGV fast path planning cannot meet actual requirements. To solve this problem, a multi-AGV fast path planning method based on an improved conflict-based search (ICBS) algorithm is proposed. First, the path planning problem is analyzed, and the environment expression, task, objective and constraint models are established. Subsequently, a two-layer ICBS algorithm is proposed to achieve fast path planning. At the bottom layer, an improved A* algorithm is adopted, and the selection strategy of the nodes is changed when multiple minimum values are equal. In the upper layer, the conflict number, conflict objective and conflict constraint sets are established. Three priority rules including Most Conflicts First (MCF) rule, Earliest Conflict First (ECF) rule, Single Search for Conflict Point (SSCP) rule are used. And a conflict elimination strategy is proposed. Finally, the superiority of the algorithm-solving is verified based on benchmark and actual workshop maps.

Need a simple solution for managing your BibTeX entries? Explore CiteDrive!

  • Web-based, modern reference management
  • Collaborate and share with fellow researchers
  • Integration with Overleaf
  • Comprehensive BibTeX/BibLaTeX support
  • Save articles and websites directly from your browser
  • Search for new articles from a database of tens of millions of references
Try out CiteDrive

More from our Archive