# Research on Path Planning Method of Coal Mine Robot to Avoid Obstacle in Gas Distribution Area

Authors: Ruiqing Mao; Xiliang Ma
Journal: Journal of Robotics
 (2016)

---

## Abstract

As the explosion-proof safety level of a coal mine robot has not yet reached the level of intrinsic safety “ia” and it cannot work in a dangerous gas distribution area, therefore, path planning methods for coal mine robot to avoid the dangerous area of gas are necessary. In this paper, to avoid a secondary explosion when the coal mine robot passes through gas hazard zones, a path planning method is proposed with consideration of gas concentration distributions. First, with consideration of gas distribution area and obstacles, MAKLINK method is adopted to describe the working environment network diagram of the coal mine robot. Second, the initial working paths for the coal mine robot are obtained based on Dijkstra algorithm, and then the global optimal working path for the coal mine robot is obtained based on ant colony algorithm. Lastly, experiments are conducted in a roadway after an accident, and results by different path planning methods are compared, which verified the effectiveness of the proposed path planning method.


---

## Body

## 1. Introduction

Environment exploration (such as detection of methane concentration) is often necessary before coal mining, and a coal mine robot is needed. Similarly, rescue must be carried out after a coal mine accident, and the working environment in the roadway is always very complex; therefore, coal mine robot is also a good choice. In the process of environment detection or rescue, a secondary explosion must be avoided.In China, the coal mine safe electrical apparatus is Class I, which is strict with the use of mining equipment. Therefore, with regard to coal mine robot, the explosion-proof grade needs to reach the level of intrinsic safety “ia.” However, at present, very few apparatuses can reach the level of “ia” [1]. In order to promote the utility of coal mine robot and avoid the danger during the working process, studies on path planning for coal mine robot are of great significance. On the other hand, the existing studies demonstrated that gas in roadways has the regularities of regional distribution and migration [2, 3]. And the authors of this paper have studied the methane concentration prediction method in the previous studies, as seen in [4].Path planning, which can find out the optimal working path without obstacles, is very important for coal mine robot. Generally, path planning is a nondeterministic polynomial problem with such constraints from much information of environment and obstacles [5]. Artificial Potential Field Method [6], Grid Method [7], and Visibility Graph Method [8] are the common path planning methods. These methods have their own shortages. For example, Artificial Potential Field Method is prone to fall into local optimal point; in complex environment, a surge of storage capacity may arise if Grid Method is adopted; Visibility Graph Method has such shortages as high searching complexity and low efficiency. Pan et al. [9] applied an improved ant colony algorithm to the path planning for mobile robot with peaks on the path considered. Zhang et al. [10] proposed a global path planning method for coal mine rescue robot based on ant colony algorithm. Li et al. [11] studied the global path planning method for mobile robot based on Particle Swarm Optimization. The complex working environment in roadway after coal mine accident brings about great challenges to the path planning for coal mine robot. And there are few researches on path planning method for coal mine robot with gas concentration distributions considered.In the paper, to avoid a secondary explosion when the coal mine robot passes through gas hazard zones, path planning method is studied. First, MAKLINK method is adopted to describe the working environment network diagram of the coal mine robot with consideration of gas distribution area and obstacles. Second, with the help of Dijkstra algorithm, the initial working paths for coal mine robot are obtained, and then ant colony algorithm is adopted to optimize the initial working paths, and the global optimal working paths for coal mine robot are obtained. Lastly, experiments are conducted in a roadway after an accident, and results by different path planning methods are compared.


## 2. Path Planning for Coal Mine Robot

In this paper, with consideration of gas distribution area and obstacles, MAKLINK method is adopted to describe the working environment network graph of coal mine robot. Suppose that the roadway bottom is parallel toX
Y plane of the space rectangular coordinate system O
X
Y
Z and the height of gas concentration distributions and obstacles is parallel to z-axis. The lines linking the nodes, which do not intersect with the obstacles and gas concentration distribution areas, are defined as MAKLINK lines. The convex polygon areas, which are divided by the MAKLINK lines, make up the feasible working space of coal mine robot. Based on the feasible working space, the midpoints of the MAKLINK lines are defined as the possible path nodes v
1
,
v
2
,
…
,
v
n. The feasible paths of coal mine robot are formed by the lines that link the starting point, the possible path nodes [12], and the target point.Based on the GIS system before the mine accident and the modeling of roadway environment after the mine accident, the optimal working path for coal mine robot is obtained by Dijkstra-ant colony algorithm. The optimal working path planning method for coal mine robot is shown in Figure1.Figure 1
Dijkstra-ant colony algorithm for coal mine robot.


