Skip to main navigation Skip to search Skip to main content

UAV Path Planning with No-Fly-Zone Constraints by Convex Optimization

  • Xi Chen
  • , Zhe Lin
  • , Haiyan He
  • , Qinglei Hu
  • , Ruihao Cao
  • Beihang University
  • China Aerospace Science and Technology Corporation

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

Abstract

This paper presents a convex optimization methodology for an unmanned aerial vehicle (UAV) path planning problem with no-fly-zone (NFZ) constraints. The great challenge is to cast the original problem into a second-order cone programming (SOCP) frame. Since the original dynamic model of the UAV is nonlinear, a special transformation is applied to linearize the dynamic model. To make the problem tractable, this paper employs lossless convexification and relaxation. Then the L1 penalty method is introduced to ensure the feasibility of the transformed problem. The feasibility and effectiveness of the designed successive SOCP algorithm are demonstrated by numerical simulations.

Original languageEnglish
Title of host publicationProceedings of the 40th Chinese Control Conference, CCC 2021
EditorsChen Peng, Jian Sun
PublisherIEEE Computer Society
Pages7713-7717
Number of pages5
ISBN (Electronic)9789881563804
DOIs
StatePublished - 26 Jul 2021
Event40th Chinese Control Conference, CCC 2021 - Shanghai, China
Duration: 26 Jul 202128 Jul 2021

Publication series

NameChinese Control Conference, CCC
Volume2021-July
ISSN (Print)1934-1768
ISSN (Electronic)2161-2927

Conference

Conference40th Chinese Control Conference, CCC 2021
Country/TerritoryChina
CityShanghai
Period26/07/2128/07/21

Keywords

  • Convex Optimization
  • Path Planning
  • SOCP
  • UAV

Fingerprint

Dive into the research topics of 'UAV Path Planning with No-Fly-Zone Constraints by Convex Optimization'. Together they form a unique fingerprint.

Cite this