# An Improved Ant Colony Algorithm for Solving the Path Planning Problem of the Omnidirectional Mobile Vehicle

Authors: Jiang Zhao; Dingding Cheng; Chongqing Hao
Journal: Mathematical Problems in Engineering
 (2016)

---

## Abstract

This paper presents an improved ant colony algorithm for the path planning of the omnidirectional mobile vehicle. The purpose of the improved ant colony algorithm is to design an appropriate route to connect the starting point and ending point of the environment with obstacles. Ant colony algorithm, which is used to solve the path planning problem, is improved according to the characteristics of the omnidirectional mobile vehicle. And in the improved algorithm, the nonuniform distribution of the initial pheromone and the selection strategy with direction play a very positive role in the path search. The coverage and updating strategy of pheromone is introduced to avoid repeated search reducing the effect of the number of ants on the performance of the algorithm. In addition, the pheromone evaporation coefficient is segmented and adjusted, which can effectively balance the convergence speed and search ability. Finally, this paper provides a theoretical basis for the improved ant colony algorithm by strict mathematical derivation, and some numerical simulations are also given to illustrate the effectiveness of the theoretical results.


---

## Body

## 1. Introduction

Path planning, which is one of the hot topics in motion control research, requires the control object to determine the path, avoid obstacles, and achieve the goal autonomously [1]. As a special kind of mobile robot, the omnidirectional mobile robot has wide application in the field of industrial transportation. With the increase of production cost and work efficiency, the path planning problem of the omnidirectional mobile vehicle needs to be resolved as soon as possible. The path planning problem of mobile robot was proposed in the 1960s. With the research of Lozano-Perez and Wesley [2], the problem has aroused the interest of many scholars.Simulated annealing algorithm [3], potential function theory [4], genetic algorithm [5], particle swarm algorithm [6], and ant colony algorithm [7] are representative methods of path planning, which can find the shortest path. In addition, the research on path planning has made great progress in recent years. The idea of Mo and Xu [8] solved the path planning by PSO with the position updating strategy and biogeography particle swarm optimization algorithm to increase the diversity of population and optimize the paths in a static environment. Precup et al. [9] proposed that the adaptive charged system search algorithm was applied to the optimal path planning problem of multiple mobile robots in static environment. Several modifications and improvements of A star algorithm were introduced by Ducho et al. [10] and Guruji et al. [11] considering a static or dynamic environment. And it was the first time that MOVNS [12] was proposed to deal with the path planning problem of mobile robots about the path safety, length, and smoothness. In addition, many other findings also made contributions to the related path planning problem [13–15].Many scholars applied ant colony algorithm [16] to solve the path planning problem because it can represent obstacles flexibly and easily by using a tabu list. On this basis, the further research was carried out. Later, according to the characteristics of the above algorithms, some methods combined ant colony algorithm and other algorithms which were proposed and had more advantages than one algorithm, such as ant colony particle swarm algorithm [2] and ant colony genetic algorithm [17]. However, the application of ant colony algorithm is much more than that. As discussed by Tiwari and Vidyarthi [18], the ant colony optimization algorithm solved the scheduling problem effectively through a kind of special ants that remain alive till the fitter lazy ants are generated in the successive generations. Wang et al. [19] proposed a modified ACS scheme that can identify the true attack path even without the entire network routing information. Jiang et al. [20] presented a coevolutionary improved multiant colony optimization algorithm to design appropriate pipe routes in the layout space under various kinds of constraints. What is more, Saidi-Mehrabad et al. [21] also made some improvements to the ant colony algorithm to solve the problem. Therefore, solving the problem in accordance with the feature of the control object, environment, and existing methods is the best way.So, accordingly, ant colony algorithm is a key point, because it is the basis of the above methods. Therefore, based on the motion characteristics of omnidirectional mobile vehicle, this paper proposes a kind of improved ant colony algorithm. The initial pheromone distribution is nonuniform, which helps reduce the blindness of the search. In the strategy of selection, heuristic information with direction is introduced to improve the probability of finding the optimal solution. And piecewise adjusting pheromone behavior helps avoid falling into local optimal solution. Finally, the pheromone coverage and updating strategy can ensure that the algorithm can find the optimal path strictly in theory.


## 2. Problem Statement

### 2.1. Control Object

As we all know, solving the path planning problem in accordance with the feature of the control object is the best way. Different from mobile robot, the omnidirectional mobile vehicle, as shown in Figure1, is equipped with chassis and drive which can contribute to moving in any direction. In terms of its control system, the omnidirectional mobile vehicle has 8 basic motion units, upper, upper right, right, lower right, lower, lower left, left, and upper left, as shown in Figure 2. Therefore, its form of motion, which is the output of the motion path, can be composed of a number of basic motion units.Figure 1
The omnidirectional mobile vehicle.Figure 2
Basic motion directions.


### 2.2. Problem Description

Without considering the omnidirectional mobile vehicle height, the working environment can be considered as a two-dimensional plane. So the path planning needs to solve three problems:(1)
In a nonchanging work environment, find a path to connect the starting point and the ending point.
(2)
Find the shortest path with avoiding all obstacles.
(3)
The algorithm should have certain simplicity, low complexity, and good stability.


## 2.1. Control Object

As we all know, solving the path planning problem in accordance with the feature of the control object is the best way. Different from mobile robot, the omnidirectional mobile vehicle, as shown in Figure1, is equipped with chassis and drive which can contribute to moving in any direction. In terms of its control system, the omnidirectional mobile vehicle has 8 basic motion units, upper, upper right, right, lower right, lower, lower left, left, and upper left, as shown in Figure 2. Therefore, its form of motion, which is the output of the motion path, can be composed of a number of basic motion units.Figure 1
The omnidirectional mobile vehicle.Figure 2
Basic motion directions.


## 2.2. Problem Description

Without considering the omnidirectional mobile vehicle height, the working environment can be considered as a two-dimensional plane. So the path planning needs to solve three problems:(1)
In a nonchanging work environment, find a path to connect the starting point and the ending point.
(2)
Find the shortest path with avoiding all obstacles.
(3)
The algorithm should have certain simplicity, low complexity, and good stability.


## 3. Mathematical Model

### 3.1. Environment Model

