{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T14:53:57Z","timestamp":1774450437546,"version":"3.50.1"},"reference-count":29,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61673004"],"award-info":[{"award-number":["61673004"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2022]]},"DOI":"10.1109\/access.2021.3064831","type":"journal-article","created":{"date-parts":[[2021,3,9]],"date-time":"2021-03-09T21:29:07Z","timestamp":1615325347000},"page":"28322-28332","source":"Crossref","is-referenced-by-count":54,"title":["Research on Dynamic Path Planning Based on the Fusion Algorithm of Improved Ant Colony Optimization and Rolling Window Method"],"prefix":"10.1109","volume":"10","author":[{"given":"Qibing","family":"Jin","sequence":"first","affiliation":[{"name":"College of Information Science and Technology, Beijing University of Chemical Technology, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7798-1375","authenticated-orcid":false,"given":"Chuning","family":"Tang","sequence":"additional","affiliation":[{"name":"College of Information Science and Technology, Beijing University of Chemical Technology, Beijing, China"}]},{"given":"Wu","family":"Cai","sequence":"additional","affiliation":[{"name":"College of Information Science and Technology, Beijing University of Chemical Technology, Beijing, China"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.actaastro.2010.07.001"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.compeleceng.2014.12.014"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.micpro.2016.04.001"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.ifacol.2016.07.610"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.conengprac.2016.11.010"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/j.jclepro.2016.12.084"},{"key":"ref7","first-page":"301","article-title":"Mobile robot multi-goal path planning using improved particle swarm optimization","volume":"12","author":"Pu","year":"2017","journal-title":"CAAI Trans. Intell. Syst."},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.robot.2017.05.014"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2017.05.066"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.cirp.2017.04.095"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.robot.2017.10.011"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.robot.2018.01.007"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.actaastro.2018.04.029"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.procir.2018.03.067"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2907783"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.topol.2019.02.047"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.robot.2019.05.003"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/j.robot.2019.02.002"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/j.comcom.2019.10.014"},{"key":"ref20","first-page":"235","article-title":"Robot path planning based on particle swarm optimization and ant colony fusion algorithm","volume":"34","author":"Lei","year":"2020","journal-title":"J. Chongqing Univ. Technol."},{"key":"ref21","first-page":"241","article-title":"Improved indoor robot path planning algorithm of RRT*","volume":"28","author":"Yang","year":"2020","journal-title":"Comput. Meas. Control."},{"key":"ref22","first-page":"55","article-title":"Research on improved ant colony algorithm in path planning","volume":"42","author":"Zhang","year":"2020","journal-title":"Manuf. Automat."},{"key":"ref23","first-page":"28","article-title":"Path planning of robot based on improved ant colony algorithm","volume":"37","author":"Fang","year":"2020","journal-title":"Meas. Control Technol."},{"key":"ref24","first-page":"56","article-title":"Dynamic path planning of robot based on improved ant colony algorithm","volume":"43","author":"Liang","year":"2020","journal-title":"Electron. Meas. Technol."},{"key":"ref25","first-page":"617","article-title":"Local path planning of outdoor cleaning robot based on an improved DWA","volume":"42","author":"Zhang","year":"2020","journal-title":"Robotics"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1016\/j.comcom.2020.11.012"},{"key":"ref27","first-page":"593","article-title":"Study on simulation optimization of Gazebo based on asynchronous mechanism","volume":"47","author":"Zeng","year":"2020","journal-title":"Comput. Sci."},{"key":"ref28","first-page":"103","volume-title":"Engineering\u2014Aerospace Engineering; New Findings from National University of Defence Science and Technology Describe Advances in Aerospace Engineering (Conflict Detection and Resolution for Civil Aviation: A Literature Survey)","year":"2019"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2017.2746752"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/9668973\/09373426.pdf?arnumber=9373426","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,9]],"date-time":"2024-01-09T22:54:35Z","timestamp":1704840875000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9373426\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"references-count":29,"URL":"https:\/\/doi.org\/10.1109\/access.2021.3064831","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]}}}