Optimal Path Planning for Multi-UAV Based on Pseudo-spectral Method

Jin Pengfei, Cui Yu, Wang Aihua, Hou Zhenqian, Wang Yichong

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

1 Citation (Scopus)

Abstract

The quadrotor has a dynamics with strong nonlinearity, and path planning for quadrotors in obstacle environment will be a complex multi-constraint optimization problem. Based on the pseudo-spectral method, this paper transforms the optimal control problem with complex constraints into a nonlinear programming problem. To improve solving efficiency, the distributed solution is adopted, and the Nash optimal coordination strategy is adopted to ensure the optimality of the whole system. The simulation results show that this method can complete the optimal path planning for quadrotors formation under complex multi-constraint conditions.

Original languageEnglish
Title of host publicationProceedings - 2020 International Conference on Big Data, Artificial Intelligence and Internet of Things Engineering, ICBAIE 2020
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages417-422
Number of pages6
ISBN (Electronic)9781728164991
DOIs
Publication statusPublished - Jun 2020
Externally publishedYes
Event2020 International Conference on Big Data, Artificial Intelligence and Internet of Things Engineering, ICBAIE 2020 - Virtual, Fuzhou, China
Duration: 12 Jun 202014 Jun 2020

Publication series

NameProceedings - 2020 International Conference on Big Data, Artificial Intelligence and Internet of Things Engineering, ICBAIE 2020

Conference

Conference2020 International Conference on Big Data, Artificial Intelligence and Internet of Things Engineering, ICBAIE 2020
Country/TerritoryChina
CityVirtual, Fuzhou
Period12/06/2014/06/20

Keywords

  • Nash optimality
  • path planning
  • pseudo-spectral method
  • quadrotor

Fingerprint

Dive into the research topics of 'Optimal Path Planning for Multi-UAV Based on Pseudo-spectral Method'. Together they form a unique fingerprint.

Cite this