In practical applications, the electronic map is often needed to represent the working environment. This paper describes the work environment using the grid method in which the grid coordinates are replaced by the position of each center point. So working environment is divided intoM
∗
N squares. And the obstacles are represented by gray grids (less than one by one count) distinguishing them from available parts. The area is numbered from top to bottom and from left to right in the literature [22], while the squares can be represented by the set of numbered B
=
{
1,2
,
…
,
b
,
…
,
M
∗
N
} which is shown in Figure 3. In order to identify obstacles, the white grid cell is represented by 0 and the gray grid unit is represented by 1. Thus, the working environment is represented by M
∗
N binary matrix, which is denoted by G.Figure 3
Mathematical model of working environment.


### 3.2. Path Representation

It can be known from the characteristics of the omnidirectional mobile vehicle and the environment representation that the resolution of the system is related to the number of grids. Finally, the path is obtained by adding the components of the solution step by step to obtain the solution. The path of the vehicle can be expressed asL
=
{
(
x
1
,
y
1
)
,
…
,
(
x
i
,
y
i
)
,
…
,
(
x
t
-
1
,
y
t
-
1
)
,
(
x
t
,
y
t
)
}, the starting point is (
x
1
,
y
1
) denoted as S, and the ending point coordinate is (
x
t
,
y
t
) denoted as E. From the environmental model, we can know that the path can be expressed by the grid number L
=
{
l
1
,
…
,
l
i
,
…
,
l
t
-
1
,
l
t
} and (
x
i
,
y
i
) is replaced by l
i, i
=
1
,
…
,
t
-
1
,
t.


## 3.1. Environment Model

In practical applications, the electronic map is often needed to represent the working environment. This paper describes the work environment using the grid method in which the grid coordinates are replaced by the position of each center point. So working environment is divided intoM
∗
N squares. And the obstacles are represented by gray grids (less than one by one count) distinguishing them from available parts. The area is numbered from top to bottom and from left to right in the literature [22], while the squares can be represented by the set of numbered B
=
{
1,2
,
…
,
b
,
…
,
M
∗
N
} which is shown in Figure 3. In order to identify obstacles, the white grid cell is represented by 0 and the gray grid unit is represented by 1. Thus, the working environment is represented by M
∗
N binary matrix, which is denoted by G.Figure 3
Mathematical model of working environment.


## 3.2. Path Representation

It can be known from the characteristics of the omnidirectional mobile vehicle and the environment representation that the resolution of the system is related to the number of grids. Finally, the path is obtained by adding the components of the solution step by step to obtain the solution. The path of the vehicle can be expressed asL
=
{
(
x
1
,
y
1
)
,
…
,
(
x
i
,
y
i
)
,
…
,
(
x
t
-
1
,
y
t
-
1
)
,
(
x
t
,
y
t
)
}, the starting point is (
x
1
,
y
1
) denoted as S, and the ending point coordinate is (
x
t
,
y
t
) denoted as E. From the environmental model, we can know that the path can be expressed by the grid number L
=
{
l
1
,
…
,
l
i
,
…
,
l
t
-
1
,
l
t
} and (
x
i
,
y
i
) is replaced by l
i, i
=
1
,
…
,
t
-
1
,
t.


## 4. Improved Ant Colony Algorithm

### 4.1. Improvement Aspects

