IECON 2021 – 47th Annual Conference of the IEEE Industrial Electronics Society 2021
DOI: 10.1109/iecon48115.2021.9589808
|View full text |Cite
|
Sign up to set email alerts
|

Path Planning of Mobile Robot Based on Adaptive Ant Colony Optimization

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
0
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
4
3

Relationship

0
7

Authors

Journals

citations
Cited by 7 publications
(5 citation statements)
references
References 10 publications
0
0
0
Order By: Relevance
“…Assuming the algorithm has Z groups of product ant colonies, the global pheromone update rule of the PACO algorithm, shown in Equation (22), is derived according to Equation (18).…”
Section: Multi-pheromone Of Product Ant Colonymentioning
confidence: 99%
See 1 more Smart Citation
“…Assuming the algorithm has Z groups of product ant colonies, the global pheromone update rule of the PACO algorithm, shown in Equation (22), is derived according to Equation (18).…”
Section: Multi-pheromone Of Product Ant Colonymentioning
confidence: 99%
“…Zhang et al [20] studied the production scheduling problem in a flexible manufacturing system with two adjacent working areas. Miao et al [21] and Yang et al [22] solved the problems related to the path planning of mobile robots with an improved adaptive ACO algorithm. Jia et al [23] proposed a novel bilevel ACO algorithm to deal with the vehicle routing problem.…”
Section: Introductionmentioning
confidence: 99%
“…The foundational exploration of wheeled mobile robots (WMRs) to assess the mechanical system's dynamics involves a kinematic inquiry, which is imperative for ensuring the seamless execution of predefined trajectories [12]. This analytical process yields insights into devising control software for the WMR hardware, as well as for the design of robots tailored to tasks demanding a comprehensive grasp of the mechanical conduct of the robot [13].…”
Section: Kinematic Analysis Of Wmrmentioning
confidence: 99%
“…ACO is a meta-heuristic probabilistic technique focusing on unbalancing load [28]. The ACO offers minimum completion time and optimality to a large number of jobs but have stagnation issue and suffer from low convergence speed [21]. The Crow Search Algorithm (CSO) imitates crows' comportment by storing extra food or resources and retrieving it when necessary.…”
Section: Max-minmentioning
confidence: 99%