2019
DOI: 10.3389/fnbot.2019.00015
|View full text |Cite
|
Sign up to set email alerts
|

Mobile Robot Path Planning Based on Ant Colony Algorithm With A* Heuristic Method

Abstract: This paper proposes an improved ant colony algorithm to achieve efficient searching capabilities of path planning in complicated maps for mobile robot. The improved ant colony algorithm uses the characteristics of A * algorithm and MAX-MIN Ant system. Firstly, the grid environment model is constructed. The evaluation function of A * algorithm and the bending suppression operator are introduced to improve the heuristic information of the Ant colony algorithm, which … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

1
87
0
1

Year Published

2019
2019
2024
2024

Publication Types

Select...
5
3

Relationship

0
8

Authors

Journals

citations
Cited by 167 publications
(89 citation statements)
references
References 35 publications
1
87
0
1
Order By: Relevance
“…It endorses that it utilizes the network coding resources in better way. It is now used in latest projects like path finding for unmanned vehicles [44] and Path Planning for Mobile Robots [9].…”
Section: Gray Hole Attackmentioning
confidence: 99%
See 1 more Smart Citation
“…It endorses that it utilizes the network coding resources in better way. It is now used in latest projects like path finding for unmanned vehicles [44] and Path Planning for Mobile Robots [9].…”
Section: Gray Hole Attackmentioning
confidence: 99%
“…As this study is focusing on prevention of Black Hole Attacks in MANET, the path finding and route optimization technique can be selected among these metaheuristics simple, basic and advanced techniques of Ant Colony Optimization [9], Particle Swarm Optimization (PSO) [26], External Optimization [45,46], Large Neighborhood Search [17] and Neuro-Heuristic Methods [31].…”
Section: Objectives and Motivationmentioning
confidence: 99%
“…However, the recent investigation has been improved by adopting different techniques. For example, Dai et al [16] implemented the A* characteristics into an ant algorithm and Yang et al [17] presented an efficient double layer ant colony, which is called DL-ACO. This novel concept uses two ant colony running independently and successively.…”
Section: Of 19mentioning
confidence: 99%
“…Ant algorithm with A* characteristic [16] A* accelerates the ant colony conversion and increases the smoothness of global path.…”
Section: Reference Advantages Weaknessmentioning
confidence: 99%
“…ACA (ACO) is used for path optimization and obstacle avoidance planning for robots or UAVs [33]- [39]. Variants of ACA reduce the computing costs and training speeds [28], [40], [41].…”
Section: Introductionmentioning
confidence: 99%