(1) Nonuniform Distribution of Initial Pheromone. In the initial phase of traditional ant colony algorithm, the pheromone distribution is described by M
∗
N dimensional matrix, where the element τ
b
∈
T represents the initial value of pheromone in b grid. As shown below, (1)
τ
b
=
c
0
c
0
is  a  constant
.To solve the problems of lack of initial pheromone and low speed of search, in literatures [10, 11] particle swarm optimization algorithm and genetic algorithm are proposed to generate an initial path which can be transformed into the initial pheromone distribution so as to reduce the blindness of the ant colony search. In order to improve the efficiency and simplicity of the algorithm, the nonuniform distribution of initial pheromone is proposed in this paper. So the pheromone distribution is described by matrix T, where element τ
b
∈
T, as shown below:(2)
τ
b
=
c
0
×
θ
1
b
∈
A
c
0
otherwise
,where A is the collection of all numbers between number l
1 and l
t; that is to say, A
=
{
min
⁡
l
1
,
l
t
,
min
⁡
l
1
,
l
t
+
1
,
…
,
max
⁡
{
l
1
,
l
t
}
}; θ
1 is a constant greater than 1. Formula (2) indicates that the number of pieces of information between the starting point and the ending point is slightly higher than others. Similar to the principle of the zero point theorem, in view of the characteristics of the path, the probability of an arbitrary path set between the starting point and the ending point is 1. Therefore, the simple initial distribution strategy has advantages to reduce the blindness of ant colony search, shorten the path search time. And at the same time, it does not increase the complexity of the algorithm.(2) Heuristic Strategy with Direction Information. In the traditional ant colony algorithm, the probability of the next node is selected by rotating the roulette wheel method as follows:(3)
p
l
i
,
l
i
+
1
=
τ
l
i
,
l
i
+
1
α
η
l
i
,
l
i
+
1
β
∑
l
i
+
1
∈
a
l
l
o
w
e
d
b
τ
l
i
,
l
i
+
1
α
η
l
i
,
l
i
+
1
β
,
η
l
i
,
l
i
+
1
=
1
d
l
i
+
1
,
l
t
,
d
l
i
+
1
,
l
t
=
x
l
t
-
x
l
i
+
1
2
+
y
l
t
-
y
l
i
+
1
2
,where p
l
i
,
l
i
+
1 is the probability of the next node of l
i, τ
l
i
,
l
i
+
1 is the pheromone of the path from l
i to l
i
+
1, and α is the pheromone coefficient. Even η
l
i
,
l
i
+
1is the heuristic information of l
i to l
i
+
1, and β is the heuristic information parameter, where d
l
i
+
1
,
l
t is the distance between node l
i
+
1 and end node l
t. (
x
l
i
+
1
,
y
l
i
+
1
) and (
x
l
t
,
y
l
t
) are the coordinates of l
i
+
1 and l
t.The direction information is proposed as the heuristic information of the node transfer strategy by Wang et al. [19] to solve the path planning problem without obstacle:(4)
p
l
i
,
l
i
+
1
=
τ
l
i
,
l
i
+
1
α
η
l
i
,
l
i
+
1
β
∑
l
i
+
1
∈
a
l
l
o
w
e
d
b
τ
l
i
,
l
i
+
1
α
η
l
i
,
l
i
+
1
β
,
η
l
i
,
l
i
+
1
=
θ
2
i
f
s
t
a
t
e
i
s
t
o
w
a
r
d
t
h
e
g
o
a
l
1
o
t
h
e
r
w
i
s
e
,where η
l
i
,
l
i
+
1 is the direction of information and θ
2 is a constant little more than 1. In order to reduce the blindness of the search, the paper puts forward the strategy of the direction information, and the probability formula is (5)
p
l
i
,
l
i
+
1
=
τ
l
i
,
l
i
+
1
α
η
l
i
,
l
i
+
1
β
μ
l
i
,
l
i
+
1
∑
l
i
+
1
∈
allowed
b
τ
l
i
,
l
i
+
1
α
η
l
i
,
l
i
+
1
β
μ
l
i
,
l
i
+
1
l
i
+
1
∈
t
h
e
n
e
x
t
n
o
d
e
0
o
t
h
e
r
w
i
s
e
,where(6)
η
l
i
,
l
i
+
1
=
1
d
l
i
+
1
,
l
t
d
l
i
+
1
,
l
t
=
x
l
t
-
x
l
i
+
1
2
+
y
l
t
-
y
l
i
+
1
2
.The direction informationμ
i
,
i
+
1 is expressed as follows:(7)
μ
l
i
,
l
i
+
1
=
θ
3
γ
,where γ is the number of the same directions of node l
i to next l
i
+
1 and node l
i to end l
t: γ
=
0
,
1
,
2. And θ
3 is a constant slightly greater than 1. As shown in Figure 4, the next node of 17 may be 11, 12, 13, 16, 18, 21, 22, and 23, where node 13 has two same directions as the end, so the direction information is θ
3
2. And as such, the direction information of nodes 11, 12, 18, and 23 is θ
3
1, and for 16, 21, and 22 it is θ
2
0.Figure 4
Directional information representation.(3) Coverage and Updating Strategy. In the traditional ant colony algorithm, the next node position is decided by the roulette wheel method and repeated until the target point is obtained. The pheromones of all nodes are updated by the following rules after every ant ξ searching:(8)
τ
l
i
,
l
i
+
1
k
,
ξ
+
1
=
1
-
ρ
τ
l
i
,
l
i
+
1
k
,
ξ
+
Δ
τ
l
i
,
l
i
+
1
k
,
ξ
,
τ
l
i
,
l
i
+
1
k
+
1,1
=
1
-
ρ
τ
l
i
,
l
i
+
1
k
,
R
+
Δ
τ
l
i
,
l
i
+
1
k
,
R
,
Δ
τ
l
i
,
l
i
+
1
k
,
ξ
=
1
P
L
k
,
ξ
t
h
r
o
u
g
h
l
i
t
o
l
i
+
1
0
o
t
h
e
r
w
i
s
e
,where ρ is the evaporation rate of pheromone, where the function is to avoid the pheromone accumulation: 0
<
ρ
<
1. R is the number of the ants starting from the starting point in every round. Δ
τ
l
i
,
l
i
+
1
(
k
,
ξ
) is the addition of the kth round ξth ant. And P
L
k
,
ξ is the path length of the ξth ant which can get to the end point in the kth round.In the improved ant colony algorithm, the next node position is decided by the roulette wheel method until the target point is obtained. And, in a cycle, the pheromone of all the nodes is updated by following the rules in each round of ants:(9)
τ
l
i
,
l
i
+
1
′
k
+
1
=
1
-
ρ
k
τ
l
i
,
l
i
+
1
k
+
Δ
τ
l
i
,
l
i
+
1
k
,
τ
l
i
,
l
i
+
1
′
′
k
+
1
=
θ
4
τ
l
i
,
l
i
+
1
0
ln
⁡
k
+
1
+
Δ
τ
l
i
,
l
i
+
1
k
,
τ
l
i
,
l
i
+
1
k
+
1
=
max
⁡
τ
l
i
,
l
i
+
1
′
k
+
1
,
τ
l
i
,
l
i
+
1
′
′
k
+
1
.Among them,Δ
τ
l
i
.
l
i
+
1
(
k
) is the pheromone update part of l
i to l
i
+
1 in the kth round. θ
4 is a constant, and the maximum value of the pheromone in the iterative process is the initial set value τ
m
a
x
=
τ
(
0
). ρ
(
k
) is the pheromone evaporation coefficient: 0
<
ρ
(
k
)
<
1. In the entire search space,(10)
Δ
τ
l
i
,
l
i
+
1
k
=
o
Δ
τ
l
i
,
l
i
+
1
k
,
1
,
…
,
Δ
τ
l
i
,
l
i
+
1
k
,
ξ
,
…
,
Δ
τ
l
i
,
l
i
+
1
k
,
R
-
1
,
Δ
τ
l
i
,
l
i
+
1
k
,
R
,where o
(
Δ
τ
l
i
,
l
i
+
1
(
k
,
1
)
,
…
,
Δ
τ
l
i
,
l
i
+
1
(
k
,
R
)
) is a nonzero pheromone space covering operation. For example, (11)
A
1
=
1
2
4
0
0
1
3
0
0
,
A
2
=
2
3
5
1
0
0
2
0
0
,
s
o
o
A
1
,
A
2
=
2
3
5
1
0
1
2
0
0
.In formula (10),(12)
Δ
τ
l
i
,
l
i
+
1
k
,
ξ
=
Q
P
L
k
,
ξ
τ
l
i
,
l
i
+
1
k
,
ξ
t
h
r
o
u
g
h
l
i
t
o
l
i
+
1
0
o
t
h
e
r
w
i
s
e
.Among them,Q is a constant. It can be seen that if the ant can get to the end point, the added part of the pheromone is in inverse proportion with the length and if the ant cannot reach the ending point, it is recorded as 0. The rule can guide the search for the shortest path, improve the speed of convergence, and avoid the possibility of the pheromone accumulation caused by repeated search; meanwhile the effect on the performance of the algorithm caused by the quantity of the ants is reduced.(4) Evaporation Coefficient Segment. When the problem scale is relatively large, due to the presence of pheromone evaporation, the pheromone of some nodes will be reduced greatly, even close to zero, which reduces the search ability of the algorithm. When ρ is large, the search ability is affected by repeated selection. Meanwhile when ρ is small, the search ability of the algorithm is enhanced, but the convergence speed is decreased. Therefore, the heuristic information coefficient is adjusted as follows:(13)
ρ
k
+
1
=
θ
5
ρ
k
ρ
k
≥
ρ
m
i
n
ρ
m
i
n
ρ
k
<
ρ
m
i
n
,where θ
5 is a constant less than 1. k is the number of search rounds: k
=
0,1
,
…
,
K. ρ
(
0
)
=
ρ
m
a
x. ρ
m
a
x and ρ
m
i
n are the maximum and minimum of the coefficient of evaporation. The pheromone evaporation coefficient of fragmentation can enhance the search ability in the initial stage of search, increase the convergence speed later, and improve the performance of ant colony algorithm.


