Unmanned aerial vehicle and unmanned vehicle air defense alarm cooperative operation path optimization method
Through the coordinated operation path optimization method between drones and unmanned vehicles, the improved lion group optimization algorithm and Sweep scanning method are used to solve the problems of limited coverage and insufficient flexibility of traditional air defense alarm systems, and achieve faster and more comprehensive Integrated air defense alarm system.
Patent Information
- Application Number
- CN202411048961.X
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2024-08-01
- Publication Date
- 2024-11-19
- Estimated Expiration
- 2044-08-01
AI Technical Summary
Traditional air defense alarm systems have problems with fixed locations and limited coverage, making it difficult to fully cover cities, especially in complex or remote areas, and lack flexibility and cannot be adjusted quickly, resulting in untimely information transmission and incomplete coverage.
Adopting the coordinated operation path optimization method between drones and unmanned vehicles, the locations of drones and unmanned vehicles are represented by multi-dimensional coordinates, and establishing a coordinated air defense alarm scheduling that minimizes the weighted sum of the total task completion time and total delay time as the goal. The model uses the improved lion group optimization algorithm for path planning, combined with the Sweep scanning method and multi-operator update mechanism to optimize the task allocation and path planning of drones and unmanned vehicles.
It realizes coordinated operation scheduling of drones and unmanned vehicles in the air defense alarm system, reduces local congestion problems in path planning, improves the timeliness of information transmission and comprehensive coverage, and can quickly adjust task allocation to cope with it. Emergency.
Smart Images

