A complex area covering path planning method for variable speed fixed-wing unmanned aerial vehicle

By optimizing the path planning of fixed-wing UAVs using ox-plowing-style cell decomposition and integer linear programming models, the inefficiency and dynamic distortion caused by the constant speed assumption are solved, achieving efficient coverage and safe maneuverability in complex areas.

CN122590912BActive Publication Date: 2026-11-10DALIAN UNIV OF TECH
View PDF 4 Cites 0 Cited by

Patent Information

Application Number
CN202611088806.X
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2026-07-22
Publication Date
2026-11-10
Estimated Expiration
2046-07-22

AI Technical Summary

Technical Problem

Existing technologies for path planning of fixed-wing UAVs suffer from low operational efficiency due to constant speed assumptions and simplified environmental assumptions, as well as distortion in dynamic modeling caused by planning-control decoupling strategies. This makes it particularly difficult to improve overall operational efficiency in complex areas.

Method used

The region is decomposed into covering strips using the ox-plowing cell decomposition method, and a high-resolution risk potential field and velocity expansion state diagram are constructed. Combined with an integer linear programming model, the strip access order and variable velocity dynamics are optimized to generate a globally coupled optimized covering path.

Benefits of technology

It significantly improves operational efficiency in complex environments, ensures the dynamic feasibility and safety of the path, enables collision-free maneuvering under nonholonomic constraints, and shortens the total task time.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN122590912B_ABST
    Figure CN122590912B_ABST
Patent Text Reader

Abstract

The application belongs to the technical field of fixed-wing unmanned aerial vehicle coverage path planning, and discloses a complex area coverage path planning method for variable-speed fixed-wing unmanned aerial vehicles. A high-resolution risk potential field and a coverage strip are constructed according to a given two-dimensional map; a discrete sampling speed set is defined, a single coverage strip is abstracted into a plurality of independent state nodes according to different departure speeds, state transition edges are established between the nodes of different strips, and a speed state expansion graph is constructed; based on the minimum turning radius of the unmanned aerial vehicle and the acceleration / deceleration dynamics constraint, a global cost matrix containing state transition time and coverage operation time is calculated, and an integer linear programming model is constructed for solving. The method globally couples the risk avoidance, strip access sequence decision and in-strip variable-speed dynamics for optimization, minimizes the total operation time in the whole task cycle under the premise of ensuring obstacle avoidance safety and dynamics feasibility, and significantly improves the operation efficiency.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] This invention relates to the field of coverage path planning technology for fixed-wing unmanned aerial vehicles (UAVs), and more specifically to a coverage path planning method for complex areas for variable-speed fixed-wing UAVs. Background Technology

[0002] Coverage path planning is a core technology for fixed-wing UAVs performing tasks such as agricultural plant protection, maritime search and rescue, and topographic mapping. For this type of mobile platform constrained by nonholonomic dynamics, Durbins curves are typically used to plan smooth paths that satisfy minimum turning radius constraints. However, after review and analysis, existing technologies still have the following shortcomings: (1) Limitations of the constant speed assumption and simple coverage mode. Most existing path planning methods typically assume constant speed operation and an ideal operating environment (no no-fly zones or only considering boundaries). For example, although patent CN120161853B focuses on optimizing the turning paths between adjacent strips to reduce overlap and omissions, it still relies on sequential adjacent back-and-forth coverage and does not consider the efficiency improvement brought by skipping strip access. Another example is the literature (Li et al., "Fixed-Wing UAV Coverage Path Planning Based on TurningSpan Selection"), which introduces reinforcement learning algorithms to optimize the access order of strips and minimize path length. However, its model construction is usually based on an environment without no-fly zones and ignores the efficiency gains brought by the fixed-wing UAV through speed changes during the mission. The above technical solutions are all difficult to fully utilize the maneuverability of fixed-wing UAVs, resulting in a large room for compression of the total operation time in complex tasks.

