CN102901498B - Method for cooperative search and dynamic task allocation of unmanned aerial vehicle teams under uncertain environment - Google Patents

Method for cooperative search and dynamic task allocation of unmanned aerial vehicle teams under uncertain environment Download PDF

Info

Publication number
CN102901498B
CN102901498B CN201210356428.0A CN201210356428A CN102901498B CN 102901498 B CN102901498 B CN 102901498B CN 201210356428 A CN201210356428 A CN 201210356428A CN 102901498 B CN102901498 B CN 102901498B
Authority
CN
China
Prior art keywords
unmanned plane
task
tid
uid
unmanned
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.)
Active
Application number
CN201210356428.0A
Other languages
Chinese (zh)
Other versions
CN102901498A (en
Inventor
吴森堂
孙健
胡楠希
杜阳
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Beihang University
Original Assignee
Beihang University
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Beihang University filed Critical Beihang University
Priority to CN201210356428.0A priority Critical patent/CN102901498B/en
Publication of CN102901498A publication Critical patent/CN102901498A/en
Application granted granted Critical
Publication of CN102901498B publication Critical patent/CN102901498B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Landscapes

  • Control Of Position, Course, Altitude, Or Attitude Of Moving Bodies (AREA)

Abstract

The invention relates to a method for cooperative search and dynamic task allocation of unmanned aerial vehicle teams under an uncertain environment, and not only puts forward a cooperative dynamic task allocation strategy of unmanned aerial vehicle teams, but also designs a concrete guidance law. By adopting an arc air route as the air route by which unmanned aerial vehicles performing tasks, the method includes: step 1. determining the data structure of single unmanned aerial vehicle maintenance; step 2. determining the flight mode of unmanned aerial vehicles; step 3. determining the dominant function of task performing of the unmanned aerial vehicles; step 4. determining a dynamic task allocation process; and step 5. determining the guidance law of aerial vehicle search and task performing. Compared with modern optimization algorithm based task allocation methods, the method provided in the invention reduces the computation load of single unmanned aerial vehicle, and is suitable for conditions characterized by strong real-time performance and uncertain environment. Compared with market mechanism auction algorithm based task allocation methods, the method reduces the times of communication performed among unmanned aerial vehicles and the computation load of single unmanned aerial vehicle, and guarantees the real-time performance of broadcast unmanned aerial vehicles during task performing.

Description

Unmanned vehicle formation collaboratively searching under a kind of uncertain environment and dynamic task allocation method
Technical field
The unmanned vehicle that the present invention relates under a kind of uncertain environment is formed into columns and is worked in coordination with dynamic task allocation strategy, belong to flight formation Guidance and control technical field, be specifically related to the unmanned vehicle formation collaboratively searching under a kind of uncertain environment and dynamic task allocation method.
Background technology
Current had nearly more than 30 countries to drop into research and the production that a large amount of manpower and financial resources is engaged in unmanned plane.Through vicennial development, this technology comparative maturity, play in the army and the people every field and act on, however, single rack unmanned plane also exists some problems when carrying out task, and such as single rack unmanned plane may be subject to the restricted number of sensor, can not observing target area from Multi-angle omnibearing, when facing wide area search task, can not effectively cover whole region of search; If what perform is rescue task, single rack unmanned plane is restricted in load, often affects the usefulness of whole rescue, brings larger loss, in addition, once single rack unmanned plane breaks down, must interrupt task return immediately, may incur loss through delay rescue opportunity.
In recent years due to the complicacy of environment and the multiplicity of task, single rack unmanned plane cannot meet the needs of air-to-ground attack and rescue, for the above-mentioned shortcoming of single rack unmanned plane, abroad proposed in recent years multiple no-manned plane jointly carry out task concept and achieve certain achievement in research, jointly the carry out mode of task of multiple no-manned plane can significantly improve operation and the rescue usefulness of unmanned plane entirety, the ability of success ratio and the anti-accident of executing the task can be increased, based on above-mentioned advantage, the multiple no-manned plane aerial mission that jointly carries out will become an important directions of Development of UAV from now on.Wherein multiple no-manned plane works in coordination with dynamic task allocation problem is the key issue that multiple no-manned plane carries out in task jointly, this is a multiple constraint, the Complex multi-target optimization of strong coupling and decision problem in essence, be specifically related to the research fields such as unmanned plane formation communication protocol, collaboratively searching strategy, dynamic task allocation method and unmanned plane kinematics link Guidance Law Design, the quality of these designs directly affects the effect that multiple no-manned plane works in coordination with dynamic task allocation.
The concept that multiple no-manned plane works in coordination with dynamic task allocation is: carry out in task process at multiple no-manned plane, based on certain environmental knowledge and mission requirements, according to quantity or the load of unmanned plane, sequence task (target or locus point) is had for each unmanned plane distributes one or one group, to complete the task of most probable number simultaneously, the efficiency of aircraft entirety is reaching optimum.The research that multiple no-manned plane works in coordination with dynamic task allocation method grew up in recent years, more influential paper is " the Real-Time Planning for Teams ofAutonomous Vehicles in Dynamic Uncertain Environment " of the Pong Punwattana of University of Washington in 2004, and the development through nearly ten years defines following two kinds of main solutions:
Modern optimization algorithm method for allocating tasks: first the method carries out the modeling of Task Allocation Problem, take out the fitness function relevant to task matching effect, then a colony is generated, each individuality in colony represents a kind of task matching scheme, utilizes the optimum solution that in didactic decision search colony, fitness function is the highest.This method utilizes the mode of colony's rolling optimizing to search for the optimal case that multiple no-manned plane works in coordination with dynamic task allocation, and computing time is longer, is not suitable for the comparatively strong and uncertain condition of environment of real-time; And dynamic task allocation process is generally time correlation, a certain moment determines that the optimality of partition can not ensure the optimality of whole process, therefore determines that the consumption plenty of time in moment does this optimization not too large necessity a certain; The problem of research only relates to single Task Allocation Problem mostly, does not embody the feature of movable body multiple constraint, strong coupling and time correlation.The current major applications of modern optimization algorithm is in unmanned plane information and the known static task scheduling process of mission bit stream.
Agent system method: Task Allocation Problem can abstractly be at Agent system (Multi-Agent Systems, MAS) in, there is M different Agent and will perform the different task of N item, how reasonably by Agent different for task matching, thus improve the whole efficiency of system.Agent has two types usually: a kind of is cooperation, and a kind of is from profit.In the previous case, the Agent in system has common target, under centralized management mechanism, coordinate respective behavior, and System benefits is maximized; And in the latter case, Agent has oneself privately owned utility function, be used for instructing its reasoning and decision-making.Auction system based on market mechanism is the conventional method solving dynamic task allocation in Agent system method.The deficiency of this method is, in order to reach optimality, carrying out taking turns communication more, if frequently communicated in hostile area, can increase the probability that unmanned plane is found between the unmanned plane needing to represent each Agent.
Summary of the invention
Take turns the shortcoming of communication more for existing Agent system method, devise the relatively simple synergistic mechanism of one, make just can enter respective pattern (Mode) alternately by three times between unmanned plane, avoid the frequent communication issue between unmanned plane; The guidance law for unmanned aerial vehicle design, unites the coupling of Task Assigned Policy and movable body and temporal correlation, verifies the feasibility of dynamic task allocation strategy in dynamic process.
Unmanned vehicle formation collaboratively searching under uncertain environment and a dynamic task allocation method, is characterized in that: the air route adopting circular arc air route to execute the task as unmanned plane, comprises following step:
Step one: determine the data structure that single rack unmanned plane is safeguarded;
In unmanned plane is formed into columns every frame unmanned plane airborne computer in store:
(1) unmanned plane self sequence number UID;
(2) task number TID performed by each unmanned plane, when unmanned plane is in search pattern, performed by unmanned plane, task number TID is-1;
(3) mission payload that carries of unmanned plane self x is load categories; When middle all elements is 0, and now unmanned plane enters search pattern;
(4) load needed when unmanned plane performs TID task middle element represents different types of load of required by task, and when all elements is all 0, expression task completes; Under search pattern for sky;
Step 2: the offline mode determining unmanned plane;
The offline mode of unmanned plane is divided into search pattern and execution pattern, search pattern is divided into again broadcast mode and response modes, wherein, unmanned plane does not find executable task in search coverage, in communication radius, also do not have other unmanned planes to provide executable task, at this moment unmanned plane is in search pattern; In search procedure, discovery enters broadcast mode after can executing the task, and carries out mission bit stream share with other unmanned planes in communication radius; Under search pattern, if run into the broadcast of other unmanned planes in communication radius, then enter response modes.Unmanned plane finds in self investigative range can complete independently task, or enters execution pattern after response process is carried out in the broadcast receiving other unmanned planes, and now TID is adjusted to from-1 the TID executed the task by unmanned plane;
Step 3: determine the advantage function that unmanned plane is executed the task;
UID load entrained by the unmanned plane of i is made to be tID is that the task of j needs load to be uID is the unmanned plane of i dominance vector A when being the task of j relative to TID ij=[a ij1, a ij2..., a ijk..., α ijx] computing formula as follows:
k=1,2,3...x (1)
When for the UID unmanned plane that is i, to perform TID be the task of j, advantage function computing formula is as follows:
a ij = Σ k = 1 x a ijk - - - ( 2 )
Step 4: determine dynamic task allocation flow process;
If UID is the unmanned plane of i detect some tasks point, then by step 3 method obtain UID be the unmanned plane of i perform each task point time advantage function, the maximum TID of selective advantage function is the task point of j; If the maximum TID of advantage function is the task point advantage function a of j ij=0, then TID=-1, unmanned plane proceeds search or waits for that other unmanned planes are broadcasted; If the maximum TID of advantage function is the task point advantage function a of j ij≠ 0, now, the whether capable complete independently task of this unmanned plane need be judged, if advantage function a ijduring=2x, then unmanned plane enters the task that execution pattern is executed the task alone a little; If advantage function a ijduring < 2x, unmanned plane enters broadcast mode, jointly to be finished the work as a supplement j by other unmanned planes;
Step 5: determine the guidance law that aircraft is executed the task;
Make the position of any time unmanned plane for (x u, y u), unmanned plane determines the task point j of execution when A point, enter execution pattern, now A point coordinate (x a, y a), the coordinate (x of task point j o, y o), unmanned plane enters task point O along the circular arc that diameter is OA, now the unmanned plane air route radius of executing the task unmanned plane is at position (x u, y u) the desired track drift angle instruction at place:
The feedback that radius limits is added in the instruction of flight path drift angle:
Wherein, z is feedback factor to be adjusted;
The invention has the advantages that:
1, the inventive method is relative to the method for allocating tasks based on modern optimization algorithm, the mode of colony's rolling optimizing is not utilized to search for the optimal case that multiple no-manned plane works in coordination with dynamic task allocation, shorten computing time, reduce the computational load of single rack unmanned plane, be applicable to the comparatively strong and uncertain condition of environment of real-time, can be applicable in the task dynamic allocation procedure of uncertain environment;
2, the inventive method is relative to the method for allocating tasks based on market mechanism auction algorithm, reduces the number of communications of carrying out between unmanned plane, reduces the difficulty of UAV Communication Data-Link design, also improves the survival probability of executing the task in enemy-occupied area simultaneously; Secondly the optimum integer programming algorithm of NP-hard is instead of by the suboptimum PTA method of polynomial time, reduce the computational load of broadcast unmanned plane, ensure that the broadcast unmanned plane real-time of executing the task, this when unmanned plane and task point quantity larger and when executing the task and a little need load more, have very large practical significance;
3, the inventive method with existing can compared with the dynamic assignment data of reference, the solution considered a problem in the dynamic process of complex systematic dynamics, do not only give the collaborative dynamic task allocation strategy of unmanned vehicle formation, and be the concrete guidance law of this Strategy Design, in dynamic process, the computation complexity of verification method and validity, have clear and definite engineering background.
Accompanying drawing explanation
Fig. 1 is that the present invention forms into columns collaboratively searching and dynamic task allocation method overall flow figure;
Fig. 2 to form into columns the description figure that collaboratively searching and dynamic task allocation method will deal with problems for the present invention;
Fig. 3 describes the search of aircraft and the guidance law schematic diagram of task object;
Fig. 4 is the guiding schematic diagram that unmanned plane is executed the task;
Fig. 5 is the Initial situation figures of 5 frame unmanned planes when performing 6 tasks;
When Fig. 6 is for employing existing method, 5 frame unmanned planes perform each unmanned plane trajectory diagram during 6 tasks;
When Fig. 7 is for employing the inventive method, 5 frame unmanned planes perform each unmanned plane trajectory diagram during 6 tasks;
Fig. 8 is the Initial situation figures of 8 frame unmanned planes when performing 10 tasks;
When Fig. 9 is for employing existing method, 8 frame unmanned planes perform each unmanned plane trajectory diagram during 10 tasks;
When Figure 10 is for employing the inventive method, 8 frame unmanned planes perform each unmanned plane trajectory diagram during 10 tasks.
Embodiment
Unmanned vehicle formation collaboratively searching under uncertain environment and a dynamic task allocation method, as shown in Figure 1, comprise following step:
Step one: determine the data structure that single rack unmanned plane is safeguarded;
In order to completing of collaborative dynamic task allocation, need to store following data in the airborne computer of every frame unmanned plane in unmanned plane is formed into columns:
(1) unmanned plane self sequence number UID, is used for confirming the identity of each unmanned plane in unmanned plane is formed into columns, when have broadcast mode unmanned plane broadcast needed for execute the task after, response modes unmanned plane relies on No. UID source confirming broadcast message;
(2) task number TID performed by each unmanned plane, be used for identifying the current pattern be in of unmanned plane and the task that will perform, when unmanned plane is in search pattern, performed by unmanned plane, task number TID is-1;
(3) mission payload that carries of unmanned plane self represent in vector form; X is load categories, therefore it is the vector of 1 × x; Along with unmanned plane carries out task, the load of carrying constantly consumes until vectorial all elements is 0, and now unmanned plane can not perform any goal task and can only enter search pattern;
(4) load needed when unmanned plane performs TID task representing in vector form, is the vector of 1 × x, and the different elements of vector represent different types of load of required by task, constantly carry out task until when vectorial all elements is all 0, represent that this task completes with unmanned plane; This vector under search pattern for sky.
Further illustrate step one below in conjunction with Fig. 2, in figure, pentagon is unmanned plane; Blockage represents the task point on ground, can be emergency place or threat to be destroyed; Peripheral solid line great circle represents the detecting devices investigative range of each unmanned plane, unmanned plane can only find the task point in investigative range, due to unmanned plane form into columns enter this region of search time the task amount of counting to form into columns for unmanned plane with load needed for each task point be all unknown, demarcate so task matching is actual by task point position and distinguish, for convenience of description, the position of task point is represented with No. TID, task point; Suppose that the mission payload kind that the mission payload of UAV flight and impact point need is 3, the digitized representation task number TID outside the bracket of the blockage lower right corner; In bracket 1 × 3 vector for completing the load that this required by task is wanted, the different elements of vector represent different types of load, represent the quantity of various types of load in digital form, such as: expression a little 1 task of will finishing the work needs the first load 0, the second load 1, the third load 2, and load needed for task point constantly carries out task until be 0 with unmanned plane, all elements represent that this task completes when being all 0.Blockage periphery realize the effective radius that small circle represents task point, unmanned plane needs when executing the task to detect the effective radius whether entering task point, if entered, throw in corresponding mission payload, now this unmanned plane completes this task, dotted line great circle represents the communication radius between each unmanned plane, and unmanned plane can only communicate with other unmanned planes be in communication radius.Namely the present invention is unmanned vehicle formation collaboratively searching under such uncertain environment and dynamic task allocation method;
The air route executed the task as unmanned plane in circular arc air route is adopted in the present invention, the reason in this air route is selected to be, first circular arc air route not easily causes unmanned plane overload to exceed restriction when executing the task and switching, topworks is not easily saturated, so can ensure that unmanned plane enters in the circle of task effective radius accurately; Secondly unmanned plane does circular arc search, is convenient to expand hunting zone and is beneficial to find ground-based mission point.
Step 2: the offline mode determining unmanned plane;
The offline mode of unmanned plane is divided into search pattern and execution pattern, and search pattern is divided into again broadcast mode and response modes, and unmanned plane must be in one of following Three models at any time, is introduced respectively below to various pattern.
(1) search pattern (TID=-1): unmanned plane does not find executable task in search coverage, in communication radius, do not have other unmanned planes to provide executable task yet, at this moment unmanned plane is in search pattern, under this pattern, unmanned plane can carry out range searching according to predetermined search pattern, broadcast mode is entered after discovery task in search procedure, carry out information sharing with other unmanned planes in communication radius, jointly complete this task; Under search pattern, if run into the broadcast of other unmanned planes in communication radius, then enter response modes, jointly complete goal task with broadcast unmanned plane.
(2) execution pattern: unmanned plane finds in self investigative range can the task of complete independently, or the pattern entered after the broadcast receiving other unmanned planes carries out responding process, and at this moment TID is adjusted to from-1 TID executed the task by unmanned plane.
Step 3: determine the advantage function that unmanned plane is executed the task;
UID load entrained by the unmanned plane of i is made to be tID is that the task of j needs load to be uID is the unmanned plane of i dominance vector A when being the task of j relative to TID ij=[a ij1, a ij2..., a ijk..., a ijx] computing formula as follows:
k=1,2,3...x (1)
When for the UID unmanned plane that is i, to perform TID be the task of j, advantage function computing formula is as follows:
a ij = &Sigma; k = 1 x a ijk - - - ( 2 )
In above-mentioned formula (1), Superiority Value a ijkvalue reason be: work as a ijkillustrate when=2 that UID is the kth type carriers of the UAV flight of i, meet the demand of task for kth type carriers that TID is j, at this moment this unmanned plane does not need other unmanned planes to assist the kth type carriers task of a j that just can finish the work, and the Superiority Value at this moment had is 2 to the maximum; Work as a ijk=1 illustrates that UID is that to be not enough to TID be that the task point of j is to the demand of kth type carriers for the kth type carriers of the UAV flight of i, but still there is certain contribution to the demand of this task point to kth type carriers, need to broadcast to other unmanned planes in communication radius, jointly complete this task, the Superiority Value at this moment had is 1; Work as a ijkthe demand of task to kth type carriers of=0 illustrates UID to be the kth type carriers of the UAV flight of i to TID be j is not contributed, the unmanned plane that may be i due to UID does not have kth type carriers or TID to be that the task of j does not need kth type carriers, at this moment the Superiority Value of the UID unmanned plane that is i should not be greater than calling and the unmanned plane oneself that comes finds the Superiority Value that this task has, otherwise can bring between unmanned plane and communicate frequently, increase the catch probability of ground based threats;
Below in conjunction with Fig. 2, have 3 types with load, i.e. x=3, and the unmanned plane that UID is 1 detect in investigative range TID be 1 and 2 task be example, when executing the task to unmanned plane, the computing method of advantage function carry out a step explanation, wherein:
R &OverBar; 1 u = r 11 u r 12 u r 13 u = 1 2 0
R &OverBar; 1 t = r 11 t r 12 t r 13 t = 0 1 2
R &OverBar; 2 t = r 21 t r 22 t r 23 t = 2 0 1
According to formula (1) can obtain UID be 1 unmanned plane be the dominance vector of the task point of 1 to TID be A 11=[0 2 0], UID be 1 unmanned plane be the dominance vector of the task point of 2 to TID be A 12=[1 0 0], according to formula (2) can obtain UID be 1 unmanned plane be the advantage function a of the task point of 1 to TID 11=2.
Step 4: determine dynamic task allocation flow process;
As shown in Figure 3, UID is that the airborne detecting devices of the unmanned plane of i is with some cycles detection mission dot information, if detect some tasks point, then by step 3 method obtain UID be the unmanned plane of i perform each task point time advantage function, the maximum TID of selective advantage function is the task point of j; If the maximum TID of advantage function is the task point advantage function a of j ij=0, although illustrate that unmanned plane detects task point, unmanned plane institute bringing onto load has no contribution to this task, at this moment TID=-1, and unmanned plane proceeds search or waits for that other unmanned planes are broadcasted; If the maximum TID of advantage function is the task point advantage function a of j ij≠ 0, illustrate that this unmanned plane has contribution to detecting of task, select TID to be the tasks carrying of j.
After determining that performing TID is the task of j, the whether capable complete independently task of this unmanned plane need be judged, if during advantage function, then illustrate that the load entrained by this unmanned plane can not broadcast fulfilling the task all by oneself a little of task completely; If a ijduring < 2x, illustrate that this unmanned plane does not have the task ability that complete independently TID is j, then need broadcast jointly to be finished the work as a supplement j by other unmanned planes, now unmanned plane enters broadcast mode.There are 3 types to further illustrate for load, work as a ijwhen=6, a is described ijk=2, wherein N (1,3) represents the integer set of 1 to 3, and at this moment unmanned plane self load of being with just can be executed the task j, then arrange TID=j and enter execution pattern; Work as a ijduring < 6, illustrate that this unmanned plane does not have the task ability that complete independently TID is j, then need broadcast jointly to be finished the work as a supplement j by other unmanned planes;
Unmanned plane in a broadcast mode, the load of UID entrained by the unmanned plane of i execution TID is that the task of j needs load what through type (3) calculating will be broadcasted needs load vectors:
S &OverBar; ij u = [ s ij 1 u , s ij 2 u , . . . . . . , s ijk u , . . . . . . , s ijx u ] - - - ( 3 )
Wherein,
UID is the load vectors of unmanned plane by self UID and needs of i after broadcast, being in search pattern and containing broadcast vector within communication radius the unmanned plane of middle element, makes its UID be respectively n 1, n 2..., n w..., n p, all enter response modes, all the other continue to keep search pattern.Enter unmanned plane in response modes by self UID, position and entrained load information send to UID to be the unmanned plane of i, UID is that the unmanned plane information of unmanned plane to the response modes that these are collected of i is handled as follows:
1) set is set as initial sets, wherein, C ijrepresent the UID set of final response unmanned plane, represent C ijin final each response unmanned plane entrained by mission payload set;
2) determine that response modes unmanned plane arrives the estimated time of arrival (ETA) (ETA that TID is j task, Estimated Time ofArrival), can determine that when unmanned plane velocity variations is little unmanned plane enters the ETA of task point, is specially easily: set estimated time of arrival (ETA) gather as ETAs = { t n 1 , t n 2 , . . . . . . , t n w , . . . . . . , t n p } , Then:
t n w &ap; &pi;R - r V u - - - ( 4 )
Wherein, r represents the effective radius of task point, V ufor the speed of unmanned plane, the speed of unmanned plane leans on the Throttle Opening Control of unmanned vehicle engine, by Throttle Opening Control at about 50m/s; R is the air route radius that unmanned plane is executed the task;
3) estimated time of arrival (ETA) of response modes unmanned plane is sorted [N, T]=sort (ETAs), wherein T = { t n 1 * , t n 2 * , . . . . . . , t n w * , . . . . . . , t n p * } For the result after ascending sequence time of arrival, N = { n 1 * , n 2 * , . . . . . . , n w * , . . . . . . , n p * } For No. UID, corresponding unmanned plane;
4) according to N order to set C ijsupplement, use according to the order of N simultaneously right supplement, until or whole element adds to C in N ijin, suppose the response modes unmanned plane set after supplementing C ij = { n ^ 1 * , n ^ 2 * , n ^ w * , . . . . . . , n ^ q * } , q≤p;
5) C is traveled through ijin each element inspection whether be true, if very, then will from C ijmiddle rejecting, will simultaneously from middle rejecting, finally obtains the C removing redundant elements ijwith do not add to C ijthe TID of the response modes unmanned plane that neutralization is rejected is set to-1, continues to make it be in search pattern and searches for other task points, final C ijin the TID of unmanned plane be set to task j and enter execution pattern.
Pass through said method, once after unmanned plane finds the task that can perform, just can determine alternately in three communication works in coordination with the unmanned plane group executed the task and the unmanned plane continuing search pattern, such structure overcomes the shortcoming repeatedly communicated of MAS auction algorithm, has the advantages such as algorithm is simple, real-time is good.
Carry out above-mentioned 3), 4), 5) reason be in order to avoid use integer programming (Linear Programming) method determine C ij, represent 3 by the thought of integer programming), 4), 5) object as shown in the formula:
Wherein, be and C ijthe subset of corresponding T, integer programming belongs to NP-hard problem, along with unmanned plane and task quantity increase, the calculated amount of broadcast mode unmanned plane can produce shot array, therefore the shot array problem that eliminate redundancy element two steps in the sequence of the ETAs in (3) and (4) avoid integer programming to produce is used, the computing time of such broadcast mode unmanned plane can drop to sequence and reject the polynomial time of operation, be convenient to the applications that requirement of real-time is stronger, shortcoming is that result at this moment often only has suboptimality.For convenience of description, by the step of above-mentioned (1) ~ (5) referred to as PTA(PolynomialTime Algorithm) method, in order to better description of step four, following table provides the false code form of step 4:
Step 5: determine the guidance law that aircraft is executed the task;
As shown in Figure 4, for the guiding schematic diagram that unmanned plane is executed the task, unmanned plane is all in whole search procedure determines high state, so the guidance law of the search of aircraft and tasks carrying mainly designs the instruction of flight path drift angle, guarantee that each frame unmanned plane that unmanned plane is formed into columns can enter task circular arc accurately.Make the position of any time unmanned plane for (x u, y u), unmanned plane determines the task point j of execution at A point, enters execution pattern, now A point coordinate (x a, y a), the coordinate (x of task point j b, y b), now wish that unmanned plane enters task point B along the circular arc that diameter is BA, the air route radius R that now unmanned plane is executed the task is unmanned plane is at position (x u, y u) the desired track drift angle instruction at place:
Wherein, a is the angle of unmanned plane task point line and earth axes x-axis,
The feedback that radius limits is added in the instruction of flight path drift angle:
Wherein, z is feedback factor to be adjusted, is taken as 0.002 in this example.Unmanned plane is in search pattern and also can adopts such guidance law that unmanned plane is moved in a circle along the search center pre-estimated.Above-mentioned guidance law can ensure that unmanned plane enters task point along circular arc track.
Embodiment 1:
Original state when 5 frame unmanned planes perform 6 tasks as shown in Figure 5, wherein, the radius of investigation of each unmanned plane is 800 meters, communication radius is 1600 meters, in order to clear, does not mark in the drawings, when unmanned plane is in search pattern, guidance law guiding unmanned plane does the center of circle (2100,2025), radius is the circular motion of 800 meters, and this belongs to the typical case that unmanned plane number of executing the task is less than number of tasks.The initial information of 5 frame unmanned planes is as shown in the table:
The initial information of 6 task points is as shown in the table:
When adopting existing method to carry out unmanned plane task matching, unmanned plane only selects the task that in self investigative range, advantage function is maximum, does not have information interaction between unmanned plane, and 5 frame unmanned planes perform each unmanned plane track of 6 tasks as shown in Figure 6; Unmanned plane initial information is consistent with Fig. 5 with task point initial information, and UAV Communication radius is 1600 meters, radius of investigation 800 meters, and the full that carries out task needs time 200.8s.
And when adopting the inventive method to carry out unmanned vehicle formation collaboratively searching and dynamic task allocation, the strategy of three communication interactions is have employed between unmanned plane, unmanned plane initial information, task point initial information is consistent with Fig. 5 with the guidance law of search pattern, and each unmanned plane track as shown in Figure 7; UAV Communication radius is 1600 meters, radius of investigation 800 meters, and the full that carries out task needs time 109.2s.
Embodiment 2:
The inventive method is adopted to carry out 8 frame unmanned planes when performing 10 tasks, original state as shown in Figure 8, the radius of investigation of each unmanned plane is 800 meters, communication radius is 1600 meters, in order to clear, do not mark in the drawings, when unmanned plane is in search pattern, guidance law guiding unmanned plane does the center of circle (2100,2025), radius is the circular motion of 800 meters.Wherein, the initial information of 8 frame unmanned planes is as shown in the table:
The initial information of 10 task points is as shown in the table:
When adopting existing method to carry out unmanned plane task matching, unmanned plane only selects the task that in self investigative range, advantage function is maximum, does not have information interaction between unmanned plane, and each unmanned plane track when 8 frame unmanned planes perform 10 goal tasks as shown in Figure 9; Unmanned plane initial information is consistent with Fig. 6 with task point initial information, and UAV Communication radius is 1600 meters, radius of investigation 800 meters, and the full that carries out task needs time 184.8s.
And when adopting the inventive method to carry out unmanned vehicle formation collaboratively searching and dynamic task allocation, each unmanned plane track as shown in Figure 10; The strategy of three communication interactions is have employed between unmanned plane, unmanned plane initial information, task point initial information is consistent with Fig. 8 with the guidance law of search pattern, UAV Communication radius is 1600 meters, radius of investigation 800 meters, and the full that carries out task needs time 149.6s.
Can find out thus, relative to the method for allocating tasks based on modern optimization algorithm, the inventive method does not utilize the mode of colony's rolling optimizing to search for the optimal case that multiple no-manned plane works in coordination with dynamic task allocation, shorten computing time, reduce the computational load of single rack unmanned plane, be applicable to the comparatively strong and uncertain condition of environment of real-time, unmanned plane at most only needs three communication from discovery target to entering execution pattern simultaneously, relative MAS competition auction system reduces the number of communications between unmanned aerial vehicle group, simulation result shows that the method can be applied in the task dynamic allocation procedure of uncertain environment.

