Online trajectory optimization based on successive convex optimization

Chaoyue Liu, Cheng Zhang*, Huan Jiang, Fenfen Xiong

*Corresponding author for this work

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

5 Citations (Scopus)

Abstract

The traditional trajectory optimization methods are often difficult to achieve the rapid requirements of online planning. Therefore, the convex optimization method is applied to trajectory optimization of a missile to reduce the computational cost in this paper. With the convex optimization theory, the missile nonlinear motion model is firstly convexified based on the small perturbation linearization theory and then discretized using the Euler method, which is then solved by the successive convex optimization method. Simulation results show that the convex optimization technique can greatly reduce the computational time, while yields comparable optimal solutions compared to the well-known Gauss pseudospectral method.

Original languageEnglish
Title of host publicationProceedings of the 36th Chinese Control Conference, CCC 2017
EditorsTao Liu, Qianchuan Zhao
PublisherIEEE Computer Society
Pages2577-2582
Number of pages6
ISBN (Electronic)9789881563934
DOIs
Publication statusPublished - 7 Sept 2017
Event36th Chinese Control Conference, CCC 2017 - Dalian, China
Duration: 26 Jul 201728 Jul 2017

Publication series

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

Conference

Conference36th Chinese Control Conference, CCC 2017
Country/TerritoryChina
CityDalian
Period26/07/1728/07/17

Keywords

  • online
  • successive convex optimization
  • trajectory optimization

Fingerprint

Dive into the research topics of 'Online trajectory optimization based on successive convex optimization'. Together they form a unique fingerprint.

Cite this