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.展开更多
A decentralized task planning algorithm is proposed for heterogeneous unmanned aerial vehicle(UAV)swarm with different capabilities.The algorithm extends the consensus-based bundle algorithm(CBBA)to account for a more...A decentralized task planning algorithm is proposed for heterogeneous unmanned aerial vehicle(UAV)swarm with different capabilities.The algorithm extends the consensus-based bundle algorithm(CBBA)to account for a more realistic and complex environment.The extension of the algorithm includes handling multi-agent task that requires multiple UAVs collaboratively completed in coordination,and consideration of avoiding obstacles in task scenarios.We propose a new consensus algorithm to solve the multi-agent task allocation problem and use the Dubins algorithm to design feasible paths for UAVs to avoid obstacles and consider motion constraints.Experimental results show that the CBBA extension algorithm can converge to a conflict-free and feasible solution for multi-agent task planning problems.展开更多
基金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.
文摘A decentralized task planning algorithm is proposed for heterogeneous unmanned aerial vehicle(UAV)swarm with different capabilities.The algorithm extends the consensus-based bundle algorithm(CBBA)to account for a more realistic and complex environment.The extension of the algorithm includes handling multi-agent task that requires multiple UAVs collaboratively completed in coordination,and consideration of avoiding obstacles in task scenarios.We propose a new consensus algorithm to solve the multi-agent task allocation problem and use the Dubins algorithm to design feasible paths for UAVs to avoid obstacles and consider motion constraints.Experimental results show that the CBBA extension algorithm can converge to a conflict-free and feasible solution for multi-agent task planning problems.