Claims (1)

1. the unmanned vehicle formation collaboratively searching under uncertain environment and a dynamic task allocation method, is characterized in that: the air route adopting circular arc air route to execute the task as unmanned plane, comprises following step:
Step one: determine the data structure that single rack unmanned plane is safeguarded;
In unmanned plane is formed into columns every frame unmanned plane airborne computer in store:
(1) unmanned plane self sequence number UID;
(2) task number TID performed by each unmanned plane, when unmanned plane is in search pattern, performed by unmanned plane, task number TID is-1;
(3) mission payload that carries of unmanned plane self x is load categories; When middle all elements is 0, and now unmanned plane enters search pattern;
(4) load needed when unmanned plane performs TID task middle element represents different types of load of required by task, and when all elements is all 0, expression task completes, under search pattern for sky;
Step 2: the offline mode determining unmanned plane;
The offline mode of unmanned plane is divided into search pattern and execution pattern, search pattern is divided into again broadcast mode and response modes, wherein, unmanned plane does not find executable task in search coverage, in communication radius, also do not have other unmanned planes to provide executable task, at this moment unmanned plane is in search pattern; Discovery task in search procedure and entrained by self, load is not enough to finish the work time enter broadcast mode, with other unmanned planes in communication radius carry out mission bit stream share; Under search pattern, if run into the broadcast of other unmanned planes in communication radius, then enter response modes; Unmanned plane finds in self investigative range can the task of complete independently, or enters execution pattern after response process is carried out in the broadcast receiving other unmanned planes, and now TID is adjusted to from-1 the TID executed the task by unmanned plane;
Step 3: determine the advantage function that unmanned plane is executed the task;
UID load entrained by the unmanned plane of i is made to be tID is that the task of j needs load to be uID is the unmanned plane of i dominance vector A when being the task of j relative to TID ij=[a ij1, a ij2..., a ijk..., a ijx] computing formula as follows:
When for the UID unmanned plane that is i, to perform TID be the task of j, advantage function computing formula is as follows:
a ij = &Sigma; k = 1 x a ijk - - - ( 2 )
Step 4: determine dynamic task allocation flow process;
If UID is the unmanned plane of i detect some tasks point, then by step 3 method obtain UID be the unmanned plane of i perform each task point time advantage function, the maximum TID of selective advantage function is the task point of j; If the maximum TID of advantage function is the task point advantage function a of j ij=0, then TID=-1, unmanned plane proceeds search or waits for that other unmanned planes are broadcasted; If the maximum TID of advantage function is the task point advantage function a of j ij≠ 0, now, the whether capable complete independently task of this unmanned plane need be judged, if advantage function a ijduring=2x, then unmanned plane enters the task that execution pattern is executed the task alone a little; If advantage function a ijduring < 2x, unmanned plane enters broadcast mode, and jointly to be finished the work as a supplement j by other unmanned planes, concrete mode is:
Unmanned plane in a broadcast mode, the load of UID entrained by the unmanned plane of i execution TID is that the task of j needs load then UID be i unmanned plane broadcast need load vectors, S &OverBar; ij u = [ s ij 1 u , s ij 2 u , . . . . . . , s ijk u , . . . . . . , s ijx u ] , Wherein,
s ijk u = r jk t - r ik u , r jk t > r ik u 0 , otherwise k = 1,2,3 . . . x ;
UID is the load vectors of unmanned plane by self UID and needs of i after broadcast, being in search pattern and containing broadcast vector within communication radius the unmanned plane of middle element, makes its UID be respectively n 1, n 2..., n w..., n p, all enter response modes, and self UID, position and entrained load information send to UID to be the unmanned plane of i, UID is that the unmanned plane information of unmanned plane to the response modes that these are collected of i is handled as follows:
1) set is set as initial sets, wherein, C ijrepresent the UID set of final response unmanned plane, represent C ijin final each response unmanned plane entrained by mission payload set;
2) determining that response modes unmanned plane arrives TID is the estimated time of arrival (ETA) ETA of j task, can determine that unmanned plane enters the ETA of task point, is specially when unmanned plane velocity variations is little easily: set estimated time of arrival (ETA) gather as ETAs = { t n 1 , t n 2 , . . . . . . , t n w , . . . . . . , t n p } , Then:
t n w &ap; &pi;R - r V u - - - ( 4 )
Wherein, r represents the effective radius of task point, V ufor the speed of unmanned plane, the speed of unmanned plane leans on the Throttle Opening Control of unmanned vehicle engine, by Throttle Opening Control at about 50m/s; R is the air route radius that unmanned plane is executed the task;
3) estimated time of arrival (ETA) of response modes unmanned plane is sorted wherein T = { t n 1 * , t n 2 * , . . . . . . , t n w * , . . . . . . , t n p * } For the result after ascending sequence time of arrival, N = { n 1 * , n 2 * , . . . . . . , n w * , . . . . . . , n p * } For No. UID, corresponding unmanned plane;
4) according to N order to set C ijsupplement, use according to the order of N simultaneously right supplement, until or whole element adds to C in N ijin, suppose the response modes unmanned plane set after supplementing C ij = { n ^ 1 * , n ^ 2 * , . . . . . . , n ^ w * , . . . . . . , n ^ q * } , q &le; p ;
5) C is traveled through ijin each element inspection whether be true, if very, then will reject from Cij, will simultaneously from middle rejecting, finally obtains the C removing redundant elements ijwith do not add to C ijthe TID of the response modes unmanned plane that neutralization is rejected is set to-1, continues to make it be in search pattern and searches for other task point, final C ijin unmanned plane
TID be set to task j and enter execution pattern; Step 5: the search determining aircraft and the guidance law of executing the task;
Make the position of any time unmanned plane for (x u, y u), unmanned plane determines the task point j of execution when A point, enter execution pattern, now A point coordinate (x a, y a), the coordinate (x of task point j o, y o), unmanned plane enters task point O along the circular arc that diameter is OA, now the unmanned plane air route radius of executing the task unmanned plane is at position (x u, y u) the desired track drift angle instruction at place:
The feedback that radius limits is added in the instruction of flight path drift angle:
Wherein, z is feedback factor to be adjusted.
CN201210356428.0A 2012-09-21 2012-09-21 Method for cooperative search and dynamic task allocation of unmanned aerial vehicle teams under uncertain environment Active CN102901498B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201210356428.0A CN102901498B (en) 2012-09-21 2012-09-21 Method for cooperative search and dynamic task allocation of unmanned aerial vehicle teams under uncertain environment

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201210356428.0A CN102901498B (en) 2012-09-21 2012-09-21 Method for cooperative search and dynamic task allocation of unmanned aerial vehicle teams under uncertain environment