### 4.2. Algorithm Steps

The improved ant colony algorithm is to find the optimal path according to the following steps.Step 1.
The nonuniform distribution of initial pheromone is proposed and pheromone matrixT is constructed according to formula (2).Step 2.
SendK rounds and each round of R ants which are placed at the starting point.Step 3.
Send a round of ants and each ant to select the node according to the roulette wheel method, with the probability of each point calculated by formulas (5), (6), and (7).Step 4.
After a round of ant search, the pheromone was calculated by formulas (10) and (12), the evaporation coefficient was calculated by (13), and the pheromone was updated according to formulas (9).Step 5.
Send the next round of ants, and repeat above Steps3 and 4 until the end of the iteration.Step 6.
Record the shortest path of each round; then draw the curve of the shortest path length of each round.Step 7.
Compare the shortest paths of all the ants. Finally, output the current global optimal path.


### 4.3. Proof of Convergence

The proof depends on a necessary assumption: there is a path between the starting point and the ending at least. According to formulas (10) and (12), the added part of pheromone must be greater than or equal to 0. That is, (14)
Δ
τ
l
i
,
l
i
+
1
k
≥
0
.Formulas (9) show that the pheromone can be expressed as follows:(15)
τ
l
i
,
l
i
+
1
k
≥
max
⁡
1
-
ρ
k
k
τ
0
,
θ
4
τ
0
ln
⁡
k
+
1
.EventE
k means that the optimal solution is obtained for the first time in the kth iteration. Therefore, event ⋀
k
=
1
K
E
k denotes that the algorithm can find the optimal solution for the first time for K iterations. Then probability P
(
⋀
k
=
1
K
E
k
) is satisfied:(16)
lim
k
→
∞
⁡
P
⋀
k
=
1
K
E
k
=
1
.Proof.
l
i
+
1
∗ is the choice of the ith optimal solution, and the probability of finding the optimal solution for the ξth ant in the kth round p
(
k
,
ξ
) can be obtained by formula (5) because the node selection is an independent event.(17)
1
≥
p
k
,
ξ
=
∏
i
=
1
t
-
1
τ
l
i
,
l
i
+
1
∗
α
η
l
i
,
l
i
+
1
∗
β
μ
l
i
,
l
i
+
1
∗
∑
l
i
+
1
∈
a
l
l
o
w
e
d
b
τ
l
i
,
l
i
+
1
α
η
l
i
,
l
i
+
1
β
μ
l
i
,
l
i
+
1
=
∏
i
=
1
t
-
1
τ
l
i
,
l
i
+
1
∗
α
∑
l
i
+
1
∈
a
l
l
o
w
e
d
b
τ
l
i
,
l
i
+
1
α
η
l
i
,
l
i
+
1
/
η
l
i
,
l
i
+
1
∗
β
μ
l
i
,
l
i
+
1
/
μ
l
i
,
l
i
+
1
∗
.
Defineψ
(
l
i
+
1
)
=
(
η
l
i
,
l
i
+
1
/
η
l
i
,
l
i
+
1
∗
)
β
(
μ
l
i
,
l
i
+
1
/
μ
l
i
,
l
i
+
1
∗
), and ψ
m
a
x
=
m
a
x
ψ
l
i
+
1, i
=
1
,
…
,
t
-
1. So formula (17) can be expressed as(18)
∏
i
=
1
t
-
1
τ
l
i
,
l
i
+
1
∗
α
∑
l
i
+
1
∈
a
l
l
o
w
e
d
b
τ
l
i
,
l
i
+
1
α
ψ
m
a
x
.
Because of formula (12), it is known that the minimum value of pheromone in the kth iteration of the ant colony algorithm is(19)
τ
m
i
n
k
≥
θ
4
τ
0
ln
⁡
k
+
1
,
∀
k
≥
1
.
Further, the maximum value of the pheromone is the initial value by setting some parameters. So(20)
τ
m
a
x
=
τ
0
.
And the maximum number ofN
c
(
k
,
ξ
,
(
l
i
,
l
i
+
1
)
) can be expressed as(21)
N
c
=
max
⁡
N
c
k
,
ζ
,
l
i
,
l
i
+
1
,
i
=
1
,
…
,
t
-
1
,where N
c
(
k
,
ξ
,
(
l
i
,
l
i
+
1
)
) is the number of options. By (19), (20), and (21), we can know that formula (18) meets the following relationship:(22)
1
≥
P
k
,
ζ
>
∏
i
=
1
t
-
1
τ
l
i
,
l
i
+
1
∗
α
∑
l
i
+
1
∈
a
l
l
o
w
e
d
b
τ
l
i
,
l
i
+
1
α
ψ
m
a
x
>
θ
4
×
τ
0
/
l
n
k
+
1
α
τ
0
α
×
N
c
×
ψ
m
a
x
t
-
1
.Record(23)
d
=
θ
4
×
τ
0
α
τ
0
α
×
N
c
k
,
ξ
,
l
i
,
l
i
+
1
×
ψ
m
a
x
t
-
1
=
θ
4
α
N
c
k
,
ξ
,
l
i
,
l
i
+
1
×
ψ
m
a
x
t
-
1
.So, formula (22) is expressed as(24)
1
≥
P
k
,
ζ
>
∏
i
=
1
t
-
1
θ
4
×
τ
0
/
l
n
k
+
1
α
τ
0
α
×
N
c
×
ψ
m
a
x
=
d
ln
⁡
k
+
1
t
-
1
α
.From the above, we can know that(25)
1
>
d
l
n
k
+
1
t
-
1
α
>
0
.
The probability that the optimal solution cannot be found by any ants in thekth round is p
(
k
):(26)
p
k
=
1
-
p
k
,
ξ
R
.
ProbabilityP
(
⋁
k
=
1
K
E
-
k
) that cannot find the optimal solution for the K rounds is given as follows:(27)
P
⋁
k
=
1
K
E
-
k
=
∏
k
=
1
K
p
k
=
∏
k
=
1
K
1
-
p
k
,
ξ
R
<
∏
k
=
1
K
1
-
d
ln
⁡
k
+
1
t
-
1
α
R
.
After the logarithm to the above formula,(28)
ln
⁡
P
⋁
k
=
1
K
E
-
k
<
∑
k
=
1
K
ln
⁡
1
-
d
ln
⁡
k
+
1
t
-
1
α
R
=
R
∑
k
=
1
K
ln
⁡
1
-
d
ln
⁡
k
+
1
t
-
1
α
≤
-
R
×
d
∑
k
=
1
K
1
ln
⁡
k
+
1
t
-
1
α
≤
-
R
×
d
∑
k
=
1
K
1
k
+
1
lim
K
→
∞
⁡
ln
⁡
P
⋁
k
=
1
K
E
-
k
<
lim
K
→
∞
⁡
ln
⁡
-
R
×
d
∑
k
=
1
K
1
k
+
1
=
-
∞
.
That is,P
(
⋁
k
=
1
K
E
-
k
)
=
0. So lim
k
→
∞
⁡
P
(
⋀
k
=
1
K
E
k
)
=
1.


