Abstract
In order to improve the search speed and shorten the search time of robot path planning, the algorithm and its characteristics of mobile robot in path planning are summarized. Firstly, the path planning of mobile robots is classified and summarized. From the perspective of mobile robots’ mastery of the environment, the path planning of mobile robots is replanned through IAFSA. Meanwhile, the development status, advantages and disadvantages of relevant algorithms are summarized. Then it points out the future development trend of robot path planning technology in improved algorithm, hybrid algorithm, multi-robot collaboration, complex environment and multi-dimensional environment.
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
He, S., Belacel, N., Chan, A., Hamam, H., Bouslimani Y.: A hybrid artificial fish swarm simulated annealing optimization algorithm for automatic identification of clusters. World Sci. Pub. Comp. 15(5), 67–69 (2016)
Chen, L., Zhang, H.: Orderly discharging strategy for electric vehicles at workplace based on time-of-use price. Inventi J. Pvt. Ltd. 222–224 (2017)
Chen, L., Zhang, H., Schuster, T.: Orderly discharging strategy for electric vehicles at workplace based on time-of-use price. Hindawi Pub. Corp. 376–377 (2016)
Jiaan, W., Ancheng, X., Jintao, J., Linyang, G.: Optimization lighting layout of indoor visible light communication system based on improved artificial fish swarm algorithm. J. Optics 22(3), 88–90 (2020)
Xingming, Z., Peng, W., Yanping, B., Yuchao, H.: DOA estimation of array signal based on iafsa-music algorithm. Math. Pract. Understand. 49(22), 163–170 (2019) (in Chinese)
Lin, C., Yang, B.: Simulation of flow line scheduling of production enterprises based on improved artificial fish swarm algorithm. Int. J. Simulat. Model. 17(3), 112–114 (2018)
Wawrzyniak, J., Drozdowski, M., Sanlaville, É.: Selecting algorithms for large berth allocation problems. Euro. J. Operat. Res. 283(3), 844–862 (2020)
Sheikholeslami, A., Mardani, M., Ayazi, E., Arefkhani, H.: A dynamic and discrete berth allocation problem in container terminals considering tide effects. Iran. J. Sci. Technol. Trans. Civil Eng. 44(1), 369–376 (2020)
Tufano, A., Accorsi, R., Manzini, R.: A simulated annealing algorithm for the allocation of production resources in the food catering industry. Brit. Food J. 122(7), 2139–2158 (2020)
Yang, L., Xinyu, L., Jianhui, M.: Large-scale permutation flow shop scheduling based on improved simulated annealing algorithm. Comput.-Integra. Manufact. 26(02), 366–375 (2020) (in Chinese)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Guan, Y., Tan, L. (2021). Path Planning Algorithm of Mobile Robot Based on IAFSA. In: MacIntyre, J., Zhao, J., Ma, X. (eds) The 2020 International Conference on Machine Learning and Big Data Analytics for IoT Security and Privacy. SPIOT 2020. Advances in Intelligent Systems and Computing, vol 1282. Springer, Cham. https://doi.org/10.1007/978-3-030-62743-0_117
Download citation
DOI: https://doi.org/10.1007/978-3-030-62743-0_117
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-62742-3
Online ISBN: 978-3-030-62743-0
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)