[0003] (2) To overcome the limitations of constant speed models, some existing technologies have begun to explore variable speed motion planning. For example, patent CN116430855B introduces a variable speed mechanism, which effectively addresses issues such as curvature constraints and risk avoidance. However, in pursuing the maximization of global operational efficiency, this method still makes relatively idealistic assumptions for the speed planning of straight operational segments and has not fully covered its fine dynamic constraints. In real-world scenarios, especially in fragmented areas containing a large number of short strips, robots are often limited by their own acceleration limits and find it difficult to reach the preset ideal operational speed within a short distance. If this nonlinear time cost caused by the limited strip length is not incorporated into the optimization loop of global planning, there is still room for further improvement in global operational efficiency in actual execution.

[0004] In summary, existing technologies suffer from two main drawbacks: first, they often employ constant speeds and simplified environmental assumptions, making them unsuitable for efficient and safe operations; second, while some research has addressed variable speeds and risk avoidance, it has failed to achieve global coupling optimization of coverage sequence and motion state. This is precisely the key problem that this invention aims to solve. Summary of the Invention

[0005] This invention aims to address the low operational efficiency caused by constant speed assumptions and fixed coverage patterns in existing technologies, as well as the distortion in dynamic modeling resulting from planning-control decoupling strategies. It provides a coverage path planning method for variable-speed fixed-wing UAVs in complex areas. Considering the variable-speed fixed-wing UAV and the risk of no-fly zones, it constructs a global coupling optimization framework to jointly decide on the strip access order and variable-speed dynamic characteristics (especially the constrained acceleration process). This accurately calculates the actual operational cost in complex obstacle environments, thereby minimizing operational time and maximizing efficiency throughout the entire mission cycle while satisfying kinematic constraints.

[0006] The technical solution of the present invention is as follows: A method for coverage path planning in complex areas for variable-speed fixed-wing unmanned aerial vehicles, comprising the following steps: Step 1: Obtain a two-dimensional map of the area to be covered. Use the ox-plowing cell decomposition method to decompose the free area in the area to be covered into several coverage strips, which together with the airport strip outside the area to be covered constitute the entire strip set. Step 2: Map the two-dimensional map of the area to be covered into a high-resolution binary matrix and construct a high-resolution risk potential field based on the distance to the no-fly zone; Step 3: Define the discrete sampling velocity set of the fixed-wing UAV, abstract the strip into several state nodes according to the different velocities of leaving the strip, establish state transition edges between state nodes of different strips, and construct a velocity extension state graph. Step 4: Calculate the cost weight of the state transition connection between any two state nodes on different stripes in the speed expansion state graph, and filter feasible state transition connections in combination with security checks. Step 5: Based on all feasible state transition edges and their cost weights, construct an integer linear programming model with the goal of minimizing the total coverage cost, and set constraints to ensure the continuity and uniqueness of state transitions. Step 6: Solve the integer linear programming model to obtain the optimal strip traversal order and generate a full-coverage trajectory containing speed information.

[0007] Fixed-wing UAVs are subject to acceleration constraints; the initial position of a fixed-wing UAV is set at an airport outside the area to be covered.

[0008] The described ox-plowing-style cell decomposition method is a vertical decomposition, leaving a certain distance between the decomposed coverage strips and the no-fly zone to provide space for fixed-wing UAVs to turn; the width of the coverage strip is the field of view width of the fixed-wing UAV's sensor; the x-coordinates of the upper and lower endpoints of the coverage strip are both the x-coordinates of the center of the coverage strip, the y-coordinates of the upper endpoint are the y-coordinates of the upper boundary of the coverage strip, and the y-coordinates of the lower endpoint are the y-coordinates of the lower boundary of the coverage strip; the upper endpoint of the airport strip is the position where the fixed-wing UAV takes off and reaches its cruising altitude, and the lower endpoint is the position where the fixed-wing UAV ends its cruising and prepares to land; all coverage strips and airport strips constitute the complete strip set. Where N is the total number of stripes, and airport stripes are stripes. .

[0009] In step 2, the safe radius of the fixed-wing UAV is set, and the Euclidean distance from each point in the high-resolution binary matrix to the nearest no-fly zone is calculated. If the distance is less than the safe distance, it is determined to be a risk point; otherwise, it is a no-risk point, thus forming a high-resolution risk potential field.

