UAV Relay Point Sampling for Low-Delay Target Tracking
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current UAV path planning methods for tracking moving targets are complex and suffer from significant delays due to the need for continuous recalculation of paths based on real-time target locations, making them inefficient.
Innovation Solution
A relay point generation method for UAVs that predicts the target's state at the next moment, establishes a search range, samples location points within this range, and determines a relay point based on scoring criteria to simplify path planning and reduce delay.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Measurement precision
If continuous path planning is performed based on real-time target location, then tracking accuracy is maintained, but algorithm complexity and processing delay increase significantly
Solution Approach 1:
The patent segments the continuous path planning problem into discrete relay point selection. Instead of planning the entire path continuously, the system divides the search space into grid cells and selects relay points at grid intersections, transforming a complex continuous optimization problem into a simpler discrete selection problem that maintains tracking accuracy while reducing computational burden
Solution Approach 2:
The patent performs preliminary actions by pre-dividing the search space into grid cells and pre-identifying potential relay points at grid intersections before actual path planning is needed. This preprocessing creates a structured framework that simplifies real-time decision-making, allowing the UAV to quickly select relay points based on current target position without performing complex continuous path planning
2Measurement precision
If continuous path planning is performed based on real-time target location, then tracking accuracy is maintained, but processing delay increases
Solution Approach 1:
By segmenting the path into discrete relay point selections rather than continuous planning, the system reduces computation time. The grid-based approach with relay points at intersections allows for rapid evaluation of candidate points based on simple geometric criteria, significantly reducing processing delay while maintaining adequate tracking accuracy
Solution Approach 2:
The patent applies partial action by selecting only the most critical relay points (e.g., at grid intersections or key waypoints) rather than optimizing every segment of the path. This selective approach performs sufficient path planning to maintain tracking accuracy without the excessive computation required for complete continuous path optimization, thereby reducing processing delay
3Device complexity
If relay point selection uses grid-based sampling, then algorithm complexity is reduced, but path precision may be compromised
Solution Approach 1:
The patent applies local quality by concentrating relay points at grid intersections within the search range, creating higher density sampling where the UAV needs to make precise directional changes. The grid structure provides sufficient local precision at critical points while maintaining overall algorithm simplicity, balancing path precision requirements with computational efficiency
Data Source
AI summary
A relay point generation method includes: predicting a state of a target at a next moment; establishing a search range around the target according to the state of the target at the next moment; performing sampling within the search range, to obtain at least two location sampling points; and determining a relay point of the UAV at the next moment according to the state of the target at the next moment and the at least two location sampling points.