{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,26]],"date-time":"2026-06-26T01:44:51Z","timestamp":1782438291485,"version":"3.54.5"},"reference-count":38,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T00:00:00Z","timestamp":1619740800000},"content-version":"vor","delay-in-days":119,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100004921","name":"Shanghai Jiao Tong University","doi-asserted-by":"publisher","award":["#1907"],"award-info":[{"award-number":["#1907"]}],"id":[{"id":"10.13039\/501100004921","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["Wireless Communications and Mobile Computing"],"published-print":{"date-parts":[[2021,1]]},"abstract":"<jats:p>Path planning is the core technology of mobile robot decision\u2010making and control and is also a research hotspot in the field of artificial intelligence. Aiming at the problems of slow response speed, long planning path, unsafe factors, and a large number of turns in the conventional path planning algorithm, an improved multiobjective genetic algorithm (IMGA) is proposed to solve static global path planning in this paper. The algorithm uses a heuristic median insertion method to establish the initial population, which improves the feasibility of the initial path and generates a multiobjective fitness function based on three indicators: path length, path security, and path energy consumption, to ensure the quality of the planned path. Then, the selection, crossover, and mutation operators are designed by using the layered method, the single\u2010point crossover method, and the eight\u2010neighborhood\u2010domain single\u2010point mutation method, respectively. Finally, the delete operation is added, to further ensure the efficient operation of the mobile robot. Simulation experiments in the grid environment show that the algorithm can improve the defects of the traditional genetic algorithm (GA), such as slow convergence speed and easy to fall into local optimum. Compared with GA, the optimal path length obtained by planning is shortened by 17%.<\/jats:p>","DOI":"10.1155\/2021\/8836615","type":"journal-article","created":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T19:35:13Z","timestamp":1619811313000},"update-policy":"https:\/\/doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":38,"title":["Path Planning of Mobile Robot Based on Improved Multiobjective Genetic Algorithm"],"prefix":"10.1155","volume":"2021","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7223-5720","authenticated-orcid":false,"given":"Kairong","family":"Li","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3062-2869","authenticated-orcid":false,"given":"Qianqian","family":"Hu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jinpeng","family":"Liu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"311","published-online":{"date-parts":[[2021,4,30]]},"reference":[{"key":"e_1_2_10_1_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.robot.2016.12.008"},{"key":"e_1_2_10_2_2","doi-asserted-by":"publisher","DOI":"10.3390\/app8112253"},{"key":"e_1_2_10_3_2","doi-asserted-by":"publisher","DOI":"10.3390\/sym10100450"},{"key":"e_1_2_10_4_2","first-page":"833","article-title":"Robot path planning based on adaptive integrating of genetic and ant colony algorithm","volume":"11","author":"Chen J.","year":"2015","journal-title":"International Journal of Innovative Computing Information and Control"},{"key":"e_1_2_10_5_2","article-title":"Motor anomaly detection for unmanned aerial vehicles using reinforcement learning","volume":"1","author":"Lu H.","year":"2017","journal-title":"IEEE Internet of Things Journal"},{"key":"e_1_2_10_6_2","article-title":"Revocable identity-based broadcast proxy re-encryption for data sharing in clouds","volume":"99","author":"Ge C.","year":"2019","journal-title":"IEEE Transactions on Dependable and Secure Computing"},{"key":"e_1_2_10_7_2","doi-asserted-by":"publisher","DOI":"10.1088\/1742-6596\/1237\/2\/022028"},{"key":"e_1_2_10_8_2","doi-asserted-by":"crossref","unstructured":"UtamiN. S. JazidieA. andKadierR. E. A. Path planning for differential drive mobile robot to avoid static obstacles collision using modified crossover genetic algorithm 2019 International Seminar on Intelligent Technology and Its Application (ISITIA) 2019 Surabaya Indonesia 282\u2013287 https:\/\/doi.org\/10.1109\/ISITIA.2019.8937184.","DOI":"10.1109\/ISITIA.2019.8937184"},{"key":"e_1_2_10_9_2","doi-asserted-by":"crossref","unstructured":"XiaoQ. LiJ. andXiaoC. Research on performance optimization of several frequently-used genetic algorithm selection operators 580 International Conference on Applications and Techniques in Cyber Security and Intelligence 2018 Ningbo China 90\u201397 Advances in Intelligent Systems and Computing .","DOI":"10.1007\/978-3-319-67071-3_14"},{"key":"e_1_2_10_10_2","doi-asserted-by":"publisher","DOI":"10.1109\/MWC.2019.1800325"},{"key":"e_1_2_10_11_2","first-page":"5","article-title":"Population initialization improvement of robot path planning based on genetic algorithm","volume":"47","author":"Liu Z.","year":"2019","journal-title":"Machine Tool & Hydraulics"},{"key":"e_1_2_10_12_2","doi-asserted-by":"publisher","DOI":"10.1088\/1361-665X\/aab991"},{"key":"e_1_2_10_13_2","doi-asserted-by":"publisher","DOI":"10.1007\/s13042-017-0703-7"},{"key":"e_1_2_10_14_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2010.07.006"},{"key":"e_1_2_10_15_2","doi-asserted-by":"publisher","DOI":"10.4156\/jdcta.vol4.issue9.18"},{"key":"e_1_2_10_16_2","doi-asserted-by":"publisher","DOI":"10.1109\/TDSC.2020.2963978"},{"key":"e_1_2_10_17_2","doi-asserted-by":"publisher","DOI":"10.5772\/63484"},{"key":"e_1_2_10_18_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.procs.2018.01.113"},{"key":"e_1_2_10_19_2","first-page":"24","article-title":"Mobile robot path planning based on improved genetic algorithm","volume":"18","author":"Chen L.","year":"2019","journal-title":"Software Guide"},{"key":"e_1_2_10_20_2","doi-asserted-by":"publisher","DOI":"10.1109\/access.2020.3006579"},{"key":"e_1_2_10_21_2","first-page":"19","article-title":"Research on path planning algorithm based on improved artificial potential field-genetic algorithm","volume":"38","author":"Duan J.","year":"2019","journal-title":"Foreign Electronic Measurement Technology"},{"key":"e_1_2_10_22_2","first-page":"1","article-title":"Robot motion based on adaptive selection operator combined with genetic algorithm","volume":"37","author":"Yi X.","year":"2020","journal-title":"Application Research of Computers"},{"key":"e_1_2_10_23_2","first-page":"162","article-title":"Application of improved genetic algorithm in path planning of mobile robots","volume":"55","author":"Sun B.","year":"2019","journal-title":"Computer Engineering and Applications"},{"key":"e_1_2_10_24_2","first-page":"167","article-title":"Simulation study on effective path planning for mobile robot","volume":"41","author":"Liang K.","year":"2018","journal-title":"Modern Electronic Technology"},{"key":"e_1_2_10_25_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.compeleceng.2012.06.016"},{"key":"e_1_2_10_26_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10586-018-2360-3"},{"key":"e_1_2_10_27_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.compeleceng.2011.07.007"},{"key":"e_1_2_10_28_2","doi-asserted-by":"publisher","DOI":"10.1049\/iet-smt.2016.0273"},{"key":"e_1_2_10_29_2","first-page":"711","article-title":"Research on mobile robot path planning by using improved genetic algorithm","volume":"36","author":"Wang L.","year":"2017","journal-title":"Mechanical Science and Technology"},{"key":"e_1_2_10_30_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.compeleceng.2013.10.016"},{"key":"e_1_2_10_31_2","doi-asserted-by":"publisher","DOI":"10.1007\/s11036-017-0932-8"},{"key":"e_1_2_10_32_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2018.07.080"},{"key":"e_1_2_10_33_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-018-0462-9"},{"key":"e_1_2_10_34_2","doi-asserted-by":"crossref","unstructured":"LiY. HuangZ. andXieY. Path planning of mobile robot based on improved genetic algorithm 3rd International Conference on Electron Device and Mechanical Engineering (ICEDME) 2020 Suzhou China 691\u2013695 https:\/\/doi.org\/10.1109\/ICEDME50972.2020.00163.","DOI":"10.1109\/ICEDME50972.2020.00163"},{"key":"e_1_2_10_35_2","doi-asserted-by":"publisher","DOI":"10.1155\/2020\/981304"},{"key":"e_1_2_10_36_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2018.08.008"},{"key":"e_1_2_10_37_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.cviu.2016.06.003"},{"key":"e_1_2_10_38_2","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0165803"}],"container-title":["Wireless Communications and Mobile Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/wcmc\/2021\/8836615.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/wcmc\/2021\/8836615.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1155\/2021\/8836615","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,7]],"date-time":"2024-08-07T11:35:40Z","timestamp":1723030540000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1155\/2021\/8836615"}},"subtitle":[],"editor":[{"given":"Alessandro","family":"Bazzi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"editor"}]}],"short-title":[],"issued":{"date-parts":[[2021,1]]},"references-count":38,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,1]]}},"alternative-id":["10.1155\/2021\/8836615"],"URL":"https:\/\/doi.org\/10.1155\/2021\/8836615","archive":["Portico"],"relation":{},"ISSN":["1530-8669","1530-8677"],"issn-type":[{"value":"1530-8669","type":"print"},{"value":"1530-8677","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,1]]},"assertion":[{"value":"2020-08-12","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-04-30","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}],"article-number":"8836615"}}