### 2.1. Initial Path Planning for Coal Mine Robot

The initial working paths for coal mine robot are obtained based on Dijkstra algorithm. The working environment network graph obtained by MAKLINK method is defined asG
=
(
V
,
E
), where V is the set of all the path nodes which include the starting point and the target point. E is the set of edges which link the path nodes.The adjacency matrix of the network graphG
=
(
V
,
E
) is defined as X. The value of the element at ith row and jth column can be expressed as follows [13]: (1)
X
i
,
j
=
H
v
i
,
v
j
v
i
and
v
j
neighboring
∞
v
i
and
v
j
not neighboring
,where H
(
v
i
,
v
j
) is the distance between v
i and v
j.The set of path nodes of coal mine robot is divided into two subsetsS and U, and V
=
{
S
,
U
}, where S is the set of path nodes that have been admitted to be on the shortest path and U is the set of the path nodes that have not.Based on Dijkstra algorithm, the steps to obtain the initial working paths for coal mine robot are as follows:(1)
Put the starting point St intoS and the rest of the path nodes into U. The adjacency matrix X is used to initialize the shortest paths W between St and each point in U.
(2)
Select the minimum valueW
i in W, and put the corresponding point v
i into S.
(3)
Use pointv
i as the intermediate point, and update the distances W
′ between St and each point in U. If the direct distance between S
t and v
j in U is larger than the sum of the distance between S
t and v
i and that between v
i and v
j, the distance between S
t and v
j is updated to be W
j
′
=
W
i
+
H
(
v
i
,
v
j
).
(4)
Repeat step (2) and step (3), until the setU is empty. The shortest paths between S
t and each path node are obtained.


### 2.2. Optimal Path Planning for Coal Mine Robot