Publications (2)

Publication Number Publication Date
CN102901498A CN102901498A (en) 2013-01-30
CN102901498B true CN102901498B (en) 2015-03-25

Family

ID=47573864

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201210356428.0A Active CN102901498B (en) 2012-09-21 2012-09-21 Method for cooperative search and dynamic task allocation of unmanned aerial vehicle teams under uncertain environment

Country Status (1)

Country Link
CN (1) CN102901498B (en)

Families Citing this family (41)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103472850B (en) * 2013-09-29 2015-11-18 合肥工业大学 A kind of multiple no-manned plane collaboratively searching method based on Gaussian distribution prediction
CN103592949B (en) * 2013-11-28 2016-03-02 电子科技大学 A kind of formation for unmanned plane arrives the distributed control method of target simultaneously
CN103713641B (en) * 2013-12-19 2016-02-17 北京航空航天大学 The formation method for splitting of the intensive autonomous formation of a kind of aircraft
CN103744290B (en) * 2013-12-30 2016-02-24 合肥工业大学 A kind of multiple no-manned plane formation layering target assignment method
CN104901727B (en) * 2014-02-26 2018-02-09 清华大学 The communication control system and method for unmanned plane queue formation collaboration
CN103884237B (en) * 2014-04-08 2015-08-05 哈尔滨工业大学 The many-one cooperative guidance method of based target probability distribution information
CN104049616B (en) * 2014-06-25 2016-08-17 哈尔滨工程大学 UAV navigation colony task orchestration system and method
CN104407619B (en) * 2014-11-05 2017-03-15 沈阳航空航天大学 Multiple no-manned plane under uncertain environment reaches multiple goal approachs simultaneously
KR101666132B1 (en) * 2014-12-26 2016-10-18 서울대학교산학협력단 Market-based decentralized task assignment method for UAV and recording medium recorded program to perform the method
WO2017080600A1 (en) * 2015-11-12 2017-05-18 Sony Mobile Communications Inc. Dynamic positioning method for mobile cells
CN105573306B (en) * 2015-12-31 2018-05-08 中南大学 A kind of the formation method and device of multiple intelligent bodies with blind area
CN105487383B (en) * 2016-01-27 2018-01-16 谭圆圆 A kind of unmanned vehicle load control method and device
CN105843227B (en) * 2016-04-15 2018-10-23 上海大学 A kind of multi-robot Cooperation of task based access control closeness dynamic adjustment surrounds and seize method for allocating tasks
CN106255087B (en) * 2016-09-09 2022-01-04 北京远度互联科技有限公司 Networking method and device
CN106444845B (en) * 2016-10-14 2019-03-05 中国人民解放军国防科学技术大学 A kind of more UAV collaboratively searching methods under no information condition
CN106529674B (en) * 2016-11-03 2018-10-19 中国人民解放军信息工程大学 Multiple no-manned plane cooperates with mine to target assignment method
CN107219858B (en) * 2017-04-26 2020-04-03 西北工业大学 Multi-unmanned aerial vehicle cooperative coupling task allocation method for improving firefly algorithm
CN107203221B (en) * 2017-06-01 2020-09-01 合肥工业大学 Online information distribution method and device in unmanned aerial vehicle and manned machine mixed formation
CN107247461B (en) * 2017-06-05 2020-07-07 合肥工业大学 Unmanned-manned-aircraft formation information distribution processing method considering burst interference
CN107562074B (en) * 2017-07-24 2020-05-22 哈尔滨工程大学 MAUVS (maximum power supply) enclosure-oriented task allocation method
CN107562047B (en) * 2017-08-02 2020-11-17 中国科学院自动化研究所 Unmanned equipment formation method, storage device and processing device
CN109510655B (en) * 2017-09-15 2021-04-13 山东科技大学 Task-oriented formation networking distributed cooperative flight control method for near space platform
CN107807521B (en) * 2017-09-20 2021-02-19 北京铭海博纳科技发展有限公司 Fixed time-oriented formation aircraft cooperative control method and system
CN107947845B (en) * 2017-12-05 2020-04-24 中国科学院自动化研究所 Communication relay-based unmanned aerial vehicle formation cooperative target allocation method
CN108545160A (en) * 2018-03-12 2018-09-18 上海大学 A kind of someone's ship cooperates with rescue system and method with unmanned boat
US20210018319A1 (en) * 2018-03-26 2021-01-21 Nec Corporation Search support apparatus, search support method, and computer-readable recording medium
CN109214450B (en) * 2018-08-28 2022-05-10 北京航空航天大学 Unmanned system resource allocation method based on Bayesian program learning algorithm
CN109189094B (en) * 2018-09-25 2021-08-13 中国人民解放军空军工程大学 Resource scheduling method for hybrid formation of multiple human-machines and multiple unmanned aerial vehicles
US11164124B2 (en) 2018-11-14 2021-11-02 International Business Machines Corporation Task allocation of aerial vehicles
CN110007687B (en) * 2019-02-25 2023-07-21 中电科翌智航(重庆)科技有限公司 Unmanned aerial vehicle searching system
CN109901616B (en) * 2019-03-29 2020-04-14 北京航空航天大学 Distributed task planning method for heterogeneous unmanned aerial vehicle cluster
CN110162043B (en) * 2019-05-17 2020-10-09 北京航空航天大学 Cluster task allocation and control method under constraint of simultaneous arrival of multiple target points
CN110221624B (en) * 2019-05-20 2021-08-17 南京航空航天大学 Unmanned aerial vehicle surrounding ground target guidance method based on combined system
CN110362105B (en) * 2019-06-17 2022-07-19 广州大学 Sensor network wireless charging method based on multiple UAVs
CN110231814B (en) * 2019-07-03 2020-12-04 中国人民解放军国防科技大学 Layered distributed control system and control method for fixed-wing unmanned aerial vehicle cluster
CN111031578A (en) * 2019-11-27 2020-04-17 新石器慧通(北京)科技有限公司 Information processing system for movable carrier and unmanned vehicle
CN111222764B (en) * 2019-12-27 2021-08-20 西安羚控电子科技有限公司 Unmanned aerial vehicle swarm task allocation algorithm based on distributed collaborative auction
CN111857185B (en) * 2020-08-10 2022-11-04 南京航空航天大学 Unmanned aerial vehicle track forming guidance law design method based on dynamic reference points
CN113377119B (en) * 2021-04-21 2023-05-09 北京控制工程研究所 Spacecraft task deduction method and system based on capability model
CN113701762B (en) * 2021-10-29 2022-01-18 中国人民解放军空军预警学院 Unmanned aerial vehicle search route establishing method and device
CN116430907B (en) * 2023-06-14 2023-09-26 北京创博联航科技有限公司 Data processing method and device for unmanned aerial vehicle cooperative control

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6856894B1 (en) * 2003-10-23 2005-02-15 International Business Machines Corporation Navigating a UAV under remote control and manual control with three dimensional flight depiction
EP1524500A1 (en) * 2003-10-13 2005-04-20 Saab Ab Method and device for planning a trajector
CN102591358A (en) * 2012-03-12 2012-07-18 北京航空航天大学 Multi-UAV (unmanned aerial vehicle) dynamic formation control method

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP1524500A1 (en) * 2003-10-13 2005-04-20 Saab Ab Method and device for planning a trajector
US6856894B1 (en) * 2003-10-23 2005-02-15 International Business Machines Corporation Navigating a UAV under remote control and manual control with three dimensional flight depiction
CN102591358A (en) * 2012-03-12 2012-07-18 北京航空航天大学 Multi-UAV (unmanned aerial vehicle) dynamic formation control method

