Abstract
In order to solve the problems of ant colony algorithm such as low search efficiency, slow convergence speed and easy to fall into local optimum, an improved ant colony algorithm is proposed in this paper. In the proposed algorithm, the upper bound of path nodes is adjusted and the grid map mode is integrated. The upper bound of nodes are adjusted for driving the optimization process of algorithm. Experiment simulation is carried out based on two specific robot path-planning examples. Results show that the proposed ant colony algorithm can guarantees the global optimization capability, and it also can improve the efficiency of path planning.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Ge, S., Cui, J.: New potential functions for mobile robot path planning. IEEE Trans. Robot. Autom. 16(5), 615–620 (2000)
Mo, H., Xu, L.: Research of biogeography particle swarm optimization for robot path planning. Neurocomputing 148, 91–99 (2015)
Mac, T., Copot, C., Tran, T., et al.: Heuristic approaches in robot path planning: a survey. Robot. Auton. Syst. 86, 13–28 (2016)
Zhang, J., Zhao, Z., Liu, D.: A path planning method for mobile robot based on artificial potential field. J. Harbin Inst. Technol. 38(8), 1306–1309 (2006)
van Laarhoven, P.J.M., Aarts, E.H.L.: Simulated annealing. In: van Laarhoven, P.J.M., Aarts, E.H.L. (eds.) Simulated Annealing: Theory and Applications. MAIA, vol. 37, pp. 7–15. Springer, Dordrecht (1987). https://doi.org/10.1007/978-94-015-7744-1_2
Qing, L., Chao, Z., Caiwei, H., et al.: Path planning based on fuzzy logic algorithm for mobile robots in dynamic environments. J. Central South Univ. (Sci. Technol.) 44(s2), 104–108 (2013)
Dorigo, M., Gambardella, M.: Ant colony system: a cooperative learning approach to the traveling salesman problem. IEEE Trans. Evol. Comput. 1(1), 53–66 (1997)
Delmerico, J., Mueggler, E., Nitsch, J., et al.: Active autonomous aerial exploration for ground robot path planning. IEEE Robot. Autom. Lett. 2(2), 664–671 (2017)
Fu, B., Chen, L., Zhou, Y., et al.: An improved A* algorithm for the industrial robot path planning with high success rate and short length. Robot. Auton. Syst. 106, 26–37 (2018)
Yu, J., Rus, D.: An effective algorithmic framework for near optimal multi-robot path planning. In: Bicchi, A., Burgard, W. (eds.) Robotics Research. SPAR, vol. 2, pp. 495–511. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-51532-8_30
Deng, G., Zhang, X., Liu, Y.: Ant colony optimization and particle swarm optimization for robot-path planning in obstacle environment. Control Theory Appl. 26(08), 879–883 (2009)
Xinlei, H., Lianzhi, Y.: Mobile robot path planning based on improved ant colony algorithm. Softw. Guide 12, 162–164 (2017)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Qiu, S., Hu, B., Quan, Y., Jian, X., Ouyang, H. (2020). Ant Colony Algorithm Based on Upper Bound of Nodes for Robot Path Planning Problems. In: Pan, L., Liang, J., Qu, B. (eds) Bio-inspired Computing: Theories and Applications. BIC-TA 2019. Communications in Computer and Information Science, vol 1159. Springer, Singapore. https://doi.org/10.1007/978-981-15-3425-6_8
Download citation
DOI: https://doi.org/10.1007/978-981-15-3425-6_8
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-15-3424-9
Online ISBN: 978-981-15-3425-6
eBook Packages: Computer ScienceComputer Science (R0)