As it is known that a safe working path for coal mine robot can be determined through Dijkstra algorithm, due to the inherent shortcomings of Dijkstra algorithm, it is difficult to guarantee that the obtained path is the optimal one. Therefore, to get the optimal working path for coal mine robot, the initial working paths obtained by Dijkstra algorithm are further optimized by ant colony algorithm.A working path fromS
t to D
s for coal mine robot obtained by Dijkstra algorithm can be expressed as follows:(2)
S
t
⟶
n
1
⟶
n
2
⟶
⋯
⟶
n
l
⟶
D
s
,where n
i
(
i
=
1,2
,
…
,
l
) is the sequential path nodes.The initial length of the paths and the distances between the path nodes and the nodes of obstacles or gas concentration distributions should be considered simultaneously when ant colony algorithm is used. The objective function of the optimal working path for coal mine robot is defined as follows [14]:(3)
F
g
o
a
l
=
H
k
+
1
m
i
n
d
k
o
b
,where H
k is the length of the path that is passed by the kth ant; m
i
n
(
d
k
o
b
) is the minimum value of the distance between the path nodes and the nodes of obstacles or gas concentration distributions passed by the kth ant.The edges on the initial path in MAKLINK graph are defined asH
i
(
i
=
1,2
,
…
,
l
). The endpoints of H
i are v
i
,
0 and v
i
,
1. Other path nodes can be expressed as follows:(4)
v
i
=
v
i
,
0
+
v
i
,
1
-
v
i
,
0
×
k
i
,where k
i is a scale factor and k
i
∈
[
0,1
].For a given set of parametersk
i
(
i
=
1,2
,
…
,
l
), a new path can be obtained by the determined new path nodes on each H
i. The path with the minimum function value is the optimal one for coal mine robot.The initial pathH
i is split by a fixed-length Δ
H. The numbers of the splits of each initial path H
i can be expressed as follows:(5)
n
L
i
=
H
i
Δ
H
H
i
Δ
H
is an even number
H
i
Δ
H
+
1
H
i
Δ
H
is an odd number.There aren
(
H
i
+
1
)
+
1 selective paths from each node on edge H
i to the adjacent edge H
i
+
1. Supposing that the initial ant quantity of ant colony algorithm is m, the path from the starting point S
t to the target point D
s can be expressed as follows:(6)
S
t
⟶
n
1
j
⟶
n
2
j
⟶
⋯
⟶
n
l
j
⟶
D
s
,where n
l
j represents the jth equal division point of the path node on the edge H
l.During ant colony algorithm solving process, to avoid falling into a local optimum, a randomly selected parameterq
(
q
∈
[
0,1
]
) is defined as the selective probability when the kth ant moves from v
i to v
j. The selective probability is compared with a scheduled selectivity constant q
0
(
q
0
∈
[
0,1
]
), and the final selective probability is determined by the compared result and can be expressed as follows:(7)
P
i
j
k
=
m
a
x
τ
i
,
j
ε
η
i
,
j
δ
q
<
q
0
τ
i
,
j
ε
η
i
,
j
δ
∑
s
⊂
a
l
l
o
w
e
d
k
τ
i
,
s
ε
η
i
,
s
δ
q
≥
q
0
,where τ
i
,
j is the pheromone concentration between v
i and v
j; η
i
,
j is the inspired value between v
i and v
j, η
i
,
j
=
1
/
d
i
,
j; d
i
,
j is the distance between v
i and v
j; a
l
l
o
w
e
d
k is the next elective nodes set of the kth ant; ε and δ are the relative importance degree of the pheromone concentration and the inspired value, respectively.After the selective probability of thekth ant which moves from v
i to v
j is obtained, a roulette method is used to determine the right node v
j to which the kth ant moves. As the kth ant reaches v
j, pheromone concentration of the node should be updated as follows:(8)
τ
i
,
j
=
1
-
ρ
τ
i
,
j
′
+
ρ
τ
0
,where τ
i
,
j is the pheromone concentration between v
i and v
j, τ
i
,
j
′ is the pheromone concentration between v
i and v
j before update, τ
0 is the initial pheromone concentration, ρ is the volatile coefficient of pheromone concentration, and ρ
⊂
[
0,1
].After all them ants arrive at the target point D
s, the path with the minimum objective function value is selected, and the pheromone concentration of every node on this path is updated as follows:(9)
τ
i
,
j
=
1
-
ρ
τ
i
,
j
′
+
ρ
Δ
τ
i
,
j
,where Δ
τ
i
,
j is the increment of the pheromone concentration between v
i and v
j on this cycle path, Δ
τ
i
,
j
=
1
/
m
i
n
(
F
g
o
a
l
), and m
i
n
(
F
g
o
a
l
) is the minimum value of the objective function for the paths that all the m ants have passed.By using ant colony algorithm, the steps of the working path optimization for the rescue robot can be described as follows [15]:(1)
Get the initial path by Dijkstra algorithm, and initialize parameters of ant colony algorithm.
(2)
Calculate the selective probability of each ant, and employ a roulette method to determine which node the ant will move to, and move the ant.
(3)
Update the pheromone concentration.
(4)
Repeat step (2) and step (3) until all the ants arrive atD
s.
(5)
Compute the objective functionsF
i
g
o
a
l
(
i
=
1
,
2
,
…
,
m
) of each ant, and compare F
i
g
o
a
l with the current minimum value F
g
o
a
l
m
i
n; if F
i
g
o
a
l
<
F
g
o
a
l
m
i
n, let F
g
o
a
l
m
i
n
=
F
i
g
o
a
l. Then, the pheromone concentration of the nodes that correspond to F
i
g
o
a
l is updated according to (9).
(6)
If the loop ends, export the optimal path; otherwise, go to step (2).The proposed path planning method is suitable for the coal mine robot that works in the roadway of longwall mine.


## 2.1. Initial Path Planning for Coal Mine Robot