[0010] In step 3, the minimum speed of the fixed-wing UAV is determined according to regulations. Maximum speed of fixed-wing drones The speed range is obtained. and carry out Uniform sampling; construct a signed set of discrete sampling velocities. Positive values ​​indicate the direction of the fixed-wing UAV from the lower end to the upper end of the strip, while negative values ​​indicate the direction of the fixed-wing UAV from the upper end to the lower end. Each strip is assigned a specific exit velocity based on its characteristics. Abstracted as There are 1 state node, each state node is defined as follows: This indicates that the fixed-wing drone is at its export speed. Leave the strip ; Construct a speed extension state diagram Node set The total number is Each strip Each node is different from all other stripes. Each node constructs a state transition connection edge. E Represents the set of state transition edges; state transition edges This indicates that the fixed-wing drone is at its export speed. Leave the strip Then, move directly to the strip. And ultimately at the export speed End coverage; For state nodes If the export speed Then the strip The exit point is the upper endpoint of the strip; if Then the strip The exit point is the lower end of the strip.

[0011] Airport strip have Each node sets the speed at which it leaves the airport strip. and the speed of entering the airport strip equal, Only at this speed are the state transition edge weights between the computer field strip state nodes and other strip state nodes effective.

[0012] For any two state nodes on different stripes and Its state transition connection is formed by stripes to strip Transfer paths and stripes The coverage path consists of the cost weights of the state transition edges. Defined as a strip to strip Transfer path cost and stripe Minimum sum of covered path costs; stripe entry speed With export speed Same sign; stripe The coverage path cost is, considering acceleration constraints, for stripes Entry speed Movement to strip Export speed The shortest path time is used, and if the path is kinematically unreachable, pruning is performed.

[0013] The transfer path is a calculation strip. Export speed to strip Entry speed The variable-speed Durbins path; the transition path cost is the shortest variable-speed Durbins path time under acceleration constraints; for a given two-state node... and strip export speed and strips export speed Determined; with the strip entry speed The only change is in the strips. to strip Transfer path cost and stripe The coverage cost changes; when calculating edge weights, all elements related to the strip are traversed. The exit speed is the same as the entry speed Obtain the state node and Minimum between The transfer path is sampled and subjected to high-resolution risk potential field detection. If a risk point exists, path pruning is performed. Transfer paths that pass the detection are considered feasible and are then transferred.

[0014] The variable-speed Dubins path is divided into two types: CSC and CCC. The fixed-wing UAV has a fixed speed in the curved section C and accelerates and decelerates in the straight section S.

[0015] The constraints of the integer linear programming model include: strip access uniqueness constraint, exit velocity consistency constraint, and subloop elimination constraint; the strip access uniqueness constraint ensures that each strip is visited exactly once and corresponds to a unique exit velocity; the exit velocity consistency constraint refers to the entry velocity of a strip... and at speed The end must begin with the strip. Starting at the same speed; the sub-loop elimination constraint is achieved by introducing an auxiliary sequence variable to represent the access order of each strip, in order to exclude independent sub-loops that are not connected to the main transfer path.

[0016] Compared with the prior art, the beneficial effects of the present invention are as follows: (1) Significantly improves the overall efficiency of coverage operations in complex environments. This invention breaks through the limitations of traditional methods that focus on minimizing single-step transfer costs or finding the shortest geometric path at a constant speed. By constructing a novel integer linear programming model, it no longer focuses solely on optimizing local transfer costs between adjacent strips, but instead considers each path decision from a global perspective throughout the entire task cycle, achieving global joint optimization of strip access order and intra-strip speed-changing strategies. In complex scenarios containing obstacles or irregular boundaries, compared with traditional fixed coverage or hierarchical planning methods, this invention effectively shortens the total task time while ensuring full coverage.

