{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,27]],"date-time":"2026-05-27T13:58:25Z","timestamp":1779890305841,"version":"3.53.1"},"reference-count":27,"publisher":"Wiley","license":[{"start":{"date-parts":[[2020,2,25]],"date-time":"2020-02-25T00:00:00Z","timestamp":1582588800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100012166","name":"National Key Research and Development Program of China","doi-asserted-by":"crossref","award":["2016YFE0104600"],"award-info":[{"award-number":["2016YFE0104600"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100012166","name":"National Key Research and Development Program of China","doi-asserted-by":"crossref","award":["172102410071"],"award-info":[{"award-number":["172102410071"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Science and Technology Program of Henan Province of China","award":["2016YFE0104600"],"award-info":[{"award-number":["2016YFE0104600"]}]},{"name":"Science and Technology Program of Henan Province of China","award":["172102410071"],"award-info":[{"award-number":["172102410071"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computational Intelligence and Neuroscience"],"published-print":{"date-parts":[[2020,2,25]]},"abstract":"<jats:p>In this study, a new method of smooth path planning is proposed based on Bezier curves and is applied to solve the problem of redundant nodes and peak inflection points in the path planning process of traditional algorithms. First, genetic operations are used to obtain the control points of the Bezier curve. Second, a shorter path is selected by an optimization criterion that the length of the Bezier curve is determined by the control points. Finally, a safe distance and adaptive penalty factor are introduced into the fitness function to ensure the safety of the walking process of the robot. Numerous experiments are implemented in two different environments and compared with the existing methods. It is proved that the proposed method is more effective to generate a shorter, smoother, and safer path compared with traditional approaches.<\/jats:p>","DOI":"10.1155\/2020\/9813040","type":"journal-article","created":{"date-parts":[[2020,2,25]],"date-time":"2020-02-25T18:32:05Z","timestamp":1582655525000},"page":"1-10","source":"Crossref","is-referenced-by-count":51,"title":["Robot Path Planning Based on Genetic Algorithm Fused with Continuous Bezier Optimization"],"prefix":"10.1155","volume":"2020","author":[{"given":"Jianwei","family":"Ma","sequence":"first","affiliation":[{"name":"School of Information Engineering, Henan University of Science and Technology, Luoyang 471023, Henan, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3905-0115","authenticated-orcid":true,"given":"Yang","family":"Liu","sequence":"additional","affiliation":[{"name":"School of Information Engineering, Henan University of Science and Technology, Luoyang 471023, Henan, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shaofei","family":"Zang","sequence":"additional","affiliation":[{"name":"School of Information Engineering, Henan University of Science and Technology, Luoyang 471023, Henan, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lin","family":"Wang","sequence":"additional","affiliation":[{"name":"School of Information Engineering, Henan University of Science and Technology, Luoyang 471023, Henan, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"311","reference":[{"key":"1","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2009.02.014"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1007\/s11432-016-9115-2"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1007\/978-981-13-1595-4_11"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1108\/aa-06-2015-054"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1108\/aa-11-2014-087"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1108\/aa-11-2015-094"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1016\/j.robot.2016.12.008"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1155\/2015\/212794"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1016\/j.compeleceng.2017.12.011"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2015.01.067"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2010.07.006"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2.4.393"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2018.08.008"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1109\/tie.2011.2109332"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1007\/s42107-017-0001-4"},{"issue":"1","key":"20","first-page":"2943","volume":"7","year":"2010","journal-title":"Journal of Information and Computational Science"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.1016\/j.robot.2008.03.009"},{"key":"23","doi-asserted-by":"publisher","DOI":"10.1016\/j.jocs.2017.08.004"},{"key":"24","doi-asserted-by":"publisher","DOI":"10.1007\/s10586-018-2360-3"},{"key":"26","doi-asserted-by":"publisher","DOI":"10.1016\/j.robot.2009.09.003"},{"key":"27","doi-asserted-by":"publisher","DOI":"10.1109\/tro.2010.2042990"},{"key":"29","doi-asserted-by":"publisher","DOI":"10.3844\/jcssp.2008.341.344"},{"issue":"17","key":"31","first-page":"167","volume":"41","year":"2018","journal-title":"Modern Electronic Technology"},{"key":"32","doi-asserted-by":"publisher","DOI":"10.1016\/j.compstruc.2017.08.015"},{"key":"33","doi-asserted-by":"publisher","DOI":"10.1088\/1361-665x\/aab991"},{"key":"34","doi-asserted-by":"publisher","DOI":"10.1007\/s13042-017-0703-7"},{"key":"35","doi-asserted-by":"publisher","DOI":"10.1007\/s12559-016-9442-4"}],"container-title":["Computational Intelligence and Neuroscience"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/cin\/2020\/9813040.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/cin\/2020\/9813040.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/cin\/2020\/9813040.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,2,25]],"date-time":"2020-02-25T18:32:11Z","timestamp":1582655531000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.hindawi.com\/journals\/cin\/2020\/9813040\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,2,25]]},"references-count":27,"alternative-id":["9813040","9813040"],"URL":"https:\/\/doi.org\/10.1155\/2020\/9813040","relation":{},"ISSN":["1687-5265","1687-5273"],"issn-type":[{"value":"1687-5265","type":"print"},{"value":"1687-5273","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,2,25]]}}}