The initial working paths for coal mine robot are obtained based on Dijkstra algorithm. The working environment network graph obtained by MAKLINK method is defined asG
=
(
V
,
E
), where V is the set of all the path nodes which include the starting point and the target point. E is the set of edges which link the path nodes.The adjacency matrix of the network graphG
=
(
V
,
E
) is defined as X. The value of the element at ith row and jth column can be expressed as follows [13]: (1)
X
i
,
j
=
H
v
i
,
v
j
v
i
and
v
j
neighboring
∞
v
i
and
v
j
not neighboring
,where H
(
v
i
,
v
j
) is the distance between v
i and v
j.The set of path nodes of coal mine robot is divided into two subsetsS and U, and V
=
{
S
,
U
}, where S is the set of path nodes that have been admitted to be on the shortest path and U is the set of the path nodes that have not.Based on Dijkstra algorithm, the steps to obtain the initial working paths for coal mine robot are as follows:(1)
Put the starting point St intoS and the rest of the path nodes into U. The adjacency matrix X is used to initialize the shortest paths W between St and each point in U.
(2)
Select the minimum valueW
i in W, and put the corresponding point v
i into S.
(3)
Use pointv
i as the intermediate point, and update the distances W
′ between St and each point in U. If the direct distance between S
t and v
j in U is larger than the sum of the distance between S
t and v
i and that between v
i and v
j, the distance between S
t and v
j is updated to be W
j
′
=
W
i
+
H
(
v
i
,
v
j
).
(4)
Repeat step (2) and step (3), until the setU is empty. The shortest paths between S
t and each path node are obtained.


## 2.2. Optimal Path Planning for Coal Mine Robot

As it is known that a safe working path for coal mine robot can be determined through Dijkstra algorithm, due to the inherent shortcomings of Dijkstra algorithm, it is difficult to guarantee that the obtained path is the optimal one. Therefore, to get the optimal working path for coal mine robot, the initial working paths obtained by Dijkstra algorithm are further optimized by ant colony algorithm.A working path fromS
t to D
s for coal mine robot obtained by Dijkstra algorithm can be expressed as follows:(2)
S
t
⟶
n
1
⟶
n
2
⟶
⋯
⟶
n
l
⟶
D
s
,where n
i
(
i
=
1,2
,
…
,
l
) is the sequential path nodes.The initial length of the paths and the distances between the path nodes and the nodes of obstacles or gas concentration distributions should be considered simultaneously when ant colony algorithm is used. The objective function of the optimal working path for coal mine robot is defined as follows [14]:(3)
F
g
o
a
l
=
H
k
+
1
m
i
n
d
k
o
b
,where H
k is the length of the path that is passed by the kth ant; m
i
n
(
d
k
o
b
) is the minimum value of the distance between the path nodes and the nodes of obstacles or gas concentration distributions passed by the kth ant.The edges on the initial path in MAKLINK graph are defined asH
i
(
i
=
1,2
,
…
,
l
). The endpoints of H
i are v
i
,
0 and v
i
,
1. Other path nodes can be expressed as follows:(4)
v
i
=
v
i
,
0
+
v
i
,
1
-
v
i
,
0
×
k
i
,where k
i is a scale factor and k
i
∈
[
0,1
].For a given set of parametersk
i
(
i
=
1,2
,
…
,
l
), a new path can be obtained by the determined new path nodes on each H
i. The path with the minimum function value is the optimal one for coal mine robot.The initial pathH
i is split by a fixed-length Δ
H. The numbers of the splits of each initial path H
i can be expressed as follows:(5)
n
L
i
=
H
i
Δ
H
H
i
Δ
H
is an even number
H
i
Δ
H
+
1
H
i
Δ
H
is an odd number.There aren
(
H
i
+
1
)
+
1 selective paths from each node on edge H
i to the adjacent edge H
i
+
1. Supposing that the initial ant quantity of ant colony algorithm is m, the path from the starting point S
t to the target point D
s can be expressed as follows:(6)
S
t
⟶
n
1
j
⟶
n
2
j
⟶
⋯
⟶
n
l
j
⟶
D
s
,where n
l
j represents the jth equal division point of the path node on the edge H
l.During ant colony algorithm solving process, to avoid falling into a local optimum, a randomly selected parameterq
(
q
∈
[
0,1
]
) is defined as the selective probability when the kth ant moves from v
i to v
j. The selective probability is compared with a scheduled selectivity constant q
0
(
q
0
∈
[
0,1
]
), and the final selective probability is determined by the compared result and can be expressed as follows:(7)
P
i
j
k
=
m
a
x
τ
i
,
j
ε
η
i
,
j
δ
q
<
q
0
τ
i
,
j
ε
η
i
,
j
δ
∑
s
⊂
a
l
l
o
w
e
d
k
τ
i
,
s
ε
η
i
,
s
δ
q
≥
q
0
,where τ
i
,
j is the pheromone concentration between v
i and v
j; η
i
,
j is the inspired value between v
i and v
j, η
i
,
j
=
1
/
d
i
,
j; d
i
,
j is the distance between v
i and v
j; a
l
l
o
w
e
d
k is the next elective nodes set of the kth ant; ε and δ are the relative importance degree of the pheromone concentration and the inspired value, respectively.After the selective probability of thekth ant which moves from v
i to v
j is obtained, a roulette method is used to determine the right node v
j to which the kth ant moves. As the kth ant reaches v
j, pheromone concentration of the node should be updated as follows:(8)
τ
i
,
j
=
1
-
ρ
τ
i
,
j
′
+
ρ
τ
0
,where τ
i
,
j is the pheromone concentration between v
i and v
j, τ
i
,
j
′ is the pheromone concentration between v
i and v
j before update, τ
0 is the initial pheromone concentration, ρ is the volatile coefficient of pheromone concentration, and ρ
⊂
[
0,1
].After all them ants arrive at the target point D
s, the path with the minimum objective function value is selected, and the pheromone concentration of every node on this path is updated as follows:(9)
τ
i
,
j
=
1
-
ρ
τ
i
,
j
′
+
ρ
Δ
τ
i
,
j
,where Δ
τ
i
,
j is the increment of the pheromone concentration between v
i and v
j on this cycle path, Δ
τ
i
,
j
=
1
/
m
i
n
(
F
g
o
a
l
), and m
i
n
(
F
g
o
a
l
) is the minimum value of the objective function for the paths that all the m ants have passed.By using ant colony algorithm, the steps of the working path optimization for the rescue robot can be described as follows [15]:(1)
Get the initial path by Dijkstra algorithm, and initialize parameters of ant colony algorithm.
(2)
Calculate the selective probability of each ant, and employ a roulette method to determine which node the ant will move to, and move the ant.
(3)
Update the pheromone concentration.
(4)
Repeat step (2) and step (3) until all the ants arrive atD
s.
(5)
Compute the objective functionsF
i
g
o
a
l
(
i
=
1
,
2
,
…
,
m
) of each ant, and compare F
i
g
o
a
l with the current minimum value F
g
o
a
l
m
i
n; if F
i
g
o
a
l
<
F
g
o
a
l
m
i
n, let F
g
o
a
l
m
i
n
=
F
i
g
o
a
l. Then, the pheromone concentration of the nodes that correspond to F
i
g
o
a
l is updated according to (9).
(6)
If the loop ends, export the optimal path; otherwise, go to step (2).The proposed path planning method is suitable for the coal mine robot that works in the roadway of longwall mine.


