2018
DOI: 10.33440/j.ijpaa.20180101.0008
|View full text |Cite
|
Sign up to set email alerts
|

Application of distributed auction to multi-UAV task assignment in agriculture

Abstract: This paper addresses the multiple farming task assignment for agricultural UAVs by presenting a decentralized auction algorithm, where computation and information are distributed among multiple parallel processing units (UAVs). The scheme iterates between bundle construction phase and two conflict resolution phases, and then converges to a task allocation and route plan simultaneously. In the bundle construction stage, each UAV groups the tasks with commonalities by considering its own capacities of flight end… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
14
0

Year Published

2020
2020
2023
2023

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 14 publications
(14 citation statements)
references
References 14 publications
0
14
0
Order By: Relevance
“…Theorem 1. Consider a multi-UAV system with n vehicles whose motion are modelled as (10). Under Assumptions 2-5, the distributed control law (16) (or (17) for bounded inputs) along with the algorithm in S1-S4 solves the 3D barrier coverage problem defined in Problem 1.…”
Section: Assumption 4 the Voronoi Neighbours Of Pbmentioning
confidence: 99%
See 2 more Smart Citations
“…Theorem 1. Consider a multi-UAV system with n vehicles whose motion are modelled as (10). Under Assumptions 2-5, the distributed control law (16) (or (17) for bounded inputs) along with the algorithm in S1-S4 solves the 3D barrier coverage problem defined in Problem 1.…”
Section: Assumption 4 the Voronoi Neighbours Of Pbmentioning
confidence: 99%
“…Theorem 2. Consider a multi-UAV system of size n where each vehicle's motion model is represented by (10). The control law (16) along with the algorithm in S1-S4 defined for a sweeping region F (t) whose dynamics is governed by (25) solves the 3D sweeping coverage problem defined in Problem 2 under Assumptions 2-6 and the condition (26).…”
Section: Sweep Coverage Control Designmentioning
confidence: 99%
See 1 more Smart Citation
“…For example, Kim et al [12] propose a resource-oriented, distributed auction algorithm, which considers multiple resources of the agents and limited communication range. In [25], it uses a distributed auction algorithm to handle the task assignment problem while taking path planning into account. Because of using a well constructive distributed auction algorithm, the method in literature [26] can provide desirable assignment results in the constraint of limited resources and deadlines.…”
Section: Introductionmentioning
confidence: 99%
“…When huge dimension fields have to be covered in an agricultural mission, using a fleet of vehicles can be a solution so as to reduce the total time required to complete the mission, and therefore, obtain more homogeneous images due to possible changes in light [21][22][23][24][25][26].…”
mentioning
confidence: 99%