## 4.1. Improvement Aspects

(1) Nonuniform Distribution of Initial Pheromone. In the initial phase of traditional ant colony algorithm, the pheromone distribution is described by M
∗
N dimensional matrix, where the element τ
b
∈
T represents the initial value of pheromone in b grid. As shown below, (1)
τ
b
=
c
0
c
0
is  a  constant
.To solve the problems of lack of initial pheromone and low speed of search, in literatures [10, 11] particle swarm optimization algorithm and genetic algorithm are proposed to generate an initial path which can be transformed into the initial pheromone distribution so as to reduce the blindness of the ant colony search. In order to improve the efficiency and simplicity of the algorithm, the nonuniform distribution of initial pheromone is proposed in this paper. So the pheromone distribution is described by matrix T, where element τ
b
∈
T, as shown below:(2)
τ
b
=
c
0
×
θ
1
b
∈
A
c
0
otherwise
,where A is the collection of all numbers between number l
1 and l
t; that is to say, A
=
{
min
⁡
l
1
,
l
t
,
min
⁡
l
1
,
l
t
+
1
,
…
,
max
⁡
{
l
1
,
l
t
}
}; θ
1 is a constant greater than 1. Formula (2) indicates that the number of pieces of information between the starting point and the ending point is slightly higher than others. Similar to the principle of the zero point theorem, in view of the characteristics of the path, the probability of an arbitrary path set between the starting point and the ending point is 1. Therefore, the simple initial distribution strategy has advantages to reduce the blindness of ant colony search, shorten the path search time. And at the same time, it does not increase the complexity of the algorithm.(2) Heuristic Strategy with Direction Information. In the traditional ant colony algorithm, the probability of the next node is selected by rotating the roulette wheel method as follows:(3)
p
l
i
,
l
i
+
1
=
τ
l
i
,
l
i
+
1
α
η
l
i
,
l
i
+
1
β
∑
l
i
+
1
∈
a
l
l
o
w
e
d
b
τ
l
i
,
l
i
+
1
α
η
l
i
,
l
i
+
1
β
,
η
l
i
,
l
i
+
1
=
1
d
l
i
+
1
,
l
t
,
d
l
i
+
1
,
l
t
=
x
l
t
-
x
l
i
+
1
2
+
y
l
t
-
y
l
i
+
1
2
,where p
l
i
,
l
i
+
1 is the probability of the next node of l
i, τ
l
i
,
l
i
+
1 is the pheromone of the path from l
i to l
i
+
1, and α is the pheromone coefficient. Even η
l
i
,
l
i
+
1is the heuristic information of l
i to l
i
+
1, and β is the heuristic information parameter, where d
l
i
+
1
,
l
t is the distance between node l
i
+
1 and end node l
t. (
x
l
i
+
1
,
y
l
i
+
1
) and (
x
l
t
,
y
l
t
) are the coordinates of l
i
+
1 and l
t.The direction information is proposed as the heuristic information of the node transfer strategy by Wang et al. [19] to solve the path planning problem without obstacle:(4)
p
l
i
,
l
i
+
1
=
τ
l
i
,
l
i
+
1
α
η
l
i
,
l
i
+
1
β
∑
l
i
+
1
∈
a
l
l
o
w
e
d
b
τ
l
i
,
l
i
+
1
α
η
l
i
,
l
i
+
1
β
,
η
l
i
,
l
i
+
1
=
θ
2
i
f
s
t
a
t
e
i
s
t
o
w
a
r
d
t
h
e
g
o
a
l
1
o
t
h
e
r
w
i
s
e
,where η
l
i
,
l
i
+
1 is the direction of information and θ
2 is a constant little more than 1. In order to reduce the blindness of the search, the paper puts forward the strategy of the direction information, and the probability formula is (5)
p
l
i
,
l
i
+
1
=
τ
l
i
,
l
i
+
1
α
η
l
i
,
l
i
+
1
β
μ
l
i
,
l
i
+
1
∑
l
i
+
1
∈
allowed
b
τ
l
i
,
l
i
+
1
α
η
l
i
,
l
i
+
1
β
μ
l
i
,
l
i
+
1
l
i
+
1
∈
t
h
e
n
e
x
t
n
o
d
e
0
o
t
h
e
r
w
i
s
e
,where(6)
η
l
i
,
l
i
+
1
=
1
d
l
i
+
1
,
l
t
d
l
i
+
1
,
l
t
=
x
l
t
-
x
l
i
+
1
2
+
y
l
t
-
y
l
i
+
1
2
.The direction informationμ
i
,
i
+
1 is expressed as follows:(7)
μ
l
i
,
l
i
+
1
=
θ
3
γ
,where γ is the number of the same directions of node l
i to next l
i
+
1 and node l
i to end l
t: γ
=
0
,
1
,
2. And θ
3 is a constant slightly greater than 1. As shown in Figure 4, the next node of 17 may be 11, 12, 13, 16, 18, 21, 22, and 23, where node 13 has two same directions as the end, so the direction information is θ
3
2. And as such, the direction information of nodes 11, 12, 18, and 23 is θ
3
1, and for 16, 21, and 22 it is θ
2
0.Figure 4
Directional information representation.(3) Coverage and Updating Strategy. In the traditional ant colony algorithm, the next node position is decided by the roulette wheel method and repeated until the target point is obtained. The pheromones of all nodes are updated by the following rules after every ant ξ searching:(8)
τ
l
i
,
l
i
+
1
k
,
ξ
+
1
=
1
-
ρ
τ
l
i
,
l
i
+
1
k
,
ξ
+
Δ
τ
l
i
,
l
i
+
1
k
,
ξ
,
τ
l
i
,
l
i
+
1
k
+
1,1
=
1
-
ρ
τ
l
i
,
l
i
+
1
k
,
R
+
Δ
τ
l
i
,
l
i
+
1
k
,
R
,
Δ
τ
l
i
,
l
i
+
1
k
,
ξ
=
1
P
L
k
,
ξ
t
h
r
o
u
g
h
l
i
t
o
l
i
+
1
0
o
t
h
e
r
w
i
s
e
,where ρ is the evaporation rate of pheromone, where the function is to avoid the pheromone accumulation: 0
<
ρ
<
1. R is the number of the ants starting from the starting point in every round. Δ
τ
l
i
,
l
i
+
1
(
k
,
ξ
) is the addition of the kth round ξth ant. And P
L
k
,
ξ is the path length of the ξth ant which can get to the end point in the kth round.In the improved ant colony algorithm, the next node position is decided by the roulette wheel method until the target point is obtained. And, in a cycle, the pheromone of all the nodes is updated by following the rules in each round of ants:(9)
τ
l
i
,
l
i
+
1
′
k
+
1
=
1
-
ρ
k
τ
l
i
,
l
i
+
1
k
+
Δ
τ
l
i
,
l
i
+
1
k
,
τ
l
i
,
l
i
+
1
′
′
k
+
1
=
θ
4
τ
l
i
,
l
i
+
1
0
ln
⁡
k
+
1
+
Δ
τ
l
i
,
l
i
+
1
k
,
τ
l
i
,
l
i
+
1
k
+
1
=
max
⁡
τ
l
i
,
l
i
+
1
′
k
+
1
,
τ
l
i
,
l
i
+
1
′
′
k
+
1
.Among them,Δ
τ
l
i
.
l
i
+
1
(
k
) is the pheromone update part of l
i to l
i
+
1 in the kth round. θ
4 is a constant, and the maximum value of the pheromone in the iterative process is the initial set value τ
m
a
x
=
τ
(
0
). ρ
(
k
) is the pheromone evaporation coefficient: 0
<
ρ
(
k
)
<
1. In the entire search space,(10)
Δ
τ
l
i
,
l
i
+
1
k
=
o
Δ
τ
l
i
,
l
i
+
1
k
,
1
,
…
,
Δ
τ
l
i
,
l
i
+
1
k
,
ξ
,
…
,
Δ
τ
l
i
,
l
i
+
1
k
,
R
-
1
,
Δ
τ
l
i
,
l
i
+
1
k
,
R
,where o
(
Δ
τ
l
i
,
l
i
+
1
(
k
,
1
)
,
…
,
Δ
τ
l
i
,
l
i
+
1
(
k
,
R
)
) is a nonzero pheromone space covering operation. For example, (11)
A
1
=
1
2
4
0
0
1
3
0
0
,
A
2
=
2
3
5
1
0
0
2
0
0
,
s
o
o
A
1
,
A
2
=
2
3
5
1
0
1
2
0
0
.In formula (10),(12)
Δ
τ
l
i
,
l
i
+
1
k
,
ξ
=
Q
P
L
k
,
ξ
τ
l
i
,
l
i
+
1
k
,
ξ
t
h
r
o
u
g
h
l
i
t
o
l
i
+
1
0
o
t
h
e
r
w
i
s
e
.Among them,Q is a constant. It can be seen that if the ant can get to the end point, the added part of the pheromone is in inverse proportion with the length and if the ant cannot reach the ending point, it is recorded as 0. The rule can guide the search for the shortest path, improve the speed of convergence, and avoid the possibility of the pheromone accumulation caused by repeated search; meanwhile the effect on the performance of the algorithm caused by the quantity of the ants is reduced.(4) Evaporation Coefficient Segment. When the problem scale is relatively large, due to the presence of pheromone evaporation, the pheromone of some nodes will be reduced greatly, even close to zero, which reduces the search ability of the algorithm. When ρ is large, the search ability is affected by repeated selection. Meanwhile when ρ is small, the search ability of the algorithm is enhanced, but the convergence speed is decreased. Therefore, the heuristic information coefficient is adjusted as follows:(13)
ρ
k
+
1
=
θ
5
ρ
k
ρ
k
≥
ρ
m
i
n
ρ
m
i
n
ρ
k
<
ρ
m
i
n
,where θ
5 is a constant less than 1. k is the number of search rounds: k
=
0,1
,
…
,
K. ρ
(
0
)
=
ρ
m
a
x. ρ
m
a
x and ρ
m
i
n are the maximum and minimum of the coefficient of evaporation. The pheromone evaporation coefficient of fragmentation can enhance the search ability in the initial stage of search, increase the convergence speed later, and improve the performance of ant colony algorithm.


