返回
Motion planning of multiple unmanned vehicles using sequential convex programming-based distributed model predictive control
DOI:10.1002/rnc.7633.png)
摘要
En 中文
This article tackles the complex challenge of multi-vehicle motion planning by presenting the novel Sequential Convex Programming-based Distributed Model Predictive Control (SCP-DMPC) algorithm. Existing methods often struggle with the nonconvex nature of optimization in multi-vehicle motion planning, frequently compromising on computational efficiency. SCP-DMPC innovatively combines the predictive control of DMPC with the optimization prowess of SCP to address these issues efficiently, while adhering to both physical and operational constraints. To ensure precise attainment of target poses, a three-stage control strategy is introduced, with theoretical analysis on its recursive feasibility and asymptotic stability, enhancing the reliability of the algorithm. Moreover, a heuristic-based deadlock resolution scheme is devised to prevent vehicle stalling, a common issue in cooperative motion. Validated through simulations in challenging scenarios, including symmetric position swapping and obstacle-laden formation transition, SCP-DMPC demonstrates superior adaptability, precision, and efficiency. These results underscore its potential for robust, real-time unmanned vehicle applications, suggesting new directions for future research and development in the field.
Keyword:
collision avoidance
distributed model predictive control
multi-vehicle motion planning
sequential convex programming
期刊
IF:
3.2
论文数:
7.0K
被引数:
1.4W
机构
引用论文
Does it take older adults longer than younger adults to perceptually segregate a speech target from a background masker?在感知上将语音目标与背景掩蔽器隔离开来是否需要老年人比年轻人更长的时间?
Model-Predictive-Control-Based Path Tracking Controller of Autonomous Vehicle Considering Parametric Uncertainties and Velocity-Varying考虑参数不确定性和速度变化的基于模型预测控制的自主车辆路径跟踪控制器
Sequential Convex Programming Methods for Real-Time Optimal Trajectory Planning in Autonomous Vehicle Racing自动驾驶赛车实时最优轨迹规划的序贯凸规划方法

