系统仿真学报 ›› 2025, Vol. 37 ›› Issue (1): 134-144.doi: 10.16182/j.issn1004731x.joss.23-1026

• 论文 • 上一篇    

安全走廊约束的无人机轨迹序列凸优化方法

王祝1, 张振鹏1, 张梦通1, 徐广通2   

  1. 1.华北电力大学(保定) 自动化系,河北 保定 071003
    2.浙江大学 湖州研究院,浙江 湖州 313000
  • 收稿日期:2023-08-18 修回日期:2023-09-16 出版日期:2025-01-20 发布日期:2025-01-23
  • 第一作者简介:王祝(1991-),男,副教授,博士,研究方向为机器人运动规划与控制。
  • 基金资助:
    国家自然科学基金(61903033);中央高校基本科研业务费专项资金(2020MS116)

Sequential Convex Programming Using Safe Flight Corridor for Trajectory Planning of UAVs

Wang Zhu1, Zhang Zhenpeng1, Zhang Mengtong1, Xu Guangtong2   

  1. 1.Department of Automation, North China Electric Power University(Baoding), Baoding 071003, China
    2.Huzhou Institute, Zhejiang University, Huzhou 313000, China
  • Received:2023-08-18 Revised:2023-09-16 Online:2025-01-20 Published:2025-01-23

摘要:

针对无人机时间最优轨迹规划的序列凸优化方法存在初值敏感与收敛能力弱等不足,提出了一种基于安全飞行走廊约束的序列凸优化方法(safe flight corridor-sequential convex programming,SFC-SCP)通过前端路径规划获得避障路径,用以构建安全飞行走廊,即为每个轨迹点构建一个不含障碍的凸多边形安全区域,将非凸避障约束转换为线性不等式约束,以提高规划收敛能力。后端使用序列凸优化方法将安全走廊约束下的非线性轨迹优化问题转换为一系列凸规划子问题进行逐次求解,降低问题的复杂度。其中,轨迹优化的初始解基于前端规划的避障路径构建,以缓解局部优化算法的初值敏感问题。仿真对比结果表明SFC-SCP算法在规划成功率、计算时效性和飞行时间最优性等方面相比于SCP有较大提升。

关键词: 四旋翼, 轨迹规划, 安全飞行走廊, 序列凸优化, 时间最优轨迹

Abstract:

To address the issues of sensitivity to initial values and weak convergence of sequential convex programming(SCP) based time-optimal trajectory planning for UAVs, a SCP method using safety flight corridor, denoted as SFC-SCP(safe flight corridor-sequential convex programming) is proposed. According to the obstacle avoidance path obtained from the front-end path planning, a safe flight corridor is constructed by forming a convex polygon safe flight area without obstacles for each trajectory point. The non-convex obstacle avoidance constraint is converted into linear inequality constraints to improve convergence ability. The rear-end SCP method is used to transform the nonlinear trajectory optimization problem under the safety corridor constraint into a series of convex sub-problems for successive solutions, reducing the complexity of the problem. Among SCP iteration, the initial solution of trajectory optimization is constructed based on the obstacle avoidance path planned by the front-end to alleviate initial sensitivity of the local optimization algorithm. The simulation comparison results show that SFC-SCP algorithm has better performance than SCP in terms of planning success rate, computational efficiency, and flight time optimality.

Key words: quadrotor, trajectory planning, safe flight corridor(SFC), sequential convex programming(SCP), time optimal trajectory

中图分类号: