CN114043476B - Swarm robot control method based on particle swarm algorithm under rejection environment - Google Patents
Swarm robot control method based on particle swarm algorithm under rejection environment Download PDFInfo
- Publication number
- CN114043476B CN114043476B CN202111301771.0A CN202111301771A CN114043476B CN 114043476 B CN114043476 B CN 114043476B CN 202111301771 A CN202111301771 A CN 202111301771A CN 114043476 B CN114043476 B CN 114043476B
- Authority
- CN
- China
- Prior art keywords
- robot
- attacking
- enemy
- attack
- environment
- 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
Links
- 239000002245 particle Substances 0.000 title claims abstract description 48
- 238000000034 method Methods 0.000 title claims abstract description 39
- 238000004422 calculation algorithm Methods 0.000 title claims abstract description 37
- 230000007123 defense Effects 0.000 claims abstract description 11
- 238000005516 engineering process Methods 0.000 claims abstract description 9
- 239000008280 blood Substances 0.000 claims description 20
- 210000004369 blood Anatomy 0.000 claims description 20
- 238000005457 optimization Methods 0.000 claims description 12
- 230000014509 gene expression Effects 0.000 claims description 11
- 230000008569 process Effects 0.000 claims description 8
- 230000033001 locomotion Effects 0.000 claims description 6
- 230000001133 acceleration Effects 0.000 claims description 3
- 238000004364 calculation method Methods 0.000 claims description 3
- 230000002349 favourable effect Effects 0.000 claims description 3
- 238000005259 measurement Methods 0.000 claims description 3
- 239000002689 soil Substances 0.000 claims description 3
- 238000012549 training Methods 0.000 abstract description 3
- 230000006870 function Effects 0.000 description 32
- 239000003795 chemical substances by application Substances 0.000 description 6
- 238000004891 communication Methods 0.000 description 2
- 230000002787 reinforcement Effects 0.000 description 2
- 230000003042 antagnostic effect Effects 0.000 description 1
- 230000008485 antagonism Effects 0.000 description 1
- 238000013459 approach Methods 0.000 description 1
- 230000008859 change Effects 0.000 description 1
- 238000005094 computer simulation Methods 0.000 description 1
- 238000010276 construction Methods 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 239000010432 diamond Substances 0.000 description 1
- 239000006185 dispersion Substances 0.000 description 1
- 238000002474 experimental method Methods 0.000 description 1
- 230000009545 invasion Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
Images
Classifications
-
- B—PERFORMING OPERATIONS; TRANSPORTING
- B25—HAND TOOLS; PORTABLE POWER-DRIVEN TOOLS; MANIPULATORS
- B25J—MANIPULATORS; CHAMBERS PROVIDED WITH MANIPULATION DEVICES
- B25J9/00—Programme-controlled manipulators
- B25J9/16—Programme controls
- B25J9/1679—Programme controls characterised by the tasks executed
- B25J9/1682—Dual arm manipulator; Coordination of several manipulators
Landscapes
- Engineering & Computer Science (AREA)
- Robotics (AREA)
- Mechanical Engineering (AREA)
- Feedback Control In General (AREA)
Abstract
The invention relates to a swarm robot control method based on a particle swarm algorithm in a rejection environment, which comprises the following steps: step 1, establishing an attack and defense confrontation scene in a rejection environment, and initializing parameters of a particle swarm algorithm; step 2, the attacking robot detects surrounding environment information through a sensor, acquires situation information of friend and enemy robots, and calculates the position of the enemy territory in real time by using an inertial navigation technology; step 3, constructing a fitness function by the attack robot; step 4, optimizing a fitness function by utilizing a particle swarm algorithm to obtain the optimal occupation of the attacking robot; step 5, moving and attacking the attacking robot; step 6, if any attacking robot enters enemy territory, the task is completed; otherwise, judging whether the maximum operation time is reached, if so, failing the task; otherwise, turning to step 2 to iterate the next time slice. Compared with the prior art, the method avoids global positioning, the control does not need pre-training, and the problem of dimension disaster is solved.
Description
Technical Field
The invention relates to the field of cooperative and game confrontation control among multi-agent clusters, in particular to a swarm robot control method based on a particle swarm algorithm in a rejection environment.
Background
With the rapid development and mature application of intelligent unmanned technology, cooperative combat among unmanned devices has become possible, and cooperative attack and defense confrontation among unmanned clusters gradually becomes an important mode of future war. As an application carrier of the multi-agent technology, the unmanned cluster judges the surrounding situation through sensing the environment, and takes the actions of fire gathering attack, wounded recoiling, obstacle avoidance, group collision avoidance, dispersion, concentration, cooperation, assistance and the like according to a certain attack and defense strategy to realize attack and defense confrontation.
The cooperative attack and defense confrontation of the group of robots can be described as an optimal decision problem under complex multi-constraint conditions, and the most classical is the problem of earth guard. In this problem, the confrontation environment is composed of two multiple intelligent groups of an intruder and a defender. Where the intruder is intended to try to get as close to and into a territory as possible and the defender is intended to intercept the intruder as far from the territory as possible. The advantages and disadvantages of the situation under the confrontation environment depend on the relationship among an invader, a defender and the territory, and because the state space dimension of the multi-agent attack-defense confrontation task is high, the strategy solving space is exponentially increased along with the increase of the scale of the entity object, the situation is complex and fast to change, attack-defense strategies are various, the solving difficulty is large, and an efficient decision algorithm is needed.
The most popular group confrontation method at present is a multi-agent deep reinforcement learning method. However, such algorithms require extensive pre-training, are limited by dimensional disaster problems, and rely on accurate global positioning and communication, failing to achieve effective collaboration and countermeasures in a denial environment.
Disclosure of Invention
The invention aims to overcome the defects in the prior art and provide a swarm robot control method based on a particle swarm algorithm in a rejection environment, and the control method makes up the bottleneck problem that global positioning and communication are limited by dimension disasters since most of multi-agent algorithms currently exist.
The purpose of the invention can be realized by the following technical scheme:
the invention provides a swarm robot control method based on a particle swarm algorithm in a rejection environment, which comprises the following steps:
step 1, establishing an attack and defense confrontation scene in a refused environment, and initializing parameters of a particle swarm algorithm;
step 2, the attacking robot detects surrounding environment information through a sensor, acquires situation information of the friend robot and the enemy robot, and calculates the position of the enemy territory in real time by utilizing an inertial navigation technology
Step 3, the attacking robot constructs a fitness function containing enemy robot state information, friend robot state information and enemy territory information by using the detected surrounding environment information;
step 4, optimizing the fitness function by utilizing a particle swarm algorithm to obtain the optimal occupation of the attacking robot and guide the attacking robot to move and attack in the next time slice;
step 5, the attacking robot carries out moving and attacking operations;
step 6, if an attacking robot enters enemy territory, the task is completed; otherwise, judging whether the maximum running time is reached, if so, failing the task; otherwise, the iteration of the next time slice is carried out in the step 2.
Preferably, the attack and defense confrontation scene in the rejection environment is established in step 1, and parameters of the particle swarm algorithm are initialized, specifically: initializing the positions of N attacking robots, the positions of M defending robots and a GPS positioning coordinate U of enemy territory; initializing initial number of particles in particle swarm optimization
Acceleration factor c 1 And c 2 Inertial weight w and dimension of problem D;
all the robots have the same attribute and have P-point blood volume, when the robots are attacked, the blood volume is reduced by P, and when the blood volume of the robots is less than or equal to 0, the robots are killed.
Preferably, the step 2 specifically comprises: each attacking robot constructs a coordinate system according to the position and the moving direction of the attacking robot; the method comprises the steps of detecting surrounding environment information through a sensor, obtaining coordinates of a friend robot and an enemy robot, and calculating the position of enemy territory in real time by utilizing an inertial navigation technology
Preferably, in step 3, the attack robot constructs a fitness function of the attack robot by using the detected ambient environment information, specifically: attacking robot A i Constructing a fitness function F according to the state information of the enemy robot, the state information of the friend robot and the information of the enemy territory i The expression is as follows:
F i ＝f 1 +f 2 +f 3
wherein f is 1 Is a confrontation fitness f constructed according to the state information of the enemy robot 2 Is a cooperative fitness f constructed according to the state information of the friend robot 3 Is the adaptability of enemy to soil.
Preferably, said fitness opposition function f 1 The expression of (a) is:
where Ψ is the attacking robot A i Neighborhood region R 1 The indices of all enemy robots within,
is a sub-fitness function generated according to the state information of the kth enemy robot;
Is the coordinates of the kth enemy robot; x = (x) 1 ，x 2 ) Is an independent variable representing the coordinates of a certain position in the rectangular coordinate system of the attack robot; sigma 1 And w 1 Respectively defining the width and the amplitude of the Gaussian-like model; s (i, k) is the measurement of the ith attack robot A i Whether the situation of (2) is better than that of the enemy robot B k Determines the attacking robot A i Is to enemy robot B k Whether to move or to back is expressed as:
the situation information of the robot is obtained by calculation according to the number and the total blood volume of friend robots, wherein '-1' and '1' respectively represent an attacking robot A i In unfavorable and favorable situations; n is a radical of i And
respectively represent attack robots A i Scope of attackR 0 The number and total blood volume values of all friend robots within; m k And &>
Respectively enemy robot B k The number of all enemy robots and the total blood volume value within the attack range R0;
when S (i, k) = -1, f Bk Is a valley-shaped function which represents the attacking robot A i Robot B away from enemy k The farther away, the attacking robot A i The higher the fitness of (a);
when S (i, k) =1, f Bk Is a peak-shaped function and represents the attacking robot A i With enemy robot B k The closer the approach, the higher the fitness of the attacking robot Ai.
Preferably, the attack robot A i Of the cooperative fitness function f 2 The expression of (a) is:
where Φ is the attacking robot A i Neighborhood region R 1 Indices of all friends in the content; f. of Ak Is a sub-fitness function generated according to the state information of the kth attack robot, wherein
Is the coordinates of the kth attacker; x = (x) 1 ，x 2 ) Is an independent variable representing the coordinate of a certain position in the rectangular coordinate system of the attack robot; sigma 2 And w 2 Respectively defining the width and the amplitude of the Gaussian-like model;
if attacking robot A i In the time slices of tau, the attacking robot a is in a disadvantage facing the surrounding enemy robot all the time i The cooperative fitness function f needs to be released from the constraint of the fellow and quit the group 2 Set to 0, attack robot A i Act independently to search for better attack locations;
when A is i Friend with it A k Is less than a preset threshold value Δ =10| Ψ |, f Ak Set to 0 to avoid collision of two attacking robots.
Preferably, the attack robot A i Fitness f of enemy territory 3 The expression is as follows:
wherein U = (U) 1 ，U 2 ) Is the coordinate of the center position of enemy territory, x = (x) 1 ，x 2 ) Is an independent variable representing the coordinate of a certain position in the rectangular coordinate system of the attack robot; sigma 3 And w 3 The width and amplitude of the gaussian-like model are defined separately.
Preferably, the step 4 specifically includes: in each time slice, executing a particle swarm algorithm to optimize the fitness function to obtain an attacking robot A i Best position p in its current situation g (ii) a The search space of the particle swarm algorithm is an attacking robot A i Is the center of the coordinate of (c), R 1 Is within a circular area of radius.
Preferably, the speed and location update expression of the fitness function is:
wherein, c 1 ，c 2 Is a constant acceleration factor, w is an inertial weight,
represents the velocity of the ith particle in the D-dimension, D ∈ [1]，
Indicates that the ith particle is in the d-dimension position>
And &>
Is a random number vector; d is the dimension of the environment, for a two-dimensional confrontation environment D =2, a three-dimensional confrontation environment D =3.
Preferably, the step 4 specifically includes:
each attacking robot is oriented to the calculated optimal position p g Direction movement if the robot is in the optimal position p g Is less than the maximum distance of the attack robot moving in a time slice
The attacking robot moves to the optimal position p g (ii) a Otherwise, go to the optimal position p g Direction shift>
A distance; in the moving process of the robot, if other robots exist in the warning area of the position of the next time slice, the moving direction of the robot is rotated anticlockwise by a degrees, and after the rotating times exceed the preset times, if the robot still cannot find a proper collision-free path, the robot stays at the current position until the next time slice;
if an enemy of the attacking robot enters the attacking range in the moving process, the nearest enemy is selected to attack; if the situation of the attacking robot is better than that of the enemy robot, the attacking robot can move towards the enemy robot and attack, namely the closer the attacking robot is to the enemy robot, the higher the fitness of the attacking robot is; conversely, if the attacking robot is inferior to the enemy robot in posture, the closer it is to the enemy robot, the lower its fitness;
the attacking robot and the friend of the attacking robot are in a cooperative relationship and form a group to attack the robot group of the enemy, and the closer the attacking robot is to the friend of the attacking robot, the higher the fitness of the attacking robot is.
Compared with the prior art, the invention has the following advantages:
1) The group robot senses the motion of the group robot from the surrounding environment by using the sensor carried by the group robot, and does not depend on a global navigation system; each robot constructs a respective coordinate system, and cooperation and confrontation are realized by acquiring relative coordinates of surrounding intelligent agents without depending on a global positioning system;
2) The fitness function of the robot integrates information of friend, enemy and enemy territory, and the control of the robot in the cooperative and antagonistic environments is realized;
3) Compared with a reinforcement learning method, the distributed control of the swarm robots based on the particle swarm algorithm has the advantages of no need of pre-training and strong expandability.
Drawings
FIG. 1 is a flow chart of a swarm robot control method based on a particle swarm algorithm in a rejection environment.
FIG. 2 is an exemplary diagram of a rectangular coordinate system of an attack robot;
FIG. 3 shows an attack robot A 1 An example of a fitness model of (a);
Detailed Description
The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are some, not all, embodiments of the present invention. All other embodiments, which can be obtained by a person skilled in the art without any inventive step based on the embodiments of the present invention, shall fall within the scope of protection of the present invention.
The embodiment provides a swarm robot attacking method based on a particle swarm optimization in a denial environment, as shown in fig. 1, including the following steps:
step 1, establishing an attack and defense confrontation scene in a refused environment, setting the positions of N attack group robots, the positions of M defense group robots and the position coordinates of enemy territory, setting all robots to have the same attribute and 10 pointsThe blood volume is reduced by 1 when the robot is attacked, and the robot is destroyed when the blood volume of the robot is less than or equal to 0; initial number of particles for initializing particle swarm optimization
Acceleration factor c 1 And c 2 Inertial weight w and dimension D of the problem; all robots have the same attribute and have 10-point blood volume, when the robots are attacked, the blood volume is reduced by 1, and when the blood volume of the robots is less than or equal to 0, the robots are destroyed.
Step 2, the attacking robot detects the surrounding environment through a sensor, acquires situation information of the friend robot and the enemy robot, and calculates the position of the enemy territory in real time by utilizing the inertial navigation technology
Step 3, the attacking robot constructs a fitness function containing enemy robot state information, friend robot state information and enemy territory information by using the detected surrounding environment information;
as shown in FIG. 2, each attacking robot A i Constructing a rectangular coordinate system by taking the position of the mobile terminal as the origin of coordinates and the moving direction as the positive direction of the horizontal axis; wherein Q j 、P k And U is the coordinates of the jth defender, kth attacker and territory respectively, attacking robot A i Obtaining Q by sensing environment using its sensors j And P k ；
The coordinate U of the enemy territory is known when each attacking robot is at the initial position, and the approximate coordinate of the enemy territory is calculated in real time by applying the inertial navigation technology in the moving process of the robots
For each attack robot, the fitness function comprises three parts of information: state information of enemy robots, state information of friend military robots and enemy territory information;
the attack robot A i Fitness function F i The calculation formula of (2) is as follows:
F i ＝f 1 +f 2 +f 3
wherein, f 1 Is a confrontation fitness f constructed according to the state information of the enemy robot 2 Is a cooperative fitness f constructed according to the state information of the friend robot 3 Is the adaptability of enemy to soil.
1) Constructing an confrontation fitness function f of the attack robot 1
If the situation of the attacking robot is better than that of the enemy robot, the attacking robot moves towards the enemy robot and attacks are initiated. This situation is mapped into the fitness function model, i.e. the closer the attacking robot is to the enemy robot, the higher its fitness. Conversely, if the attacking robot is less dominant than the enemy robot, the closer it is to the enemy robot, the lower its fitness. The confrontation fitness function model is constructed by utilizing Gaussian-like distribution. Confrontation fitness function f of attack robot 1 Comprises the following steps:
where Ψ is the attacking robot A i Neighborhood region R 1 Index f of all enemy robots therein Bk Is a sub-fitness function generated from the state information of the kth enemy robot.
Is the coordinates of the kth enemy robot; x = (x) 1 ，x 2 ) Is an independent variable representing the coordinate of a certain position in a rectangular coordinate system; sigma 1 And w 1 The width and amplitude of the gaussian-like model are defined separately.
S (i, k) is the measurement of the ith attack robot A i Whether the situation of (2) is better than that of the enemy robot B k The index of (1). The situation of the robot is calculated according to the number of friends and the total blood volume, wherein "-1" and "1" represent A respectively i In unfavorable and favorable situations; n is a radical of i And
is A i Attack range R 0 Attack robot (including attacker A) i ) Number of and total blood volume values; m k And &>
Are respectively B k Attack range R 0 Number of enemy robots and total blood volume value. When S (i, k) = -1, f Bk Is a valley-shaped function. This means that A i From B k The farther away, A i The higher the fitness. When S (i, k) =1, f Bk Is a peak-shaped function. This means that A i And B k The closer to A i The higher the fitness. S (i, k) determines A i Is directed to B k Whether to move or to back.
2) Construction of attack robot A i Of the cooperative fitness function f 2
The attacking robot and its friend are in a cooperative relationship and form a group to attack the enemy robot population. This situation is mapped into the fitness function model, i.e. the closer the attacking robot is to its friend, the higher its fitness. Attacking robot A i Is a cooperative fitness function f 2 Comprises the following steps:
wherein Φ is A i Neighborhood region R 1 Index of all friends in the content. f. of Ak Is a sub-fitness function generated according to the state information of the kth attack robot, wherein
Is the coordinates of the kth attacker. Notably, according to f 2 The attacking population may dynamically form subgroups. If A is i Within a period of tau time, a is always at a disadvantage facing surrounding enemy robots, then a i It is necessary to escape from the constraints of its partners and exit the population, at which point f will be 2 Set to 0,ai to act independently to search for a better attack position. When A is i Friend with it A k Is less than a threshold value Δ =10| Ψ |, f Ak Set to 0 to avoid collision of two attacking robots.
3) Constructing a fitness function f according to the position information of enemy territory 3
The attacking robot aims to enter enemy territory, and the closer the attacking robot is to the enemy territory, the higher the fitness is. Therefore, the fitness function f 3 Comprises the following steps:
wherein U = (U) 1 ，U 2 ) Is the coordinate of the center position of the enemy territory.
FIG. 3 shows an attacking robot A 1 An example of a fitness model of (1), where two diamonds represent A 1 And A 2 Three triangles are enemy robot B 1 、B 2 And B 3 The star is the enemy territory T. Wherein A is 1 And A 2 Are in cooperative relationship with each other, A 1 And B 1 、B 2 And B 3 The relationship between is a resistance relationship. The fitness model is applied to a particle swarm algorithm to optimize and obtain a group robot attack strategy in a rejection environment so as to guide the movement and attack of an attacking robot.
Step 4, optimizing the fitness function by utilizing a particle swarm algorithm to obtain the optimal occupation of the attacking robot and guide the attacking robot to move and attack in the next time slice;
in each time slice, a particle swarm optimization PSO optimization attack robot A is executed i Best position p in its current situation g . Since the attacker's distance of movement is limited within a time slice and the environment is dynamically changing, it only needs to be in its neighborhood R 1 Finding the position with the best fitness.
Therefore, the search space of the particle swarm algorithm PSO is constrained to attack robot a i Is the center of the coordinate of (c), R 1 Is within a circular area of radius.
The speed and location update formula for optimizing the fitness function is as follows:
wherein, c 1 ，c 2 Is a constant acceleration factor, w is an inertial weight,
represents the velocity of the ith particle in the D-dimension, D ∈ [1]，
Indicates the position of the i-th particle in dimension d>
And &>
Is a random number vector; d is the dimension of the environment, for a two-dimensional confrontation environment D =2, a three-dimensional confrontation environment D =3;
step 5, the attack robot carries out moving and attack operation;
each robot is directed to the calculated optimal position p g Direction movement if the robot is in the optimal position p g Is less than the maximum distance the robot moves within a time slice
The robot moves to the optimal position p g (ii) a Otherwise to p g Direction shift->
Distance.
In the moving process, if the robot has enemy army entering the attack range in the moving process, the nearest enemy army attack to the robot is selected. During the moving process of the robot, if other robots exist in the warning area of the position where the next time slice is located, the moving direction of the robot is rotated by 15 degrees anticlockwise, and after a series of rotations (23 times), if the robot still cannot find a proper collision-free path, the robot stays at the current position until the next time slice.
Step 6, if an attacking robot enters enemy territory, the task is completed; otherwise, judging whether the maximum running time is reached, if so, failing the task; otherwise, the iteration of the next time slice is carried out in the step 2.
In order to verify the performance of the method in the group robot territory invasion problem more intuitively, the method carries out the antagonism experiment with the following three algorithms applied to the enemy robot group:
(1) Based on a rule algorithm, the enemy robot always moves to the middle point position of the attack robot closest to the territory and the enemy robot to intercept the attack robot.
(2) DPSO attack task assignment algorithm, "Cooperative Multi-task assignment for multiple UAVs," Electronics Optics & controls, vol.24, no.1, pp.46-50, 2017.
(3) SDPSO attack task allocation algorithm, "UAV cooperative multiple-task assistance based on discrete particle timing algorithm," Computer Simulation, vol.35, no.2, pp.22-28, 2018.
The challenge results of the algorithm are shown in table 1.
TABLE 1
It is apparent that the overall odds of the attacking robot group using the PSO-AS method is 100% when the numbers of the attacking robot group and the enemy robot group are the same. When the number of attacking robot groups is only 75% of the enemy robot groups, the proposed method still has a success rate of winning of more than 50%.
While the invention has been described with reference to specific embodiments, the invention is not limited thereto, and various equivalent modifications and substitutions can be easily made by those skilled in the art within the technical scope of the invention. Therefore, the protection scope of the present invention shall be subject to the protection scope of the claims.
Claims (10)
1. A swarm robot control method based on a particle swarm algorithm under a rejection environment is characterized by comprising the following steps of:
step 1, establishing an attack and defense confrontation scene in a rejection environment, and initializing parameters of a particle swarm algorithm;
step 2, the attacking robot detects surrounding environment information through a sensor, acquires situation information of the friend robot and the enemy robot, and calculates the position of the enemy territory in real time by utilizing an inertial navigation technology
Step 3, the attacking robot constructs a fitness function containing enemy robot state information, friend robot state information and enemy territory information by using the detected surrounding environment information;
step 4, optimizing the fitness function by utilizing a particle swarm algorithm to obtain the optimal occupation of the attack robot and guide the attack robot to move and attack in the next time slice;
step 5, the attacking robot carries out moving and attacking operations;
step 6, if an attacking robot enters enemy territory, the task is completed; otherwise, judging whether the maximum operation time is reached, if so, failing the task; otherwise, the iteration of the next time slice is carried out in the step 2.
2. The method for controlling group robots based on particle swarm optimization in the denial environment according to claim 1, wherein the attack and defense confrontation scene in the denial environment is established in step 1, and parameters of the particle swarm optimization are initialized, specifically: initializing the positions of N attacking robots, the positions of M defending robots and a GPS positioning coordinate U of enemy territory; initializing initial number of particles in particle swarm optimization
Acceleration factor c 1 And c 2 Inertial weight w and dimension of problem D;
all robots have the same attribute and have P-point blood volume, when the robots are attacked, the blood volume is reduced by P, and when the blood volume of the robots is less than or equal to 0, the robots are destroyed.
3. The swarm robot control method based on the particle swarm algorithm in the denial environment according to claim 1, wherein the step 2 specifically comprises: each attacking robot constructs a coordinate system according to the position and the moving direction of the attacking robot; the method comprises the steps of detecting surrounding environment information through a sensor, obtaining coordinates of a friend robot and an enemy robot, and calculating the position of enemy territory in real time by utilizing an inertial navigation technology
4. The method of claim 1A swarm robot control method based on a particle swarm algorithm in a denial environment is characterized in that in step 3, an attack robot utilizes detected surrounding environment information to construct a fitness function of the attack robot, and the method specifically comprises the following steps: attacking robot A i Constructing a fitness function F according to the enemy robot state information, the friend robot state information and the enemy territory information i The expression is as follows:
F i ＝f 1 +f 2 +f 3
wherein f is 1 Is a confrontation fitness f constructed according to the state information of the enemy robot 2 Is a cooperative fitness f constructed according to the state information of the friend robot 3 Is the adaptability of enemy to soil.
5. The swarm robot control method based on particle swarm optimization in the rejection environment of claim 4, wherein the countervailing fitness function f is 1 The expression of (a) is:
where Ψ is the attacking robot A i Neighborhood region R 1 The indices of all enemy robots within,
is a sub-fitness function generated according to the state information of the kth enemy robot;
Is the coordinates of the kth enemy robot; x = (x) 1 ,x 2 ) Is an independent variable representing the coordinates of a certain position in the rectangular coordinate system of the attack robot; sigma 1 And w 1 Respectively defining the width and the amplitude of the Gaussian-like model; s (i, k) is the measurement of the ith attack robot A i Whether the situation of (2) is better than that of the enemy robot B k Determines the attack machinePerson A i Is to enemy robot B k Whether to move or to back, the expression is: />
The situation information of the robot is obtained by calculation according to the number and the total blood volume of friend robots, wherein '-1' and '1' respectively represent an attacking robot A i In unfavorable and favorable situations; n is a radical of i And
respectively represent attack robots A i Attack range R 0 The number and total blood volume values of all friend robots within; m k And &>
Respectively enemy robot B k Attack range R 0 Number of all enemy robots within and total blood volume value;
when S (i, k) = -1, f Bk Is a valley-shaped function and represents the attacking robot A i Robot B away from enemy k The farther away, the attacking robot A i The higher the fitness;
when S (i, k) =1, f Bk Is a peak-shaped function and represents the attacking robot A i With enemy robot B k The closer the attacking robot A is i The higher the fitness.
6. The swarm robot control method based on particle swarm optimization in the denial environment of claim 4, wherein the attacking robot A i Is a cooperative fitness function f 2 The expression of (a) is:
where Φ is the attacking robot A i Neighborhood region R 1 Indices of all friends in the content; f. of Ak Is a sub-fitness function generated according to the state information of the kth attack robot, wherein
Is the coordinates of the kth attacker; x = (x) 1 ,x 2 ) Is an independent variable representing the coordinate of a certain position in the rectangular coordinate system of the attack robot; sigma 2 And w 2 Respectively defining the width and the amplitude of the Gaussian-like model;
if attacking robot A i In the time slice of tau, the robot facing the surrounding enemy is always in a disadvantage, and then the attacking robot A i The cooperative fitness function f needs to be released from the constraint of the fellow and quit the group 2 Set to 0, attack robot A i Act independently to search for better attack locations;
when A is i Friend with it A k Is less than a preset threshold value Δ =10| Ψ |, f Ak Set to 0 to avoid collision of two attacking robots.
7. The swarm robot control method based on particle swarm optimization in the denial environment as claimed in claim 4, wherein the attacking robot A i Land-taking fitness f of enemy 3 The expression is as follows:
wherein U = (U) 1 ,U 2 ) Is the coordinate of the center position of enemy territory, x = (x) 1 ,x 2 ) Is an independent variable representing the coordinate of a certain position in the rectangular coordinate system of the attack robot; sigma 3 And w 3 The width and amplitude of the gaussian-like model are defined separately.
8. A denial according to claim 1The swarm robot control method based on the particle swarm algorithm under the environment is characterized in that the step 4 specifically comprises the following steps: in each time slice, executing a particle swarm algorithm to optimize the fitness function to obtain an attacking robot A i Best position p in its current situation g (ii) a The search space of the particle swarm algorithm is an attacking robot A i Is the coordinate of (A) as the center, R 1 Is within a circular area of radius.
9. The swarm robot control method based on the particle swarm optimization algorithm in the denial environment according to claim 8, wherein the speed and location update expressions of the fitness function are:
wherein, c 1 ，c 2 Is a constant acceleration factor, w is an inertial weight,
represents the velocity of the ith particle in the D-dimension, D ∈ [1]，
Indicates that the ith particle is in the d-dimension position>
And &>
Is a random number vector; d is the dimension of the environment, for a two-dimensional confrontation environment D =2, a three-dimensional confrontation environment D =3.
10. The swarm robot control method based on the particle swarm algorithm in the denial environment according to claim 8, wherein the step 4 specifically comprises:
each attacking robot moves to the calculated optimal position p g Direction movement if the robot is in the optimal position p g Is less than the maximum distance of the attack robot moving in a time slice
The attacking robot moves to the optimal position p g (ii) a Otherwise, go to the optimal position p g Direction shift->
A distance; in the moving process of the robot, if other robots exist in the warning area of the position of the next time slice, the moving direction of the robot is rotated anticlockwise by a degrees, and after the rotating times exceed the preset times, if the robot still cannot find a proper collision-free path, the robot stays at the current position until the next time slice;
if an enemy of the attacking robot enters the attacking range in the moving process, the nearest enemy is selected to attack; if the situation of the attacking robot is better than that of the enemy robot, the attacking robot can move towards the enemy robot and attack, namely the closer the attacking robot is to the enemy robot, the higher the fitness of the attacking robot is; conversely, if the attacking robot is inferior to the enemy robot in posture, the closer it is to the enemy robot, the lower its fitness;
the attacking robot and the friend of the attacking robot are in a cooperative relationship and form a group to attack the robot group of the enemy, and the closer the attacking robot is to the friend of the attacking robot, the higher the fitness of the attacking robot is.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111301771.0A CN114043476B (en) | 2021-11-04 | 2021-11-04 | Swarm robot control method based on particle swarm algorithm under rejection environment |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111301771.0A CN114043476B (en) | 2021-11-04 | 2021-11-04 | Swarm robot control method based on particle swarm algorithm under rejection environment |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN114043476A CN114043476A (en) | 2022-02-15 |
| CN114043476B true CN114043476B (en) | 2023-03-31 |
Family
ID=80207292
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202111301771.0A Active CN114043476B (en) | 2021-11-04 | 2021-11-04 | Swarm robot control method based on particle swarm algorithm under rejection environment |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114043476B (en) |
Family Cites Families (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP1974305A4 (en) * | 2006-01-11 | 2011-11-09 | Carmel Haifa University Economic Corp Ltd | Uav decision and control system |
| CN101908097B (en) * | 2010-07-13 | 2012-03-21 | 北京航空航天大学 | Particle swarm optimization method for air combat decision |
| CN111176309B (en) * | 2019-12-31 | 2021-01-12 | 北京理工大学 | Multi-unmanned aerial vehicle self-group mutual inductance understanding method based on spherical imaging |
| CN113052289B (en) * | 2021-03-16 | 2024-03-15 | 东南大学 | Method for selecting cluster hitting position of unmanned ship based on game theory |
| CN113378988B (en) * | 2021-07-06 | 2024-02-13 | 浙江工业大学 | Particle swarm algorithm-based robustness enhancement method and device for deep learning system |
-
2021
- 2021-11-04 CN CN202111301771.0A patent/CN114043476B/en active Active
Also Published As
| Publication number | Publication date |
|---|---|
| CN114043476A (en) | 2022-02-15 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN114413906B (en) | Three-dimensional trajectory planning method based on improved particle swarm optimization algorithm | |
| CN108680063B (en) | A kind of decision-making technique for extensive unmanned plane cluster dynamic confrontation | |
| CN109254588B (en) | Unmanned aerial vehicle cluster cooperative reconnaissance method based on cross variation pigeon swarm optimization | |
| CN112269396B (en) | Unmanned aerial vehicle cluster cooperative confrontation control method for eagle pigeon-imitated intelligent game | |
| CN111381600B (en) | UUV path planning method based on particle swarm optimization | |
| EP2010981A2 (en) | Method and system for autonomous tracking of a mobile target by an unmanned aerial vehicle | |
| Coon et al. | Control strategies for multiplayer target-attacker-defender differential games with double integrator dynamics | |
| CN113741525A (en) | Strategy set based MADDPG multi-unmanned aerial vehicle cooperative attack and defense countermeasure method | |
| CN110633857A (en) | Autonomous defense clustering algorithm for heterogeneous unmanned aerial vehicle cluster | |
| CN111258332B (en) | Unmanned aerial vehicle group formation method | |
| CN114063644A (en) | Unmanned combat aircraft air combat autonomous decision method based on pigeon flock reverse confrontation learning | |
| CN112305913A (en) | Multi-UUV collaborative dynamic maneuver decision method based on intuitive fuzzy game | |
| CN112327917A (en) | Unmanned aerial vehicle cluster cooperative coverage method based on group intelligence | |
| Choi et al. | Adversarial swarm defence using multiple fixed-wing unmanned aerial vehicles | |
| CN117313561B (en) | Unmanned aerial vehicle intelligent decision model training method and unmanned aerial vehicle intelligent decision method | |
| CN114043476B (en) | Swarm robot control method based on particle swarm algorithm under rejection environment | |
| CN112925317A (en) | AUV path planning method based on improved brainstorming optimization algorithm | |
| CN115061495B (en) | Unmanned aerial vehicle group countermeasure autonomous control method based on eagle pigeon game | |
| CN113507339B (en) | Unmanned aerial vehicle swarm countering method based on swarm behavior characteristics | |
| CN116520852A (en) | Method, device and equipment for capturing multiple targets by group robots under local information | |
| CN115686075A (en) | Unmanned aerial vehicle cluster multi-target collaborative search algorithm based on combination of particle swarm and artificial potential field | |
| Simonjan et al. | Reinforcement Learning-based Countermeasures against Attacking UAV Swarms | |
| CN115328190A (en) | Unmanned aerial vehicle three-dimensional dynamic path planning method based on self-adaptive dynamic planning | |
| Gudi et al. | Bio-inspired evasive movement of uavs based on dragonfly algorithm in military environment | |
| Li et al. | Research on stealthy UAV path planning based on improved genetic algorithm |
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 |