PSO-based Optimal Task Allocation for Cooperative Timing Missions

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 298
  • Download : 0
An optimal task allocation algorithm based on Particle swarm optimization (PSO) is proposed for cooperative timing missions that require involvement of multiple agents. The optimal solution can be utilized in the centralized operation of multi-agent system as well as a benchmark solution of the decentralized task allocation algorithm. However, the optimal solution requires significant computations because this problem is known as NP-hard. Therefore, PSO-based approach can be an alternative because it can be used to obtain a near optimal solution with reduced computational load. In this study, the conventional PSO-based algorithm is modified by adopting graph theory. Numerical simulations are carried out to demonstrate the performance of the proposed algorithm.
Publisher
Elsevier B.V.
Issue Date
2016
Language
English
Citation

IFAC-PapersOnLine, v.49, no.17, pp.314 - 319

ISSN
2405-8963
DOI
10.1016/j.ifacol.2016.09.054
URI
http://hdl.handle.net/10203/222900
Appears in Collection
AE-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0