Skip to main navigation Skip to search Skip to main content

Periodic re-optimization based dynamic branch and price algorithm for dynamic multi-UAV path planning

  • Ke Shang
  • , Stephen Karungaru
  • , Zuren Feng
  • , Liangjun Ke
  • , Kenji Terada
  • Xi'an Jiaotong University
  • Tokushima University

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

4 Scopus citations

Abstract

In this paper, a dynamic branch and price algorithm with a periodic re-optimization framework is proposed to solve the dynamic Multi-UAV path planning problem. By partitioning the planning horizon into a series of time slices, the dynamic problem is transformed into a series of static problems. We then use the adjusted branch and price algorithm to solve each static problem. The prominent characteristic of this algorithm is to improve the solving efficiency at each time slice by succeeding and adjusting the columns from the last time slice. According to the experimental results, the proposed dynamic branch and price algorithm with a periodic re-optimization framework can solve the test instances effectively.

Original languageEnglish
Title of host publication2013 IEEE International Conference on Mechatronics and Automation, IEEE ICMA 2013
Pages581-586
Number of pages6
DOIs
StatePublished - 2013
Event2013 10th IEEE International Conference on Mechatronics and Automation, IEEE ICMA 2013 - Takamastu, Japan
Duration: 4 Aug 2013 → 7 Aug 2013

Publication series

Name2013 IEEE International Conference on Mechatronics and Automation, IEEE ICMA 2013

Conference

Conference2013 10th IEEE International Conference on Mechatronics and Automation, IEEE ICMA 2013
Country/TerritoryJapan
CityTakamastu
Period4/08/13 → 7/08/13

Keywords

  • Branch and price
  • Column generation
  • Dynamic Multi-UAV path planning
  • Periodic re-optimization

Fingerprint

Dive into the research topics of 'Periodic re-optimization based dynamic branch and price algorithm for dynamic multi-UAV path planning'. Together they form a unique fingerprint.

Cite this