## 3. Experiments and Results

### 3.1. Experimental Conditions

The experiments are carried out in the roadway of Huainan Panyi Mine, whose length is 50 meters and width is 3 meters. In the roadway, gas is distributed regionally and the gas concentration is not over the standard (≤5%). To ensure the safety of the experiments, the area is assumed to be a gas hazard area if the area gas concentration is greater than 2%. Additionally, the length and width of the coal mine robot are 600 mm and 450 mm, respectively. The picture of the coal mine robot is shown in Figure2. The coal mine robot is equipped with multiparameter gas detector, which can be used to detect methane, carbon dioxide, carbon monoxide, oxygen, wind speed and direction, temperature, humidity, and so on. It can also be used to predict the gas concentration ahead. Laser radar and infrared range sensors are also equipped on the coal mine robot. A sensing space corresponding to the real environment is built through laser perception. The distance between the robot and the obstacle is detected by the infrared distance sensor. The designed walking speed of the coal mine robot is 1 m/s [16]. During the walking process of the coal mine robot, the landform would be evaluated, and if the landform could meet the requirements of walking, the coal mine robot would be walking at the speed of 1 m/s, which will reduce quickly to 0.2 m/s when the obstacle or the gas distribution area is about 3 meters far away. Then, the coal mine robot will go around the obstacle or the gas distribution area at a low speed. In the gas detection process, gas densities are recorded once every 0.5 m in length and width directions, and then gas distribution map is generated according to the gas concentration. Path planning for the coal mine robot is performed under two different circumstances. In one circumstance, it is assumed that the roadway is a flat one; the robot can gain access through the tunnel except the side wall and the dangerous area of the gas. In the other circumstance, it is assumed that other obstacles exist in the roadway, such as stones, mound, and gas danger area.Figure 2
The coal mine robot.


### 3.2. Working Environment Modeling for Rescue Robot