Non-Patent Citations (4)

* Cited by examiner, † Cited by third party
Title
"基于多任务的无人机编队控制研究";阎振鑫,章卫国等;《计算机测量与控制》;20091231;第17卷(第11期);2223-2225 *
"基于改进粒子群算法的多UAV协同侦察任务规划";孙健,刘慧霞,席庆彪;《现代电子技术》;20120401;第35卷(第7期);12-18 *
"多无人机自主编队协同制导技术的概念、设计和仿真";刘星,吴森堂等;《系统仿真学报》;20081031;第20卷(第19期);5075-5080 *
"高空长航时无人机编队协同侦察任务规划";鲍学良,梁伟;《火力与指挥控制》;20120731;第37卷(第7期);147-150 *

Also Published As

Publication number Publication date
CN102901498A (en) 2013-01-30

Similar Documents

Publication Publication Date Title
CN102901498B (en) Method for cooperative search and dynamic task allocation of unmanned aerial vehicle teams under uncertain environment
Wang et al. Reconnaissance mission conducted by UAV swarms based on distributed PSO path planning algorithms
Carbone et al. A novel 3D geometric algorithm for aircraft autonomous collision avoidance
CN102778235B (en) Multiple-unmanned aerial vehicle collaborative area searching method under communication constrains
Chen et al. An improved A* algorithm for UAV path planning problems
CN102147255A (en) Real-time path planning method for unmanned aerial vehicle group under threat information sharing environment
Majd et al. Integrating learning, optimization, and prediction for efficient navigation of swarms of drones
CN105184092A (en) Method for achieving multi-type unmanned aerial vehicle cooperative task assignment under resource constraints
CN112130587A (en) Multi-unmanned aerial vehicle cooperative tracking method for maneuvering target
CN112733251B (en) Collaborative flight path planning method for multiple unmanned aerial vehicles
Luo et al. Reliable path planning algorithm based on improved artificial potential field method
CN103810382A (en) Method for choosing two-level data fusion strategy of airborne distributed multi-sensor
Azeemi Cooperative trajectory and launch power optimization of UAV deployed in cross-platform battlefields
Biswas et al. Path planning and task assignment for multiple UAVs in dynamic environments
CN115237151A (en) Multi-moving-object searching method for group unmanned aerial vehicle based on pheromone elicitation
Gao et al. Cooperative multi-aircraft conflict resolution based on co-evolution
Biswas et al. Nearest neighbour based task allocation with multi-agent path planning in dynamic environments
Wei et al. Hierarchical task assignment of multiple UAVs with improved firefly algorithm based on simulated annealing mechanism
Yan et al. Target tracking and obstacle avoidance for multi-agent networks with input constraints
Pehlivanoğlu et al. Efficient strategy for multi-UAV path planning in target coverage problems
Liu et al. Trajectories planning for multiple UAVs by the cooperative and competitive PSO algorithm
Surana et al. Coverage control of mobile sensors for adaptive search of unknown number of targets
Lu et al. Distributed multi-UAV cooperation for path planning by an NTVPSO-ADE algorithm
Lu et al. Dual redundant UAV path planning and mission analysis based on Dubins curves
Tian et al. A unified cooperative control architecture for UAV missions

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
C14 Grant of patent or utility model
GR01 Patent grant