Evidence map›Paper›PMID 40075166›Full record

ArticleScientific reports2025

Dynamic path planning of UAV with least inflection point based on adaptive neighborhood A* algorithm and multi-strategy fusion.

Longyan Xu, Mao Xi, Ren Gao, Ziheng Ye, Zaihan He

Abstract read
In one paragraph

Article in Scientific reports, 2025. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 6 papers.

0numbers the graph read from it
0cells of the map it votes in
6citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

6 citing papers in PubMed.

  1. Article
  2. Article
  3. Article
  4. Article
  5. Article
  6. Article
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

5 authors.

Longyan XuSchool of Electrical & Information Engineering, Hubei University of Automotive Technology, Shiyan, 442002, China.
Mao XiSchool of Electrical & Information Engineering, Hubei University of Automotive Technology, Shiyan, 442002, China.
Ren GaoSchool of Electrical & Information Engineering, Hubei University of Automotive Technology, Shiyan, 442002, China. gaoren@huat.edu.cn.
Ziheng YeSchool of Electrical & Information Engineering, Hubei University of Automotive Technology, Shiyan, 442002, China.
Zaihan HeSchool of Electrical & Information Engineering, Hubei University of Automotive Technology, Shiyan, 442002, China.

Funding

Key R&D Plan Project of Hubei Provincial Department of Science and Technology 2022BEC008South-Central University for Nationalities Key Laboratory of Cyber-Physics Fusion Intelligent Computing, State Ethnic Affairs Commission Open Fund CPFIC202402
6 · The paper itself

Abstract

Planning a safe and efficient global path in a complex three-dimensional environment is a complex and challenging optimization task. Existing planning algorithms are faced with problems such as lengthy path, too many inflection points and insufficient dynamic obstacle avoidance performance. In order to solve these challenges, this paper proposes a dynamic obstacle avoidance algorithm (MSF-MTPO) with multi-strategy fusion to achieve the least inflection point path optimization. Initially, an adaptive extended neighborhood A* algorithm is designed, which dynamically adjusts the neighborhood extension range according to the distribution of obstacles around the current location, selecting the optimal travel direction and step size each time to reduce redundant paths and unnecessary extended nodes. Then, combined with the two-way search mechanism, starting from the original starting point and the end point, the opposite current node is searched as the target point, respectively, so as to reduce the number of search nodes and reduce the search time. In order to further improve the path efficiency, an inflection point trajectory correction method is designed to eliminate redundant inflection points on the premise of ensuring path safety. Fourthly, in order to solve the problem of path deviation or excessive softening caused by the limited path control points in existing smoothing methods, a local tangent circle smoothing method is proposed, which effectively improves the smoothness of the trajectory on the basis of retaining the superiority of the original path. Finally, the global optimization path is used as the guiding trajectory of artificial potential field method to avoid falling into local optimum and realize dynamic obstacle avoidance. In addition, the performance is compared with several advanced algorithms in different environments, and the MSF-MTPO algorithm has the lowest path cost in different complex scenarios, which proves the effectiveness and stability of MSF-MTPO in UAV 3D path planning.

Indexed as

A* algorithmArtificial potential field methodBidirectional searchExtended neighborhoodInflection point trajectory correctionTangential smoothing

Identifiers

PMID40075166
PMCPMC11903833

What OpenQuestion holds

Textmetadata
LicenceCC BY-NC-ND
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.