Market-Based Distributed Task Assignment of Multiple Unmanned Aerial Vehicles for Cooperative Timing Mission

Cited 1 time in webofscience Cited 0 time in scopus
  • Hit : 144
  • Download : 0
This paper introduces a new market-based distributed algorithm to solve a task assignment problem arising in missions using multiple unmanned aerial vehicles with timing coordination. The proposed algorithm is composed of four phases analogous to the activities of participants in a market. Analyses on the convergence and scalability of the proposed algorithm indicate that the algorithm has a polynomial-time complexity, which is verified through numerical experiments as well. The proposed algorithm is applied for a suppression of enemy air defenses mission with pop-up threats and loss of unmanned aerial vehicles. Numerical simulations demonstrate that the proposed algorithm operates in a robust way under a dynamic environment and can be potentially considered for actual cooperative timing missions for unmanned aerial vehicles.
Publisher
AMER INST AERONAUTICS ASTRONAUTICS
Issue Date
2017-11
Language
English
Article Type
Article
Keywords

COALITION-FORMATION; GENETIC ALGORITHMS; COORDINATION; ALLOCATION; CONSENSUS; NETWORKS; TARGET

Citation

JOURNAL OF AIRCRAFT, v.54, no.6, pp.2298 - 2310

ISSN
0021-8669
DOI
10.2514/1.C032984
URI
http://hdl.handle.net/10203/237181
Appears in Collection
AE-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 1 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0