Name
Abstract | ||
|---|---|---|
In this paper, we consider the task allocation models, in which we seek to assign a set of m unmanned aerial vehicles (UAVs) to a set of n tasks in an optimal way. The optimality is quantified using target scores. This problem is NP-hard. To solve it, we propose an approach based on the Cross-Entropy (CE) method. The computational experiments in the large scale setting show the efficiency of our approach. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1109/RIVF.2010.5633032 | Computing and Communication Technologies, Research, Innovation, and Vision for the Future |
Keywords | DocType | ISBN |
monte carlo methods,aircraft,computational complexity,integer programming,nonlinear programming,remotely operated vehicles,np-hard problem,cross entropy method,nonlinear uav task assignment problem,task allocation model,unmanned aerial vehicles,optimization,stochastic processes,np hard problem,cross entropy,resource management,computer experiment,convergence,computational modeling,programming | Conference | 978-1-4244-8074-6 |
Citations | PageRank | References |
0 | 0.34 | 2 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Duc Manh Nguyen | 1 | 17 | 4.24 |
| Le Thi Hoai An | 2 | 1038 | 80.20 |
| Pham Dinh Tao | 3 | 1340 | 104.84 |