Key points are not available for this paper at this time.
A multiple UAV search and attack mission involves searching for targets in an unknown region, followed by attack on the detected targets. An effective mission involves assigning the tasks to UAVs efficiently. Task allocation becomes difficult when the UAVs have limited range to detect the targets and neighbouring UAVs. The UAVs are also subject to limited communication range. With these constraints, allocating tasks efficiently to UAVs become difficult. In this paper, we propose a negotiation scheme that efficiently allocates tasks for multiple UAVs. The performance of the negotiation based task allocation is studied on a battle field scenario. We study the effect of sensor ranges on the task allocation and compare the results with that of greedy strategy and a variation of the negotiation mechanism. The results show that the negotiation based task allocation mechanism performs far better than the greedy strategy. Negotiation with target information exchange between neighbours performs better than without target information exchange, when the sensor radius is low.
Sujit et al. (Mon,) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: