2006
DOI: 10.1007/s11771-006-0018-4
|View full text |Cite
|
Sign up to set email alerts
|

Global path planning approach based on ant colony optimization algorithm

Abstract: Ant colony optimization (ACO) algorithm was modified to optimize the global path. In order to simulate the real ant colonies, according to the foraging behavior of ant colonies and the characteristic of food, conceptions of neighboring area and smell area were presented. The former can ensure the diversity of paths and the latter ensures that each ant can reach the goal. Then the whole path was divided into three parts and ACO was used to search the second part path. When the three parts pathes were adjusted, … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
7
0

Year Published

2008
2008
2023
2023

Publication Types

Select...
7
2

Relationship

0
9

Authors

Journals

citations
Cited by 20 publications
(7 citation statements)
references
References 5 publications
0
7
0
Order By: Relevance
“…The principle of ant colony searching for food is shown in Figure 9. Wen et al [37] modified ACO to optimize the global path. When only the pheromone was used to search the optimum path, the ACO converges easily.…”
Section: Acomentioning
confidence: 99%
“…The principle of ant colony searching for food is shown in Figure 9. Wen et al [37] modified ACO to optimize the global path. When only the pheromone was used to search the optimum path, the ACO converges easily.…”
Section: Acomentioning
confidence: 99%
“…The ant colony algorithm is an optimization algorithm for simulating behavior of ant colony foraging. 33…”
Section: Aco Of Cutting Trajectory Planningmentioning
confidence: 99%
“…The ant colony algorithm is an optimization algorithm for simulating behavior of ant colony foraging. 33 For roadheader, assuming the starting position g begin of the cutting is the ant nest and the target location g end is the food source. The cutting trajectory planning based on ACO actually makes use of the interaction and collaborating between the ants in the ant colony to avoid all the big dirt bands and finally finds an optimal path.…”
Section: Artificial Neural Network (Ann)mentioning
confidence: 99%
“…Fig.1 shows that the ants can find the optimum route again quickly when a barrier suddenly appears in the path they pass [18]. In general, the ant moves from state x to state y with probability = .... (4) Where, is the amount of pheromone deposited for transition from state x to y, 0 ≤ α is a parameter to control the influence of , is the desirability of state transition xy (a priori knowledge, typically 1 / , where d is the distance) and b ≤ 1 is a parameter to control the influence of .…”
Section: Givingmentioning
confidence: 99%