[0017] (2) The dynamic feasibility and safety of the planned path are guaranteed. Addressing the issue that existing variable-speed planning techniques easily overlook acceleration limitations in short strips, this invention embeds precise kinematic constraints into the integer linear programming model. This means that the method can predict, during the decision-making stage, that the robot is limited by maximum acceleration and deceleration and cannot reach its ideal speed within the short strip, thus automatically calculating the kinematically achievable time cost. This avoids the theoretically optimal but physically infeasible paths generated by existing techniques due to idealized assumptions, significantly improving the robustness and practical feasibility of path planning.

[0018] (3) Collision-free flexible maneuvering under nonholonomic constraints is achieved. This invention fully utilizes the difference in minimum turning radius of fixed-wing UAVs at different speeds. By introducing a state space with a speed dimension into the global planning, the UAV is allowed to reduce its turning radius by actively decelerating in narrow spaces or high-risk areas, thereby passing through narrow passages that cannot be traversed by traditional methods, or completing ground turns in a more compact manner. This not only expands the operational range of the UAV, but also reduces the ineffective detour distance caused by risk avoidance. Attached Figure Description

[0019] Figure 1 This is a schematic diagram showing the coverage of the method of the present invention in scenario 1; Figure 2 This is a schematic diagram of the coverage path of the P2RP method in patent CN116430855B in scenario 1; Figure 3 This is a schematic diagram of the coverage at a constant speed of 140m / s in Scene 1. Figure 4 This is a schematic diagram of the coverage at a constant speed of 170m / s in scenario 1. Figure 5 This is a comparison chart of the coverage time of the four strategies mentioned above in different scenarios. Detailed Implementation

[0020] As a specific embodiment, the specific steps of the method of the present invention are as follows: Step 1: Obtain a two-dimensional map of the area to be covered. Use the ox-plowing cell decomposition method to decompose the free area in the area to be covered into several coverage strips, which together with the airport strip outside the area to be covered constitute the entire strip set. Step 1.1: Input data; a two-dimensional map of a given area to be covered. The area is surrounded and contains a limited number of no-fly zones of known shape and location. The fixed-wing UAV performing the coverage mission is initially positioned at an airport outside the area to be covered, with its sensor field of view extending directly below the fuselage. Length is A rectangular area.

