A Robust Multi-AGV Cooperative Path Planning Method Considering Spatiotemporal Distance

With the widespread application of Automated Guided Vehicles (AGVs) in warehousing and logistics systems, the optimization of multi-AGV path planning has become a critical issue. Current methods primarily focus on minimizing operating time and energy consumption but often overlook spatiotemporal distances between paths, leading to frequent path conflicts and interferences in the system. This paper proposes a neural network based time window estimation model, designed to generate time windows that better align with dynamic environments. Based on this model, we introduce a collaborative multi-AGV path planning method that optimizes spatiotemporal distances between paths. Compared to the Conflict-Based Search (CBS) method, this approach significantly improves the spatiotemporal distance between AGVs during task execution, enhancing the robustness of AGV clusters while only marginally increasing time costs.

Authors

Institutions

Publication Details

Published
2024-10-11
DOI
https://doi.org/10.1109/icceic64099.2024.10775744
Primary Topic
Robotic Path Planning Algorithms
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A Robust Multi-AGV Cooperative Path Planning Method Considering Spatiotemporal Distance

Mingchang Lian, Songhang Chen, Maolin Chen
Robotic Path Planning Algorithms
article

A Robust Multi-AGV Cooperative Path Planning Method Considering Spatiotemporal Distance

Mingchang Lian, Songhang Chen, Maolin Chen
article en

Abstract

With the widespread application of Automated Guided Vehicles (AGVs) in warehousing and logistics systems, the optimization of multi-AGV path planning has become a critical issue. Current methods primarily focus on minimizing operating time and energy consumption but often overlook spatiotemporal distances between paths, leading to frequent path conflicts and interferences in the system. This paper proposes a neural network based time window estimation model, designed to generate time windows that better align with dynamic environments. Based on this model, we introduce a collaborative multi-AGV path planning method that optimizes spatiotemporal distances between paths. Compared to the Conflict-Based Search (CBS) method, this approach significantly improves the spatiotemporal distance between AGVs during task execution, enhancing the robustness of AGV clusters while only marginally increasing time costs.

Chinese Academy of Sciences (CN), Fujian Institute of Research on the Structure of Matter (CN), Fuzhou University (CN)
Openalex Percentile: Top 77%
Robotic Path Planning Algorithms
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

A Robust Multi-AGV Cooperative Path Planning Method Considering Spatiotemporal Distance — Mingchang Lian, Songhang Chen, et al. · (2024) | TGRS Research Map | TGRS