Choosing the best path during unmanned air vehicle （UAV） flying is the target of the UAV mission planning problem. Because of its nearly constant flight height, the UAV mission planning problem can be treated as a 2...Choosing the best path during unmanned air vehicle （UAV） flying is the target of the UAV mission planning problem. Because of its nearly constant flight height, the UAV mission planning problem can be treated as a 2-D （horizontal） path arrangement problem. By modeling the antiaircraft threat, the UAV mission planning can be mapped to the traveling seaman problem （TSP）. A new algorithm is presented to solve the TSP. The algorithm combines the traditional ant colony system （ACS） with particle swarm optimization （PSO）, thus being called the AC-PSO algorithm. It uses one by one tour building strategy like ACS to determine that the target point can be chosen like PSO. Experiments show that AC-PSO synthesizes both ACS and PSO and obtains excellent solution of the UAV mission planning with a higher accuracy.展开更多
To solve the deadlock problem of tasks that the interdependence between tasks fails to consider during the course of resource assignment and task scheduling based on the heuristics algorithm, an improved ant colony sy...To solve the deadlock problem of tasks that the interdependence between tasks fails to consider during the course of resource assignment and task scheduling based on the heuristics algorithm, an improved ant colony system （ACS） based algorithm is proposed. First, how to map the resource assignment and task scheduling （RATS） problem into the optimization selection problem of task resource assignment graph （TRAG） and to add the semaphore mechanism in the optimal TRAG to solve deadlocks are explained. Secondly, how to utilize the grid pheromone system model to realize the algorithm based on ACS is explicated. This refers to the construction of TRAG by the random selection of appropriate resources for each task by the user agent and the optimization of TRAG through the positive feedback and distributed parallel computing mechanism of the ACS. Simulation results show that the proposed algorithm is effective and efficient in solving the deadlock problem.展开更多
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.展开更多
Task allocation is a key issue of agent cooperation mechanism in Multi-Agent Systems. The important features of an agent system such as the latency of the network infrastructure, dynamic topology, and node heterogenei...Task allocation is a key issue of agent cooperation mechanism in Multi-Agent Systems. The important features of an agent system such as the latency of the network infrastructure, dynamic topology, and node heterogeneity impose new challenges on the task allocation in Multi-Agent environments. Based on the traditional parallel computing task allocation method and Ant Colony Optimization (ACO), a novel task allocation method named Collection Path Ant Colony Optimization (CPACO) is proposed to achieve global optimization and reduce processing time. The existing problems of ACO are analyzed; CPACO overcomes such problems by modifying the heuristic function and the update strategy in the Ant-Cycle Model and establishing a threedimensional path pheromone storage space. The experimental results show that CPACO consumed only 10.3% of the time taken by the Global Search Algorithm and exhibited better performance than the Forward Optimal Heuristic Algorithm.展开更多
By Lie symmetry method, the Lie point symmetries and its Kac-Moody-Virasoro (KMV) symmetry algebra of (2+1)-dimensional dispersive long-wave equation (DLWE) are obtained, and the finite transformation of DLWE is given...By Lie symmetry method, the Lie point symmetries and its Kac-Moody-Virasoro (KMV) symmetry algebra of (2+1)-dimensional dispersive long-wave equation (DLWE) are obtained, and the finite transformation of DLWE is given by symmetry group direct method, which can recover Lie point symmetries. Then KMV symmetry algebra of DLWE with arbitrary order invariant is also obtained. On basis of this algebra the group invariant solutions and similarity reductions are also derived.展开更多
By using the strong continuous semigroup theory of linear operators we prove the existence of a unique positive time-dependent solution of the model describing a re-pairable, standby, human & machine system.
文摘Choosing the best path during unmanned air vehicle （UAV） flying is the target of the UAV mission planning problem. Because of its nearly constant flight height, the UAV mission planning problem can be treated as a 2-D （horizontal） path arrangement problem. By modeling the antiaircraft threat, the UAV mission planning can be mapped to the traveling seaman problem （TSP）. A new algorithm is presented to solve the TSP. The algorithm combines the traditional ant colony system （ACS） with particle swarm optimization （PSO）, thus being called the AC-PSO algorithm. It uses one by one tour building strategy like ACS to determine that the target point can be chosen like PSO. Experiments show that AC-PSO synthesizes both ACS and PSO and obtains excellent solution of the UAV mission planning with a higher accuracy.
文摘To solve the deadlock problem of tasks that the interdependence between tasks fails to consider during the course of resource assignment and task scheduling based on the heuristics algorithm, an improved ant colony system （ACS） based algorithm is proposed. First, how to map the resource assignment and task scheduling （RATS） problem into the optimization selection problem of task resource assignment graph （TRAG） and to add the semaphore mechanism in the optimal TRAG to solve deadlocks are explained. Secondly, how to utilize the grid pheromone system model to realize the algorithm based on ACS is explicated. This refers to the construction of TRAG by the random selection of appropriate resources for each task by the user agent and the optimization of TRAG through the positive feedback and distributed parallel computing mechanism of the ACS. Simulation results show that the proposed algorithm is effective and efficient in solving the deadlock problem.
文摘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 National Natural Science Foundation of China under Grant No.61170117Major National Science and Technology Programs under Grant No.2010ZX07102006+3 种基金National Key Technology R&D Program under Grant No.2012BAH25B02the National 973 Program of China under Grant No.2011CB505402the Guangdong Province University-Industry Cooperation under Grant No.2011A090200008the Scientific Research Foundation, Returned Overseas Chinese Scholars, State Education Ministry
文摘Task allocation is a key issue of agent cooperation mechanism in Multi-Agent Systems. The important features of an agent system such as the latency of the network infrastructure, dynamic topology, and node heterogeneity impose new challenges on the task allocation in Multi-Agent environments. Based on the traditional parallel computing task allocation method and Ant Colony Optimization (ACO), a novel task allocation method named Collection Path Ant Colony Optimization (CPACO) is proposed to achieve global optimization and reduce processing time. The existing problems of ACO are analyzed; CPACO overcomes such problems by modifying the heuristic function and the update strategy in the Ant-Cycle Model and establishing a threedimensional path pheromone storage space. The experimental results show that CPACO consumed only 10.3% of the time taken by the Global Search Algorithm and exhibited better performance than the Forward Optimal Heuristic Algorithm.
基金Supported by the Natural Science Foundation of China under Grant No. 10735030Ningbo Natural Science Foundation under Grant No. 2008A610017+3 种基金National Basic Research Program of China (973 Program 2007CB814800)Shanghai Leading Academic Discipline Project under Grant No. B412Program for Changjiang Scholars and Innovative Research Team in University (IRT0734)K.C. Wong Magna Fund in Ningbo University
文摘By Lie symmetry method, the Lie point symmetries and its Kac-Moody-Virasoro (KMV) symmetry algebra of (2+1)-dimensional dispersive long-wave equation (DLWE) are obtained, and the finite transformation of DLWE is given by symmetry group direct method, which can recover Lie point symmetries. Then KMV symmetry algebra of DLWE with arbitrary order invariant is also obtained. On basis of this algebra the group invariant solutions and similarity reductions are also derived.
基金This research is supported by the Tianyuan Mathematics Foundation (No. 10226007) and the Science Foundation of Xinjiang University
文摘By using the strong continuous semigroup theory of linear operators we prove the existence of a unique positive time-dependent solution of the model describing a re-pairable, standby, human & machine system.
