Multiple unmanned aerial vehicles(UAVs)cooperative operation is the main form for UAVs fighting in battlefield,and multi-UAV mission rendezvous is the premise of cooperative reconnaissance and attack missions.We propo...Multiple unmanned aerial vehicles(UAVs)cooperative operation is the main form for UAVs fighting in battlefield,and multi-UAV mission rendezvous is the premise of cooperative reconnaissance and attack missions.We propose a rendezvous control strategy,which divides the rendezvous process into two parts:The loose formation rendezvous and the close formation rendezvous.In the first stage,UAVs are supposed to reach the specific target locations simultaneously and form a loose formation.A distributed control strategy based on first-order consensus algorithm is presented to achieve this goal.Then the second stage is designed based on the second-order consensus algorithm to complete the transition from the loose formation to the close formation.This process needs the speeds and heading angles of UAVs to reach an agreement.Besides,control algorithms with a virtual leader are proposed,by which the formation states can reach a specific value.Finally,simulation results show that the control algorithms are capable of realizing the mission rendezvous of multi-UAV and the consistence of UAVs′final states,which verify the effectiveness and feasibility of the designed control strategy.展开更多
An ant colony optimization with artificial potential field(ACOAPF)algorithm is proposed to solve the cooperative search mission planning problem of unmanned aerial vehicle(UAV)swarm.This algorithm adopts a distributed...An ant colony optimization with artificial potential field(ACOAPF)algorithm is proposed to solve the cooperative search mission planning problem of unmanned aerial vehicle(UAV)swarm.This algorithm adopts a distributed architecture where each UAV is considered as an ant and makes decision autonomously.At each decision step,the ants choose the next gird according to the state transition rule and update its own artificial potential field and pheromone map based on the current search results.Through iterations of this process,the cooperative search of UAV swarm for mission area is realized.The state transition rule is divided into two types.If the artificial potential force is larger than a threshold,the deterministic transition rule is adopted,otherwise a heuristic transition rule is used.The deterministic transition rule can ensure UAVs to avoid the threat or approach the target quickly.And the heuristics transition rule considering the pheromone and heuristic information ensures the continuous search of area with the goal of covering more unknown area and finding more targets.Finally,simulations are carried out to verify the effectiveness of the proposed ACOAPF algorithm for cooperative search mission of UAV swarm.展开更多
基金jointly granted by the Science and Technology on Avionics Integration Laboratorythe Aeronautical Science Foundation(2016ZC15008)
文摘Multiple unmanned aerial vehicles(UAVs)cooperative operation is the main form for UAVs fighting in battlefield,and multi-UAV mission rendezvous is the premise of cooperative reconnaissance and attack missions.We propose a rendezvous control strategy,which divides the rendezvous process into two parts:The loose formation rendezvous and the close formation rendezvous.In the first stage,UAVs are supposed to reach the specific target locations simultaneously and form a loose formation.A distributed control strategy based on first-order consensus algorithm is presented to achieve this goal.Then the second stage is designed based on the second-order consensus algorithm to complete the transition from the loose formation to the close formation.This process needs the speeds and heading angles of UAVs to reach an agreement.Besides,control algorithms with a virtual leader are proposed,by which the formation states can reach a specific value.Finally,simulation results show that the control algorithms are capable of realizing the mission rendezvous of multi-UAV and the consistence of UAVs′final states,which verify the effectiveness and feasibility of the designed control strategy.
基金supported by the National Natural Science Foundation of China (Nos.61973158, 61673209)the Aeronautical Science Foundation (No.2016ZA52009)
文摘An ant colony optimization with artificial potential field(ACOAPF)algorithm is proposed to solve the cooperative search mission planning problem of unmanned aerial vehicle(UAV)swarm.This algorithm adopts a distributed architecture where each UAV is considered as an ant and makes decision autonomously.At each decision step,the ants choose the next gird according to the state transition rule and update its own artificial potential field and pheromone map based on the current search results.Through iterations of this process,the cooperative search of UAV swarm for mission area is realized.The state transition rule is divided into two types.If the artificial potential force is larger than a threshold,the deterministic transition rule is adopted,otherwise a heuristic transition rule is used.The deterministic transition rule can ensure UAVs to avoid the threat or approach the target quickly.And the heuristics transition rule considering the pheromone and heuristic information ensures the continuous search of area with the goal of covering more unknown area and finding more targets.Finally,simulations are carried out to verify the effectiveness of the proposed ACOAPF algorithm for cooperative search mission of UAV swarm.
