2021
DOI: 10.1080/21642583.2021.1901158
|View full text |Cite
|
Sign up to set email alerts
|

Path planning for coal mine robot via improved ant colony optimization algorithm

Abstract: This paper is concerned with the path planning of the coal mine robot. A new workspace model is presented to describe the complex coal mine environment. Thus, the cost of a path is composed of not only the distance of the path but also some hybrid costs that can be linked to the criteria of path optimization. To overcome the drawbacks of conventional ant colony optimization (ACO) algorithm, an improved ACO algorithm is developed to tackle the issues of path planning of coal mine robot based on the new workspac… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
7
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
7
2

Relationship

0
9

Authors

Journals

citations
Cited by 39 publications
(12 citation statements)
references
References 13 publications
0
7
0
Order By: Relevance
“…e formula represents the distance from fence i to i. Suppose the ant colony is initialized [17] pheromone ℓ ii (d) � c. After n times, the ant completes a cycle, and the amount of pheromone on each path will change due to the passage of the ant and the change of time. e change rules are as follows:…”
Section: Revised Ant Colonies Computer Systemmentioning
confidence: 99%
“…e formula represents the distance from fence i to i. Suppose the ant colony is initialized [17] pheromone ℓ ii (d) � c. After n times, the ant completes a cycle, and the amount of pheromone on each path will change due to the passage of the ant and the change of time. e change rules are as follows:…”
Section: Revised Ant Colonies Computer Systemmentioning
confidence: 99%
“…[1] Dataset Ⅳa [45] This dataset consists of EEG signals of three MI tasks (left hand, right hand, and right foot) recorded from 118 EEG channels, with only cues of the right hand and foot tasks provided for competition purpose. Five healthy subjects (aa, al, av, aw, and ay) participate in the experiments, and cues of 280 trials are provided for each subject.…”
Section: Dataset Descriptionmentioning
confidence: 99%
“…More details of this dataset can be found on the competition website (http://www.bbci.de/competition/iii/desc_ IVa.html). [2] Dataset Ⅲa [45] This dataset is recorded over 60 EEG channels at 250Hz from three subjects (k3, k6, and l1). Every subject is instructed to imagine four kinds of movement, namely, MI tasks of the left hand, right hand, tongue, and foot.…”
Section: Dataset Descriptionmentioning
confidence: 99%
“…It is worth mentioning that evolutionary computation (EC) has been widely used to solve various optimization problems [39], [50]- [52]. Among the EC algorithms, the particle swarm optimization (PSO) algorithm is a population-based one, which is inspired by the mimics of social interactions, e.g., birds flocking and fish schooling [55], [57].…”
Section: Introductionmentioning
confidence: 99%