## 4.2. Algorithm Steps

The improved ant colony algorithm is to find the optimal path according to the following steps.Step 1.
The nonuniform distribution of initial pheromone is proposed and pheromone matrixT is constructed according to formula (2).Step 2.
SendK rounds and each round of R ants which are placed at the starting point.Step 3.
Send a round of ants and each ant to select the node according to the roulette wheel method, with the probability of each point calculated by formulas (5), (6), and (7).Step 4.
After a round of ant search, the pheromone was calculated by formulas (10) and (12), the evaporation coefficient was calculated by (13), and the pheromone was updated according to formulas (9).Step 5.
Send the next round of ants, and repeat above Steps3 and 4 until the end of the iteration.Step 6.
Record the shortest path of each round; then draw the curve of the shortest path length of each round.Step 7.
Compare the shortest paths of all the ants. Finally, output the current global optimal path.


## 4.3. Proof of Convergence

The proof depends on a necessary assumption: there is a path between the starting point and the ending at least. According to formulas (10) and (12), the added part of pheromone must be greater than or equal to 0. That is, (14)
Δ
τ
l
i
,
l
i
+
1
k
≥
0
.Formulas (9) show that the pheromone can be expressed as follows:(15)
τ
l
i
,
l
i
+
1
k
≥
max
⁡
1
-
ρ
k
k
τ
0
,
θ
4
τ
0
ln
⁡
k
+
1
.EventE
k means that the optimal solution is obtained for the first time in the kth iteration. Therefore, event ⋀
k
=
1
K
E
k denotes that the algorithm can find the optimal solution for the first time for K iterations. Then probability P
(
⋀
k
=
1
K
E
k
) is satisfied:(16)
lim
k
→
∞
⁡
P
⋀
k
=
1
K
E
k
=
1
.Proof.
l
i
+
1
∗ is the choice of the ith optimal solution, and the probability of finding the optimal solution for the ξth ant in the kth round p
(
k
,
ξ
) can be obtained by formula (5) because the node selection is an independent event.(17)
1
≥
p
k
,
ξ
=
∏
i
=
1
t
-
1
τ
l
i
,
l
i
+
1
∗
α
η
l
i
,
l
i
+
1
∗
β
μ
l
i
,
l
i
+
1
∗
∑
l
i
+
1
∈
a
l
l
o
w
e
d
b
τ
l
i
,
l
i
+
1
α
η
l
i
,
l
i
+
1
β
μ
l
i
,
l
i
+
1
=
∏
i
=
1
t
-
1
τ
l
i
,
l
i
+
1
∗
α
∑
l
i
+
1
∈
a
l
l
o
w
e
d
b
τ
l
i
,
l
i
+
1
α
η
l
i
,
l
i
+
1
/
η
l
i
,
l
i
+
1
∗
β
μ
l
i
,
l
i
+
1
/
μ
l
i
,
l
i
+
1
∗
.
Defineψ
(
l
i
+
1
)
=
(
η
l
i
,
l
i
+
1
/
η
l
i
,
l
i
+
1
∗
)
β
(
μ
l
i
,
l
i
+
1
/
μ
l
i
,
l
i
+
1
∗
), and ψ
m
a
x
=
m
a
x
ψ
l
i
+
1, i
=
1
,
…
,
t
-
1. So formula (17) can be expressed as(18)
∏
i
=
1
t
-
1
τ
l
i
,
l
i
+
1
∗
α
∑
l
i
+
1
∈
a
l
l
o
w
e
d
b
τ
l
i
,
l
i
+
1
α
ψ
m
a
x
.
Because of formula (12), it is known that the minimum value of pheromone in the kth iteration of the ant colony algorithm is(19)
τ
m
i
n
k
≥
θ
4
τ
0
ln
⁡
k
+
1
,
∀
k
≥
1
.
Further, the maximum value of the pheromone is the initial value by setting some parameters. So(20)
τ
m
a
x
=
τ
0
.
And the maximum number ofN
c
(
k
,
ξ
,
(
l
i
,
l
i
+
1
)
) can be expressed as(21)
N
c
=
max
⁡
N
c
k
,
ζ
,
l
i
,
l
i
+
1
,
i
=
1
,
…
,
t
-
1
,where N
c
(
k
,
ξ
,
(
l
i
,
l
i
+
1
)
) is the number of options. By (19), (20), and (21), we can know that formula (18) meets the following relationship:(22)
1
≥
P
k
,
ζ
>
∏
i
=
1
t
-
1
τ
l
i
,
l
i
+
1
∗
α
∑
l
i
+
1
∈
a
l
l
o
w
e
d
b
τ
l
i
,
l
i
+
1
α
ψ
m
a
x
>
θ
4
×
τ
0
/
l
n
k
+
1
α
τ
0
α
×
N
c
×
ψ
m
a
x
t
-
1
.Record(23)
d
=
θ
4
×
τ
0
α
τ
0
α
×
N
c
k
,
ξ
,
l
i
,
l
i
+
1
×
ψ
m
a
x
t
-
1
=
θ
4
α
N
c
k
,
ξ
,
l
i
,
l
i
+
1
×
ψ
m
a
x
t
-
1
.So, formula (22) is expressed as(24)
1
≥
P
k
,
ζ
>
∏
i
=
1
t
-
1
θ
4
×
τ
0
/
l
n
k
+
1
α
τ
0
α
×
N
c
×
ψ
m
a
x
=
d
ln
⁡
k
+
1
t
-
1
α
.From the above, we can know that(25)
1
>
d
l
n
k
+
1
t
-
1
α
>
0
.
The probability that the optimal solution cannot be found by any ants in thekth round is p
(
k
):(26)
p
k
=
1
-
p
k
,
ξ
R
.
ProbabilityP
(
⋁
k
=
1
K
E
-
k
) that cannot find the optimal solution for the K rounds is given as follows:(27)
P
⋁
k
=
1
K
E
-
k
=
∏
k
=
1
K
p
k
=
∏
k
=
1
K
1
-
p
k
,
ξ
R
<
∏
k
=
1
K
1
-
d
ln
⁡
k
+
1
t
-
1
α
R
.
After the logarithm to the above formula,(28)
ln
⁡
P
⋁
k
=
1
K
E
-
k
<
∑
k
=
1
K
ln
⁡
1
-
d
ln
⁡
k
+
1
t
-
1
α
R
=
R
∑
k
=
1
K
ln
⁡
1
-
d
ln
⁡
k
+
1
t
-
1
α
≤
-
R
×
d
∑
k
=
1
K
1
ln
⁡
k
+
1
t
-
1
α
≤
-
R
×
d
∑
k
=
1
K
1
k
+
1
lim
K
→
∞
⁡
ln
⁡
P
⋁
k
=
1
K
E
-
k
<
lim
K
→
∞
⁡
ln
⁡
-
R
×
d
∑
k
=
1
K
1
k
+
1
=
-
∞
.
That is,P
(
⋁
k
=
1
K
E
-
k
)
=
0. So lim
k
→
∞
⁡
P
(
⋀
k
=
1
K
E
k
)
=
1.


