CN117647997A - Knowledge bidirectional migration unmanned aerial vehicle collaborative track local re-planning method and system - Google Patents
Knowledge bidirectional migration unmanned aerial vehicle collaborative track local re-planning method and system Download PDFInfo
- Publication number
- CN117647997A CN117647997A CN202410116123.5A CN202410116123A CN117647997A CN 117647997 A CN117647997 A CN 117647997A CN 202410116123 A CN202410116123 A CN 202410116123A CN 117647997 A CN117647997 A CN 117647997A
- Authority
- CN
- China
- Prior art keywords
- unmanned aerial
- aerial vehicle
- knowledge
- planning
- representing
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 64
- 238000013508 migration Methods 0.000 title claims abstract description 63
- 230000005012 migration Effects 0.000 title claims abstract description 63
- 230000002457 bidirectional effect Effects 0.000 title claims abstract description 26
- 238000000926 separation method Methods 0.000 claims abstract description 59
- 238000004422 calculation algorithm Methods 0.000 claims abstract description 19
- 238000013459 approach Methods 0.000 claims description 16
- 239000011159 matrix material Substances 0.000 claims description 15
- 230000008569 process Effects 0.000 claims description 14
- 238000006757 chemical reactions by type Methods 0.000 claims description 9
- 239000000446 fuel Substances 0.000 claims description 9
- 230000004044 response Effects 0.000 claims description 9
- 238000010276 construction Methods 0.000 claims description 7
- 101100134058 Caenorhabditis elegans nth-1 gene Proteins 0.000 claims description 6
- 238000004364 calculation method Methods 0.000 claims description 6
- 238000012544 monitoring process Methods 0.000 claims description 6
- 238000001303 quality assessment method Methods 0.000 claims description 6
- 230000003044 adaptive effect Effects 0.000 claims description 4
- 238000013461 design Methods 0.000 claims description 4
- 230000001133 acceleration Effects 0.000 claims description 3
- 238000000605 extraction Methods 0.000 claims description 3
- 230000035772 mutation Effects 0.000 claims description 3
- 238000012545 processing Methods 0.000 claims description 3
- 238000013441 quality evaluation Methods 0.000 claims description 3
- 238000012546 transfer Methods 0.000 claims description 3
- 230000001960 triggered effect Effects 0.000 claims description 3
- 230000010485 coping Effects 0.000 abstract description 4
- 230000006870 function Effects 0.000 description 14
- 230000008859 change Effects 0.000 description 5
- 238000010586 diagram Methods 0.000 description 4
- 238000001514 detection method Methods 0.000 description 3
- 238000005516 engineering process Methods 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 238000004088 simulation Methods 0.000 description 2
- 238000006467 substitution reaction Methods 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000006243 chemical reaction Methods 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 230000007246 mechanism Effects 0.000 description 1
- 239000002245 particle Substances 0.000 description 1
- 230000002688 persistence Effects 0.000 description 1
- 230000003068 static effect Effects 0.000 description 1
- 230000009466 transformation Effects 0.000 description 1
Classifications
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02T—CLIMATE CHANGE MITIGATION TECHNOLOGIES RELATED TO TRANSPORTATION
- Y02T10/00—Road transport of goods or passengers
- Y02T10/10—Internal combustion engine [ICE] based vehicles
- Y02T10/40—Engine management systems
Landscapes
- Control Of Position, Course, Altitude, Or Attitude Of Moving Bodies (AREA)
Abstract
The invention belongs to the field of unmanned path planning, in particular relates to a method and a system for planning a cooperative track local re-plan of an unmanned plane with knowledge bidirectional migration, and aims to solve the problems that the existing unmanned plane path planning has insufficient capability for coping with complex dynamic environments and cannot meet the real-time performance of coping with emergencies. The invention comprises the following steps: when the coarse position and threat value of the mobile threat source are detected to meet the unmanned aerial vehicle angle obstacle avoidance judging condition, constructing a reference point space based on the unmanned aerial vehicle and the task point tangent plane, acquiring multiple separation spaces through a space separation method based on the reference point space, and further determining the fine position of the mobile threat source; and generating a plurality of unmanned aerial vehicle distribution initial schemes through a differential evolution algorithm, and acquiring an unmanned aerial vehicle optimal planning scheme through a knowledge bidirectional migration method. According to the distribution scheme with better convergence in the initial distribution scheme, the invention provides a strategy of knowledge bidirectional migration, and improves the planning efficiency of the planning system.
Description
Technical Field
The invention belongs to the field of unmanned path planning, and particularly relates to a method and a system for collaborative track local re-planning of an unmanned plane with knowledge bidirectional migration.
Background
Along with the rapid development of unmanned aerial vehicle technology, unmanned aerial vehicle has lower cost, stronger intelligence and better flexibility for unmanned aerial vehicle has obtained very extensive application, for example: enemy information detection, target persistence detection, electronic adversary of enemy and other fields. But at the same time comes with two important difficulties: 1) The unmanned aerial vehicle processes some complex tasks together through a cooperative technology, so that the execution efficiency of the unmanned aerial vehicle planning system is lower and lower; 2) The working scene of the unmanned aerial vehicle is more and more complex, and particularly the influence of the dynamic environment on the unmanned aerial vehicle track causes the initial track of the unmanned aerial vehicle to fail. Aiming at the collaborative flight path planning of multiple unmanned aerial vehicles in a dynamic environment, the prior art often considers the influence of a two-dimensional plane threat source on the flight path planning of the multiple unmanned aerial vehicles, and ignores the real-time influence of ordinate data on the unmanned aerial vehicles; meanwhile, in the planning process, the unmanned aerial vehicles are often regarded as one particle, the change of the relative position and the relative speed between the unmanned aerial vehicles in the three-dimensional space along with time is ignored, and then the unmanned aerial vehicles cannot perform real-time obstacle avoidance detection; finally, the change of the dynamic environment greatly affects the collaborative track planning of the unmanned aerial vehicle, and the initial track cannot be used as a reference in a transformation time period. Therefore, the method has important significance in researching the problem of local re-planning of the collaborative flight path of the multiple unmanned aerial vehicles in the three-dimensional dynamic environment.
Disclosure of Invention
In order to solve the problems in the prior art, namely that the existing unmanned aerial vehicle path planning has insufficient capability of coping with complex dynamic environments and cannot meet the problem of real-time coping with emergencies, the invention provides a method for collaborative flight path local re-planning of an unmanned aerial vehicle with knowledge bidirectional migration, which comprises the following steps:
step S1, acquiring the position of each unmanned aerial vehicle, and constructing a unmanned aerial vehicle discrete model;
monitoring the coarse position and threat value of the mobile threat source in real time;
s2, constructing unmanned aerial vehicle angle obstacle avoidance judging conditions based on the unmanned aerial vehicle discrete model, further determining a rapid reaction type obstacle avoidance strategy, and setting constraint conditions and an objective function;
step S3, when the coarse position and threat value of the mobile threat source are detected to meet the unmanned plane angle obstacle avoidance judging condition, constructing a reference point space based on the unmanned plane and the task point tangent plane, acquiring multiple separation spaces through a space separation method based on the reference point space, and further determining the fine position of the mobile threat source;
step S4, constructing a road-finding vertical section based on the fine position of the mobile threat source and the position of the current unmanned aerial vehicle, and generating a plurality of unmanned aerial vehicle distribution initial schemes meeting an objective function and a quick response obstacle avoidance strategy through a differential evolution algorithm and under constraint conditions;
And S5, acquiring an optimal planning scheme of the unmanned aerial vehicle by a knowledge bidirectional migration method based on the initial scheme of the unmanned aerial vehicle distribution, and taking the optimal planning scheme as a local re-planning path.
Further, the unmanned aerial vehicle discrete model comprises:
the unmanned aerial vehicle position, the unmanned aerial vehicle speed, the unmanned aerial vehicle relative position and the unmanned aerial vehicle relative included angle;
wherein, unmanned aerial vehicle position is:
；
indicating the position of the ith unmanned aerial vehicle at any time t,/>Indicating the position of the x-axis of the ith unmanned aerial vehicle in any t moment space, +.>Indicating the position of the y-axis of the ith unmanned aerial vehicle in the arbitrary t moment space, +.>Indicating the z-axis position of the ith unmanned aerial vehicle in any t moment space, +.>Representing a transpose;
the speed of the unmanned aerial vehicle is as follows:
；
indicating the speed of the ith unmanned aerial vehicle at any time t,/>Indicating the speed of the ith unmanned aerial vehicle in the x direction at any t moment, +.>Indicating the speed of the ith unmanned aerial vehicle in the y direction at any t moment, +.>The speed of the ith unmanned aerial vehicle in the z direction at any t moment is represented;
the unmanned aerial vehicle position at the next time t+1 is:
；
indicating the position of the ith unmanned aerial vehicle at time t+1,/for>Representing a real-time state matrix of the unmanned aerial vehicle, +.>Representing an input matrix +. >The control quantity of the ith unmanned aerial vehicle at the time t is represented; the real-time state matrix of the unmanned aerial vehicle comprises speed and acceleration; the input matrix is an instruction of the control quantity to the unmanned aerial vehicle;
the relative positions of the unmanned aerial vehicle are as follows:
；
indicating the initial moment +_>Indicating that the ith unmanned aerial vehicle and the jth unmanned aerial vehicle are at initial time +.>Is (are) relative to one another>Indicating that the ith unmanned aerial vehicle and the jth unmanned aerial vehicle are at initial time +.>Relative speed of>Represents the i-th unmanned aerial vehicle initial moment +.>Is (are) located>Represents the initial moment of the jth unmanned plane +.>Is (are) located>Represents the i-th unmanned aerial vehicle initial moment +.>Is (are) located>Represents the initial moment of the jth unmanned plane +.>Is a speed of (2);
the relative positions of unmanned aerial vehicles with the running time approaching 0 infinitely are as follows:
；
represents the amount of time that is infinitely approaching 0, +.>Indicating that the run time is infinitely approaching 0,representing the position of the ith unmanned aerial vehicle when the running time approaches 0 infinitely, +.>The position of the jth unmanned aerial vehicle when the running time approaches 0 infinitely is shown, and the unmanned aerial vehicle flies at a constant speed when the running time approaches 0 infinitely;
the relative positions of unmanned aerial vehicles with the running time approaching 0 infinitely are as follows:
；
representing the relative positions of the ith unmanned aerial vehicle and the jth unmanned aerial vehicle when the running time approaches 0 infinitely;
The included angle between unmanned aerial vehicle is:
；
represents the included angle between the ith unmanned aerial vehicle and the jth unmanned aerial vehicle at any t moment,/>Representing the norm.
Further, the unmanned aerial vehicle angle obstacle avoidance judging condition specifically comprises:
when (when)In the case of->Judging that the ith unmanned aerial vehicle and the jth unmanned aerial vehicle are far away in different directions;
when (when)In the case of->Judging that the ith unmanned aerial vehicle and the jth unmanned aerial vehicle approach in the same direction, and triggering an obstacle avoidance strategy;
setting a safety distance:
；
；
；
represents the safety distance between the ith unmanned aerial vehicle and the jth unmanned aerial vehicle at any moment t,/>Representing the number of drones.
Further, the fast reaction type obstacle avoidance strategy specifically comprises the following steps:
the fast reaction type obstacle avoidance strategy triggered according to the unmanned aerial vehicle angle obstacle avoidance judging condition is as follows:
when the safety distance is satisfiedWhen the collision risk exists, the collision risk is indicated;
in the flight process, the control rules of all unmanned aerial vehicles are the same and are in a flight state with inertia, and any two unmanned aerial vehicles jointly adjust the sum of flight angles：
；
The design of the fast reactive obstacle avoidance strategy of the ith unmanned aerial vehicle is as follows:
；
representing the unmanned aerial vehicle course control factor:
；
when the relative position of any two unmanned aerial vehicles is smaller than the safe distance And changing the original flight track by the fast reactive obstacle avoidance strategy of the ith unmanned aerial vehicle until the safety distance is met.
Further, the objective function specifically includes:
；
wherein,indicating the fuel consumption of all unmanned aerial vehicle tracks, +.>The time for the unmanned aerial vehicle to complete the flight path is indicated,represents the voyage cost of the unmanned aerial vehicle,Nrepresenting the number of unmanned aerial vehicles, k representing the time period between arrival of unmanned aerial vehicles at the mission point, +.>Representing unmanned plane slave->Time position fly to->Fuel consumption at the time point,/, and>representing from->Time position fly to->Time of day position actual time,/->Representing from->Time position fly to->The actual flight distance of the moment position.
Further, the constraint condition includes:
speed control constraint of unmanned aerial vehicle in three-dimensional direction:
；
representing the integrated speed of the ith unmanned aerial vehicle in the three-dimensional environment at time t,/for the unmanned aerial vehicle>Representing the absolute value of the speed of the ith unmanned aerial vehicle in the x direction at time t, +.>Representing the absolute value of the speed of the ith unmanned aerial vehicle in the y direction at time t, +.>Representing the absolute value of the speed of the ith unmanned aerial vehicle in the z direction at time t, +.>Representing the speed limit of the unmanned aerial vehicle in the x-direction, < >>Representing the speed of the unmanned aerial vehicle in the y-direction，/>Representing the speed limit of the drone in the z direction.
Further, the multiple separation space is obtained by a method comprising:
a1, constructing a rectangular space perpendicular to the ground as a reference point space, wherein two opposite planes perpendicular to the ground of the reference point space are marked as a first tangent plane and a second tangent plane, the position of the first tangent plane is determined by the position of the unmanned aerial vehicle, the position of a position task point of the second tangent plane is determined, the reference point space is { reference point 1, reference points 2, …, reference point 8}, and the reference points are 8 vertexes of the reference point space;
step A2, based on the reference point space, performing halving from the longer side of the reference point space to obtain 2 first separation spaces:
；
representing the euclidean distance between two reference points;
step A3, determining threat values of two first separation spaces according to the coarse position of the mobile threat source, and judging the first separation space where the mobile threat source is located;
the number of times of separation of the space n is 2 at this time;
step A4, selecting an nth-1 separation space where the mobile threat source is located, and carrying out dichotomy on the longer side of the nth-1 separation space to obtain 2 nth separation spaces:
step A5, determining threat values of two nth separation spaces according to the coarse position of the mobile threat source, and judging the nth separation space where the mobile threat source is located;
Repeating the steps A4 to A5 until the separation cannot be continued or the maximum division times are reached;
a mobile threat source fine location is obtained.
Further, the method comprises the steps of,
the road searching vertical section specifically comprises:
based on the multiple separation spaces and the fine positions of the mobile threat sources, the current position and the task point position of the unmanned aerial vehicle are passed through to make an initial path-finding vertical tangent planeDetermining key node->；
Judging the initial road-finding vertical sectionWhether overlap exists with the nth separation space where the mobile threat source fine position is located;
if there is overlap, the n-th separation space where the fine position of the mobile threat source is located is separated from the initial road-finding vertical sectionThe nearest reference point is used as a stage node, the current position and the task point position of the unmanned aerial vehicle are divided into beta stages by the stage node, the beta stage node is used as the end point of the beta stage and the starting point of the beta+1st stage, and a plurality of road searching vertical sections are constructed;
constructing a rotatable coordinate system based on each road-finding vertical sectionThe road searching vertical sectionThe rotation angle is changed in the rotatable coordinates.
Further, the knowledge bidirectional migration specifically includes:
generating a plurality of multi-unmanned aerial vehicle distribution initial schemes through a differential evolution algorithm;
Determining multiple unmanned aerial vehicle allocation initial scheme setsWhereinpRepresenting preliminary trajectory planning execution schemesSequence numbers of each execution scheme in the set;
the method comprises the steps of distributing three candidate track schemes randomly from a plurality of unmanned aerial vehicles according to an initial scheme, and according to unmanned aerial vehicle sequences:task point sequence、Andthe sequences are crossed, mutated, differenced and selected to obtain a new task point sequence after crossing +.>；
According to the new task point sequenceJudging an allocation identifier; the identifier represents the rationality of the post-difference allocation sequence; an identifier of 0 indicates that the allocation scheme is unreasonable, and an identifier of 1 indicates that the allocation scheme is reasonable;
if the identifier is 0, the allocation scheme is unreasonable, and at the moment, unreasonable task point sequences are covered in sequence by adopting a positive sequence ordering mutation operator to obtain a new multi-unmanned aerial vehicle allocation scheme;
representing the new multi-unmanned aerial vehicle allocation scheme as knowledge K;
the knowledge K comprises the shortest track of the initial scheme of the multi-unmanned aerial vehicle distributionShortest planning timeAnd minimal fuel consumption->；
Local of multi-unmanned aerial vehicle cooperative trackThe re-planned task is expressed as3 represents the number of tasks;
the initial scheme is distributed to each unmanned aerial vehicle through the knowledge K and task representation of the multi-unmanned aerial vehicle collaborative track local re-planning to carry out scheme quality assessment, and a quality assessment result is obtained;
Based on the quality evaluation result, adjusting an evolution strategy of a differential evolution algorithm, and distributing tasks to a plurality of task solvers;
performing multi-task calculation through a plurality of task solvers to construct a new allocation scheme;
the multitasking computation includes:
solving the task of the multi-unmanned aerial vehicle collaborative track local re-planning of each multi-unmanned aerial vehicle allocation initial scheme through a plurality of task solvers, and simultaneously calculating the crowding distance Dis:
；
wherein,represents the p-th knowledge->And (q) th knowledge>Euclidean distance minimum of (c);represents the p-th knowledge->And (q) th knowledge>Euclidean distance maximum value (x);
based on the crowding distance, the minimum knowledge of Dis is reserved in the current task solver, and the rest knowledge is uploaded to a central processor through a knowledge migration method;
the knowledge migration comprises knowledge extraction, adaptive knowledge generation and knowledge bidirectional migration;
the bidirectional migration of the knowledge comprises the steps that each reserved knowledge K is uploaded to a cloud server, the cloud server performs balance solver and knowledge migration, balances a plurality of task sources, determines the migration strength of each knowledge source, and migrates the corresponding knowledge to each task solver;
After the knowledge migration is completed, updating the knowledge transfer probability of the current task and the source task selection probability;
and solving by the current task solver to obtain an optimal planning scheme.
In another aspect of the present invention, a system for collaborative track local re-planning for an unmanned aerial vehicle with knowledge bi-directional migration is provided, the system comprising:
the discrete model construction module is used for acquiring the position of each unmanned aerial vehicle and constructing a unmanned aerial vehicle discrete model;
monitoring the coarse position and threat value of the mobile threat source in real time;
the obstacle avoidance strategy construction module is used for constructing unmanned aerial vehicle angle obstacle avoidance judging conditions based on the unmanned aerial vehicle discrete model so as to determine a quick response type obstacle avoidance strategy, and setting constraint conditions and an objective function;
the mobile threat source space reconstruction module is used for constructing a reference point space based on the plane tangent to the unmanned plane and the task point when detecting that the coarse position and the threat value of the mobile threat source meet the unmanned plane angle obstacle avoidance judging condition, acquiring a plurality of separation spaces through a space separation method based on the reference point space, and further determining the fine position of the mobile threat source;
the initial allocation scheme generation module is used for constructing a road-finding vertical section based on the fine position of the mobile threat source and the position of the current unmanned aerial vehicle, and generating a plurality of unmanned aerial vehicle allocation initial schemes meeting an objective function and a quick response obstacle avoidance strategy through a differential evolution algorithm and under constraint conditions;
And the local re-planning path generation module is used for acquiring an optimal planning scheme of the unmanned aerial vehicle by a knowledge bidirectional migration method based on the initial scheme allocated by the unmanned aerial vehicles, and taking the optimal planning scheme as a local re-planning path.
The invention has the beneficial effects that:
(1) According to the unmanned aerial vehicle angle obstacle avoidance judging method and the rapid reaction type obstacle avoidance method, through an unmanned aerial vehicle discrete model, the change of the relative position and the relative speed between unmanned aerial vehicles along with the change of time is fully considered.
(2) According to the invention, the initial allocation scheme of the multi-unmanned aerial vehicle collaborative track planning is obtained through iterative updating of the differential evolution algorithm, so that the planning efficiency of the planning system is improved.
(3) According to the distribution scheme with better convergence in the initial distribution scheme, the invention is defined as high-quality reference knowledge in the re-planning process, a reference knowledge updating method is determined, a strategy of knowledge bidirectional migration is provided, redundant calculation is avoided, and the planning efficiency of a planning system is improved.
Drawings
Other features, objects and advantages of the present application will become more apparent upon reading of the detailed description of non-limiting embodiments, made with reference to the following drawings, in which:
FIG. 1 is a flow diagram of a method for knowledge bi-directional migration of unmanned aerial vehicle collaborative track local re-planning;
Fig. 2 is a schematic diagram of acquiring an optimal planning scheme of an unmanned aerial vehicle by a knowledge bidirectional migration method in the embodiment of the invention;
FIG. 3 is a flow chart of a method for knowledge migration in an embodiment of the invention;
FIG. 4 is a schematic diagram of a method for determining a fine position of a mobile threat source by obtaining multiple separation spaces through a spatial separation method in an embodiment of the invention;
FIG. 5 is a schematic diagram of the construction of a vertical section of a road-finding in accordance with the present invention.
Detailed Description
The present application is described in further detail below with reference to the drawings and examples. It is to be understood that the specific embodiments described herein are merely illustrative of the invention and are not limiting of the invention. It should be noted that, for convenience of description, only the portions related to the present invention are shown in the drawings.
It should be noted that, in the case of no conflict, the embodiments and features in the embodiments may be combined with each other. The present application will be described in detail below with reference to the accompanying drawings in conjunction with embodiments.
In order to more clearly describe the method for the collaborative track local re-planning of the unmanned aerial vehicle with the knowledge bi-directional migration of the present invention, each step in the embodiment of the present invention is described in detail below with reference to fig. 1.
The method for planning the unmanned aerial vehicle collaborative track local re-planning by the knowledge bi-directional migration in the first embodiment of the invention comprises the following steps S1-S5, wherein the detailed description of each step is as follows:
step S1, acquiring the position of each unmanned aerial vehicle, and constructing a unmanned aerial vehicle discrete model;
in this embodiment, the unmanned aerial vehicle discrete model includes:
the unmanned aerial vehicle position, the unmanned aerial vehicle speed, the unmanned aerial vehicle relative position and the unmanned aerial vehicle relative included angle;
wherein, unmanned aerial vehicle position is:
；
indicating the position of the ith unmanned aerial vehicle at any time t,/>Indicating the position of the x-axis of the ith unmanned aerial vehicle in any t moment space, +.>Indicating the position of the y-axis of the ith unmanned aerial vehicle in the arbitrary t moment space, +.>Indicating the z-axis position of the ith unmanned aerial vehicle in any t moment space, +.>Representing a transpose;
the speed of the unmanned aerial vehicle is as follows:
；
indicating the speed of the ith unmanned aerial vehicle at any time t,/>Indicating the speed of the ith unmanned aerial vehicle in the x direction at any t moment, +.>Indicating the speed of the ith unmanned aerial vehicle in the y direction at any t moment, +.>The speed of the ith unmanned aerial vehicle in the z direction at any t moment is represented;
the unmanned aerial vehicle position at the next time t+1 is:
；
indicating the position of the ith unmanned aerial vehicle at time t+1,/for >Representing a real-time state matrix of the unmanned aerial vehicle, +.>Representing an input matrix +.>The control quantity of the ith unmanned aerial vehicle at the time t is represented; the real-time state matrix of the unmanned aerial vehicle comprises speed and acceleration; by a means ofThe input matrix is an instruction of the control quantity to the unmanned aerial vehicle; the input matrix refers to an instruction of the control quantity to the unmanned aerial vehicle, and if the all-zero matrix indicates that the unmanned aerial vehicle is in a static state, the flight state of the unmanned aerial vehicle in the flight process can be changed (similar to interference) by changing the input matrix;
the relative positions of the unmanned aerial vehicle are as follows:
；
indicating the initial moment +_>Indicating that the ith unmanned aerial vehicle and the jth unmanned aerial vehicle are at initial time +.>Is (are) relative to one another>Indicating that the ith unmanned aerial vehicle and the jth unmanned aerial vehicle are at initial time +.>Relative speed of>Represents the i-th unmanned aerial vehicle initial moment +.>Is (are) located>Represents the initial moment of the jth unmanned plane +.>Is (are) located>Represents the i-th unmanned aerial vehicle initial moment +.>Is (are) located>Represents the initial moment of the jth unmanned plane +.>Is a speed of (2);
the relative positions of unmanned aerial vehicles with the running time approaching 0 infinitely are as follows:
；
represents the amount of time that is infinitely approaching 0, +.>Indicating that the run time is infinitely approaching 0,representing the position of the ith unmanned aerial vehicle when the running time approaches 0 infinitely, +. >The position of the jth unmanned aerial vehicle when the running time approaches 0 infinitely is shown, and the unmanned aerial vehicle flies at a constant speed when the running time approaches 0 infinitely;
the relative positions of unmanned aerial vehicles with the running time approaching 0 infinitely are as follows:
；
representing the relative positions of the ith unmanned aerial vehicle and the jth unmanned aerial vehicle when the running time approaches 0 infinitely;
the included angle between unmanned aerial vehicle is:
；
represents the included angle between the ith unmanned aerial vehicle and the jth unmanned aerial vehicle at any t moment,/>Representing the norm.
Monitoring the coarse position and threat value of the mobile threat source in real time;
s2, constructing unmanned aerial vehicle angle obstacle avoidance judging conditions based on the unmanned aerial vehicle discrete model, further determining a rapid reaction type obstacle avoidance strategy, and setting constraint conditions and an objective function;
in this embodiment, the individuals in the multi-unmanned aerial vehicle collaborative track planning algorithm are represented by constructing individual four-tuple information, where the four-tuple information includes an unmanned aerial vehicle sequence，/>A serial number representing the unmanned aerial vehicle; task Point sequence->，/>A serial number representing a task point; estimated voyage cost of unmanned aerial vehicle and task point>，/>A sequence number representing an approximate voyage cost; threat source weight->，/>A sequence number representing threat source weight, the individual expression of which is: />。
According to the invention, through the fact that the information of the unmanned aerial vehicle cannot be fully considered by an individual in a cooperative algorithm, four tuple information of unmanned aerial vehicle track planning is constructed, each tuple information comprises the allocation sequences of the unmanned aerial vehicle and task points, and important information such as estimated course cost is estimated.
In this embodiment, the conditions for determining the obstacle avoidance angle of the unmanned aerial vehicle are specifically:
when (when)In the case of->Judging that the ith unmanned aerial vehicle and the jth unmanned aerial vehicle are far away in different directions;
when (when)In the case of->Judging that the ith unmanned aerial vehicle and the jth unmanned aerial vehicle approach in the same direction, and triggering an obstacle avoidance strategy;
setting a safety distance:
；
；
；
indicating any time tSafety distance between ith unmanned aerial vehicle and jth unmanned aerial vehicle, +.>Representing the number of drones.
When the flight distance of the two unmanned aerial vehicles is smaller than the safe distanceThe unmanned aerial vehicle control system can trigger the angle to judge to by unmanned aerial vehicle fast reaction obstacle avoidance mechanism quick change flight angle, avoided the collision between the unmanned aerial vehicle.
In this embodiment, the fast reaction type obstacle avoidance strategy specifically includes:
the fast reaction type obstacle avoidance strategy triggered according to the unmanned aerial vehicle angle obstacle avoidance judging condition is as follows:
when the safety distance is satisfiedWhen the collision risk exists between unmanned aerial vehicles, the collision risk is indicated;
in the flight process, the control rules of all unmanned aerial vehicles are the same and are in a flight state with inertia, and any two unmanned aerial vehicles jointly adjust the sum of flight angles：
；
The design of the fast reactive obstacle avoidance strategy of the ith unmanned aerial vehicle is as follows:
；
Representing the unmanned aerial vehicle course control factor:
；
when the relative position of any two unmanned aerial vehicles is smaller than the safe distanceAnd changing the original flight track by the fast reactive obstacle avoidance strategy of the ith unmanned aerial vehicle until the safety distance is met.
In this embodiment, the objective function is specifically:
；
wherein,indicating the fuel consumption of all unmanned aerial vehicle tracks, +.>The time for the unmanned aerial vehicle to complete the flight path is indicated,represents the voyage cost of the unmanned aerial vehicle,Nrepresenting the number of unmanned aerial vehicles, k representing the time period between arrival of unmanned aerial vehicles at the mission point, +.>Representing unmanned plane slave->Time position fly to->Fuel consumption at the time point,/, and>representing from->Time position fly to->Time of day position actual time,/->Representing from->Time position fly to->The actual flight distance of the moment position.
In this embodiment, the constraint condition includes:
speed control constraint of unmanned aerial vehicle in three-dimensional direction:
；
representing the integrated speed of the ith unmanned aerial vehicle in the three-dimensional environment at time t,/for the unmanned aerial vehicle>Representing the absolute value of the speed of the ith unmanned aerial vehicle in the x direction at time t, +.>Representing the absolute value of the speed of the ith unmanned aerial vehicle in the y direction at time t, +.>Representing the absolute value of the speed of the ith unmanned aerial vehicle in the z direction at time t, +. >Representing the speed limit of the unmanned aerial vehicle in the x-direction, < >>Representing the speed limit of the unmanned aerial vehicle in the y-direction, < >>Representing the speed limit of the drone in the z direction. The limiting speed of the unmanned aerial vehicle in all directions can be set according to the requirements.
Step S3, when the coarse position and threat value of the mobile threat source are detected to meet the unmanned plane angle obstacle avoidance judging condition, constructing a reference point space based on the unmanned plane and the task point tangent plane, acquiring multiple separation spaces through a space separation method based on the reference point space, and further determining the fine position of the mobile threat source;
in this embodiment, the multiple separation spaces, as shown in fig. 4, are obtained by a method including:
a1, constructing a rectangular space perpendicular to the ground as a reference point space, wherein two opposite planes perpendicular to the ground of the reference point space are marked as a first tangent plane and a second tangent plane, the position of the first tangent plane is determined by the position of the unmanned aerial vehicle, the position of a position task point of the second tangent plane is determined, the reference point space is { reference point 1, reference points 2, …, reference point 8}, and the reference points are 8 vertexes of the reference point space;
step A2, based on the reference point space, performing halving from the longer side of the reference point space to obtain 2 first separation spaces:
；
Representing the euclidean distance between two reference points;
step A3, determining threat values of two first separation spaces according to the coarse position of the mobile threat source, and judging the first separation space where the mobile threat source is located;
the number of times of separation of the space n is 2 at this time;
step A4, selecting an nth-1 separation space where the mobile threat source is located, and carrying out dichotomy on the longer side of the nth-1 separation space to obtain 2 nth separation spaces:
step A5, determining threat values of two nth separation spaces according to the coarse position of the mobile threat source, and judging the nth separation space where the mobile threat source is located;
repeating the steps A4 to A5 until the separation cannot be continued or the maximum division times are reached;
a mobile threat source fine location is obtained.
The space separation method adopted in the embodiment is different from the common simulation space grid method, and grid processing is not needed for the whole simulation space, so that the calculation efficiency is improved.
Step S4, constructing a road-finding vertical section based on the fine position of the mobile threat source and the position of the current unmanned aerial vehicle, and generating a plurality of unmanned aerial vehicle distribution initial schemes meeting an objective function and a quick response obstacle avoidance strategy through a differential evolution algorithm and under constraint conditions;
in the present embodiment of the present invention, in the present embodiment,
The road searching vertical section specifically comprises:
based on the multiple separation spaces and the fine positions of the mobile threat sources, the current position and the task point position of the unmanned aerial vehicle are passed through to make an initial path-finding vertical tangent planeDetermining key node->；
Judging the initial road-finding vertical sectionWhether overlap exists with the nth separation space where the mobile threat source fine position is located;
if there is overlap, the n-th separation space where the fine position of the mobile threat source is located is separated from the initial road-finding vertical sectionThe nearest reference point is used as a stage node, the current position and the task point position of the unmanned aerial vehicle are divided into beta stages by the stage node, and the beta stage node is used as the end point of the beta stage and the beginning of the beta+1st stageA plurality of road searching vertical sections are constructed;
constructing a rotatable coordinate system based on each road-finding vertical sectionThe road searching vertical sectionThe rotation angle is changed in the rotatable coordinates. A schematic of the vertical section constructed is shown in FIG. 5. />
And S5, acquiring an optimal planning scheme of the unmanned aerial vehicle by a knowledge bidirectional migration method based on the initial scheme of the unmanned aerial vehicle distribution, and taking the optimal planning scheme as a local re-planning path.
In this embodiment, the knowledge bidirectional migration, as shown in fig. 2, specifically includes:
Generating a plurality of multi-unmanned aerial vehicle distribution initial schemes through a differential evolution algorithm;
determining multiple unmanned aerial vehicle allocation initial scheme setsWhereinpRepresenting serial numbers of each execution scheme in the preliminary track planning execution scheme set;
the method comprises the steps of distributing three candidate track schemes randomly from a plurality of unmanned aerial vehicles according to an initial scheme, and according to unmanned aerial vehicle sequences:task Point sequence->、And->The sequences are crossed, mutated, differenced and selected to obtain a new task point sequence after crossing；
According to the new task point sequenceJudging an allocation identifier; the identifier represents the rationality of the post-difference allocation sequence; an identifier of 0 indicates that the allocation scheme is unreasonable, and an identifier of 1 indicates that the allocation scheme is reasonable; the cross-talk in this segment can produce unreasonable allocation sequences such as: the task point sequence 1 and the task point sequence 2 differ by-1, and it is obvious that the task point sequence is a value that is not allowed to appear-1, so that it is reasonable to use an allocation identifier of 0 to represent the result of cross-difference.
If the identifier is 0, the allocation scheme is unreasonable, and at the moment, unreasonable task point sequences are covered in sequence by adopting a positive sequence ordering mutation operator to obtain a new multi-unmanned aerial vehicle allocation scheme;
Representing the new multi-unmanned aerial vehicle allocation scheme as knowledge K;
the knowledge K comprises the shortest track of the initial scheme of the multi-unmanned aerial vehicle distributionShortest planning timeAnd minimal fuel consumption->；
The task of the multi-unmanned aerial vehicle collaborative track local re-planning is expressed as3 represents the number of tasks; according to task needs, the number of tasks and the observation indexes can be increased.
The initial scheme is distributed to each unmanned aerial vehicle through the knowledge K and task representation of the multi-unmanned aerial vehicle collaborative track local re-planning to carry out scheme quality assessment, and a quality assessment result is obtained;
based on the quality evaluation result, adjusting an evolution strategy of a differential evolution algorithm, and distributing tasks to a plurality of task solvers;
performing multi-task calculation through a plurality of task solvers to construct a new allocation scheme;
the multitasking computation includes:
solving the task of the multi-unmanned aerial vehicle collaborative track local re-planning of each multi-unmanned aerial vehicle allocation initial scheme through a plurality of task solvers, and simultaneously calculating the crowding distance Dis:
wherein,represents the p-th knowledge->And (q) th knowledge>Euclidean distance minimum of (c);represents the p-th knowledge->And (q) th knowledge>Euclidean distance maximum value (x);
Based on the crowding distance, the minimum knowledge of Dis is reserved in the current task solver, and the rest knowledge is uploaded to a central processor through a knowledge migration method;Dissmaller means that the corresponding knowledge provides similar but redundant information for evolution in subsequent environments, resulting in poorer diversity of the knowledge base.
Carrying out knowledge migration on the reserved knowledge K by a current task solver; the knowledge migration comprises knowledge extraction, adaptive knowledge generation and knowledge bidirectional migration;
the bidirectional migration of the knowledge comprises uploading each unreserved knowledge K to a central processor, and the central processor performs balance solver and knowledge migration, balances a plurality of task sources, determines the migration strength of each knowledge source and migrates the corresponding knowledge to each task solver;
after the knowledge migration is completed, updating the knowledge transfer probability of the current task and the source task selection probability;
and solving by the current task solver to obtain an optimal planning scheme.
The invention carries out bidirectional migration of knowledge, as shown in fig. 3, specifically comprising:
the solution of the task of the multi-unmanned aerial vehicle collaborative track local re-planning obtained by calculation of each round of multi-task solver is recorded as a generation of knowledge; for example, if the number of iterations is 1000 generations, 1000 generations of knowledge will be generated;
Storing each generation of knowledge and algorithm run time in a library;
initially, a new multi-unmanned aerial vehicle distribution scheme is obtained through a differential evolution algorithm; the method only relates to a reference allocation scheme, and does not relate to knowledge migration among tasks, and the knowledge migration probability of an initial task solver is 0;
after a new multi-unmanned aerial vehicle allocation scheme is obtained, extracting knowledge of the new multi-unmanned aerial vehicle allocation scheme and corresponding algorithm running time from a library to generate self-adaptive knowledge; the adaptive knowledge is determined according to the objective function, the unmanned plane range cost and the flight time, for example, the range distance of the optimal solution in the 1 st generation is 100km, the time is 50s, the range distance of the optimal solution in the second generation is 120km, and the time is 20s. And if the target function pursues that the unmanned aerial vehicle course distance is shortest, calling a first generation optimal solution to enter an iterative loop, and if the target function pursues that the unmanned aerial vehicle time is shortest, calling a second generation optimal solution to enter the iterative loop.
The bi-directional migration of knowledge herein involves knowledge in the library and knowledge of the current iteration update process into the next generation, and is therefore referred to as knowledge bi-directional migration. The selection probability of the update source task in fig. 3 is 1, which refers to both the reference library and the self knowledge migration.
Although the steps are described in the above-described sequential order in the above-described embodiments, it will be appreciated by those skilled in the art that in order to achieve the effects of the present embodiments, the steps need not be performed in such order, and may be performed simultaneously (in parallel) or in reverse order, and such simple variations are within the scope of the present invention.
The system for collaborative track local re-planning for unmanned aerial vehicle with knowledge bidirectional migration according to the second embodiment of the present invention includes:
the discrete model construction module is used for acquiring the position of each unmanned aerial vehicle and constructing a unmanned aerial vehicle discrete model;
monitoring the coarse position and threat value of the mobile threat source in real time;
the obstacle avoidance strategy construction module is used for constructing unmanned aerial vehicle angle obstacle avoidance judging conditions based on the unmanned aerial vehicle discrete model so as to determine a quick response type obstacle avoidance strategy, and setting constraint conditions and an objective function;
the mobile threat source space reconstruction module is used for constructing a reference point space based on the plane tangent to the unmanned plane and the task point when detecting that the coarse position and the threat value of the mobile threat source meet the unmanned plane angle obstacle avoidance judging condition, acquiring a plurality of separation spaces through a space separation method based on the reference point space, and further determining the fine position of the mobile threat source;
The initial allocation scheme generation module is used for constructing a road-finding vertical section based on the fine position of the mobile threat source and the position of the current unmanned aerial vehicle, and generating a plurality of unmanned aerial vehicle allocation initial schemes meeting an objective function and a quick response obstacle avoidance strategy through a differential evolution algorithm and under constraint conditions;
and the local re-planning path generation module is used for acquiring an optimal planning scheme of the unmanned aerial vehicle by a knowledge bidirectional migration method based on the initial scheme allocated by the unmanned aerial vehicles, and taking the optimal planning scheme as a local re-planning path.
It will be clear to those skilled in the art that, for convenience and brevity of description, the specific working process of the system described above and the related description may refer to the corresponding process in the foregoing method embodiment, which is not repeated here.
It should be noted that, in the system for collaborative track local re-planning of an unmanned aerial vehicle with knowledge bidirectional migration provided in the foregoing embodiment, only the division of each functional module is illustrated, in practical application, the foregoing functional allocation may be completed by different functional modules according to needs, that is, the modules or steps in the foregoing embodiment of the present invention are further decomposed or combined, for example, the modules in the foregoing embodiment may be combined into one module, or may be further split into a plurality of sub-modules, so as to complete all or part of the functions described above. The names of the modules and steps related to the embodiments of the present invention are merely for distinguishing the respective modules or steps, and are not to be construed as unduly limiting the present invention.
It will be clearly understood by those skilled in the art that, for convenience and brevity of description, the specific working process of the storage device and the processing device described above and the related description may refer to the corresponding process in the foregoing method embodiment, which is not repeated herein.
Those of skill in the art will appreciate that the various illustrative modules, method steps described in connection with the embodiments disclosed herein may be implemented as electronic hardware, computer software, or combinations of both, and that the program(s) corresponding to the software modules, method steps, may be embodied in Random Access Memory (RAM), memory, read Only Memory (ROM), electrically programmable ROM, electrically erasable programmable ROM, registers, hard disk, removable disk, CD-ROM, or any other form of storage medium known in the art. To clearly illustrate this interchangeability of electronic hardware and software, various illustrative components and steps have been described above generally in terms of their functionality. Whether such functionality is implemented as electronic hardware or software depends upon the particular application and design constraints imposed on the solution. Those skilled in the art may implement the described functionality using different approaches for each particular application, but such implementation is not intended to be limiting.
The terms "first," "second," and the like, are used for distinguishing between similar objects and not for describing a particular sequential or chronological order.
The terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus/apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus/apparatus.
Thus far, the technical solution of the present invention has been described in connection with the preferred embodiments shown in the drawings, but it is easily understood by those skilled in the art that the scope of protection of the present invention is not limited to these specific embodiments. Equivalent modifications and substitutions for related technical features may be made by those skilled in the art without departing from the principles of the present invention, and such modifications and substitutions will be within the scope of the present invention.
Claims (10)
1. A method for collaborative track local re-planning for unmanned aerial vehicle with knowledge bi-directional migration, the method comprising:
step S1, acquiring the position of each unmanned aerial vehicle, and constructing a unmanned aerial vehicle discrete model;
Monitoring the coarse position and threat value of the mobile threat source in real time;
s2, constructing unmanned aerial vehicle angle obstacle avoidance judging conditions based on the unmanned aerial vehicle discrete model, further determining a rapid reaction type obstacle avoidance strategy, and setting constraint conditions and an objective function;
step S3, when the coarse position and threat value of the mobile threat source are detected to meet the unmanned plane angle obstacle avoidance judging condition, constructing a reference point space based on the unmanned plane and the task point tangent plane, acquiring multiple separation spaces through a space separation method based on the reference point space, and further determining the fine position of the mobile threat source;
step S4, constructing a road-finding vertical section based on the fine position of the mobile threat source and the position of the current unmanned aerial vehicle, and generating a plurality of unmanned aerial vehicle distribution initial schemes meeting an objective function and a quick response obstacle avoidance strategy through a differential evolution algorithm and under constraint conditions;
and S5, acquiring an optimal planning scheme of the unmanned aerial vehicle by a knowledge bidirectional migration method based on the initial scheme of the unmanned aerial vehicle distribution, and taking the optimal planning scheme as a local re-planning path.
2. The method for collaborative track local re-planning for a knowledge bi-directional migration of a unmanned aerial vehicle of claim 1, wherein the unmanned aerial vehicle discrete model comprises:
The unmanned aerial vehicle position, the unmanned aerial vehicle speed, the unmanned aerial vehicle relative position and the unmanned aerial vehicle relative included angle;
wherein, unmanned aerial vehicle position is:
；
indicating the position of the ith unmanned aerial vehicle at any time t,/>Indicating the position of the x-axis of the ith unmanned aerial vehicle in any t moment space, +.>Indicating the position of the y-axis of the ith unmanned aerial vehicle in the arbitrary t moment space, +.>Indicating the z-axis position of the ith unmanned aerial vehicle in any t moment space, +.>Representing a transpose;
the speed of the unmanned aerial vehicle is as follows:
；
indicating the speed of the ith unmanned aerial vehicle at any time t,/>Indicating the speed of the ith unmanned aerial vehicle in the x direction at any t moment, +.>Indicating the speed of the ith unmanned aerial vehicle in the y direction at any t moment, +.>The speed of the ith unmanned aerial vehicle in the z direction at any t moment is represented;
the unmanned aerial vehicle position at the next time t+1 is:
；
indicating the position of the ith unmanned aerial vehicle at time t+1,/for>Representing a real-time state matrix of the unmanned aerial vehicle, +.>Representing an input matrix +.>The control quantity of the ith unmanned aerial vehicle at the time t is represented; the real-time state matrix of the unmanned aerial vehicle comprises speed and acceleration; the input matrix is an instruction of the control quantity to the unmanned aerial vehicle;
the relative positions of the unmanned aerial vehicle are as follows:
；
Indicating the initial moment +_>Indicating that the ith unmanned aerial vehicle and the jth unmanned aerial vehicle are at initial time +.>Is (are) relative to one another>Indicating that the ith unmanned aerial vehicle and the jth unmanned aerial vehicle are at initial time +.>Relative speed of>Represents the i-th unmanned aerial vehicle initial moment +.>Is (are) located>Represents the initial moment of the jth unmanned plane +.>Is (are) located>Represents the i-th unmanned aerial vehicle initial moment +.>Is (are) located>Represents the initial moment of the jth unmanned plane +.>Is a speed of (2);
the relative positions of unmanned aerial vehicles with the running time approaching 0 infinitely are as follows:
；
represents the amount of time that is infinitely approaching 0, +.>Indicating that the run time is infinitely approaching 0,/o>Representing the position of the ith unmanned aerial vehicle when the running time approaches 0 infinitely, +.>The position of the jth unmanned aerial vehicle when the running time approaches 0 infinitely is shown, and the unmanned aerial vehicle flies at a constant speed when the running time approaches 0 infinitely;
the relative positions of unmanned aerial vehicles with the running time approaching 0 infinitely are as follows:
；
representing the relative positions of the ith unmanned aerial vehicle and the jth unmanned aerial vehicle when the running time approaches 0 infinitely;
the included angle between unmanned aerial vehicle is:
；
represents the included angle between the ith unmanned aerial vehicle and the jth unmanned aerial vehicle at any t moment,/>Representing the norm.
3. The method for collaborative flight path local re-planning for unmanned aerial vehicle with knowledge bi-directional migration according to claim 2, wherein the unmanned aerial vehicle angle obstacle avoidance judging conditions specifically are:
When (when)In the case of->Judging that the ith unmanned aerial vehicle and the jth unmanned aerial vehicle are far away in different directions;
when (when)In the case of->Judging that the ith unmanned aerial vehicle and the jth unmanned aerial vehicle approach in the same direction, and triggering an obstacle avoidance strategy;
setting a safety distance:
；
；
；
represents the safety distance between the ith unmanned aerial vehicle and the jth unmanned aerial vehicle at any moment t,/>Representing the number of drones.
4. The method for collaborative flight path local re-planning for an unmanned aerial vehicle with knowledge bi-directional migration according to claim 3, wherein the fast reactive obstacle avoidance strategy specifically comprises:
the fast reaction type obstacle avoidance strategy triggered according to the unmanned aerial vehicle angle obstacle avoidance judging condition is as follows:
when the safety distance is satisfiedWhen the collision risk exists between unmanned aerial vehicles, the collision risk is indicated;
in the flight process, the control rules of all unmanned aerial vehicles are the same and are in a flight state with inertia, and any two unmanned aerial vehicles jointly adjust the sum of flight angles：
；
The design of the fast reactive obstacle avoidance strategy of the ith unmanned aerial vehicle is as follows:
；
representing the unmanned aerial vehicle course control factor:
；
when the relative position of any two unmanned aerial vehicles is smaller than the safe distanceAnd changing the original flight track by the fast reactive obstacle avoidance strategy of the ith unmanned aerial vehicle until the safety distance is met.
5. The method for collaborative flight path local re-planning for a knowledge bi-directional migration unmanned aerial vehicle according to claim 1, wherein the objective function is specifically:
；
；
wherein,indicating the fuel consumption of all unmanned aerial vehicle tracks, +.>The time for the unmanned aerial vehicle to complete the flight path is indicated,represents the voyage cost of the unmanned aerial vehicle,Nrepresenting the number of unmanned aerial vehicles, k representing the time period between arrival of unmanned aerial vehicles at the mission point, +.>Representing unmanned plane slave->Time position fly to->Fuel consumption at the time point,/, and>representing from->Time position fly to->Time of day position actual time,/->Representing from->Time position fly to->The actual flight distance of the moment position.
6. The method for collaborative flight path local re-planning for a knowledge bi-directional migration according to claim 1, wherein the constraints include:
speed control constraint of unmanned aerial vehicle in three-dimensional direction:
；
representing the integrated speed of the ith unmanned aerial vehicle in the three-dimensional environment at time t,/for the unmanned aerial vehicle>Representing the absolute value of the speed of the ith unmanned aerial vehicle in the x direction at time t, +.>Representing the absolute value of the speed of the ith unmanned aerial vehicle in the y direction at time t, +.>Representing the absolute value of the speed of the ith unmanned aerial vehicle in the z direction at time t, +. >Representing the speed limit of the unmanned aerial vehicle in the x-direction, < >>Representing the speed limit of the unmanned aerial vehicle in the y-direction, < >>Representing the speed limit of the drone in the z direction.
7. The method for collaborative flight path local re-planning for a knowledge bi-directional migration unmanned aerial vehicle according to claim 1, wherein the multiple separation spaces are obtained by a method comprising:
a1, constructing a rectangular space perpendicular to the ground as a reference point space, wherein two opposite planes perpendicular to the ground of the reference point space are marked as a first tangent plane and a second tangent plane, the position of the first tangent plane is determined by the position of the unmanned aerial vehicle, the position of a position task point of the second tangent plane is determined, the reference point space is { reference point 1, reference points 2, …, reference point 8}, and the reference points are 8 vertexes of the reference point space;
step A2, based on the reference point space, performing halving from the longer side of the reference point space to obtain 2 first separation spaces:
；
representing the euclidean distance between two reference points;
step A3, determining threat values of two first separation spaces according to the coarse position of the mobile threat source, and judging the first separation space where the mobile threat source is located;
the number of times of separation of the space n is 2 at this time;
Step A4, selecting an nth-1 separation space where the mobile threat source is located, and carrying out dichotomy on the longer side of the nth-1 separation space to obtain 2 nth separation spaces:
step A5, determining threat values of two nth separation spaces according to the coarse position of the mobile threat source, and judging the nth separation space where the mobile threat source is located;
repeating the steps A4 to A5 until the separation cannot be continued or the maximum division times are reached;
a mobile threat source fine location is obtained.
8. The method for collaborative flight path local re-planning for an unmanned aerial vehicle with knowledge bi-directional migration according to claim 7, wherein the locating a vertical section specifically comprises:
based on the multiple separation spaces and the fine positions of the mobile threat sources, the current position and the task point position of the unmanned aerial vehicle are passed through to make an initial path-finding vertical tangent planeDetermining key node->；
Judging the initial road-finding vertical sectionWhether overlap exists with the nth separation space where the mobile threat source fine position is located;
if there is overlap, the n-th separation space where the fine position of the mobile threat source is located is separated from the initial road-finding vertical sectionRecent referencesThe point is used as a stage node, the current position and the task point position of the unmanned aerial vehicle are divided into beta stages by the stage node, the beta stage node is used as the end point of the beta stage and the start point of the beta+1st stage, and a plurality of road searching vertical sections are constructed;
Constructing a rotatable coordinate system based on each road-finding vertical sectionThe road searching vertical sectionThe rotation angle is changed in the rotatable coordinates.
9. The method for collaborative flight path local re-planning for knowledge bi-directional migration of unmanned aerial vehicles according to claim 1, wherein the knowledge bi-directional migration is specifically:
generating a plurality of multi-unmanned aerial vehicle distribution initial schemes through a differential evolution algorithm;
determining multiple unmanned aerial vehicle allocation initial scheme sets
WhereinpRepresenting serial numbers of each execution scheme in the preliminary track planning execution scheme set;
the method comprises the steps of distributing three candidate track schemes randomly from a plurality of unmanned aerial vehicles according to an initial scheme, and according to unmanned aerial vehicle sequences:task Point sequence->、And->The sequences are crossed, mutated,Performing difference and selection processing to obtain new task point sequence after crossing
；
According to the new task point sequenceJudging an allocation identifier; the identifier represents the rationality of the post-difference allocation sequence; an identifier of 0 indicates that the allocation scheme is unreasonable, and an identifier of 1 indicates that the allocation scheme is reasonable;
if the identifier is 0, the allocation scheme is unreasonable, and at the moment, unreasonable task point sequences are covered in sequence by adopting a positive sequence ordering mutation operator to obtain a new multi-unmanned aerial vehicle allocation scheme;
Representing the new multi-unmanned aerial vehicle allocation scheme as knowledge K;
the knowledge K comprises the shortest track of the initial scheme of the multi-unmanned aerial vehicle distributionShortest planning time->And minimal fuel consumption->；
The task of the multi-unmanned aerial vehicle collaborative track local re-planning is expressed as
3 represents the number of tasks;
the initial scheme is distributed to each unmanned aerial vehicle through the knowledge K and task representation of the multi-unmanned aerial vehicle collaborative track local re-planning to carry out scheme quality assessment, and a quality assessment result is obtained;
based on the quality evaluation result, adjusting an evolution strategy of a differential evolution algorithm, and distributing tasks to a plurality of task solvers;
performing multi-task calculation through a plurality of task solvers to construct a new allocation scheme;
the multitasking computation includes:
solving the task of the multi-unmanned aerial vehicle collaborative track local re-planning of each multi-unmanned aerial vehicle allocation initial scheme through a plurality of task solvers, and simultaneously calculating the crowding distance Dis:
；
wherein,represents the p-th knowledge->And (q) th knowledge>Euclidean distance minimum of (c);represents the p-th knowledge->And (q) th knowledge>Euclidean distance maximum value (x);
based on the crowding distance, the minimum knowledge of Dis is reserved in the current task solver, and the rest knowledge is uploaded to a central processor through a knowledge migration method;
The knowledge migration comprises knowledge extraction, adaptive knowledge generation and knowledge bidirectional migration;
the bidirectional migration of the knowledge comprises uploading each unreserved knowledge K to a central processor, and the central processor performs balance solver and knowledge migration, balances a plurality of task sources, determines the migration strength of each knowledge source and migrates the corresponding knowledge to each task solver;
after the knowledge migration is completed, updating the knowledge transfer probability of the current task and the source task selection probability;
and solving by the current task solver to obtain an optimal planning scheme.
10. A system for collaborative track local re-planning for unmanned aerial vehicle with knowledge bi-directional migration, the system comprising:
the discrete model construction module is used for acquiring the position of each unmanned aerial vehicle and constructing a unmanned aerial vehicle discrete model;
monitoring the coarse position and threat value of the mobile threat source in real time;
the obstacle avoidance strategy construction module is used for constructing unmanned aerial vehicle angle obstacle avoidance judging conditions based on the unmanned aerial vehicle discrete model so as to determine a quick response type obstacle avoidance strategy, and setting constraint conditions and an objective function;
the mobile threat source space reconstruction module is used for constructing a reference point space based on the plane tangent to the unmanned plane and the task point when detecting that the coarse position and the threat value of the mobile threat source meet the unmanned plane angle obstacle avoidance judging condition, acquiring a plurality of separation spaces through a space separation method based on the reference point space, and further determining the fine position of the mobile threat source;
The initial allocation scheme generation module is used for constructing a road-finding vertical section based on the fine position of the mobile threat source and the position of the current unmanned aerial vehicle, and generating a plurality of unmanned aerial vehicle allocation initial schemes meeting an objective function and a quick response obstacle avoidance strategy through a differential evolution algorithm and under constraint conditions;
and the local re-planning path generation module is used for acquiring an optimal planning scheme of the unmanned aerial vehicle by a knowledge bidirectional migration method based on the initial scheme allocated by the unmanned aerial vehicles, and taking the optimal planning scheme as a local re-planning path.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202410116123.5A CN117647997B (en) | 2024-01-29 | 2024-01-29 | Knowledge bidirectional migration unmanned aerial vehicle collaborative track local re-planning method and system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202410116123.5A CN117647997B (en) | 2024-01-29 | 2024-01-29 | Knowledge bidirectional migration unmanned aerial vehicle collaborative track local re-planning method and system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN117647997A true CN117647997A (en) | 2024-03-05 |
| CN117647997B CN117647997B (en) | 2024-04-16 |
Family
ID=90049903
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202410116123.5A Active CN117647997B (en) | 2024-01-29 | 2024-01-29 | Knowledge bidirectional migration unmanned aerial vehicle collaborative track local re-planning method and system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN117647997B (en) |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108594834A (en) * | 2018-03-23 | 2018-09-28 | 哈尔滨工程大学 | One kind is towards more AUV adaptive targets search and barrier-avoiding method under circumstances not known |
| CN109144102A (en) * | 2018-09-19 | 2019-01-04 | 沈阳航空航天大学 | A kind of Path Planning for UAV based on improvement bat algorithm |
| CN110456823A (en) * | 2019-08-27 | 2019-11-15 | 北京航空航天大学 | It is a kind of to calculate the double-deck paths planning method being limited with storage capacity for unmanned plane |
| US20210088337A1 (en) * | 2019-09-20 | 2021-03-25 | Prince Sultan University | System and method for service oriented cloud based management of internet of drones |
| CN114265425A (en) * | 2021-11-30 | 2022-04-01 | 中国电子科技集团公司第五十四研究所 | Multi-rotor unmanned aerial vehicle formation anti-collision control method |
| CN116382334A (en) * | 2023-03-24 | 2023-07-04 | 西北工业大学 | Fusion optimization method for multi-unmanned aerial vehicle collaborative track planning |
| CN117454926A (en) * | 2023-10-12 | 2024-01-26 | 中兵智能创新研究院有限公司 | Unmanned cluster system evolution and feedback evolution method driven by bionic behavior paradigm |
-
2024
- 2024-01-29 CN CN202410116123.5A patent/CN117647997B/en active Active
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108594834A (en) * | 2018-03-23 | 2018-09-28 | 哈尔滨工程大学 | One kind is towards more AUV adaptive targets search and barrier-avoiding method under circumstances not known |
| CN109144102A (en) * | 2018-09-19 | 2019-01-04 | 沈阳航空航天大学 | A kind of Path Planning for UAV based on improvement bat algorithm |
| CN110456823A (en) * | 2019-08-27 | 2019-11-15 | 北京航空航天大学 | It is a kind of to calculate the double-deck paths planning method being limited with storage capacity for unmanned plane |
| US20210088337A1 (en) * | 2019-09-20 | 2021-03-25 | Prince Sultan University | System and method for service oriented cloud based management of internet of drones |
| CN114265425A (en) * | 2021-11-30 | 2022-04-01 | 中国电子科技集团公司第五十四研究所 | Multi-rotor unmanned aerial vehicle formation anti-collision control method |
| CN116382334A (en) * | 2023-03-24 | 2023-07-04 | 西北工业大学 | Fusion optimization method for multi-unmanned aerial vehicle collaborative track planning |
| CN117454926A (en) * | 2023-10-12 | 2024-01-26 | 中兵智能创新研究院有限公司 | Unmanned cluster system evolution and feedback evolution method driven by bionic behavior paradigm |
Non-Patent Citations (1)
| Title |
|---|
| 唐强, 朱志强, 王建元: "国外无人机自主飞行控制研究", 系统工程与电子技术, no. 03, 20 March 2004 (2004-03-20), pages 418 - 422 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN117647997B (en) | 2024-04-16 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Duan et al. | Dynamic discrete pigeon-inspired optimization for multi-UAV cooperative search-attack mission planning | |
| CN107169608B (en) | Distribution method and device for multiple unmanned aerial vehicles to execute multiple tasks | |
| Wan et al. | An accurate UAV 3-D path planning method for disaster emergency response based on an improved multiobjective swarm intelligence algorithm | |
| CN107145161B (en) | Flight path planning method and device for unmanned aerial vehicle to access multiple target points | |
| CN110412869B (en) | Multi-satellite cooperative space dynamic target real-time tracking method | |
| CN107103164B (en) | Distribution method and device for unmanned aerial vehicle to execute multiple tasks | |
| Gul et al. | Multi-robot space exploration: An augmented arithmetic approach | |
| Tuba et al. | Mobile robot path planning by improved brain storm optimization algorithm | |
| CN112082552A (en) | Unmanned aerial vehicle flight path planning method based on improved hybrid particle swarm optimization algorithm | |
| CN105700549A (en) | Unmanned plane multi-track planning method based on sequence ecological niche PSO (particle swarm optimization) algorithm | |
| Sujit et al. | Self assessment-based decision making for multiagent cooperative search | |
| Wei et al. | Recurrent MADDPG for object detection and assignment in combat tasks | |
| CN110162077B (en) | Unmanned aerial vehicle flight path planning method based on flying fish algorithm | |
| CN115562357B (en) | Intelligent path planning method for unmanned aerial vehicle cluster | |
| Luo et al. | A multi-scale map method based on bioinspired neural network algorithm for robot path planning | |
| CN115494873A (en) | Heterogeneous multi-unmanned aerial vehicle cooperative task allocation method based on Monte Carlo tree search architecture under time sequence constraint | |
| Riviere et al. | Neural tree expansion for multi-robot planning in non-cooperative environments | |
| Huang et al. | A novel route planning method of fixed-wing unmanned aerial vehicle based on improved QPSO | |
| CN113805609A (en) | Unmanned aerial vehicle group target searching method based on chaos lost pigeon group optimization mechanism | |
| Ryu et al. | Application of moving objects and spatiotemporal reasoning | |
| CN117647997B (en) | Knowledge bidirectional migration unmanned aerial vehicle collaborative track local re-planning method and system | |
| Yang et al. | Learning graph-enhanced commander-executor for multi-agent navigation | |
| Kong et al. | Multi-UAV simultaneous target assignment and path planning based on deep reinforcement learning in dynamic multiple obstacles environments | |
| Heidari et al. | Improved black hole algorithm for efficient low observable UCAV path planning in constrained aerospace | |
| Zu et al. | Research on UAV path planning method based on improved HPO algorithm in multi-task environment |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |