{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,21]],"date-time":"2026-01-21T07:17:40Z","timestamp":1768979860471,"version":"3.49.0"},"reference-count":31,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2021,5,8]],"date-time":"2021-05-08T00:00:00Z","timestamp":1620432000000},"content-version":"vor","delay-in-days":127,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61902273"],"award-info":[{"award-number":["61902273"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61962052"],"award-info":[{"award-number":["61962052"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100006606","name":"Natural Science Foundation of Tianjin Municipality","doi-asserted-by":"publisher","award":["18JCYBJC85600"],"award-info":[{"award-number":["18JCYBJC85600"]}],"id":[{"id":"10.13039\/501100006606","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["Computational Intelligence and Neuroscience"],"published-print":{"date-parts":[[2021,1]]},"abstract":"<jats:p>An adaptive genetic algorithm based on collision detection (AGACD) is proposed to solve the problems of the basic genetic algorithm in the field of path planning, such as low convergence path quality, many iterations required for convergence, and easily falling into the local optimal solution. First, this paper introduces the Delphi weight method to evaluate the weight of path length, path smoothness, and path safety in the fitness function, and a collision detection method is proposed to detect whether the planned path collides with obstacles. Then, the population initialization process is improved to reduce the program running time. After comprehensively considering the population diversity and the number of algorithm iterations, the traditional crossover operator and mutation operator are improved, and the adaptive crossover operator and adaptive mutation operator are proposed to avoid the local optimal solution. Finally, an optimization operator is proposed to improve the quality of convergent individuals through the second optimization of convergent individuals. The simulation results show that the adaptive genetic algorithm based on collision detection is not only suitable for simulation maps with various sizes and obstacle distributions but also has excellent performance, such as greatly reducing the running time of the algorithm program, and the adaptive genetic algorithm based on collision detection can effectively solve the problems of the basic genetic algorithm.<\/jats:p>","DOI":"10.1155\/2021\/5536574","type":"journal-article","created":{"date-parts":[[2021,5,8]],"date-time":"2021-05-08T17:36:34Z","timestamp":1620495394000},"update-policy":"https:\/\/doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":40,"title":["The Application of an Adaptive Genetic Algorithm Based on Collision Detection in Path Planning of Mobile Robots"],"prefix":"10.1155","volume":"2021","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5627-7151","authenticated-orcid":false,"given":"Kun","family":"Hao","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0209-8462","authenticated-orcid":false,"given":"Jiale","family":"Zhao","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6883-5707","authenticated-orcid":false,"given":"Beibei","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Yonglei","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Chuanqi","family":"Wang","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2021,5,8]]},"reference":[{"key":"e_1_2_12_1_2","first-page":"1312","article-title":"Path planning algorithm for mobile robots based on improved asymptotic optimal bidirectional fast-expanding random tree","volume":"39","author":"Wang K.","year":"2019","journal-title":"Computer Applications"},{"key":"e_1_2_12_2_2","doi-asserted-by":"publisher","DOI":"10.3390\/electronics7100212"},{"key":"e_1_2_12_3_2","doi-asserted-by":"publisher","DOI":"10.3390\/electronics7120344"},{"key":"e_1_2_12_4_2","first-page":"1006","article-title":"Application of improved A\u2217 algorithm in indoor path planning of robots","volume":"39","author":"Chen R.","year":"2019","journal-title":"Computer Applications"},{"key":"e_1_2_12_5_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-015-0754-y"},{"key":"e_1_2_12_6_2","doi-asserted-by":"publisher","DOI":"10.12677\/AAM.2020.98151"},{"key":"e_1_2_12_7_2","doi-asserted-by":"crossref","unstructured":"LiuQ. XuH. WangL.et al. Application of dijkstra algorithm in path planning for geomagnetic navigation Proceedings of the2020 IEEE 11th Sensor Array and Multichannel Signal Processing Workshop (SAM) 2020 Hangzhou China IEEE.","DOI":"10.1109\/SAM48682.2020.9104382"},{"key":"e_1_2_12_8_2","first-page":"16","article-title":"Research Overview of AUV Obstacle Avoidance Algorithm based on artificial potential field method","volume":"056","author":"Guo Y.","year":"2020","journal-title":"Computer Engineering and Applications"},{"key":"e_1_2_12_9_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10846-019-01112-z"},{"key":"e_1_2_12_10_2","doi-asserted-by":"publisher","DOI":"10.1007\/bf00204755"},{"key":"e_1_2_12_11_2","first-page":"124","article-title":"Path planning of mobile robot based on cloning selection","volume":"8","author":"Hu X.","year":"2009","journal-title":"Microelectronics and Computers"},{"key":"e_1_2_12_12_2","doi-asserted-by":"crossref","unstructured":"SantiagoR. M. C. OcampoA. L. D. UbandoA. T.et al. Path planning for mobile robots using genetic algorithm and probabilistic roadmap Proceedings of the 2017 IEEE 9th International Conference on Humanoid Nanotechnology Information Technology Communication and Control Environment and Management (HNICEM) 2017 Manila Philippines IEEE.","DOI":"10.1109\/HNICEM.2017.8269498"},{"key":"e_1_2_12_13_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-22796-8_37"},{"key":"e_1_2_12_14_2","unstructured":"HollandJ. B. HollandJ. HollandJ. H.et al. Adaption in natural and artificial systems 1975 6 no. 2 MIT press Ann Arbor MI USA 126\u2013137."},{"key":"e_1_2_12_15_2","volume-title":"Nature-Inspired Optimization Algorithms for Fuzzy Controlled Servo Systems","author":"Precup R.-E.","year":"2019"},{"key":"e_1_2_12_16_2","doi-asserted-by":"publisher","DOI":"10.3390\/s20185440"},{"key":"e_1_2_12_17_2","doi-asserted-by":"publisher","DOI":"10.1109\/tmag.2015.2486043"},{"key":"e_1_2_12_18_2","doi-asserted-by":"publisher","DOI":"10.1109\/access.2019.2960531"},{"key":"e_1_2_12_19_2","doi-asserted-by":"publisher","DOI":"10.3390\/s20205873"},{"key":"e_1_2_12_20_2","doi-asserted-by":"publisher","DOI":"10.1002\/rob.21935"},{"key":"e_1_2_12_21_2","first-page":"1077","article-title":"Parallel collision detection of 3D mesh using hierarchical octree","volume":"40","author":"Xiao-Meng M. A.","year":"2019","journal-title":"Computer Engineering and Design"},{"key":"e_1_2_12_22_2","first-page":"350","article-title":"Collision detection algorithm based on double view and semi-transparent color overlay","volume":"025","author":"Changle S.","year":"2019","journal-title":"Computer Integrated Manufacturing Systems"},{"key":"e_1_2_12_23_2","doi-asserted-by":"publisher","DOI":"10.3390\/s17092109"},{"key":"e_1_2_12_24_2","doi-asserted-by":"publisher","DOI":"10.3390\/s18051508"},{"key":"e_1_2_12_25_2","doi-asserted-by":"publisher","DOI":"10.1109\/access.2017.2764047"},{"key":"e_1_2_12_26_2","doi-asserted-by":"publisher","DOI":"10.1109\/access.2019.2928141"},{"key":"e_1_2_12_27_2","first-page":"16","article-title":"Research on improved adaptive genetic algorithm based on individual similarity","volume":"31","author":"Liu J.","year":"2016","journal-title":"Journal of Qingdao University (Engineering & Technology Edition)"},{"key":"e_1_2_12_28_2","unstructured":"ChicoA. SasongkoH. andSarjiya Design of experiments to parameter setting in a genetic algorithm for optimal power flow with tcsc device Proceedings of the 2016 2nd International Conference of Industrial Mechanical Electrical and Chemical Engineering 2016 Yogyakarta Indonesia ICIMECE) 73\u201378."},{"key":"e_1_2_12_29_2","doi-asserted-by":"crossref","unstructured":"MosayebiM.andSodhiM. Tuning genetic algorithm parameters using design of experiments Proceedings of the 2020 Genetic and Evolutionary Computation Conference Companion (GECCO \u203220) 2020 New York NY USA Association for Computing Machinery.","DOI":"10.1145\/3377929.3398136"},{"key":"e_1_2_12_30_2","doi-asserted-by":"crossref","unstructured":"GunawanA. LauH. C. andLindawati Fine-tuning algorithm parameters using the design of experiments approach Proceedings of the 5th International Conference on Learning and Intelligent Optimization (LION\u203205) 2011 Berlin Germany Springer-Verlag 278\u2013292.","DOI":"10.1007\/978-3-642-25566-3_21"},{"key":"e_1_2_12_31_2","first-page":"15","article-title":"Experimental design for genetic algorithm simulated annealing for time cost trade-off problems","volume":"3","author":"Bettemir \u00d6.H.","year":"2011","journal-title":"International Journal of Engineering and Applied Sciences"}],"container-title":["Computational Intelligence and Neuroscience"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/cin\/2021\/5536574.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/cin\/2021\/5536574.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1155\/2021\/5536574","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,6]],"date-time":"2024-08-06T12:09:55Z","timestamp":1722946195000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1155\/2021\/5536574"}},"subtitle":[],"editor":[{"given":"Rodolfo E.","family":"Haber","sequence":"additional","affiliation":[]}],"short-title":[],"issued":{"date-parts":[[2021,1]]},"references-count":31,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,1]]}},"alternative-id":["10.1155\/2021\/5536574"],"URL":"https:\/\/doi.org\/10.1155\/2021\/5536574","archive":["Portico"],"relation":{},"ISSN":["1687-5265","1687-5273"],"issn-type":[{"value":"1687-5265","type":"print"},{"value":"1687-5273","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,1]]},"assertion":[{"value":"2021-01-25","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-04-13","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-05-08","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}],"article-number":"5536574"}}