The data collected by the coal mine robot is processed, and the gas concentration distributions are shown in Figure3. Not all regions in Figure 3 meet the conditions of a gas explosion, and, in order to increase the working space of the coal mine robot and avoid a secondary explosion when passing through gas hazard zones, the gas concentration distributions are disposed, which is shown in Figure 4. In Figures 3 and 4, the maximum concentration of the gas exists in the innermost of the closed curve. Although the high concentration of gas may not cause an explosion, the coal mine robot cannot pass through.Figure 3
Gas concentration distributions.Figure 4
Regional distributions of gas prone to explosion.The proposed method is applied to the working path planning for the coal mine robot with only the gas concentration area distributions. The coordinate of the starting point and the target point for the rescue robot is (1.5 m, 0) and (1 m, 50 m), respectively. Dijkstra algorithm and Dijkstra-ant colony optimization algorithm are used to solve the optimal path planning of coal mine robot. The parameters of ant colony algorithm are listed as follows:ε
=
1, δ
=
1.2, q
0
=
0.8, ρ
=
0.15, τ
0
=
0.0004, and m
=
30, and the maximum iteration is 500. The final results of the path planning are shown in Figure 5.Figure 5
Result of the path planning with only consideration of gas concentration distributions.∗ denotes the midpoint of the MAKLINK lines.
(a)
Result of the path planning
(b)
Variation of the total path lengthAs observed from Figure5, both the planning working paths by Dijkstra algorithm and the proposed method can avoid the danger gas zones. The curve of the total path length is converged at about 100 times. The total path length by Dijkstra algorithm is 63.39 m, while the one by the proposed method is 60.71 m. Therefore, it can be concluded that the proposed method possesses better performance with only consideration of the gas concentration distributions.The working environment in the roadway is always very complex after a coal mine accident. The proposed method is also applied to the working path planning for the coal mine robot with consideration of the gas concentration distributions and obstacles simultaneously. The final results of the path planning are shown in Figure6.Figure 6
Result of the path planning with consideration of gas concentration distributions and obstacles.∗ denotes the midpoint of the MAKLINK lines.
(a)
Result of the path planning
(b)
Variation of the total path lengthAs observed from Figure6, both the planning working paths by Dijkstra algorithm and the proposed method can avoid the danger gas zones with consideration of the gas concentration distributions and obstacles simultaneously. The curve of the total path length is also converged at about 100 times. The total path length by Dijkstra algorithm is 85.61 m, while the one by the proposed method is 73.95 m. Therefore, it can be concluded that the proposed method possesses better performance.From Figures5 and 6, it can be seen that the planning paths through the proposed method are shorter, which is of great significance to the battery powered coal mine robot. Therefore, the proposed path planning method possesses better performance.


## 3.1. Experimental Conditions

The experiments are carried out in the roadway of Huainan Panyi Mine, whose length is 50 meters and width is 3 meters. In the roadway, gas is distributed regionally and the gas concentration is not over the standard (≤5%). To ensure the safety of the experiments, the area is assumed to be a gas hazard area if the area gas concentration is greater than 2%. Additionally, the length and width of the coal mine robot are 600 mm and 450 mm, respectively. The picture of the coal mine robot is shown in Figure2. The coal mine robot is equipped with multiparameter gas detector, which can be used to detect methane, carbon dioxide, carbon monoxide, oxygen, wind speed and direction, temperature, humidity, and so on. It can also be used to predict the gas concentration ahead. Laser radar and infrared range sensors are also equipped on the coal mine robot. A sensing space corresponding to the real environment is built through laser perception. The distance between the robot and the obstacle is detected by the infrared distance sensor. The designed walking speed of the coal mine robot is 1 m/s [16]. During the walking process of the coal mine robot, the landform would be evaluated, and if the landform could meet the requirements of walking, the coal mine robot would be walking at the speed of 1 m/s, which will reduce quickly to 0.2 m/s when the obstacle or the gas distribution area is about 3 meters far away. Then, the coal mine robot will go around the obstacle or the gas distribution area at a low speed. In the gas detection process, gas densities are recorded once every 0.5 m in length and width directions, and then gas distribution map is generated according to the gas concentration. Path planning for the coal mine robot is performed under two different circumstances. In one circumstance, it is assumed that the roadway is a flat one; the robot can gain access through the tunnel except the side wall and the dangerous area of the gas. In the other circumstance, it is assumed that other obstacles exist in the roadway, such as stones, mound, and gas danger area.Figure 2
The coal mine robot.