[0021] Step 1.2: Region Decomposition: Using an edge on the boundary of the area to be covered as a reference, orient it as the horizontal axis; draw a perpendicular line at one endpoint (or reference point) of this edge, and define the direction pointing into the interior of the area to be covered as the positive direction of the vertical axis, thus constructing a Cartesian coordinate system. The Biotic Digestion (BCD) method is used to scan the two-dimensional map of the area to be covered along the vertical axis. Identify continuous free regions and decompose them into coverage strips; airports are also abstracted as a strip, generating a set of strips: , in This represents the total number of stripes. The width of each coverage strip is the field of view of the fixed-wing UAV sensor. Its length depends on the boundaries of the area to be covered and the no-fly zone. For any strip... ( Define its endpoint geometric properties as follows: in, The x-coordinate of the strip center is... and ( ( ) represent the ordinates of the upper and lower endpoints of the strip, respectively. For airport strips... The upper endpoint is the position where the fixed-wing UAV takes off and reaches its cruising altitude, and the lower endpoint is the position where the fixed-wing UAV ends its cruising and prepares to land.

[0022] Step 2: Map the two-dimensional map of the area to be covered into a high-resolution binary matrix and construct a high-resolution risk potential field based on the distance to the no-fly zone; Step 2.1: Set the subdivision resolution , the two-dimensional map of the area to be covered Mapped to a high-resolution binary matrix .

[0023] Step 2.2: For high-resolution binary matrices Each point in Calculate its distance to the nearest no-fly zone Euclidean distance ,in p It is a point within the no-fly zone.

[0024] Step 2.3: Set the safe radius of the fixed-wing UAV Definition point Risk potential for: This formula ensures that fixed-wing drones maintain a safe distance from no-fly zones.

[0025] Step 3: Define the discrete sampling velocity set of the fixed-wing UAV, abstract the strip into several state nodes according to the different velocities of leaving the strip, establish state transition edges between state nodes of different strips, and construct a velocity extension state graph. Step 3.1: Fixed-wing UAVs can move at varying speeds; define the speed range. By uniformly sampling the velocity, a discrete velocity set is obtained: in, It is the number of samples.

[0026] Step 3.2: To embed the coverage direction in the integer linear programming model, construct a set of signed discrete sampling velocities: in, Indicates stripe export speed, Indicates stripe The ingress speed. For , Indicates whether a fixed-wing drone enters or leaves the strip. The direction of movement is from the lower endpoint to the upper endpoint; Indicates whether a fixed-wing drone enters or leaves the strip. The direction of movement is from the upper endpoint to the lower endpoint.

[0027] Step 3.3: According to the exit speed type of the strip, the strip... Abstracted as There are 1 state node, each node is defined as follows: ,in, Indicates the export speed of fixed-wing UAVs Leave the strip Construction graph Node set The total number is Each strip Each node is different from all other stripes. Each node constructs a state transition edge. A state transition edge is defined as follows: ( ), indicating the fixed-wing UAV at export speed Leave the strip Then, move directly to the strip. And ultimately at the export speed Coverage terminated. Airport strip. Although it is also Each node sets the speed at which it leaves the airport strip. and the speed of entering the airport strip equal, Only the value at that speed is valid when calculating the weight.

[0028] Step 4: Calculate the cost weight of the state transition connection between any two state nodes on different stripes in the speed expansion state graph, and filter feasible state transition connections in combination with security checks. Step 4.1: Set the acceleration limit for the fixed-wing UAV to... The maximum turning angle is Maximum curvature ,in gIt is gravitational acceleration. v It refers to the speed of a fixed-wing drone.

[0029] Step 4.2: For any two different bands and strips Nodes with state (Export speed is) ) and state nodes (Export speed is) First, determine the physical coordinates based on the velocity sign. Starting point. (strip) (exports): If (Requires upward coverage) ;like (Requires downward coverage) Entry point (strip) (Entrance): If ,but ;like ,but .

[0030] Step 4.3: Coverage Time Cost Calculation: Calculate fixed-wing UAVs in strip ( Internal velocity from the inlet Shift to exit speed The required time. First, check the acceleration constraints and the required acceleration. ,like (Maximum acceleration), then the time cost of coverage. (Dynamically unreachable). Otherwise, calculate the optimal coverage time cost. Because airports don't need coverage, strips Coverage time .

[0031] Step 4.4: Transfer Cost Calculation and Risk Detection: (1) Traverse the set of discrete sampling rates All of the above Same number Calculate from arrive All variable-speed Durbins paths and their time costs. These paths can be represented by sequences CSC and CCC, where C represents a curve segment with left or right turns, on which the fixed-wing UAV's speed is constant; S represents a straight segment on which the fixed-wing UAV can accelerate or decelerate. The time cost can be expressed as: in, , These are the path lengths of the first C segment and the third C segment, respectively. If the middle segment is C, then... ,but ( (This is the path length of the second segment C); if the middle segment is S, then... yes linear speed change to The optimal time that the dynamics can achieve.

[0032] (2) Perform high-density sampling on all variable-speed Durbin paths obtained in the above steps, and query the high-resolution risk potential field generated in step 2. If any point exists... satisfy ,but The edge connecting the states that transitioned is directly removed.

[0033] Step 4.5: Two state nodes and The cost weight of the state transition edge between two edges is represented as the minimum sum of the costs of the two edge transition paths and the cost of the next edge coverage: in, It is a strip The ingress speed, Guarantee the strip The inlet and outlet velocities are in the same direction. Because... The cost that only affects this step is calculated by traversing all possible edges when calculating edge weights. To obtain the minimum value.

[0034] Step 5: Based on all feasible state transition edges and their cost weights, construct an integer linear programming model with the goal of minimizing the total coverage cost, and set constraints to ensure the continuity and uniqueness of state transitions. Step 5.1: Decision variables. If the value is 1, it indicates that the fixed-wing UAV is moving from the strip. (by export speed) (End) Move directly to the strip (and ultimately at the export speed) End of coverage). Discrete variable, representing a strip. The position in the traversal sequence.

[0035] Step 5.2: Objective Function. Minimize the total time for full coverage: Step 5.3: Constraints: (1) Strip access uniqueness constraint: Each strip must be accessed once as a whole and can only correspond to a specific exit speed.

[0036] (2) Consistency constraint on export speed: entry strip and at speed The end must begin with the strip. They set off at the same speed.

[0037] (3) Sub-loop elimination constraint: prevent the generation of multiple disconnected closed loops.

[0038] Step 6: Solve the integer linear programming model to obtain the optimal strip traversal order and generate a full-coverage trajectory containing speed information.

[0039] Step 6.1: Solve the above integer linear programming model using the standard solver to obtain the optimal decision variable matrix. .

[0040] Step 6.2: Analysis The elements with a value of 1 in the matrix are used to reconstruct the strip access sequence and the entry and exit speeds of each strip.

[0041] Step 6.3: Generate the final control command sequence for the fixed-wing UAV (including position coordinates and corresponding target velocities) based on the strip access sequence and velocity information.

[0042] Scenario 1 is set as a 22.5km × 22.5km two-dimensional area to be covered, including a free-flying zone (white) and a no-flying zone (black). The fixed-wing UAV performing the mission is parked at an airport outside the area (pentagonal position). The speed range of the fixed-wing UAV performing the coverage mission is set to [100, 220] m / s, and the number of samples is 6. The UAV's normal overload... Maximum acceleration The field of view is 1.5 km wide. Safe distance between fixed-wing UAVs and no-fly zones. Set to 350m. During the mission, the fixed-wing UAV takes off from the airport, reaches the predetermined cruising altitude, departs at minimum speed to the designated area to perform the coverage mission, and lands at minimum speed after the mission is completed.

Claims

1. A method for path planning in complex areas for variable-speed fixed-wing unmanned aerial vehicles (UAVs), characterized in that, The steps include the following: Step 1: Obtain a two-dimensional map of the area to be covered. Use the ox-plowing cell decomposition method to decompose the free area in the area to be covered into several coverage strips, which together with the airport strip outside the area to be covered constitute the entire strip set. Step 2: Map the two-dimensional map of the area to be covered into a high-resolution binary matrix and construct a high-resolution risk potential field based on the distance to the no-fly zone; Step 3: Define the discrete sampling velocity set of the fixed-wing UAV. Based on the different velocities leaving the strip, abstract the strip into several state nodes. Establish state transition edges between state nodes of different strips to construct a velocity extension state graph. Based on the specified minimum speed of the fixed-wing UAV... Maximum speed of fixed-wing drones The speed range is obtained. and carry out Uniform sampling; construct a signed set of discrete sampling velocities. Positive values ​​indicate the direction of the fixed-wing UAV from the lower end to the upper end of the strip, while negative values ​​indicate the direction of the fixed-wing UAV from the upper end to the lower end. Each strip is assigned a specific exit velocity based on its characteristics. Abstracted as There are 1 state node, each state node is defined as follows: This indicates that the fixed-wing drone is at its export speed. Leave the strip ; Constructing a speed extension state graph Node set The total number is Each strip Each node is different from all other stripes. Each node constructs a state transition connection edge. E Represents the set of state transition edges; state transition edges This indicates that the fixed-wing drone is at its export speed. Leave the strip Then, move directly to the strip. And ultimately at the export speed End coverage; For state nodes If the export speed Then the strip The exit point is the upper end of the strip; like Then the strip The exit point is the lower end of the strip; Step 4: Calculate the cost weight of the state transition connection between any two state nodes on different stripes in the speed expansion state graph, and filter feasible state transition connections in combination with security checks. For any two state nodes on different stripes and The state transition connection is formed by stripes. to strip Transfer paths and stripes The coverage path consists of the cost weights of the state transition edges. Defined as a strip to strip Transfer path cost and stripe Minimum sum of covered path costs; stripe entry speed With export speed Same sign; stripe The coverage path cost is, considering acceleration constraints, for stripes Entry speed Movement to strip Export speed The shortest path time is used; if the kinematics makes it unreachable, pruning is performed. The transfer path is a calculation strip. Export speed to strip Entry speed The variable-speed Durbins path; the transition path cost is the shortest variable-speed Durbins path time under acceleration constraints; for a given two-state node... and strip export speed and strips export speed Determined; with the strip entry speed The only change is in the strips. to strip Transfer path cost and stripe The coverage cost changes; when calculating edge weights, all elements related to the strip are traversed. The exit speed is the same as the entry speed Obtain the state node and Minimum between The transfer path is sampled and detected by high-resolution risk potential field. If risk points exist, path pruning is performed. Transfer paths that pass the detection are considered feasible and are then transferred and connected. Step 5: Based on all feasible state transition edges and their cost weights, construct an integer linear programming model with the goal of minimizing the total coverage cost, and set constraints to ensure the continuity and uniqueness of state transitions. The constraints of the integer linear programming model include: strip access uniqueness constraint, exit velocity consistency constraint, and subloop elimination constraint; the strip access uniqueness constraint ensures that each strip is visited exactly once and corresponds to a unique exit velocity; the exit velocity consistency constraint refers to the entry velocity of a strip... and at speed The end must begin with the strip. Starting at the same speed; the sub-loop elimination constraint is achieved by introducing an auxiliary sequence variable to represent the access order of each strip, thus excluding independent sub-loops that are not connected to the main transfer path; Step 6: Solve the integer linear programming model to obtain the optimal strip traversal order and generate a full-coverage trajectory containing speed information.

2. The method for coverage path planning in complex areas for variable-speed fixed-wing UAVs according to claim 1, characterized in that, Fixed-wing UAVs are subject to acceleration constraints; the initial position of a fixed-wing UAV is set at an airport outside the area to be covered.

3. The method for coverage path planning in complex areas for variable-speed fixed-wing UAVs according to claim 1, characterized in that, The described ox-plowing cell decomposition method is a vertical decomposition, and the decomposed covering strip is separated from the no-fly zone by a certain distance, providing space for the fixed-wing UAV to turn; the width of the covering strip is the field of view of the fixed-wing UAV sensor. The x-coordinates of the upper and lower endpoints of the coverage strip are both the x-coordinates of the coverage strip center, the y-coordinates of the upper endpoints are the y-coordinates of the upper boundary of the coverage strip, and the y-coordinates of the lower endpoints are the y-coordinates of the lower boundary of the coverage strip. The upper endpoint of the airport strip marks the position where the fixed-wing UAV takes off and reaches its cruising altitude, while the lower endpoint marks the position where the fixed-wing UAV ends its cruising and prepares to land; all coverage strips and airport strips constitute the complete strip set. Where N is the total number of stripes, and airport stripes are stripes. .

4. The method for coverage path planning in complex areas for variable-speed fixed-wing UAVs according to claim 1, characterized in that, In step 2, the safe radius of the fixed-wing UAV is set, and the Euclidean distance from each point in the high-resolution binary matrix to the nearest no-fly zone is calculated. If the distance is less than the safe distance, it is determined to be a risk point; otherwise, it is a no-risk point, thus forming a high-resolution risk potential field.

5. The method for coverage path planning in complex areas for variable-speed fixed-wing UAVs according to claim 1, characterized in that, Airport strip have Each node sets the speed at which it leaves the airport strip. and the speed of entering the airport strip Equal, and Only at this velocity value are the state transition edge weights between computer field strip state nodes and other strip state nodes effective.

6. The method for coverage path planning in complex areas for variable-speed fixed-wing UAVs according to claim 1, characterized in that, The variable-speed Dubins path is divided into two types: CSC and CCC. The fixed-wing UAV has a fixed speed in the curved section C and accelerates and decelerates in the straight section S.

Citation Information

Patent Citations

  • Method and device for full-coverage operation path planning and optimization of agricultural machinery in farmland scenarios

    CN120161853B

  • Collision-free coverage path planning method for variable-speed curvature limited robot

    CN116430855A

  • Path planning navigation system for unmanned agricultural machinery

    CN121026141A

  • Mobile robot path planning method based on improved A* and time elastic band algorithm

    CN122062677A