Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat
Cited by 287

The DOI matches its Crossref record; 58 of the 58 references it cites were found in a registry or an index.

Red-billed blue magpie optimizer: a novel metaheuristic algorithm for 2D/3D UAV path planning and engineering design problems

Open access
Fu, Shengwei, Li, Ke, Huang, Haisong, Ma, Chi, Fan, Qingsong, Zhu, Yunwei · 2024 · Artificial Intelligence Review

Abstract

Numerical optimization, Unmanned Aerial Vehicle (UAV) path planning, and engineering design problems are fundamental to the development of artificial intelligence. Traditional methods show limitations in dealing with these complex nonlinear models. To address these challenges, the swarm intelligence algorithm is introduced as a metaheuristic method and effectively implemented. However, existing technology exhibits drawbacks such as slow convergence speed, low precision, and poor robustness. In this paper, we propose a novel metaheuristic approach called the Red-billed Blue Magpie Optimizer (RBMO), inspired by the cooperative and efficient predation behaviors of red-billed blue magpies. The mathematical model of RBMO was established by simulating the searching, chasing, attacking prey, and food storage behaviors of the red-billed blue magpie. To demonstrate RBMO’s performance, we first conduct qualitative analyses through convergence behavior experiments. Next, RBMO’s numerical optimization capabilities are substantiated using CEC2014 (Dim = 10, 30, 50, and 100) and CEC2017 (Dim = 10, 30, 50, and 100) suites, consistently achieving the best Friedman mean rank. In UAV path planning applications (two-dimensional and three − dimensional), RBMO obtains preferable solutions, demonstrating its effectiveness in solving NP-hard problems. Additionally, in five engineering design problems, RBMO consistently yields the minimum cost, showcasing its advantage in practical problem-solving. We compare our experimental results with three categories of widely recognized algorithms: (1) advanced variants, (2) recently proposed algorithms, and (3) high-performance optimizers, including CEC winners.

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1007/s10462-024-10716-3

Cites

58 of 58 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

2 retracted

Metadata

Authors
Fu, S., Li, K., Huang, H., Ma, C., Fan, Q., & Zhu, Y.
Venue
Artificial Intelligence Review
Published
2024-05-03
Volume
57
Issue
6
ISSN
  • 0269-2821 (ISSN-L)
  • 1573-7462
OpenAlex
W4396623743
Cited by
287
References
58
FWCI
42.71
Type
journal article
Language
en
Open access
hybrid

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.