{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T01:04:26Z","timestamp":1740099866682,"version":"3.37.3"},"reference-count":22,"publisher":"IEEE","license":[{"start":{"date-parts":[[2020,9,28]],"date-time":"2020-09-28T00:00:00Z","timestamp":1601251200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,9,28]],"date-time":"2020-09-28T00:00:00Z","timestamp":1601251200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,9,28]],"date-time":"2020-09-28T00:00:00Z","timestamp":1601251200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020,9,28]]},"DOI":"10.1109\/rcar49640.2020.9303281","type":"proceedings-article","created":{"date-parts":[[2020,12,30]],"date-time":"2020-12-30T21:55:00Z","timestamp":1609365300000},"page":"26-31","source":"Crossref","is-referenced-by-count":1,"title":["Planning and Scheduling for Large-Scale Robot Networks: An Efficient and Comprehensive Approach"],"prefix":"10.1109","author":[{"given":"Zhe","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yanzi","family":"Miao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wei","family":"Dai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yu","family":"Zhai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","first-page":"1083","article-title":"Optimized simultaneous conflict-free task assignment and path palnning for multi-AGV systems","author":"sabattini","year":"2017","journal-title":"IEEE Int Conf Intelligent Robots and Systems"},{"key":"ref11","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1609\/icaps.v30i1.6677","article-title":"Multi-agent path finding with mutex propagation","author":"zhang","year":"2020","journal-title":"International Conference on Automated Planning and Scheduling"},{"key":"ref12","doi-asserted-by":"crossref","first-page":"1163","DOI":"10.1109\/TRO.2016.2593448","article-title":"Optimal multirobot path planning on graphs: complete algorithms and effective heuristics","volume":"32","author":"yu","year":"2016","journal-title":"IEEE Transactions on Robotics"},{"doi-asserted-by":"publisher","key":"ref13","DOI":"10.1109\/TSMC.2017.2750911"},{"key":"ref14","article-title":"Lifelong multi-agent path finding for online pickup and delivery tasks in","author":"ma","year":"2017","journal-title":"Proc Int Conf Autonomous Agents and Multiagent Systems"},{"key":"ref15","first-page":"961","article-title":"Suboptimal variants of the conflict-based search algorithm for the multi-agent pathfinding problem","author":"barer","year":"2014","journal-title":"European Conference on Artificial Intelligence"},{"doi-asserted-by":"publisher","key":"ref16","DOI":"10.1109\/TSMC.2017.2726104"},{"doi-asserted-by":"publisher","key":"ref17","DOI":"10.1609\/aaai.v34i06.6547"},{"doi-asserted-by":"publisher","key":"ref18","DOI":"10.1109\/ICRA40945.2020.9197354"},{"doi-asserted-by":"publisher","key":"ref19","DOI":"10.1109\/ACCESS.2019.2943253"},{"key":"ref4","first-page":"573","article-title":"Adaptive synchronized formation control considering communication constraints","author":"liu","year":"2016","journal-title":"International Conference on Intelligent Autonomous Systems"},{"doi-asserted-by":"publisher","key":"ref3","DOI":"10.1108\/AA-03-2019-0054"},{"doi-asserted-by":"publisher","key":"ref6","DOI":"10.1109\/RCAR.2016.7784102"},{"doi-asserted-by":"publisher","key":"ref5","DOI":"10.1109\/ICRA.2014.6907709"},{"doi-asserted-by":"publisher","key":"ref8","DOI":"10.1109\/TASE.2015.2446614"},{"doi-asserted-by":"publisher","key":"ref7","DOI":"10.1109\/RCAR.2017.8311859"},{"doi-asserted-by":"publisher","key":"ref2","DOI":"10.1109\/TITS.2015.2508783"},{"doi-asserted-by":"publisher","key":"ref1","DOI":"10.1108\/AA-12-2017-190"},{"doi-asserted-by":"publisher","key":"ref9","DOI":"10.1109\/TASE.2020.3015110"},{"doi-asserted-by":"publisher","key":"ref20","DOI":"10.1177\/0278364913515307"},{"doi-asserted-by":"publisher","key":"ref22","DOI":"10.1109\/ICRA.2018.8460687"},{"doi-asserted-by":"publisher","key":"ref21","DOI":"10.1109\/6979.994796"}],"event":{"name":"2020 IEEE International Conference on Real-time Computing and Robotics (RCAR)","start":{"date-parts":[[2020,9,28]]},"location":"Asahikawa, Japan","end":{"date-parts":[[2020,9,29]]}},"container-title":["2020 IEEE International Conference on Real-time Computing and Robotics (RCAR)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9303031\/9303032\/09303281.pdf?arnumber=9303281","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,10]],"date-time":"2022-12-10T02:15:30Z","timestamp":1670638530000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9303281\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,9,28]]},"references-count":22,"URL":"https:\/\/doi.org\/10.1109\/rcar49640.2020.9303281","relation":{},"subject":[],"published":{"date-parts":[[2020,9,28]]}}}