{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,27]],"date-time":"2026-01-27T15:59:04Z","timestamp":1769529544103,"version":"3.49.0"},"reference-count":27,"publisher":"Wiley","license":[{"start":{"date-parts":[[2022,4,23]],"date-time":"2022-04-23T00:00:00Z","timestamp":1650672000000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"Major Science and Technology Projects of Inner Mongolia Autonomous Region","award":["2020ZD0017"],"award-info":[{"award-number":["2020ZD0017"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Electrical and Computer Engineering"],"published-print":{"date-parts":[[2022,4,23]]},"abstract":"<jats:p>A mobile robot path planning method based on improved deep reinforcement learning is proposed. First, in order to conform to the actual kinematics model of the robot, the continuous environmental state space and discrete action state space are designed. In addition, an improved deep Q-network (DQN) method is proposed, which takes the directly collected information as the training samples and combines the environmental state characteristics of the robot and the target point to be reached as the input of the network. DQN method takes the Q value at the current position as the output of the network model and uses <jats:inline-formula>\n                     <a:math xmlns:a=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" id=\"M1\">\n                        <a:mi>\u03b5<\/a:mi>\n                     <\/a:math>\n                  <\/jats:inline-formula>-greedy strategy for action selection. Finally, the reward function combined with the artificial potential field method is designed to optimize the state-action space. The reward function solves the problem of sparse reward in the environmental state space and makes the action selection of the robot more accurate. Experiments show that compared with the classical DQN method, the average loss function value is reduced by 36.87% and the average reward value is increased by 12.96%, which can effectively improve the working efficiency of mobile robot.<\/jats:p>","DOI":"10.1155\/2022\/5433988","type":"journal-article","created":{"date-parts":[[2022,4,23]],"date-time":"2022-04-23T18:35:25Z","timestamp":1650738925000},"page":"1-7","source":"Crossref","is-referenced-by-count":15,"title":["Path Planning Method of Mobile Robot Using Improved Deep Reinforcement Learning"],"prefix":"10.1155","volume":"2022","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4805-4679","authenticated-orcid":true,"given":"Wei","family":"Wang","sequence":"first","affiliation":[{"name":"Department of Electrical Engineering, BaoTou Iron & Steel Vocational Technical College, Baotou, Inner Mongolia 014010, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5113-1105","authenticated-orcid":true,"given":"Zhenkui","family":"Wu","sequence":"additional","affiliation":[{"name":"School of Information Engineering, Inner Mongolia University of Science & Technology, Baotou, Inner Mongolia 014010, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1642-4196","authenticated-orcid":true,"given":"Huafu","family":"Luo","sequence":"additional","affiliation":[{"name":"Department of Electrical Information Engineering, Sichuan Engineering Technical College, Deyang, Sichuan 618000, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6698-0625","authenticated-orcid":true,"given":"Bin","family":"Zhang","sequence":"additional","affiliation":[{"name":"Inner Mongolia Kingdomway Pharmaceutical Limited, Inner Mongolia, Huhehaote 010200, Tuoketuo, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","reference":[{"key":"1","doi-asserted-by":"publisher","DOI":"10.3390\/vehicles3030027"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1016\/j.procs.2018.07.018"},{"issue":"1","key":"3","first-page":"12","article-title":"On complete coverage path planning algorithms for non-holonomic mobile robots: survey and challenges","volume":"33","author":"A. Khan","year":"2017","journal-title":"Journal of Information Science and Engineering"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1023\/a:1016639210559"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1016\/j.comcom.2019.10.014"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/icarsc.2019.8733623"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.3390\/electronics8020201"},{"issue":"12","key":"8","first-page":"1535","article-title":"Path planning of autonomous mobile robots: a survey and comparison","volume":"9","author":"P. Victerpaul","year":"2017","journal-title":"Journal of Advanced Research in Dynamical and Control Systems"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1007\/s11042-021-10986-x"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1177\/1729881419851402"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1109\/icra.2018.8460566"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1002\/rob.8108"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2011.09.076"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1109\/rise.2017.8378228"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1016\/j.dt.2019.04.011"},{"issue":"3","key":"16","first-page":"182","article-title":"A review on swarm intelligence based routing approaches","volume":"9","author":"B. Velusamy","year":"2019","journal-title":"Int. J. Eng. Technol. Innov"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1080\/10106049.2019.1595176"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1109\/iic.2015.7150956"},{"key":"19","doi-asserted-by":"publisher","DOI":"10.14569\/ijacsa.2016.071114"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1109\/rcar.2016.7784001"},{"key":"21","first-page":"1050","article-title":"Double-task deep q-learning with multiple views","author":"J. Chen"},{"key":"22","doi-asserted-by":"publisher","DOI":"10.1109\/icra.2017.7989385"},{"key":"23","doi-asserted-by":"publisher","DOI":"10.1109\/iros.2017.8202141"},{"key":"24","doi-asserted-by":"publisher","DOI":"10.1109\/iros.2016.7759428"},{"key":"25","doi-asserted-by":"publisher","DOI":"10.3390\/s21030796"},{"key":"26","doi-asserted-by":"publisher","DOI":"10.1109\/ijcnn52387.2021.9533570"},{"key":"27","doi-asserted-by":"publisher","DOI":"10.1109\/isie.2019.8781522"}],"container-title":["Journal of Electrical and Computer Engineering"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/jece\/2022\/5433988.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/jece\/2022\/5433988.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/jece\/2022\/5433988.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,23]],"date-time":"2022-04-23T18:35:36Z","timestamp":1650738936000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.hindawi.com\/journals\/jece\/2022\/5433988\/"}},"subtitle":[],"editor":[{"given":"Wei","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"editor","vocabulary":"crossref"}]}],"short-title":[],"issued":{"date-parts":[[2022,4,23]]},"references-count":27,"alternative-id":["5433988","5433988"],"URL":"https:\/\/doi.org\/10.1155\/2022\/5433988","relation":{},"ISSN":["2090-0155","2090-0147"],"issn-type":[{"value":"2090-0155","type":"electronic"},{"value":"2090-0147","type":"print"}],"subject":[],"published":{"date-parts":[[2022,4,23]]}}}