In EDS ansehen

Resource Welfare Based Task Allocation for UAV Team with Resource Constraints.

Gespeichert in:
Bibliographische Detailangaben
Titel: Resource Welfare Based Task Allocation for UAV Team with Resource Constraints.
Autoren: Kim, Min-Hyuk, Baik, Hyeoncheol, Lee, Seokcheon
Quelle: Journal of Intelligent & Robotic Systems; Mar2015, Vol. 77 Issue 3/4, p611-627, 17p
Abstract: This paper addresses a task allocation problem for a team of UAVs that cooperatively performs a search and attack mission in an unknown region. The UAVs are heterogeneous carrying different types and amounts of munition resources, and limited in communications and sensing capabilities. The environment is highly uncertain and dynamic where no prior information is available and dynamic events such as UAV failures unpredictably occur. The objective of the mission is to maximize total reward obtained by destroying targets within a given mission horizon. A group of UAVs may need to be formed to attack a target because individual UAVs may not have sufficient resources for the execution of attack tasks. Instantaneous task allocation approaches that seek for optimal solution for current tasks cannot effectively account for the unpredictability of future tasks in the uncertain dynamic environment. In this paper, we propose a distributed task allocation scheme based on resource welfare of which concept is adopted from economics. The approach we present enables the UAV team to effectively utilize resources by balancing resource depletions and consequently be capable of smoothly responding to dynamic events by retaining more UAVs available. Simulation experiments were conducted in various conditions to evaluate the performance of the proposed approach in comparison with the instantaneous task allocation method. The results show that our approach improves the performance by up to 29.3 % with respect to the instantaneous task allocation method. [ABSTRACT FROM AUTHOR]
Copyright of Journal of Intelligent & Robotic Systems is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Datenbank: Complementary Index
Beschreibung
Abstract:This paper addresses a task allocation problem for a team of UAVs that cooperatively performs a search and attack mission in an unknown region. The UAVs are heterogeneous carrying different types and amounts of munition resources, and limited in communications and sensing capabilities. The environment is highly uncertain and dynamic where no prior information is available and dynamic events such as UAV failures unpredictably occur. The objective of the mission is to maximize total reward obtained by destroying targets within a given mission horizon. A group of UAVs may need to be formed to attack a target because individual UAVs may not have sufficient resources for the execution of attack tasks. Instantaneous task allocation approaches that seek for optimal solution for current tasks cannot effectively account for the unpredictability of future tasks in the uncertain dynamic environment. In this paper, we propose a distributed task allocation scheme based on resource welfare of which concept is adopted from economics. The approach we present enables the UAV team to effectively utilize resources by balancing resource depletions and consequently be capable of smoothly responding to dynamic events by retaining more UAVs available. Simulation experiments were conducted in various conditions to evaluate the performance of the proposed approach in comparison with the instantaneous task allocation method. The results show that our approach improves the performance by up to 29.3 % with respect to the instantaneous task allocation method. [ABSTRACT FROM AUTHOR]
ISSN:09210296
DOI:10.1007/s10846-014-0088-8