{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,27]],"date-time":"2026-10-27T23:31:18Z","timestamp":1793143878066,"version":"4.5.0"},"reference-count":20,"publisher":"IEEE","license":[{"start":{"date-parts":[[2018,8,1]],"date-time":"2018-08-01T00:00:00Z","timestamp":1533081600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2018,8,1]],"date-time":"2018-08-01T00:00:00Z","timestamp":1533081600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,8]]},"DOI":"10.1109\/icinfa.2018.8812452","type":"proceedings-article","created":{"date-parts":[[2019,8,26]],"date-time":"2019-08-26T20:19:17Z","timestamp":1566850757000},"page":"366-371","source":"Crossref","is-referenced-by-count":71,"title":["A Deep Q-network (DQN) Based Path Planning Method for Mobile Robots"],"prefix":"10.1109","author":[{"given":"Siyu","family":"Zhou","sequence":"first","affiliation":[{"name":"Department of Aerospace Engineering, Harbin Institute of Technology, Harbin, 150001, P. R. China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xin","family":"Liu","sequence":"additional","affiliation":[{"name":"Department of Aerospace Engineering, Harbin Institute of Technology, Harbin, 150001, P. R. China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yingfu","family":"Xu","sequence":"additional","affiliation":[{"name":"Department of Aerospace Engineering, Harbin Institute of Technology, Harbin, 150001, P. R. China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jifeng","family":"Guo","sequence":"additional","affiliation":[{"name":"Department of Aerospace Engineering, Harbin Institute of Technology, Harbin, 150001, P. R. China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref10","first-page":"1221","article-title":"Genetic algorithm based path planning for a mobile robot[C]","author":"tu","year":"2003","journal-title":"IEEE International Conference on Robotics and Automation"},{"key":"ref11","first-page":"101","article-title":"Classic and Heuristic Approaches in Robot Motion Planning - A Chronological Review[J]","author":"masehian","year":"2007","journal-title":"World Academy of Science Eng and Technology"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCA.2012.2227719"},{"key":"ref13","first-page":"256","article-title":"Modern Machine Learning Approaches for Robotic Path Planning","volume":"8","author":"shreyas","year":"2017","journal-title":"International Journal of Computer Science and Information Technologies"},{"key":"ref14","article-title":"A survey of machine learning approaches to robotic path-planning","author":"otte","year":"0"},{"key":"ref15","first-page":"256","article-title":"A Survey on Deep Reinforcement Learning","volume":"8","author":"liu","year":"2017","journal-title":"Chinese Journal of Computers"},{"key":"ref16","article-title":"Playing Atari with Deep Reinforcement Learning","author":"mnih","year":"2013","journal-title":"Deep Learning Neural Information Processing Systems Workshop"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1038\/nature14236"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1017\/S0269888900008122"},{"key":"ref19","article-title":"Prioritized Experience Replay[J]","author":"schaul","year":"2015","journal-title":"Computer Science"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/116873.116880"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/DASC.1991.177203"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/7.869506"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386390"},{"key":"ref8","article-title":"Particle swarm optimization based global path planning for mobile robots[J]","author":"sun","year":"2005","journal-title":"Control & Decision"},{"key":"ref7","first-page":"131","article-title":"Optimal Path Planning for Mobile Robots Based on Intensified Ant Colony Optimization Algorithm[C]","author":"fan","year":"2003","journal-title":"IEEE International Conference on Robotics Intelligent Systems and Signal Processing 2003 Proceedings IEEE"},{"key":"ref2","first-page":"276","article-title":"Ant Colony Path Planning Based on Non-uniform Modeling of Complex Environment","volume":"38","author":"bu","year":"2016","journal-title":"Robot"},{"key":"ref1","author":"choset","year":"2005","journal-title":"Principles of Robot Motion Theory Algorithms and Implementations"},{"key":"ref9","first-page":"1253","article-title":"Robot path planning in dynamic environments using a simulated annealing based approach[C]","author":"miao","year":"2009","journal-title":"International Conference on Control Automation Robotics and Vision"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-3618-5_5"}],"event":{"name":"2018 IEEE International Conference on Information and Automation (ICIA)","location":"Wuyishan, China","start":{"date-parts":[[2018,8,11]]},"end":{"date-parts":[[2018,8,13]]}},"container-title":["2018 IEEE International Conference on Information and Automation (ICIA)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8796847\/8812311\/08812452.pdf?arnumber=8812452","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,28]],"date-time":"2025-11-28T18:41:34Z","timestamp":1764355294000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8812452\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,8]]},"references-count":20,"URL":"https:\/\/doi.org\/10.1109\/icinfa.2018.8812452","relation":{},"subject":[],"published":{"date-parts":[[2018,8]]}}}