{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,14]],"date-time":"2026-05-14T10:38:53Z","timestamp":1778755133240,"version":"3.51.4"},"reference-count":26,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"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":["U1610116"],"award-info":[{"award-number":["U1610116"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61403240"],"award-info":[{"award-number":["61403240"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004480","name":"Natural Science Foundation of Shanxi","doi-asserted-by":"publisher","award":["201801D221171"],"award-info":[{"award-number":["201801D221171"]}],"id":[{"id":"10.13039\/501100004480","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Key Research and Development Program of Shanxi","award":["201903D121145"],"award-info":[{"award-number":["201903D121145"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2020]]},"DOI":"10.1109\/access.2020.2991076","type":"journal-article","created":{"date-parts":[[2020,4,28]],"date-time":"2020-04-28T20:12:36Z","timestamp":1588104756000},"page":"80347-80357","source":"Crossref","is-referenced-by-count":29,"title":["A Novel Path Planning Algorithm for Warehouse Robots Based on a Two-Dimensional Grid Model"],"prefix":"10.1109","volume":"8","author":[{"given":"Bo","family":"Yang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7058-4951","authenticated-orcid":false,"given":"Wentao","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianrong","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jingjie","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tiantian","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xin","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.2965579"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2018.2878221"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIE.2018.2886798"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ICRIS.2018.00015"},{"key":"ref14","doi-asserted-by":"crossref","first-page":"5829","DOI":"10.1007\/s00500-016-2161-7","article-title":"An improved ant colony algorithm for robot path planning","volume":"21","author":"liu","year":"2017","journal-title":"Soft Comput"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2907783"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2932008"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/s11432-016-9115-2"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TII.2015.2416435"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.3390\/s18124167"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/IMCEC46724.2019.8983841"},{"key":"ref3","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/j.proeng.2014.12.098","article-title":"Path planning with modified a star algorithm for a mobile robot","volume":"96","author":"ducho\u00e5","year":"2014","journal-title":"Procedia Eng"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2018.08.008"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ICSIGSYS.2019.8811093"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2015.2399616"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2015.11.004"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2913144"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2946448"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1108\/IR-07-2016-0194"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2938273"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2015.01.067"},{"key":"ref21","doi-asserted-by":"crossref","DOI":"10.1016\/j.asoc.2019.106037","article-title":"A new global best guided artificial bee colony algorithm with application in robot path planning","volume":"88","author":"xu","year":"2020","journal-title":"Appl Soft Comput"},{"key":"ref24","doi-asserted-by":"crossref","first-page":"456","DOI":"10.1016\/j.procs.2018.07.056","article-title":"Development of collision free path planning algorithm for warehouse mobile robot","volume":"133","author":"kumar","year":"2018","journal-title":"Procedia Comput Sci"},{"key":"ref23","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1016\/j.procs.2018.01.113","article-title":"Genetic algorithm based approach for autonomous mobile robot path planning","volume":"127","author":"lamini","year":"2018","journal-title":"Procedia Comput Sci"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1016\/j.procs.2018.07.036"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2017.05.059"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8948470\/09079867.pdf?arnumber=9079867","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,27]],"date-time":"2022-01-27T10:46:57Z","timestamp":1643280417000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9079867\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"references-count":26,"URL":"https:\/\/doi.org\/10.1109\/access.2020.2991076","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]}}}