2015
DOI: 10.1155/2015/425356
|View full text |Cite
|
Sign up to set email alerts
|

Boolean Networks-Based Auction Algorithm for Task Assignment of Multiple UAVs

Abstract: This paper presents an application of Boolean networks-based auction algorithm (BNAA) for task assignment in unmanned aerial vehicles (UAVs) systems. Under reasonable assumptions, the assignment framework consists of mission control system, communication network, and ground control station. As the improved algorithm of consensus-based bundle algorithm (CBBA), the BNAA utilizes a cluster-based combinatorial auction policy to handle multiple tasks. Instead of empirical method based on look-up table about conditi… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2018
2018
2021
2021

Publication Types

Select...
2
2

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(2 citation statements)
references
References 22 publications
0
2
0
Order By: Relevance
“…Flight Distance between UCAV i and T j ( 1, 2, 3, 4; j = 1, 2, 3, 4) Sensor 1 Based on the normal distribution interval number theory, we first present the target information in Table 1 as normal distribution interval numbers by Equation 24, as shown in Table 4. Then we compute the corresponding criteria value matrix S (i,k) for each UCAV using Equations (10) and (11).…”
Section: Sensors Target Valuementioning
confidence: 99%
See 1 more Smart Citation
“…Flight Distance between UCAV i and T j ( 1, 2, 3, 4; j = 1, 2, 3, 4) Sensor 1 Based on the normal distribution interval number theory, we first present the target information in Table 1 as normal distribution interval numbers by Equation 24, as shown in Table 4. Then we compute the corresponding criteria value matrix S (i,k) for each UCAV using Equations (10) and (11).…”
Section: Sensors Target Valuementioning
confidence: 99%
“…They include the mixed integer linear programming (MILP) formulation [4][5][6], the branch and bound tree search algorithm [7,8], and the dynamic programming algorithm [9] among others. Most research to date on the application of heuristic (metaheuristic) algorithms have either extracted some specific search rules based on the properties of the problem to obtain optimal or suboptimal solutions rapidly or introduced some local search mechanism to the basic algorithm framework to improve the solution quality, such as tabu search algorithms [10], auction algorithms [11], genetic algorithms [12][13][14][15], ant colony algorithms [16], and particle swarm optimization [17,18]. The algorithms mentioned above-whether belonging to exact algorithms or heuristic (metaheuristic) algorithms-have demonstrated the ability to provide optimal or suboptimal solutions for task assignment problems of UAVs or UCAVs in various mission scenarios but may become difficult to apply when there are uncertain parameters related to mission scenarios.…”
Section: Introductionmentioning
confidence: 99%