## 3.2. Working Environment Modeling for Rescue Robot

The data collected by the coal mine robot is processed, and the gas concentration distributions are shown in Figure3. Not all regions in Figure 3 meet the conditions of a gas explosion, and, in order to increase the working space of the coal mine robot and avoid a secondary explosion when passing through gas hazard zones, the gas concentration distributions are disposed, which is shown in Figure 4. In Figures 3 and 4, the maximum concentration of the gas exists in the innermost of the closed curve. Although the high concentration of gas may not cause an explosion, the coal mine robot cannot pass through.Figure 3
Gas concentration distributions.Figure 4
Regional distributions of gas prone to explosion.The proposed method is applied to the working path planning for the coal mine robot with only the gas concentration area distributions. The coordinate of the starting point and the target point for the rescue robot is (1.5 m, 0) and (1 m, 50 m), respectively. Dijkstra algorithm and Dijkstra-ant colony optimization algorithm are used to solve the optimal path planning of coal mine robot. The parameters of ant colony algorithm are listed as follows:ε
=
1, δ
=
1.2, q
0
=
0.8, ρ
=
0.15, τ
0
=
0.0004, and m
=
30, and the maximum iteration is 500. The final results of the path planning are shown in Figure 5.Figure 5
Result of the path planning with only consideration of gas concentration distributions.∗ denotes the midpoint of the MAKLINK lines.
(a)
Result of the path planning
(b)
Variation of the total path lengthAs observed from Figure5, both the planning working paths by Dijkstra algorithm and the proposed method can avoid the danger gas zones. The curve of the total path length is converged at about 100 times. The total path length by Dijkstra algorithm is 63.39 m, while the one by the proposed method is 60.71 m. Therefore, it can be concluded that the proposed method possesses better performance with only consideration of the gas concentration distributions.The working environment in the roadway is always very complex after a coal mine accident. The proposed method is also applied to the working path planning for the coal mine robot with consideration of the gas concentration distributions and obstacles simultaneously. The final results of the path planning are shown in Figure6.Figure 6
Result of the path planning with consideration of gas concentration distributions and obstacles.∗ denotes the midpoint of the MAKLINK lines.
(a)
Result of the path planning
(b)
Variation of the total path lengthAs observed from Figure6, both the planning working paths by Dijkstra algorithm and the proposed method can avoid the danger gas zones with consideration of the gas concentration distributions and obstacles simultaneously. The curve of the total path length is also converged at about 100 times. The total path length by Dijkstra algorithm is 85.61 m, while the one by the proposed method is 73.95 m. Therefore, it can be concluded that the proposed method possesses better performance.From Figures5 and 6, it can be seen that the planning paths through the proposed method are shorter, which is of great significance to the battery powered coal mine robot. Therefore, the proposed path planning method possesses better performance.


## 4. Conclusions

To avoid a secondary explosion when the coal mine robot passes through gas hazard zones, a path planning method is proposed with consideration of gas concentration distributions and obstacles simultaneously. First, MAKLINK method is adopted to describe the working environment network diagram of the coal mine robot. Second, the initial working paths for the coal mine robot are obtained based on Dijkstra algorithm, and then the global optimal working path for the coal mine robot is obtained based on ant colony algorithm. To verify the effectiveness of the proposed method, lastly, experiments are conducted in a roadway after an accident, and results by different path planning methods are compared. The experiments are divided into two cases; in the first case, it is assumed that the roadway is a flat roadway, and the robot can gain access through the tunnel except the side wall and the dangerous area of the gas; in the other case, obstacles exist in the roadway, such as stones, mound, and gas danger area.With only consideration of gas concentration distributions, the total path length by Dijkstra algorithm is 63.39 m, while the one by the proposed method is 60.71 m. With consideration of gas concentration distributions and obstacles, the total path length by Dijkstra algorithm is 63.39 m, while the one by the proposed method is 60.71 m. From the results of the path planning with only consideration of gas concentration distributions and the path planning with consideration of gas concentration distributions and obstacles, it can be seen that the planning paths through the proposed method are shorter, which is of great significance to the battery powered coal mine robot. Therefore, the proposed path planning method possesses better performance. The experimental results verified the effectiveness of the proposed path planning method.



---

*Source: 4212076-2016-08-03.xml*