## 5. Numerical Simulations

The experiments are made to demonstrate the effectiveness of the proposed algorithm. The algorithm is compiled in MATLAB software. Experiments were conducted using a comparative method to be more persuasive along with the same experimental conditions.


### 5.1. Simulation Experiments

The experiment was divided into three parts with two algorithms, the traditional ant colony algorithm and the improved ant colony algorithm. In order to compare the effects of the two algorithms, they are used in the same environment.(1) Example  1. In this example, set the simulation environment as 20
×
20 grids and the length of each unit is 1. The starting point is the upper left corner in the grid (
0.5,19.5
), and the end point is the lower right corner (
19.5,0.5
) (see Figure 5).Figure 5
(a) Simulation results in20
×
20 grids. (b) The iterative curve by the traditional algorithm. (c) The iterative curve by the improved algorithm. (d) The path average curve length by two algorithms.
(a)
(b)
(c)
(d)(2) Example  2. We set the environment as 30
×
30 grids and the length of the unit is 1. The starting point is (
0.5,8.5
), and the end point is (
25.5,28.5
) (see Figure 6).Figure 6
(a) Simulation results in30
×
30 grids. (b) The iterative curve by the traditional algorithm. (c) The iterative curve by the improved algorithm. (d) The path average curve length by two algorithms.
(a)
(b)
(c)
(d)(3) Example  3. The experiment is made in model of 40
×
40 grids and the length of each unit is 1. The starting point is set at (
0.5,39.5
), and the ending point is set at (
39.5,0.5
) (see Figure 7).Figure 7
(a) Simulation results in40
×
40 grids. (b) The iterative curve by the traditional algorithm. (c) The iterative curve by the improved algorithm. (d) The path average curve length by two algorithms.
(a)
(b)
(c)
(d)


