{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,7]],"date-time":"2025-11-07T09:45:15Z","timestamp":1762508715680,"version":"3.40.5"},"reference-count":21,"publisher":"Wiley","license":[{"start":{"date-parts":[[2022,2,16]],"date-time":"2022-02-16T00:00:00Z","timestamp":1644969600000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Robotics"],"published-print":{"date-parts":[[2022,2,16]]},"abstract":"<jats:p>To better solve the problems associated with optimal pathfinding and dynamic obstacle avoidance in the path planning of mobile robots, a hybrid path planning scheme combining modified gray wolf optimization (MGWO) and situation assessment mechanism is proposed. Firstly, a MGWO algorithm is proposed to plan a global path. Secondly, different situational factors for robots in different regions are extracted from the fusion results of 2D laser measurements and image data, and a Bayesian network model of robot action selection is established. Then, the situational factors of the robot are used as evidence for reasoning. Based on the posterior probability value in the inference result, the grid to be moved is selected and the traveling direction of the robot is adjusted in order to take advantage of both global path planning and local dynamic obstacle avoidance. The simulation results show that the proposed MGWO has better optimization performance. When combined with a situation assessment mechanism, it realizes dynamic obstacle avoidance while keeping the path length as short as possible.<\/jats:p>","DOI":"10.1155\/2022\/4167170","type":"journal-article","created":{"date-parts":[[2022,2,16]],"date-time":"2022-02-16T17:05:13Z","timestamp":1645031113000},"page":"1-9","source":"Crossref","is-referenced-by-count":8,"title":["A Hybrid Mobile Robot Path Planning Scheme Based on Modified Gray Wolf Optimization and Situation Assessment"],"prefix":"10.1155","volume":"2022","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4786-9876","authenticated-orcid":true,"given":"Yilun","family":"Liu","sequence":"first","affiliation":[{"name":"School of Electrical and Information, Northeast Agricultural University, Harbin 150030, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3059-9793","authenticated-orcid":true,"given":"Xiaoming","family":"Li","sequence":"additional","affiliation":[{"name":"School of Electrical and Information, Northeast Agricultural University, Harbin 150030, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","reference":[{"key":"1","doi-asserted-by":"publisher","DOI":"10.1177\/1729881419839596"},{"key":"2","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/j.procs.2018.07.018","article-title":"Methodology for path planning and optimization of mobile robots: a review","volume":"133","author":"Z. Mohd Nayab","year":"2018","journal-title":"Procedia Computer Science"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/robio.2018.8665075"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1109\/icmre49073.2020.9065187"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1016\/j.robot.2018.04.007"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1007\/s12541-019-00224-8"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1177\/1729881418774673"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.2478\/jaiscr-2019-0008"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1109\/robio49542.2019.8961498"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1016\/j.advengsoft.2013.12.007"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1007\/s42452-020-3093-5"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1007\/s11071-017-3731-7"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1109\/access.2019.2894524"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2019.01.036"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1109\/ccdc.2017.7978472"},{"volume-title":"The D\u2217 Algorithm for Real-Time Planning of Optimal Traverses","year":"1994","author":"A. Stentz","key":"16"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1109\/lisat.2016.7494139"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1109\/milcom.2016.7795473"},{"key":"19","doi-asserted-by":"publisher","DOI":"10.1109\/iros.2017.8206230"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.3390\/e21050495"},{"key":"21","doi-asserted-by":"crossref","first-page":"674","DOI":"10.1016\/j.physa.2017.05.074","article-title":"Route to chaos and some properties in the boundary crisis of a generalized logistic mapping","volume":"486","author":"D. R. da Costa","year":"2017","journal-title":"Physica A: Statistical Mechanics and its Applications"}],"container-title":["Journal of Robotics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/jr\/2022\/4167170.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/jr\/2022\/4167170.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/jr\/2022\/4167170.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,2,16]],"date-time":"2022-02-16T17:05:21Z","timestamp":1645031121000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.hindawi.com\/journals\/jr\/2022\/4167170\/"}},"subtitle":[],"editor":[{"given":"Shan","family":"Zhong","sequence":"additional","affiliation":[],"role":[{"role":"editor","vocabulary":"crossref"}]}],"short-title":[],"issued":{"date-parts":[[2022,2,16]]},"references-count":21,"alternative-id":["4167170","4167170"],"URL":"https:\/\/doi.org\/10.1155\/2022\/4167170","relation":{},"ISSN":["1687-9619","1687-9600"],"issn-type":[{"type":"electronic","value":"1687-9619"},{"type":"print","value":"1687-9600"}],"subject":[],"published":{"date-parts":[[2022,2,16]]}}}