Mutli-robot path optimization based on DMPC

Mobile robot path planning refers to the design of the safely collision-free path with shortest distance and least time-consuming from the starting point to the end point by a mobile robot autonomously. At the application of multi-robot pattern formation, when the robot performs path planning in order to reach the target point, there are problems such as many iterations of the algorithm, large errors between the robot and the target point, long paths, and so on. To address these issues, this paper proposes an obstacle avoidance algorithm based on distributed model predictive control (DMPC). This model chooses acceleration as the input of the model, and establishes different constraints and objective functions depending on whether the robot detects other robots or obstacles. Optimal control is performed by optimizing the objective function to obtain the current optimal input. Finally, the effectiveness of the algorithm in this paper is verified by ex periments, and the results are compared with the Optimal Reciprocal Collision Avoidance (ORCA) algorithm, which shows the advantages of the algorithm in this chapter.

Authors

Institutions

Publication Details

Journal
IET conference proceedings.
Published
2024-11-01
DOI
https://doi.org/10.1049/icp.2024.3710
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

Mutli-robot path optimization based on DMPC

Peng Zhao, Jingmin Xin, Fang Zhang, Meng Duan
IET conference proceedings.
Robotic Path Planning Algorithms
article

Mutli-robot path optimization based on DMPC

Peng Zhao, Jingmin Xin, Fang Zhang, Meng Duan
article en

Abstract

Mobile robot path planning refers to the design of the safely collision-free path with shortest distance and least time-consuming from the starting point to the end point by a mobile robot autonomously. At the application of multi-robot pattern formation, when the robot performs path planning in order to reach the target point, there are problems such as many iterations of the algorithm, large errors between the robot and the target point, long paths, and so on. To address these issues, this paper proposes an obstacle avoidance algorithm based on distributed model predictive control (DMPC). This model chooses acceleration as the input of the model, and establishes different constraints and objective functions depending on whether the robot detects other robots or obstacles. Optimal control is performed by optimizing the objective function to obtain the current optimal input. Finally, the effectiveness of the algorithm in this paper is verified by ex periments, and the results are compared with the Optimal Reciprocal Collision Avoidance (ORCA) algorithm, which shows the advantages of the algorithm in this chapter.

IET conference proceedings.Vol. 2023(49)
Zhengzhou 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.