### 5.2. Results Analysis

As shown in Figure5(a), it is a global optimal path in the case of Example  1. Similarly, Figures 6(a) and 7(a) are the global optimal paths in Examples  2 and 3, respectively. The obstacles in each environment are randomly selected. The three experiment results show that the ant colony algorithm and the improved ant colony algorithm both can find the global optimal paths in a variety of environments.Figures5(b) and 5(c) depict the path length iteration curves in Example  1 by traditional ant colony algorithm and the improved ant colony algorithm. And the search process about the shortest path length of each round and the current global optimal path length can be seen from the figures. By comparison, it can be seen that the shortest path length is found in the 49th iteration by traditional ant colony algorithm, while it is found in the fifth iteration by the improved algorithm. And once the optimal solution is obtained, the search will converge to the shortest path value by the improved algorithm. Similarly, Figures 6(b) and 6(c) represent the search process of the two algorithms in Example  2. The traditional ant colony algorithm finds the shortest path in the 69th iteration with value of 35.63, while the improved algorithm gets the shortest path in the ninth times. In the same way, Figures 7(b) and 7(c) show that the traditional ant colony algorithm and the improved ant colony algorithm find the shortest path in the 37th and 24th iterations, respectively. Therefore, it can be seen that the search efficiency of the improved ant colony algorithm is significantly higher compared to the traditional ant colony algorithm in a variety of environment.The mean value of path iterative length often represents the convergence ability of the algorithm. Figures5(d), 6(d), and 7(d) present the contrast of the two algorithms on the search path average value. The improved algorithm not only is faster than the ant colony algorithm but also can avoid falling into local minimum point and obtain the global optimal solution effectively either in simple environment or in a complex one.


## 5.1. Simulation Experiments

The experiment was divided into three parts with two algorithms, the traditional ant colony algorithm and the improved ant colony algorithm. In order to compare the effects of the two algorithms, they are used in the same environment.(1) Example  1. In this example, set the simulation environment as 20
×
20 grids and the length of each unit is 1. The starting point is the upper left corner in the grid (
0.5,19.5
), and the end point is the lower right corner (
19.5,0.5
) (see Figure 5).Figure 5
(a) Simulation results in20
×
20 grids. (b) The iterative curve by the traditional algorithm. (c) The iterative curve by the improved algorithm. (d) The path average curve length by two algorithms.
(a)
(b)
(c)
(d)(2) Example  2. We set the environment as 30
×
30 grids and the length of the unit is 1. The starting point is (
0.5,8.5
), and the end point is (
25.5,28.5
) (see Figure 6).Figure 6
(a) Simulation results in30
×
30 grids. (b) The iterative curve by the traditional algorithm. (c) The iterative curve by the improved algorithm. (d) The path average curve length by two algorithms.
(a)
(b)
(c)
(d)(3) Example  3. The experiment is made in model of 40
×
40 grids and the length of each unit is 1. The starting point is set at (
0.5,39.5
), and the ending point is set at (
39.5,0.5
) (see Figure 7).Figure 7
(a) Simulation results in40
×
40 grids. (b) The iterative curve by the traditional algorithm. (c) The iterative curve by the improved algorithm. (d) The path average curve length by two algorithms.
(a)
(b)
(c)
(d)


## 5.2. Results Analysis

As shown in Figure5(a), it is a global optimal path in the case of Example  1. Similarly, Figures 6(a) and 7(a) are the global optimal paths in Examples  2 and 3, respectively. The obstacles in each environment are randomly selected. The three experiment results show that the ant colony algorithm and the improved ant colony algorithm both can find the global optimal paths in a variety of environments.Figures5(b) and 5(c) depict the path length iteration curves in Example  1 by traditional ant colony algorithm and the improved ant colony algorithm. And the search process about the shortest path length of each round and the current global optimal path length can be seen from the figures. By comparison, it can be seen that the shortest path length is found in the 49th iteration by traditional ant colony algorithm, while it is found in the fifth iteration by the improved algorithm. And once the optimal solution is obtained, the search will converge to the shortest path value by the improved algorithm. Similarly, Figures 6(b) and 6(c) represent the search process of the two algorithms in Example  2. The traditional ant colony algorithm finds the shortest path in the 69th iteration with value of 35.63, while the improved algorithm gets the shortest path in the ninth times. In the same way, Figures 7(b) and 7(c) show that the traditional ant colony algorithm and the improved ant colony algorithm find the shortest path in the 37th and 24th iterations, respectively. Therefore, it can be seen that the search efficiency of the improved ant colony algorithm is significantly higher compared to the traditional ant colony algorithm in a variety of environment.The mean value of path iterative length often represents the convergence ability of the algorithm. Figures5(d), 6(d), and 7(d) present the contrast of the two algorithms on the search path average value. The improved algorithm not only is faster than the ant colony algorithm but also can avoid falling into local minimum point and obtain the global optimal solution effectively either in simple environment or in a complex one.


## 6. Conclusion

In this paper, an improved ant colony algorithm is proposed for the 8 control operating units of the omnidirectional mobile vehicle. The grid method is used to establish the environment model, and the tabu list is introduced. By using the tabu list to show the obstacles and the units that have passed through, it is flexible to deal with obstacles and avoid duplicating the path. In this paper, the initial distribution of nonuniformity pheromone is presented which improves the time efficiency and the simplicity of the algorithm and reduces the search space of ant colony algorithm. Adding the direction of the selection strategy can get more effective information as the heuristic information, more actively guide the search behavior of ants, and reduce the blindness. By using the rule of coverage, the search probability is reduced, the stability of the algorithm is guaranteed, and the effect of the quantity of the ants on the performance of the algorithm is guaranteed. The pheromone evaporation coefficient is segmented and adjusted, which can effectively balance the convergence speed and search ability of the algorithm. Finally, it is strictly proven that the probability of finding an optimal solution is limited to 1 by the improved algorithm. The improved ant colony algorithm in solving the shortest path planning problem of the omnidirectional mobile vehicle has very good performance.



---

*Source: 7672839-2016-09-19.xml*