ArticleScientific reports2025
Dynamic path planning of UAV with least inflection point based on adaptive neighborhood A* algorithm and multi-strategy fusion.
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.
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.
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.
Who cites it
6 citing papers in PubMed.
- Bio-Inspired Energy-Efficient Routing for Wireless Sensor Networks Based on Honeybee Foraging Behavior and MDP-Driven Adaptive Scheduling.Biomimetics (Basel, Switzerland) · 2026Article
- Research on UAV Path Planning Based on Enhanced Artificial Lemming Algorithm.Biomimetics (Basel, Switzerland) · 2026Article
- A Q-learning-based hybrid search algorithm integrating PRM and ACO for 3D UAV path planning.Scientific reports · 2026Article
- A New Ant Colony Optimization-Based Dynamic Path Planning and Energy Optimization Model in Wireless Sensor Networks for Mobile Sink by Using Mixed-Integer Linear Programming.Biomimetics (Basel, Switzerland) · 2026Article
- An improved roosters algorithm for constrained 3D UAV path planning in urban environments.Scientific reports · 2025Article
- Multi-objective optimization model for dynamic airspace allocation of urban drones in medical emergency delivery.Frontiers in public health · 2025Article
Corrections and comments
PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.
Authors and funding
5 authors.
Funding
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
Identifiers
What OpenQuestion holds
Registered trials
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.