ArticleSensors (Basel, Switzerland)2025
Autonomous Mission Planning for Fixed-Wing Unmanned Aerial Vehicles in Multiscenario Reconnaissance.
Article in Sensors (Basel, Switzerland), 2025. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 1 paper.
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
1 citing paper in PubMed.
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
Before a fixed-wing UAV executes target tracking missions, it is essential to identify targets through reconnaissance mission areas using onboard payloads. This paper presents an autonomous mission planning method designed for such reconnaissance operations, enabling effective target identification prior to tracking. Existing planning methods primarily focus on flight performance, energy consumption, and obstacle avoidance, with less attention to integrating payload. Our proposed method emphasizes the combination of two key functions: flight path planning and payload mission planning. In terms of path planning, we introduce a method based on the Hierarchical Traveling Salesman Problem (HTSP), which utilizes the nearest neighbor algorithm to find the optimal visit sequence and entry points for area targets. When dealing with area targets containing no-fly zones, HTSP quickly calculates a set of waypoints required for coverage path planning (CPP) based on the Generalized Traveling Salesman Problem (GTSP), ensuring thorough and effective reconnaissance coverage. In terms of payload mission planning, our proposed method fully considers payload characteristics such as scan resolution, imaging width, and operating modes to generate predefined mission instruction sets. By meticulously analyzing payload constraints, we further optimized the path planning results, ensuring that each instruction meets the payload performance requirements. Finally, simulations validated the effectiveness and superiority of the proposed autonomous mission planning method in reconnaissance tasks.
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.