2020
DOI: 10.1016/j.ins.2018.06.061
|View full text |Cite
|
Sign up to set email alerts
|

A multi-objective pigeon-inspired optimization approach to UAV distributed flocking among obstacles

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
32
0
2

Year Published

2020
2020
2022
2022

Publication Types

Select...
5
3

Relationship

1
7

Authors

Journals

citations
Cited by 121 publications
(38 citation statements)
references
References 28 publications
0
32
0
2
Order By: Relevance
“…and using (11) in (10) yields (17). In order to avoid the random loss of measurement in calculating the Kalman gain K which introduces more errors, the first moments instead of measurements is used to determine the Kalman gain.…”
Section: ) Variational Bayesian Measurement Updatementioning
confidence: 99%
See 1 more Smart Citation
“…and using (11) in (10) yields (17). In order to avoid the random loss of measurement in calculating the Kalman gain K which introduces more errors, the first moments instead of measurements is used to determine the Kalman gain.…”
Section: ) Variational Bayesian Measurement Updatementioning
confidence: 99%
“…11) in(10) yields, and the logarithm of () q  is renewed below:This work is licensed under a Creative Commons Attribution 4.0 License. For more information, see https://creativecommons.org/licenses/by/4.0/.…”
mentioning
confidence: 99%
“…The collision avoidance in work [21] is formulated as a set of linear quadratic optimization problems, which are solved with an original geometric based formulation. To handle flocking control with obstacle avoidance, work [22] proposes a UAV distributed flocking control algorithm based on the modified multi-objective pigeon-inspired optimization (MPIO), which considers both the hard constraints and the soft ones. Our previous works [23,24] formulate the conflict avoidance problem as a nonlinear optimization problem, and then use different methods to solve such an optimization problem.…”
Section: Literature Reviewmentioning
confidence: 99%
“…However, the basic PIO algorithm is easy to fall into the local optimal solution [ 3 ]. It is necessary to try to strengthen PIO’s global search capability [ 6 , 7 ]. The binary particle swarm optimization (BPSO) is developed by Kennedy and Eberhart [ 8 ] and used to optimize combinational problems.…”
Section: Introductionmentioning
confidence: 99%