Aiming at the problems of complex space, long planning time, and insufficient path security of 3D path planning, an improved ant colony algorithm (TGACO) is proposed, which can be used to solve symmetric and asymmetric path planning problems. Firstly, the 3D array is used to access the environment information, which can record the flight environment and avoid the inefficiency of planning. Secondly, a multi-objective function of distance and angle is established to improve the efficiency and safety of the path. Then, a target-guided heuristic function is proposed, and an anti-deadlock mechanism is introduced to improve the efficiency of the ant colony algorithm. Next, the node pheromone update rules are improved to further improve the effici...
This paper proposes an improved ant colony algorithm to achieve efficient searching capabilities of ...
Dynamic path planning is one of the key procedures for unmanned aerial vehicles (UAV) to successfull...
Considering the complexity of the three-dimensional environment and the flexibility of the quadrotor...
An improved ant colony algorithm, differential evolution chaos ant colony optimization (DEACO) algor...
An improved ant colony algorithm, differential evolution chaos ant colony optimization (DEACO) algor...
In order to solve the problems of deadlock, slow convergence, easy to get into local optimum and une...
This paper uses the grid method with coding tactic based on effective vertexes of barriers (EVB-CT-G...
The conventional ant colony algorithm is easy to fall into the local optimal in some complex environ...
The conventional ant colony algorithm is easy to fall into the local optimal in some complex environ...
Using the traditional Ant Colony Algorithm for AGV path planning is easy to fall into the local opti...
Using the traditional Ant Colony Algorithm for AGV path planning is easy to fall into the local opti...
This paper presents an improved ant colony algorithm for the path planning of the omnidirectional mo...
Aiming at the problems of long search time and local optimal solution of ant colony algorithm (ACA) ...
Ant colony algorithm suffers drawbacks such as slow convergence and easy to trap into local optimum,...
AbstractThe ant colony algorithm is a new class of population basic algorithm. The path planning is ...
This paper proposes an improved ant colony algorithm to achieve efficient searching capabilities of ...
Dynamic path planning is one of the key procedures for unmanned aerial vehicles (UAV) to successfull...
Considering the complexity of the three-dimensional environment and the flexibility of the quadrotor...
An improved ant colony algorithm, differential evolution chaos ant colony optimization (DEACO) algor...
An improved ant colony algorithm, differential evolution chaos ant colony optimization (DEACO) algor...
In order to solve the problems of deadlock, slow convergence, easy to get into local optimum and une...
This paper uses the grid method with coding tactic based on effective vertexes of barriers (EVB-CT-G...
The conventional ant colony algorithm is easy to fall into the local optimal in some complex environ...
The conventional ant colony algorithm is easy to fall into the local optimal in some complex environ...
Using the traditional Ant Colony Algorithm for AGV path planning is easy to fall into the local opti...
Using the traditional Ant Colony Algorithm for AGV path planning is easy to fall into the local opti...
This paper presents an improved ant colony algorithm for the path planning of the omnidirectional mo...
Aiming at the problems of long search time and local optimal solution of ant colony algorithm (ACA) ...
Ant colony algorithm suffers drawbacks such as slow convergence and easy to trap into local optimum,...
AbstractThe ant colony algorithm is a new class of population basic algorithm. The path planning is ...
This paper proposes an improved ant colony algorithm to achieve efficient searching capabilities of ...
Dynamic path planning is one of the key procedures for unmanned aerial vehicles (UAV) to successfull...
Considering the complexity of the three-dimensional environment and the flexibility of the quadrotor...