Market-Based Task Assignment for Cooperative Timing Missions in Dynamic Environments

Cited 4 time in webofscience Cited 0 time in scopus
  • Hit : 323
  • Download : 0
New market-based decentralized algorithms are proposed for the task assignment of multiple unmanned aerial vehicles in dynamic environments with a limited communication range. In particular, a cooperative timing mission that cannot be performed by a single vehicle is considered. The baseline algorithms for a connected network are extended to deal with time-varying network topology including isolated subnetworks due to a limited communication range. The mathematical convergence and scalability analyses show that the proposed algorithms have a polynomial time complexity, and numerical simulation results support the scalability of the proposed algorithm in terms of the runtime and communication burden. The performance of the proposed algorithms is demonstrated via Monte Carlo simulations for the scenario of the suppression of enemy air defenses.
Publisher
SPRINGER
Issue Date
2017-07
Language
English
Article Type
Article
Keywords

COALITION-FORMATION; MULTIROBOT COORDINATION; ALLOCATION; ALGORITHMS; TARGET

Citation

JOURNAL OF INTELLIGENT ROBOTIC SYSTEMS, v.87, no.1, pp.97 - 123

ISSN
0921-0296
DOI
10.1007/s10846-017-0493-x
URI
http://hdl.handle.net/10203/224045
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 4 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0