2019
DOI: 10.1007/s00521-019-04172-2
|View full text |Cite
|
Sign up to set email alerts
|

Research on path planning of mobile robot based on improved ant colony algorithm

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
144
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
6
3

Relationship

0
9

Authors

Journals

citations
Cited by 260 publications
(144 citation statements)
references
References 12 publications
0
144
0
Order By: Relevance
“…The performance of the MACO algorithm is evaluated by independently repeating 20 times. In the same environment and parameters, the comparison results of the MACO algorithm and the algorithm [18] with respect to the trajectory planning are given in Table 2. These results are measured in terms of the worst value (Worst), the best value (Best), and the average value (Mean).…”
Section: A Single Uav Path Planingmentioning
confidence: 99%
See 1 more Smart Citation
“…The performance of the MACO algorithm is evaluated by independently repeating 20 times. In the same environment and parameters, the comparison results of the MACO algorithm and the algorithm [18] with respect to the trajectory planning are given in Table 2. These results are measured in terms of the worst value (Worst), the best value (Best), and the average value (Mean).…”
Section: A Single Uav Path Planingmentioning
confidence: 99%
“…Shao et al [17] presented an improved PSO algorithm to improve the solution's quality. In [18], an improved algorithm is used to overcome the problems of the slow convergence speed and low search efficiency of the ACO algorithm. Based on the different types of journals, intelligent algorithms, and planning standards, the current status of trajectory planning of UAVs is reviewed [19].…”
Section: Introductionmentioning
confidence: 99%
“…Each order has a final delivery date constraint (the same distributor may have different delivery dates for the two products A and B). Contact with process providers to obtain process-related data such as total production time and total production cost for each order at each process provider [38,39]. The time required for each process workshop of the core manufacturer to complete each process with the co-manufacturer is shown in Tab.…”
Section: Instance Datamentioning
confidence: 99%
“…Due to the construction of the unequal allocation pheromone, although this method improves the convergence speed of the algorithm, it sacrifices the global optimization ability of the algorithm, to a certain extent, and an error occurs when finding the optimal solution. Luo et al 8 introduces direction coefficients, safety distance judgment strategies, and improved pheromone update mechanisms to improve the operating efficiency and the convergence speed, of the algorithm to avoid being trapped into a deadlock. Due to the introduction of the safety distance, the algorithm is good for avoiding obstacles, but the algorithm will still produce errors when it finds the optimal path, which affects the robustness of the algorithm.…”
Section: Introductionmentioning
confidence: 99%