A New Robot Navigation Algorithm Based on a Double-Layer Ant Algorithm and Trajectory Optimization
The DOI matches its Crossref record; 26 of the 26 references it cites were found in a registry or an index.
Abstract
This paper presents an efficient double-layer ant colony optimization algorithm, called DL-ACO, for autonomous robot navigation. This DL-ACO consists of two ant colony algorithms that run independently and successively. First, a parallel elite ant colony optimization method is proposed to generate an initial collision-free path in a complex map, and then, we apply a path improvement algorithm called turning point optimization algorithm, in which the initial path is optimized in terms of length, smoothness, and safety. Besides, a piecewise B-spline path smoother is presented for easier tracking control of the mobile robot. Our method is tested by simulations and compared with other path planning algorithms. The results show that our method can generate better collision-free path efficiently and consistently, which demonstrates the effectiveness of the proposed algorithm. Furthermore, its performance is validated by experiments in indoor and outdoor environments.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Numerical potential field techniques for robot path planning
Barraquand, J., Langlois, B., & Latombe, J.-C. (1992) · IEEE Transactions on Systems, Man, and Cybernetics · doi:10.1109/21.148426 · Cited by 889 · cited 1×
“field [4] and cell decomposition [5], are widely applied in various tasks and demonstrated remarkable performance thanks to their easy execution.”
BackgroundHeuristic approaches in robot path planning: A survey
Mac, T. T., Copot, C., Tran, D. T., & De Keyser, R. (2016) · Robotics and Autonomous Systems · doi:10.1016/j.robot.2016.08.001 · Cited by 641
Garcia, M. A. P., Montiel, O., Castillo, O., Sepúlveda, R., & Melin, P. (2009) · Applied Soft Computing · doi:10.1016/j.asoc.2009.02.014 · Cited by 394 · cited 1×
“vironment by adding a fuzzy cost function in path evaluation was introduced in [17].”
MethodAnt Colony Optimization for Mixed-Variable Optimization Problems
Liao, T., Socha, K., Montes de Oca, M. A., Stutzle, T., & Dorigo, M. (2014) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2013.2281531 · Cited by 270
Fu, Y., Ding, M., Zhou, C., & Hu, H. (2013) · IEEE Transactions on Systems, Man, and Cybernetics: Systems · doi:10.1109/tsmc.2013.2248146 · Cited by 246
Bakdi, A., Hentout, A., Boutami, H., Maoudj, A., Hachour, O., & Bouzouia, B. (2017) · Robotics and Autonomous Systems · doi:10.1016/j.robot.2016.12.008 · Cited by 246 · cited 1×
“Comparing to the traditional methods, heuristic algorithms have been proven to be efficient in robot path planning [6], including neural network [7], fuzzy logic technique [8] and natureinspired algorithms such as genetic algorithm (GA) [9], particle swarm optimization (PSO) [10], and ant colony optimization (ACO) alg…”
MethodAnt Colony Optimization With Local Search for Dynamic Traveling Salesman Problems
Mavrovouniotis, M., Muller, F. M., & Yang, S. (2017) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2016.2556742 · Cited by 236
Continuous Path Smoothing for Car-Like Robots Using B-Spline Curves
Elbanhawi, M., Simic, M., & Jazar, R. N. (2015) · Journal of Intelligent & Robotic Systems · doi:10.1007/s10846-014-0172-0 · Cited by 190 · cited 1×
“With the properties of the B-spline curve, this interpolation scheme is practically useful for path smoothing [31], [32].”
MethodReinforcement Ant Optimized Fuzzy Controller for Mobile-Robot Wall-Following Control
Juang, C., & Hsu, C.-H. (2009) · IEEE Transactions on Industrial Electronics · doi:10.1109/tie.2009.2017557 · Cited by 188
Three-dimension path planning for UCAV using hybrid meta-heuristic ACO-DE algorithm
Duan, H., Yu, Y., Zhang, X., & Shao, S. (2009) · Simulation Modelling Practice and Theory · doi:10.1016/j.simpat.2009.10.006 · Cited by 155 · cited 1×
“[16] proposed a path planning method based on the ACO and differential evolution for the three-dimensional (3-D)”
MethodZhu, D. Z., Werner, P. L., & Werner, D. H. (2017) · IEEE Transactions on Antennas and Propagation · doi:10.1109/tap.2017.2766660 · Cited by 148 · cited 1×
“The ACO has been recognized as an efficient and robust optimization technique and has been used frequently in different applications [12]–[15].”
MethodHybridized ant colony algorithm for the Multi Compartment Vehicle Routing Problem
Abdulkader, M. M. S., Gajpal, Y., & ElMekkawy, T. Y. (2015) · Applied Soft Computing · doi:10.1016/j.asoc.2015.08.020 · Cited by 144 · cited 1×
“[19] put forward a”
Ma, M., Sun, C., & Chen, X. (2017) · IEEE Transactions on Instrumentation and Measurement · doi:10.1109/tim.2017.2735661 · Cited by 140 · cited 1×
“The ACO has been recognized as an efficient and robust optimization technique and has been used frequently in different applications [12]–[15].”
MethodSolving the multi-objective path planning problem in mobile robotics with a firefly-based approach
Hidalgo‐Paniagua, A., Vega-Rodríguez, M. A., Ferruz, J., & Pavón, N. (2015) · Soft Computing · doi:10.1007/s00500-015-1825-z · Cited by 135
A fast two-stage ACO algorithm for robotic path planning
Chen, X., Kong, Y., Fang, X., & Wu, Q. (2011) · Neural Computing and Applications · doi:10.1007/s00521-011-0682-7 · Cited by 132 · cited 1×
“[21] introduced a two-stage ant algorithm.”
A Multirobot Path-Planning Strategy for Autonomous Wilderness Search and Rescue
Macwan, A., Vilela, J., Nejat, G., & Benhabib, B. (2014) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2014.2360368 · Cited by 129
A path planning method using adaptive polymorphic ant colony algorithm for smart wheelchairs
Jiao, Z., Ma, K., Rong, Y., Wang, P., Zhang, H., & Wang, S. (2018) · Journal of Computational Science · doi:10.1016/j.jocs.2018.02.004 · Cited by 106 · cited 9×
“The APACA is also a path planning algorithm based on the ant algorithm, which uses the adaptive strategy to guarantee the relative importance of the pheromone intensity and desirability.”
MethodInfluentialRandomized Bidirectional B-Spline Parameterization Motion Planning
Elbanhawi, M., Simić, M., & Jazar, R. N. (2015) · IEEE Transactions on Intelligent Transportation Systems · doi:10.1109/tits.2015.2477355 · Cited by 88
Syed, U., Kunwar, F., & Iqbal, M. (2014) · Robotics and Autonomous Systems · doi:10.1016/j.robot.2013.12.004 · Cited by 65 · cited 1×
“Comparing to the traditional methods, heuristic algorithms have been proven to be efficient in robot path planning [6], including neural network [7], fuzzy logic technique [8] and natureinspired algorithms such as genetic algorithm (GA) [9], particle swarm optimization (PSO) [10], and ant colony optimization (ACO) alg…”
MethodTwo-Level Hierarchical Approach to Unit Commitment Using Expert System and Elite PSO
Chen, P.-H. (2011) · IEEE Transactions on Power Systems · doi:10.1109/tpwrs.2011.2171197 · Cited by 65 · cited 1×
“Parallel computing and elitist strategy have been widely used to improve the performance of algorithms [22]–[25].”
MethodQingbao, Z., Hu, J., Cai, W., & Henschen, L. (2011) · Applied Soft Computing · doi:10.1016/j.asoc.2011.07.016 · Cited by 59 · cited 1×
“[18] presented an algorithm based on dynamic path recomputation and an improved scout ant algorithm for robot navigation in unknown environments.”
MethodImplicit B-Spline Surface Reconstruction
Rouhani, M., Sappa, A. D., & Boyer, E. (2014) · IEEE Transactions on Image Processing · doi:10.1109/tip.2014.2366374 · Cited by 53 · cited 1×
“The B-spline curve is one of the most efficient curve interpolations and has been widely applied in many disciplines, such as medical imaging [27], geometric modeling [28], surface reconstruction [29], and position control [30].”
MethodA Recursive Receding Horizon Planning for Unmanned Vehicles
Zhang, B., Tang, L., DeCastro, J., Roemer, M. J., & Goebel, K. (2014) · IEEE Transactions on Industrial Electronics · doi:10.1109/tie.2014.2363632 · Cited by 47 · cited 1×
“G LOBAL path planning is a significant issue in robotics because of its various applications, such as autonomous driving, civilian search, emergency rescue, resource exploitation, and so forth [1]–[3].”
BackgroundMenegaldo, L. L., Ferreira, G. A. N., Santos, M. F. D., & Guerato, R. S. (2009) · IEEE Transactions on Industrial Electronics · doi:10.1109/tie.2009.2025716 · Cited by 37 · cited 1×
“[34] and [35].”
Manipulator path planning by decomposition: algorithm and analysis
Hourtash, A., & Tarokh, M. (2001) · IEEE Transactions on Robotics and Automation · doi:10.1109/70.976006 · Cited by 36 · cited 1×
“field [4] and cell decomposition [5], are widely applied in various tasks and demonstrated remarkable performance thanks to their easy execution.”
BackgroundMicrocontroller-Based B-Spline Neural Position Control for Voice Coil Motors
Hsu, C., & Chen, Y. (2015) · IEEE Transactions on Industrial Electronics · doi:10.1109/tie.2015.2416347 · Cited by 25 · cited 1×
“The B-spline curve is one of the most efficient curve interpolations and has been widely applied in many disciplines, such as medical imaging [27], geometric modeling [28], surface reconstruction [29], and position control [30].”
Method
Metadata
- Authors
- Yang, H., Qi, J., Miao, Y., Sun, H., & Li, J.
- Venue
- IEEE Transactions on Industrial Electronics
- Published
- 2019-11
- Volume
- 66
- Issue
- 11
- Pages
- 8557-8566
- ISSN
- 0278-0046 (ISSN-L)
- 1557-9948
- OpenAlex
- W2906415336
- Cited by
- 181
- References
- 26
- FWCI
- 5.86
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.