Scheduling and sequence reshuffle for autonomous aerial refueling of multiple UAVs
- Creators
- Jin, Zhipu
- Shima, Tal
- Schumacher, Corey J.
Abstract
In this paper, we formulate the autonomous aerial refueling of multiple unmanned aerial vehicles (UAVs) as a scheduling problem. In order to find the optimal refueling sequence of UAVs, an efficient dynamic programming algorithm is introduced. When UAVs leave or join the queue, the optimal sequence needs to be recalculated. A systematic reshuffling method is developed such that the UAV sequence can be reconfigured by using the least amount of shuffle steps, where only one UAV changes its position in each step. By introducing a metric over UAV sequences, this reconfiguration effort is quantified and is treated as an additional cost which can be integrated into the dynamic programming algorithm.
Additional Information
© 2006 IEEE. This work was supported by the Air Force Office of Scientific Research. The authors would like to thank Prof. Kevin Passino from The Ohio State University for helpful discussions.Attached Files
Published - Jin2006p95362009_American_Control_Conference_Vols_1-9.pdf
Files
Name | Size | Download all |
---|---|---|
md5:faf442f22a285040c674fbab6e287d6c
|
317.0 kB | Preview Download |
Additional details
- Eprint ID
- 23481
- Resolver ID
- CaltechAUTHORS:20110427-131340083
- Air Force Office of Scientific Research (AFOSR)
- Created
-
2011-04-28Created from EPrint's datestamp field
- Updated
-
2021-11-09Created from EPrint's last_modified field
- Series Name
- Proceedings of the American Control Conference
- Other Numbering System Name
- INSPEC Accession Number
- Other Numbering System Identifier
- 9046849