Figure CN118982187A_ABST
Abstract
Description
Technical Field
[0001] The present invention relates to the technical field of path planning, and in particular to a method for optimizing the collaborative operation path of air defense alarms of unmanned aerial vehicles and unmanned vehicles. Background Art
[0002] In the field of civil air defense, it is necessary to realize the rapid notification of air defense alarms. It is an important part of ensuring people's safety to spread the warning information to the largest extent, fastest and most effectively at the first time. Traditional air defense alarms are mainly fixed electric and electroacoustic alarms, relying on fixed alarm facilities. They have the problems of fixed location and limited coverage, and it is difficult to fully cover the city, especially in complex terrain or remote areas. And with the acceleration of urbanization, the floors of buildings are getting higher and higher, and the alarms located at low points are difficult to play an effect. The number of blind spots in high-rise indoor buildings has increased. The obstruction of buildings and the influence of external noise have affected the propagation of traditional air defense warning signals, resulting in untimely and inaccurate information transmission. At the same time, these fixed facilities lack flexibility in the face of emergencies and cannot be quickly adjusted according to real-time changes.
[0003] Drones and unmanned vehicles that can be equipped with air defense alarms are highly flexible and maneuverable, and can get rid of the limitations of fixed locations and limited coverage of traditional methods to achieve rapid and intelligent early warning. However, current research on path optimization for drones and unmanned vehicles is mostly independent sub-problems, lacking the ability of drones and unmanned vehicles to work together, resulting in problems such as untimely information transmission and incomplete coverage in air defense early warning missions.
[0004] The above contents are only used to assist in understanding the technical solution of the present invention and do not constitute an admission that the above contents are prior art. Summary of the invention
[0005] The main purpose of the present invention is to provide a method for optimizing the collaborative operation path of air defense alarms between unmanned aerial vehicles and unmanned vehicles, aiming to solve the problem of XX.
[0006] To achieve the above-mentioned purpose, the present invention provides a method for optimizing the air defense alarm collaborative operation path of a UAV and an unmanned vehicle, comprising:
[0007] The positions of drones and unmanned vehicles are represented by multi-dimensional coordinates, where the multi-dimensional coordinates include the starting point, the mission area, the set of tasks to be performed, the mission priority, and the physical limitations of the drones and unmanned vehicles;
[0008] With the goal of minimizing the weighted sum of total task completion time and total delay time, a coordinated dispatch model for UAVs and unmanned vehicles carrying air defense alarms is established.
[0009] The improved lion group optimization algorithm is used to solve the coordinated scheduling model of air defense alarms loaded by UAVs and unmanned vehicles, and the coordinated scheduling plan of target UAVs and unmanned vehicles is obtained. The improved lion group optimization algorithm includes the introduction of Sweep scanning method, algorithm discretization processing based on circular surround and multi-operator update mechanism to improve the response speed and decision-making accuracy of the lion group optimization algorithm.
[0010] Optionally, the drone and unmanned vehicle load air defense alarm collaborative scheduling model includes:
[0011] With the goal of minimizing the weighted sum of total task completion time and total delay time, the objective function is established:
[0012] minf=ω1·T 总 +ω2·D 总 (1)
[0013] In formula (1), T 总 represents the total task completion time, D 总 represents the total delay time, ω1 and ω2 represent weight coefficients;
[0014] Create a constraint function:
[0015] Assign each task to at least one drone or unmanned vehicle.
[0016]
[0017] In formula (2), x ij With y il is a 0-1 variable, x ij It means that when task w i 1 when assigned to a drone, otherwise 0, y il Indicates that when task ω i It is 1 when assigned to an unmanned vehicle, otherwise it is 0. W represents the set of all tasks, m represents the number of drones, and p represents the number of unmanned vehicles;
[0018] The number of drones and unmanned vehicles assigned to a mission does not exceed the total number of missions.
[0019]
[0020] The arrival time of the alarm for each area must be within the specified time window.
[0021]
[0022]
[0023] In formula (4), a i represents the i-th region that performs task a, e i , ki Indicates area a i The lower limit of the time window and the upper limit of the time window;
[0024] The path length of drones and unmanned vehicles is less than the maximum range or trip.
[0025]
[0026]
[0027] In formula (5), and Respectively represent the current drone u j The length of the path traveled and the unmanned vehicle v l The length of the path traveled, and Represent the maximum range of UAVs and unmanned vehicles respectively, U represents the set of all UAVs, U represents the set of all unmanned vehicles, and V represents the set of all unmanned vehicles;
[0028] The energy consumption of drones and autonomous vehicles does not exceed the capacity of their batteries.
[0029]
[0030]
[0031] In formula (6), and It represents the energy consumed by drones and unmanned vehicles during mission execution. and Indicates the battery capacity of drones and unmanned vehicles;
[0032] High-priority tasks can be assigned first.
[0033] P(a i )≥max[P(a1),P(a2),…P(a n )]·λ (7)
[0034] In formula (7), P(a i ) represents area a i Task priority situation;
[0035] Ability to quickly reassign tasks when tasks fail or circumstances change,
[0036]
[0037] In formula (8), R represents the set of all regions that need to perform tasks;
[0038] Drones and unmanned vehicles maintain a certain safety distance from obstacles during missions.
[0039]
[0040]
[0041] In formula (9), O represents the obstacle set, r0 represents the safety distance of area r;
[0042] When performing a mission, the load carried by each drone and unmanned vehicle shall not exceed its own maximum load capacity.
[0043]
[0044]
[0045] In formula (10), For task w i The load, For drone u j The carrying capacity, For driverless cars l The load bearing capacity;
[0046] Limitations on the range and quality of communications between drones and autonomous vehicles and with the control center,
[0047]
[0048] In formula (11), For drone u j or driverless car l Communication distance to the control center.
[0049] Optionally, the drone and unmanned vehicle load air defense alarm collaborative scheduling model is solved by an improved lion group optimization algorithm, including:
[0050] Use the Sweep method to assign initial tasks to all drones and unmanned vehicles and build an initial coordinated scheduling plan for drones and unmanned vehicles;
[0051] Using the initialized UAV and UGV collaborative scheduling scheme, calculate the path cost, time window constraint satisfaction, and task priority satisfaction of each UAV and UGV;
[0052] The lion group optimization algorithm is used to optimize the initialized UAV and unmanned vehicle collaborative scheduling scheme, and update the task allocation and path planning scheme of UAV and unmanned vehicle;
[0053] Discretize the optimization results of the lion group optimization algorithm to solve the optimal path for each drone and unmanned vehicle, comprehensively consider the path length, energy consumption and time window constraints, and add congestion penalty costs;
[0054] Use a multi-operator update mechanism to destroy, repair and reconstruct the coordinated scheduling scheme of drones and unmanned vehicles in the current population, enhancing the algorithm's global search capability and local search accuracy;
[0055] Calculate the fitness value of each scheduling scheme, calculate the weighted sum of task completion time and total delay time, and whether the constraints are met;
[0056] Repeat the optimization steps using the Lion Group Optimization Algorithm until the preset maximum number of iterations is reached or the stopping condition is met;
[0057] Output the coordinated scheduling plan for target UAVs and unmanned vehicles, including task allocation, path planning and time scheduling.
[0058] Optionally, use the Sweep method to assign initial tasks to all drones and unmanned vehicles, including:
[0059] Use the basic steps of the Sweep method to assign the tasks to be assigned to the drone and the unmanned vehicle;
[0060] Use the Sweep method to continuously adjust and optimize parameters according to the range and step size of the variables, create a diverse set of initial solutions, and improve the collaborative efficiency of drones and unmanned vehicles;
[0061] Perform a step-by-step scan across all mission areas to calculate the impact of different starting positions on the time and path length of the drone or vehicle to reach the designated alert area;
[0062] Observe the relationship between speed changes and energy consumption and task completion efficiency, and adjust the flight speed parameters of the UAV and the driving speed parameters of the unmanned vehicle;
[0063] Scan the traffic conditions, traffic congestion levels and road distances of different roads to determine the impact on the driving route parameters of the unmanned vehicle and determine the current preferred driving route;
[0064] Set different altitude ranges for scanning, observe the impact of flight altitude on signal propagation range and strength, as well as energy consumption, and adjust the flight altitude parameters of the drone;
[0065] Then scan different flight altitudes, observe the interference of terrain and building factors on signal propagation, and adjust the flight altitude parameters of the drone;
[0066] Scan the quality of different types of air defense alarm devices, determine the number and type of air defense alarm devices that drones and unmanned vehicles can carry, and adjust the load capacity parameters;
[0067] The following formula is used for calculation in the above scanning process:
[0068] P i,k = l i +k·s i
[0069]
[0070] k=1,2,…,K i (18)
[0071] In formula (18), P i,k represents the value of the i-th parameter at the k-th step, l i Represents a variable, s i is the step length, K i is the parameter P i The number of times a value can be taken.
[0072] Optionally, a lion group optimization algorithm is used to optimize the initialized UAV and unmanned vehicle collaborative scheduling scheme, including:
[0073] Determine the population size of the initial UAV and AV collaborative scheduling solution;
[0074] Calculate the fitness values of individuals in the population and divide them into groups of lion kings, lionesses, and lion cubs;
[0075] Discretize the lion's position and update the positions of the lion king, lionesses, and lion cubs.
[0076] Optionally, the optimization result of the lion group optimization algorithm is discretized, including:
[0077] The initial UAV and UGV task allocation and path planning schemes combine the position of one UAV with the flight path of another UAV, or exchange the route of one UGV with the load allocation of another UGV, thereby generating a new scheduling scheme, as shown below:
[0078]
[0079] In formula (19), represents the scheduling plan for the i-th lion individual in the t-th iteration, represents the scheduling plan of a random lion in the tth iteration, It represents the scheduling plan of the optimal lion king individual in the tth iteration. Cross1 and Cross2 represent two different update mechanisms. The Cross1 update mechanism pays more attention to the diversity of the population. By exchanging information with the distribution plan of the random population, it expands the solution space of the algorithm, improves the diversity of the population, and also strengthens the global search ability of the algorithm. The Cross2 update mechanism pays more attention to the local search ability. The distribution plan in the lion group exchanges information with the optimal scheduling plan, thereby improving the local search ability and search speed of the algorithm.
[0080] Optionally, a multi-operator update mechanism is used to destroy and repair the coordinated scheduling scheme of drones and unmanned vehicles in the current population, including:
[0081] A gradient-based update strategy is used to guide the search to quickly move toward the optimal solution, while a random mutation strategy is combined to increase the diversity of the population and avoid falling into a local optimal solution.
[0082] Through the carefully designed operator combination, populations with different characteristics are obtained to adapt to the task allocation and path planning optimization problems of drones and unmanned vehicles;
[0083] When faced with areas with complex terrain, operators that focus on exploring new paths are added to find more suitable driving routes.
[0084] Optionally, the positions of the drone and the unmanned vehicle are represented by multi-dimensional coordinates, including:
[0085] The multi-dimensional coordinates of drones and unmanned vehicles include the starting point, mission area, set of tasks to be performed, mission priorities and physical constraints.
[0086] The task set is defined as W = {w i |i=1,2,…,n}, corresponding to all tasks to be performed; the set of drones is defined as U={u j |j=1,2,…,m}, corresponding to all drones; the set of unmanned vehicles is defined as V={v l |l=1,2,…,p}, corresponding to all unmanned vehicles; the set of all mission areas is defined as R={r i |i=1,2,…,q}, represents all areas where alarm tasks need to be executed;
[0087] Define P(a i ) is area a i The task priority is defined UAV j Arrive at i Time, driverless car v l Arrive at i time, e i, k i Area a i The lower limit of the time window and the area a i The upper limit of the time window;
[0088] Physical limitations of drones and autonomous vehicles, definitions and are the maximum ranges of drones and unmanned vehicles, respectively. and The current drone u j The length of the path traveled, the unmanned vehicle v l Length of the path traveled; Definition and For the battery capacity of drones and unmanned vehicles, and It is the energy consumed by drones and unmanned vehicles during mission execution; Definition For task w i The load, For drone u j The load-bearing weight, For driverless cars l When allocating tasks and planning routes, it is necessary to reasonably allocate the equipment and materials required for the tasks and reserve a carrying capacity to deal with emergencies. The communication range and quality between drones and unmanned vehicles and the control center are also limited. It is necessary to ensure that they travel within the communication range and avoid entering the communication blind spot. For drone u j and driverless cars l Communication distance to the control center.
[0089] The technical solution provided by this application may have the following beneficial effects:
[0090] This application establishes a collaborative scheduling model for air defense drones and unmanned vehicles loaded with air defense alarms based on the characteristics and constraints of drones and unmanned vehicles, with the goal of minimizing the weighted sum of task completion time and total delay time. Through an improved lion group optimization algorithm, a multi-level mapping encoding and decoding method based on task-drone / unmanned vehicle-region is used to assign and sort tasks, and an improved path planning algorithm is integrated to optimize the movement routes of drones and unmanned vehicles, reduce the time in transit, and solve the local congestion problem in path planning. Further, through a neighborhood search strategy, the optimal scheduling plan that minimizes the task completion time and delay time is found, providing a preferred solution for the collaborative operation scheduling problem of drones and unmanned vehicles in air defense alarm systems.
[0091] It should be understood that the foregoing general description and the following detailed description are exemplary and explanatory only and are not restrictive of the present application. BRIEF DESCRIPTION OF THE DRAWINGS
[0092] The above and other objects, features and advantages of the present application will become more apparent through a more detailed description of exemplary embodiments of the present application in conjunction with the accompanying drawings, wherein the same reference numerals generally represent the same components in the exemplary embodiments of the present application.
[0093] Figure 1 It is a flow chart of a method for optimizing the air defense alarm collaborative operation path of a UAV and an unmanned vehicle shown in an embodiment of the present application;
[0094] Figure 2 It is a schematic diagram of the implementation process of the improved lion group optimization algorithm of the air defense alarm collaborative operation path optimization method of the drone and the unmanned vehicle shown in the embodiment of the present application;
[0095] Figure 3 The present invention is a schematic diagram of the hardware operating environment of the air defense alarm collaborative operation path optimization system for unmanned aerial vehicles and unmanned vehicles involved in an embodiment of the present invention. DETAILED DESCRIPTION
[0096] The embodiments of the present application will be described in more detail below with reference to the accompanying drawings. Although the embodiments of the present application are shown in the accompanying drawings, it should be understood that the present application can be implemented in various forms and should not be limited by the embodiments described herein. On the contrary, these embodiments are provided to make the present application more thorough and complete, and to fully convey the scope of the present application to those skilled in the art.
[0097] It should be understood that although the terms "first", "second", "third", etc. may be used in this application to describe various information, this information should not be limited to these terms. These terms are only used to distinguish the same type of information from each other. For example, without departing from the scope of this application, the first information may also be referred to as the second information, and similarly, the second information may also be referred to as the first information. Thus, the features defined as "first" and "second" may explicitly or implicitly include one or more of the features. In the description of this application, the meaning of "multiple" is two or more, unless otherwise clearly and specifically defined.
[0098] In the description of the present application, it should be understood that the terms "length", "width", "up", "down", "front", "back", "left", "right", "vertical", "horizontal", "top", "bottom", "inside", "outside", etc., indicating the orientation or position relationship, are based on the orientation or position relationship shown in the drawings, and are only for the convenience of describing the present application and simplifying the description, and do not indicate or imply that the device or element referred to must have a specific orientation, be constructed and operated in a specific orientation, and therefore should not be understood as a limitation on the present application.
[0099] Unless otherwise clearly specified and limited, the terms "installed", "connected", "connected", "fixed" and the like should be understood in a broad sense, for example, it can be a fixed connection, a detachable connection, or an integral connection; it can be a mechanical connection or an electrical connection; it can be a direct connection or an indirect connection through an intermediate medium, it can be the internal connection of two elements or the interaction relationship between two elements. For ordinary technicians in this field, the specific meanings of the above terms in this application can be understood according to specific circumstances.
[0100] Traditional air defense alarms are mainly fixed electric and electroacoustic alarms, which rely on fixed alarm facilities. They have the problems of fixed location and limited coverage, and it is difficult to fully cover the city, especially in complex terrain or remote areas. And with the acceleration of urbanization, the floors of buildings are getting higher and higher, and the alarms located at low points are difficult to play an effective role. The blind spots in high-rise indoors are increasing. The obstruction of buildings and the influence of external noise affect the propagation of traditional air defense warning signals, resulting in untimely and inaccurate information transmission. At the same time, these fixed facilities lack flexibility in the face of emergencies and cannot be adjusted quickly according to real-time changes. UAVs, unmanned vehicles and other equipment that can be equipped with air defense alarm devices have the characteristics of high flexibility and strong mobility. They can get rid of the limitations of fixed location and limited coverage of traditional methods and realize rapid and intelligent warning. However, the current path optimization research for drones and unmanned vehicles is mostly independent sub-problems, lacking the collaborative operation ability of drones and unmanned vehicles, resulting in problems such as untimely information transmission and incomplete coverage in air defense warning tasks.
[0101] In response to the above problems, an embodiment of the present application provides a method for optimizing the collaborative operation path of air defense alarms of drones and unmanned vehicles. The method can establish a collaborative scheduling model for air defense drones and unmanned vehicles loaded with air defense alarms based on the characteristics and constraints of drones and unmanned vehicles loaded with air defense alarms, with the goal of minimizing the weighted sum of task completion time and total delay time. Through an improved lion group optimization algorithm, tasks are assigned and sorted based on a multi-level mapping encoding and decoding method of task-drone / unmanned vehicle-region, and an improved path planning algorithm is integrated to optimize the movement routes of drones and unmanned vehicles, reduce the time in transit, and solve the problem of local congestion in path planning. Furthermore, through a neighborhood search strategy, the optimal scheduling plan that minimizes the task completion time and delay time is found, thereby providing a preferred solution for the collaborative operation scheduling problem of drones and unmanned vehicles in the air defense alarm system.
[0102] The technical solution of the embodiments of the present application is described in detail below with reference to the accompanying drawings.
[0103] Figure 1 It is a flow chart of a method for optimizing the path of air defense alarm collaborative operation between a UAV and an unmanned vehicle shown in an embodiment of the present application.
[0104] See also Figure 1 , a method for optimizing the air defense alarm collaborative operation path of a UAV and an unmanned vehicle, comprising:
[0105] S101, representing the positions of the drone and the unmanned vehicle using multi-dimensional coordinates, wherein the multi-dimensional coordinates include a starting point, a mission area, a set of executed missions, mission priorities, and physical limitations of the drone and the unmanned vehicle;
[0106] Specifically, the task set is defined as W = {w i |i=1,2,…,n}, corresponding to all tasks to be performed; the set of drones is defined as U={u j |j=1,2,…,m}, corresponding to all drones; the set of unmanned vehicles is defined as V={v l |l=1,2,…,p}, corresponding to all unmanned vehicles; the set of all mission areas is defined as R={r i |i=1,2,…,q}, indicating all areas where alarm tasks need to be executed.
[0107] Define P(a i ) is area a i The mission priorities are defined to highlight the mission's danger and flexibility. UAV j Arrive at i Time, driverless car v l Arrive at i time, e i , k i Area a i The lower limit of the time window and the area a i The upper limit of the time window.
[0108] Physical limitations of drones and autonomous vehicles, definitions and are the maximum ranges of drones and unmanned vehicles, respectively. and The current drone u j The length of the path traveled, the unmanned vehicle v l Length of the path traveled; Definition and For the battery capacity of drones and unmanned vehicles, and It is the energy consumed by drones and unmanned vehicles during mission execution; Definition For task w i The load, For drone u j The load-bearing weight, For driverless cars lWhen allocating tasks and planning routes, we need to reasonably allocate the equipment and materials required for the tasks and reserve a margin to deal with emergencies. The communication range and quality between drones and unmanned vehicles and the control center are also limited. We need to ensure that they travel within the communication range and avoid entering the communication blind spot. For drone u j and driverless cars l Communication distance to the control center.
[0109] S102, with the goal of minimizing the weighted sum of total task completion time and total delay time, establishing a coordinated dispatch model for UAVs and unmanned vehicles carrying air defense alarms;
[0110] Specifically, the coordinated dispatch model of UAV and unmanned vehicle load air defense alarm includes:
[0111] With the goal of minimizing the weighted sum of total task completion time and total delay time, the objective function is established:
[0112] minf=ω1·T 总 +ω2·D 总 (1)
[0113] In formula (1), T 总 represents the total task completion time, D 总 represents the total delay time, ω1 and ω2 represent weight coefficients;
[0114] Create a constraint function:
[0115] Assign each task to at least one drone or unmanned vehicle.
[0116]
[0117] In formula (2), x ij With y il is a 0-1 variable, x ij It means that when task w i 1 when assigned to a drone, otherwise 0, y il Indicates that when task ω i It is 1 when assigned to an unmanned vehicle, otherwise it is 0. W represents the set of all tasks, m represents the number of drones, and p represents the number of unmanned vehicles;
[0118] The number of drones and unmanned vehicles assigned to a mission does not exceed the total number of missions.
[0119]
[0120] The arrival time of the alarm for each area must be within the specified time window.
[0121]
[0122]
[0123] In formula (4), a i represents the i-th region that performs task a, e i , k i Indicates area a i The lower limit of the time window and the upper limit of the time window;
[0124] The path length of drones and unmanned vehicles is less than the maximum range or trip.
[0125]
[0126]
[0127] In formula (5), and Respectively represent the current drone u j The length of the path traveled and the unmanned vehicle v l The length of the path traveled, and Represent the maximum range of UAVs and unmanned vehicles respectively, U represents the set of all UAVs, U represents the set of all unmanned vehicles, and V represents the set of all unmanned vehicles;
[0128] The energy consumption of drones and autonomous vehicles does not exceed the capacity of their batteries.
[0129]
[0130]
[0131] In formula (6), and It represents the energy consumed by drones and unmanned vehicles during mission execution. and Indicates the battery capacity of drones and unmanned vehicles;
[0132] High-priority tasks can be assigned first.
[0133] P(a i )≥max[P(a1),P(a2),…P(a n )]·λ (7)
[0134] In formula (7), P(a i ) represents area a i Task priority situation;
[0135] Ability to quickly reassign tasks when tasks fail or circumstances change,
[0136]
[0137] In formula (8), R represents the set of all regions that need to perform tasks;
[0138] Drones and unmanned vehicles maintain a certain safety distance from obstacles during missions.
[0139]
[0140]
[0141] In formula (9), O represents the obstacle set, r0 represents the safety distance of area r;
[0142] When performing a mission, the load carried by each drone and unmanned vehicle shall not exceed its own maximum load capacity.
[0143]
[0144]
[0145] In formula (10), For task w i The load, For drone u j The carrying capacity, For driverless cars l The load bearing capacity;
[0146] Limitations on the range and quality of communications between drones and autonomous vehicles and with the control center,
[0147]
[0148] In formula (11), For drone u j or driverless car l Communication distance to the control center.
[0149] S103. The coordinated dispatch model of air defense alarms loaded on UAVs and unmanned vehicles is solved by using an improved lion group optimization algorithm to obtain a coordinated dispatch plan for target UAVs and unmanned vehicles. The improved lion group optimization algorithm includes the introduction of a sweep method, a circular surround-based algorithm discretization process, and a multi-operator update mechanism to improve the response speed and decision-making accuracy of the lion group optimization algorithm.
[0150] Specifically, the improved lion group optimization algorithm is used to solve the coordinated scheduling model of UAV and unmanned vehicle load air defense alarm, including:
[0151] S1031. Use the Sweep method to assign initial tasks to all drones and unmanned vehicles and build an initial vehicle and drone collaborative scheduling plan;
[0152] In the process of generating the initial scheduling plan for the population, the Sweep method creates a diverse set of initial solutions by systematically changing the scheduling parameters within a predetermined parameter range. This method is based on a simple and effective principle, that is, by gradually and orderly changing one or more parameters related to the collaborative path of drones and unmanned vehicles, such as starting position, flight speed, driving route, load capacity, etc., the changing trend of the objective function (such as path length, alarm coverage, response time, energy consumption, etc.) can be clearly observed, including:
[0153] Use the basic steps of the Sweep scanning method to assign the tasks to be assigned to drones and unmanned vehicles. Select a drone or unmanned vehicle that has not been used yet. Assign the unassigned tasks to drones or unmanned vehicles in descending order of priority until the relevant constraints of the drone or unmanned vehicle are not met, and then arrange the specific driving path of the drone or unmanned vehicle to obtain the specific path arrangement of a drone or unmanned vehicle. If there are still tasks that have not been arranged, continue to perform task allocation until all tasks are assigned to drones or unmanned vehicles. Swap the drone with the unmanned vehicle and the task, that is, recalculate the task priority, and then repeat the above steps to obtain multiple groups of solutions. This step is essentially to reselect and set the node with the lowest priority, and then use this node as the starting point to gradually scan the nodes with higher priorities and assign drones or unmanned vehicles. Repeat the task allocation steps, but in the task allocation, sort each task from small to large according to priority, and then assign drones and unmanned vehicles to obtain the solution to the problem. Find the current optimal solution from the above solution results and output the initial drone and unmanned vehicle collaborative scheduling plan.
[0154] The Sweep method is used to continuously adjust and optimize parameters according to the range and step size of the variables, create a diverse set of initial solutions, and improve the collaborative efficiency of drones and unmanned vehicles; the adjustment and optimization parameters are calculated using the following formula:
[0155] P i,k = l i +k·s i
[0156]
[0157] k=1,2,…,K i (18)
[0158] In formula (18), P i,k represents the value of the i-th parameter at the k-th step, l i Represents a variable, si is the step length, K i is the parameter P i The number of times a value can be taken.
[0159] Carry out a step-by-step scan within all mission areas, calculate the impact of different starting positions on the time and path length of the UAV or unmanned vehicle reaching the designated alarm area; at the same time, observe the relationship between speed changes on energy consumption and mission completion efficiency, and adjust the flight speed parameters of the UAV and the driving speed parameters of the unmanned vehicle.
[0160] Scan the traffic conditions, traffic congestion levels and road distances of different roads to determine the impact on the driving route parameters of the unmanned vehicle and determine the current preferred driving route;
[0161] Set different altitude ranges for scanning, observe the impact of flight altitude on signal propagation range and strength, as well as the impact on energy consumption, and adjust the flight altitude parameters of the UAV; then scan different flight altitudes, observe the interference of terrain and building factors on signal propagation, and adjust the flight altitude parameters of the UAV.
[0162] Scan the quality of different types of air defense alarm devices, determine the number and type of air defense alarm devices that drones and unmanned vehicles can carry, and adjust the load capacity parameters.
[0163] S1032, using the initialized UAV and UGV collaborative scheduling scheme, calculating the path cost, time window constraint satisfaction, and task priority satisfaction of each UAV and UGV;
[0164] The path cost takes into account the driving distance and energy consumption factors. The longer the driving distance, the more energy is consumed, resulting in an increase in cost. It is calculated using the following formula:
[0165]
[0166]
[0167] In formula (20), and are the path cost of the UAV and the path cost of the unmanned vehicle respectively. and The current drone u j The length of the path traveled, the unmanned vehicle v l The length of the path traveled, and It is the energy consumed by UAVs and unmanned vehicles during mission execution, and α, β, γ, and δ are weight coefficients.
[0168] The calculation of the time window constraint satisfaction of drones and unmanned vehicles is to determine whether the time they arrive at the mission area is within the specified time window, using the following formula:
[0169]
[0170]
[0171]
[0172] In formula (21), and They are the time window satisfaction of a single UAV and unmanned vehicle respectively, I is the indicator function, if the specified time window is satisfied, I=1, otherwise I=0, n is the total number of tasks, and S is the overall time window constraint satisfaction.
[0173] The calculation of task priority satisfaction is to evaluate whether high-priority tasks are assigned first. The task priority satisfaction P is obtained by calculating the ratio of the number of tasks that meet the priority requirements to the total number of tasks and then dividing it by the total number of tasks. s ,
[0174]
[0175] S1033, using the lion group optimization algorithm to optimize the initialized UAV and unmanned vehicle collaborative scheduling scheme, and update the task allocation and path planning scheme of the UAV and unmanned vehicle;
[0176] The lion group optimization algorithm is used to optimize the initialized UAV and unmanned vehicle collaborative scheduling scheme, including:
[0177] Determine the population size of the initial UAV and AV collaborative scheduling solution;
[0178] Calculate the fitness values of individuals in the population and divide them into groups of lion kings, lionesses, and lion cubs;
[0179] The fitness value of a population individual is an indicator used to evaluate the degree of excellence or adaptability of each individual in the population when solving a specific problem. In the air defense alarm collaborative operation path optimization problem of drones and unmanned vehicles, the fitness value of a population individual reflects the performance of a drone and unmanned vehicle collaborative scheduling solution. The fitness value is calculated based on the objective function and constraints of the drone and unmanned vehicle load air defense alarm collaborative scheduling model. The higher the fitness value, the closer the scheduling solution represented by the individual is to the optimal solution, that is, under the premise of meeting various constraints, it can better achieve the optimization goal set by the objective function. In the optimization algorithm, the fitness value is used to guide the evolution and search direction of the population. In the lion group optimization algorithm, individuals with high fitness values are more likely to be selected as lion kings, lionesses or lion cubs, thereby affecting their position updates and search behaviors in subsequent iterations to gradually approach the optimal collaborative scheduling solution. The following formula is used to calculate the fitness value of a population individual:
[0180]
[0181] In formula (23), Q represents the number of individuals in the population, i represents the individuals in the population, and T i represents the total task completion time of an individual, D i represents the total delay time of an individual, L i represents the total path length of an individual, E i It represents the total energy consumption of an individual, and α1, α2, α3, and α4 are weight coefficients.
[0182] When dividing lion kings, lionesses and cubs into groups, they are usually sorted according to the size of their fitness values.
[0183] The fitness values of all individuals in the population are calculated, and the individual with the highest fitness value is determined as the lion king, the individuals with the second highest fitness value are divided into the lionesses group, and the remaining individuals are classified as the cubs group. For example, if there are 10 individuals in the population, after calculating the fitness value, the individual with the highest fitness value is determined as the lion king, the individuals ranked 2nd to 4th in fitness value are divided into the lionesses group, and the remaining 5 individuals are the cubs group.
[0184] Discretize the lion's position and update the position of the lion king, lionesses, and lion cubs, including:
[0185] Lion king position update. In the lion community, the lion in a dominant position enjoys the highest status and special rights. In order to ensure its food priority, the lion king will patrol the most advantageous area and make slight moves to maintain its noble status. This practice helps the lion community maintain a stable social structure. When searching for and updating its position, the lion king will focus on areas close to the optimal solution and ensure that its position is in the best state. The lion king enjoys an unshakable position in the group. Other adult lionesses and cubs will automatically make way and regard the lion king's position as the best area to ensure that the lion king can continue to occupy the best location and gain the greatest benefit in hunting. The lion king's position update formula is,
[0186]
[0187] In formula (12), represents the position of the i-th lion in the k+1-th iteration; gbest k represents the optimal position of the k-th generation population; It represents the historical optimal position of the kth generation of the i-th lion.
[0188] Lioness position update. In a lion group, the lioness plays a key role. With her unique skills and attributes, she is crucial to the success of hunting activities. One of the main tasks of the lioness is to find and round up potential prey. In this process, the lionesses will work closely together to select the most advantageous position and method to ensure that the prey has nowhere to escape. At the same time, the lionesses will practice hunting with their cubs, teach them the necessary hunting skills and strategies, and lay the foundation for the lion group's future hunting activities. Cooperation between lionesses plays a vital role in hunting. Through unity and cooperation, the success rate of hunting can be improved, thereby enhancing the survival ability of the entire lion group. Therefore, the teamwork and cooperation spirit of the lioness are an indispensable part of the lion group, and are also key factors in the lion group's hunting success. The formula for updating the position of the lioness is,
[0189]
[0190]
[0191] In formula (13) and (14), It is represented as the best historical position of the kth generation of the cub following the lioness, γ is a random number generated according to the normal distribution N(0,1); α f represents the disturbance factor of the lioness's moving range; α1 is a random number in the range of (0,1); and They represent the minimum mean and maximum mean of each dimension of the lion's activity range; T represents the maximum number of iterations of the population; and t is the current number of iterations.
[0192] The disturbance factor for updating the lioness's position enables the lioness to explore for food in a larger range in the early stage, gradually transition the exploration range from large to small in the middle stage, and maintain a small value of the exploration range approaching zero in the late stage, thereby better balancing the algorithm's global exploration ability and local development ability, enhancing the algorithm's convergence speed, and effectively avoiding the premature problem.
[0193] The youngest member of a lion group, the lion cub, has its behavior guided and regulated by the lioness and the king. When updating its position, the lion cub will actively use the effective information provided by other members of the group to improve its positioning accuracy and search efficiency by exchanging positions and sharing experiences. The diverse position update strategies adopted by the lion cubs help enrich the strategic diversity of the lion group, thereby enhancing the overall search capability. In addition, in the process of updating their position, the lion cubs will cooperate with other lion group members in hunting. This collaboration not only improves the lion group's search efficiency, but also enhances the lion group's adaptability. Therefore, lion cubs play a vital role in the lion group. The formula for updating the position of the lion cub is,
[0194]
[0195]
[0196]
[0197] In formulas (15), (16) and (17), α c represents the disturbance factor of the lion cub's moving range; the probability factor q is a uniform random value generated according to U(0,1); α2 represents a random number in the range of (0,1); The position where the i-th lion cub is driven away within the hunting range, far away from the lion king, is a typical elite reverse learning idea. On the contrary, by moving the search focus to the location of a better solution and then searching in the opposite direction, a better solution can be found faster. In a lion group, it means that the lion cubs need to move closer to the global optimal position where the lion king is located and focus the search near that position. Then, they can move to other areas in the lion group to explore the potential solution space more comprehensively. This strategy aims to make full use of the effective information in the lion group, thereby improving the search ability and efficiency of the algorithm.
[0198] S1034, discretizing the optimization results of the lion group optimization algorithm, solving the optimal path for each drone and unmanned vehicle, comprehensively considering the path length, energy consumption and time window constraint factors, and adding congestion penalty costs;
[0199] Discretize the optimization results of the lion group optimization algorithm, including:
[0200] The initial UAV and UGV task allocation and path planning schemes combine the position of one UAV with the flight path of another UAV, or exchange the route of one UGV with the load allocation of another UGV, thereby generating a new scheduling scheme, as shown below:
[0201]
[0202] In formula (19), represents the scheduling plan for the i-th lion individual in the t-th iteration, represents the scheduling plan of a random lion in the tth iteration, It represents the scheduling plan of the optimal lion king individual in the tth iteration. Cross1 and Cross2 represent two different update mechanisms. The Cross1 update mechanism pays more attention to the diversity of the population. By exchanging information with the distribution plan of the random population, it expands the solution space of the algorithm, improves the diversity of the population, and also strengthens the global search ability of the algorithm. The Cross2 update mechanism pays more attention to the local search ability. The distribution plan in the lion group exchanges information with the optimal scheduling plan, thereby improving the local search ability and search speed of the algorithm.
[0203] S1035. Use a multi-operator update mechanism to destroy and repair the coordinated scheduling scheme of drones and unmanned vehicles in the current population, thereby enhancing the global search capability and local search accuracy of the algorithm.
[0204] Use the multi-operator update mechanism to destroy, repair and reconstruct the coordinated scheduling scheme of drones and unmanned vehicles in the current population, including:
[0205] A gradient-based update strategy is adopted to calculate the gradient of the fitness function according to the fitness value of the current population scheduling plan, and the search direction is determined accordingly to guide individuals to move quickly towards the optimal solution. For example, parameters such as the task allocation and path planning of drones and unmanned vehicles are adjusted to make the scheduling plan gradient decrease on the fitness function and approach the optimal solution.
[0206] Combined with the random mutation strategy, during the gradient update, the individuals in the population are randomly mutated with a certain probability, such as changing the task allocation and driving route of drones or unmanned vehicles, so as to increase the diversity of the population, avoid falling into the local optimal solution, expand the search space, and increase the possibility of finding the global optimal solution.
[0207] Using carefully designed operator combinations, we design a variety of operators with different functions and characteristics for task allocation and path planning optimization problems, such as operators that focus on optimizing task allocation, path planning, driving speed, load distribution, etc. We rationally combine them according to the characteristics and needs of the problem, and operate on the individuals in the population to make them better adapt to the optimization problem and improve the search efficiency and solution quality.
[0208] When faced with areas with complex terrain, increase the frequency or weight of exploring new path operators, simulate the driving conditions of drones and unmanned vehicles in complex terrain, evaluate the feasibility and advantages and disadvantages of different paths, find a more suitable driving route, and combine other operators to comprehensively optimize the collaborative scheduling plan to ensure efficient collaborative operations in complex areas.
[0209] S1036, calculating the fitness value of each scheduling scheme, calculating the weighted sum of the task completion time and the total delay time, and whether the constraint conditions are met;
[0210] S1037, repeating steps S1033 to S1036 until a preset maximum number of iterations T is reached, or the stopping condition that the improvement of the optimal solution is less than 0.1% after 10 consecutive iterations is met;
[0211] S1038. Output the coordinated scheduling plan for the target UAV and unmanned vehicle, including task allocation, path planning and time scheduling.
[0212] Corresponding to the aforementioned application function implementation device embodiment, the present application also provides an air defense alarm collaborative operation path optimization system for drones and unmanned vehicles and corresponding embodiments.
[0213] As an implementation plan, Figure 3 The present invention is a schematic diagram of the hardware operating environment of the air defense alarm collaborative operation path optimization system for unmanned aerial vehicles and unmanned vehicles involved in the embodiment of the present invention.
[0214] like Figure 3 As shown, the hardware equipment of the air defense alarm collaborative operation path optimization method of the drone and the unmanned vehicle may include: a processor 1001, such as a CPU, a memory 1005, a user interface 1003, a network interface 1004, and a communication bus 1002. Among them, the communication bus 1002 is used to realize the connection and communication between these components. The user interface 1003 may include a display screen (Display), an input unit such as a keyboard (Keyboard), and the optional user interface 1003 may also include a standard wired interface and a wireless interface. The network interface 1004 may optionally include a standard wired interface and a wireless interface (such as a WI-FI interface). The memory 1005 may be a high-speed RAM memory, or a stable memory (non-volatile memory), such as a disk memory. The memory 1005 may also be a storage device independent of the aforementioned processor 1001.
[0215] Those skilled in the art will understand that Figure 3The architecture of the hardware operating environment of the air defense alarm collaborative operation path optimization system for drones and unmanned vehicles shown in the figure does not constitute a limitation of the air defense alarm collaborative operation path optimization system for drones and unmanned vehicles, and may include more or fewer components than shown in the figure, or a combination of certain components, or a different arrangement of components.
[0216] like Figure 3 As shown, the memory 1005 as a storage medium may include an operating system, a network communication module, a user interface module, and a program of the air defense alarm collaborative operation path optimization method for unmanned aerial vehicles and unmanned vehicles. Among them, the operating system manages and controls the program of the air defense alarm collaborative operation path optimization method for unmanned aerial vehicles and unmanned vehicles, the program of the air defense alarm collaborative operation path optimization method for unmanned aerial vehicles and unmanned vehicles, and the operation of other software or programs.
[0217] exist Figure 3 In the hardware operating environment of the air defense alarm collaborative operation path optimization system for drones and unmanned vehicles shown, the user interface 1003 is mainly used to connect to the terminal and communicate data with the terminal; the network interface 1004 is mainly used for the background server and communicates data with the background server; the processor 1001 can be used to call the program of the air defense alarm collaborative operation path optimization method for drones and unmanned vehicles stored in the memory 1005.
Claims
1. A method for optimizing the air defense alarm collaborative operation path of a UAV and an unmanned vehicle, characterized in that: The method comprises the following steps: Representing the positions of the drone and the unmanned vehicle with multi-dimensional coordinates, wherein the multi-dimensional coordinates include a starting point, a mission area, a set of tasks to be performed, mission priorities, and physical limitations of the drone and the unmanned vehicle; With the goal of minimizing the weighted sum of total task completion time and total delay time, a coordinated dispatch model for UAVs and unmanned vehicles carrying air defense alarms is established. The improved lion group optimization algorithm is used to solve the coordinated scheduling model of the UAV and unmanned vehicle load air defense alarm to obtain the coordinated scheduling plan of the target UAV and unmanned vehicle. The improved lion group optimization algorithm includes the introduction of the Sweep scanning method, the algorithm discretization processing based on circular surround and the multi-operator update mechanism to improve the response speed and decision-making accuracy of the lion group optimization algorithm.
2. The method for optimizing the air defense alarm cooperative operation path of a UAV and an unmanned vehicle according to claim 1, characterized in that: The UAV and unmanned vehicle load air defense alarm collaborative dispatch model includes: With the goal of minimizing the weighted sum of total task completion time and total delay time, the objective function is established: minf=ω1·T 总 +ω2·D 总 (1) In formula (1), T 总 represents the total task completion time, D 总 represents the total delay time, ω1 and ω2 represent weight coefficients; Create a constraint function: Assign each task to at least one drone or unmanned vehicle. In formula (2), x ij With y il is a 0-1 variable, x ij It means that when task w i 1 when assigned to a drone, otherwise 0, y il Indicates that when task ω i It is 1 when assigned to an unmanned vehicle, otherwise it is 0. W represents the set of all tasks, m represents the number of drones, and p represents the number of unmanned vehicles; The number of drones and unmanned vehicles assigned to a mission does not exceed the total number of missions. The arrival time of the alarm for each area must be within the specified time window. In formula (4), a i represents the i-th region that performs task a, e i , k i Indicates area a i The lower limit of the time window and the upper limit of the time window; The path length of drones and unmanned vehicles is less than the maximum range or trip. In formula (5), and Respectively represent the current drone u j The length of the path traveled and the unmanned vehicle v l The length of the path traveled, and Represent the maximum range of UAVs and unmanned vehicles respectively, U represents the set of all UAVs, U represents the set of all unmanned vehicles, and V represents the set of all unmanned vehicles; The energy consumption of drones and autonomous vehicles does not exceed the capacity of their batteries. In formula (6), and It represents the energy consumed by drones and unmanned vehicles during mission execution. and Indicates the battery capacity of drones and unmanned vehicles; High-priority tasks can be assigned first. P(a i )≥max[P(a1),P(a2),…P(a n )]·λ (7) In formula (7), P(a i ) represents area a i Task priority situation; Ability to quickly reassign tasks when tasks fail or circumstances change, In formula (8), R represents the set of all regions that need to perform tasks; Drones and unmanned vehicles maintain a certain safety distance from obstacles during missions. In formula (9), O represents the obstacle set, r0 represents the safety distance of area r; When performing a mission, the load carried by each drone and unmanned vehicle shall not exceed its own maximum load capacity. In formula (10), For task w i The load, For drone u j The carrying capacity, For driverless cars l The load bearing capacity; Limitations on the range and quality of communications between drones and autonomous vehicles and with the control center, In formula (11), For drone u j or driverless car l Communication distance to the control center.
3. The method for optimizing the air defense alarm cooperative operation path of a UAV and an unmanned vehicle according to claim 1, characterized in that: The improved lion group optimization algorithm is used to solve the coordinated scheduling model of the UAV and the unmanned vehicle load air defense alarm, including: Use the Sweep method to assign initial tasks to all drones and unmanned vehicles and build an initial coordinated scheduling plan for drones and unmanned vehicles; Using the initialized UAV and UGV collaborative scheduling scheme, calculate the path cost, time window constraint satisfaction, and task priority satisfaction of each UAV and UGV; The lion group optimization algorithm is used to optimize the initialized UAV and unmanned vehicle collaborative scheduling scheme, and update the task allocation and path planning scheme of UAV and unmanned vehicle; Discretize the optimization results of the lion group optimization algorithm to solve the optimal path for each drone and unmanned vehicle, comprehensively consider the path length, energy consumption and time window constraints, and add congestion penalty costs; Use a multi-operator update mechanism to destroy, repair and reconstruct the coordinated scheduling scheme of drones and unmanned vehicles in the current population, enhancing the algorithm's global search capability and local search accuracy; Calculate the fitness value of each scheduling scheme, calculate the weighted sum of task completion time and total delay time, and whether the constraints are met; Repeat the optimization steps using the Lion Group Optimization Algorithm until the preset maximum number of iterations is reached or the stopping condition is met; Output the coordinated scheduling plan for target UAVs and unmanned vehicles, including task allocation, path planning and time scheduling.
4. The method for optimizing the air defense alarm cooperative operation path of a UAV and an unmanned vehicle according to claim 3 is characterized in that: The Sweep method is used to assign initial tasks to all drones and unmanned vehicles, including: Use the basic steps of the Sweep method to assign the tasks to be assigned to the drone and the unmanned vehicle; Use the Sweep method to continuously adjust and optimize parameters according to the range and step size of the variables, create a diverse set of initial solutions, and improve the collaborative efficiency of drones and unmanned vehicles; Perform a step-by-step scan across all mission areas to calculate the impact of different starting positions on the time and path length of the drone or vehicle to reach the designated alert area; Observe the relationship between speed changes and energy consumption and task completion efficiency, and adjust the flight speed parameters of the UAV and the driving speed parameters of the unmanned vehicle; Scan the traffic conditions, traffic congestion levels and road distances of different roads to determine the impact on the driving route parameters of the unmanned vehicle and determine the current preferred driving route; Set different altitude ranges for scanning, observe the impact of flight altitude on signal propagation range and strength, as well as energy consumption, and adjust the flight altitude parameters of the drone; Then scan different flight altitudes, observe the interference of terrain and building factors on signal propagation, and adjust the flight altitude parameters of the drone; Scan the quality of different types of air defense alarm devices, determine the number and type of air defense alarm devices that drones and unmanned vehicles can carry, and adjust the load capacity parameters; The following formula is used for calculation in the above scanning process: P i,k =l i +k·s i k=1,2,…,K i (18) In formula (18), P i,k represents the value of the i-th parameter at the k-th step, l i Represents a variable, s i is the step length, K i is the parameter P i The number of times a value can be taken.
5. The method for optimizing the air defense alarm cooperative operation path of a UAV and an unmanned vehicle according to claim 3, characterized in that: The lion group optimization algorithm is used to optimize the initialized UAV and unmanned vehicle collaborative scheduling scheme, including: Determine the population size of the initial UAV and AV collaborative scheduling solution; Calculate the fitness values of individuals in the population and divide them into groups of lion kings, lionesses, and lion cubs; Discretize the lion's position and update the positions of the lion king, lionesses, and lion cubs.
6. The method for optimizing the air defense alarm cooperative operation path of a UAV and an unmanned vehicle according to claim 3, characterized in that: The discretization processing of the optimization result of the lion group optimization algorithm includes: The initial UAV and UGV task allocation and path planning schemes combine the position of one UAV with the flight path of another UAV, or exchange the route of one UGV with the load allocation of another UGV, thereby generating a new scheduling scheme, as shown below: In formula (19), represents the scheduling plan for the i-th lion individual in the t-th iteration, represents the scheduling plan of a random lion in the tth iteration, It represents the scheduling plan of the optimal lion king individual in the tth iteration. Cross1 and Cross2 represent two different update mechanisms. The Cross1 update mechanism pays more attention to the diversity of the population. By exchanging information with the distribution plan of the random population, it expands the solution space of the algorithm, improves the diversity of the population, and also strengthens the global search ability of the algorithm. The Cross2 update mechanism pays more attention to the local search ability. The distribution plan in the lion group exchanges information with the optimal scheduling plan, thereby improving the local search ability and search speed of the algorithm.
7. The method for optimizing the air defense alarm cooperative operation path of a UAV and an unmanned vehicle according to claim 3, characterized in that: The multi-operator update mechanism is used to destroy and repair the coordinated scheduling scheme of drones and unmanned vehicles in the current population, including: A gradient-based update strategy is used to guide the search to quickly move toward the optimal solution, while a random mutation strategy is combined to increase the diversity of the population and avoid falling into a local optimal solution. Through the carefully designed operator combination, populations with different characteristics are obtained to adapt to the task allocation and path planning optimization problems of drones and unmanned vehicles; When faced with areas with complex terrain, operators that focus on exploring new paths are added to find more suitable driving routes.
8. The method for optimizing the air defense alarm cooperative operation path of a UAV and an unmanned vehicle according to claim 1, characterized in that: The positions of the UAV and the unmanned vehicle are expressed using multi-dimensional coordinates, including: The multi-dimensional coordinates of drones and unmanned vehicles include the departure point, mission area, set of tasks performed, mission priorities, and physical constraints; The task set is defined as W = {w i |i=1,2,…,n}, corresponding to all tasks to be performed; the set of drones is defined as U={u j |j=1,2,…,m}, corresponding to all drones; the set of unmanned vehicles is defined as V={v l |l=1,2,…,p}, corresponding to all unmanned vehicles; the set of all mission areas is defined as R={r i |i=1,2,…,q}, represents all areas where alarm tasks need to be executed; Define P(a i ) is area a i The task priority is defined UAV j Arrive at i Time, driverless car v l Arrive at i time, e i , k i Area a i The lower limit of the time window and the area a i The upper limit of the time window; Physical limitations of drones and autonomous vehicles, definitions and are the maximum ranges of drones and unmanned vehicles, respectively. and The current drone u j The length of the path traveled, the unmanned vehicle v l Length of the path traveled; Definition and For the battery capacity of drones and unmanned vehicles, and It is the energy consumed by drones and unmanned vehicles during mission execution; Definition For task w i The load, For drone u j The load-bearing weight, For driverless cars l When allocating tasks and planning routes, it is necessary to reasonably allocate the equipment and materials required for the tasks and reserve a carrying capacity to deal with emergencies. The communication range and quality between drones and unmanned vehicles and the control center are also limited. It is necessary to ensure that they travel within the communication range and avoid entering the communication blind spot. For drone u j and driverless cars l Communication distance to the control center.
9. A drone and unmanned vehicle air defense alarm collaborative operation path optimization system, characterized in that: The air defense alarm collaborative operation path optimization system of the UAV and the unmanned vehicle includes: A memory, a processor, and a program for optimizing the collaborative operation path of an air defense alarm between a drone and an unmanned vehicle, which is stored in the memory and can be run on the processor. When the program for optimizing the collaborative operation path of an air defense alarm between a drone and an unmanned vehicle is executed by the processor, the steps of the method for optimizing the collaborative operation path of an air defense alarm between a drone and an unmanned vehicle as described in any one of claims 1 to 8 are implemented.
10. A computer-readable storage medium, characterized in that: The computer-readable storage medium stores a program for optimizing the collaborative operation path of air defense alarms between drones and unmanned vehicles. When the program for optimizing the collaborative operation path of air defense alarms between drones and unmanned vehicles is executed by a processor, the steps of the method for optimizing the collaborative operation path of air defense alarms between drones and unmanned vehicles as described in any one of claims 1 to 8 are implemented.
Citation Information
Patent Citations
Unmanned aerial vehicle cluster cooperative task planning method for air maneuvering combat
CN112130581A
Unmanned aerial vehicle control method and device, equipment and storage medium
CN112947531A
Scheduling optimization method and system based on cooperative distribution of vehicle and unmanned aerial vehicle
CN116384606A
Sounding reference signal power control with non-scheduling downlink control information
WO2022216757A1
AU2020101065A4
Cited By
Task planning method and system for man-machine hybrid cluster
CN119358786A
Unmanned aerial vehicle-unmanned vehicle joint trajectory optimization method, system, medium and equipment
CN119514831A
Unmanned aerial vehicle-unmanned vehicle system cooperative target detection method and system and application thereof
CN120708188A
