Quad-Rotor Collision Avoidance via Sequential Convex Programming with Reference Correction

Tianhao Liu, Runqi Chai*, Senchun Chai

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

In this paper, the constrained trajectory optimization problem for quad-rotors is solved by a sequential convex programming-based method. The considered nonconvex problem is approximated by convex subproblems which are solved successively to generate the optimal trajectory efficiently. A reference correction strategy that utilizes the information contained in the previous solutions is proposed. Several solutions to convex subproblems are combined and their weights are optimized in the sense of minimizing the original objective. Such a method provides high-quality reference solutions for the following iterations. Numerical results showed that the proposed reference correction method generated a feasible trajectory that bypasses all the obstacles with faster convergence.

Original languageEnglish
Title of host publicationAdvances in Guidance, Navigation and Control - Proceedings of 2024 International Conference on Guidance, Navigation and Control Volume 13
EditorsLiang Yan, Haibin Duan, Yimin Deng
PublisherSpringer Science and Business Media Deutschland GmbH
Pages582-590
Number of pages9
ISBN (Print)9789819622474
DOIs
Publication statusPublished - 2025
EventInternational Conference on Guidance, Navigation and Control, ICGNC 2024 - Changsha, China
Duration: 9 Aug 202411 Aug 2024

Publication series

NameLecture Notes in Electrical Engineering
Volume1349 LNEE
ISSN (Print)1876-1100
ISSN (Electronic)1876-1119

Conference

ConferenceInternational Conference on Guidance, Navigation and Control, ICGNC 2024
Country/TerritoryChina
CityChangsha
Period9/08/2411/08/24

Keywords

  • Constrained optimization
  • Reference trajectory
  • Sequential convex programming

Fingerprint

Dive into the research topics of 'Quad-Rotor Collision Avoidance via Sequential Convex Programming with Reference Correction'. Together they form a unique fingerprint.

Cite this