{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T01:03:31Z","timestamp":1740099811768,"version":"3.37.3"},"reference-count":13,"publisher":"IEEE","license":[{"start":{"date-parts":[[2020,10,11]],"date-time":"2020-10-11T00:00:00Z","timestamp":1602374400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,10,11]],"date-time":"2020-10-11T00:00:00Z","timestamp":1602374400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,10,11]],"date-time":"2020-10-11T00:00:00Z","timestamp":1602374400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020,10,11]]},"DOI":"10.1109\/smc42975.2020.9283286","type":"proceedings-article","created":{"date-parts":[[2020,12,14]],"date-time":"2020-12-14T21:44:48Z","timestamp":1607982288000},"page":"1323-1328","source":"Crossref","is-referenced-by-count":0,"title":["Heterogeneous Multi-Robot Path Planning Based on Probabilistic Motion Model"],"prefix":"10.1109","author":[{"given":"Biao","family":"Hu","sequence":"first","affiliation":[]},{"given":"Haonan","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Zhengcai","family":"Cao","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2016.2593448"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2014.11.006"},{"key":"ref12","first-page":"961","article-title":"Suboptimal variants of the conflict-based search algorithm for the multi-agent pathfinding problem","volume":"263","author":"barer","year":"2014","journal-title":"Frontiers in Artificial Intelligence and Applications"},{"key":"ref13","first-page":"757","article-title":"Conflict-based search with optimal task assignment","author":"h\u00f6nig","year":"2018","journal-title":"International Conference on Autonomous Agents and Multiagent Systems"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2015.2445780"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2016.2603781"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1177\/0278364905051974"},{"key":"ref5","first-page":"1","article-title":"Prioritized multi robot path planning in presence of dynamic obstacles","author":"ram","year":"2017","journal-title":"IEEE Conference on Information and Communication '"},{"key":"ref8","doi-asserted-by":"crossref","DOI":"10.1609\/aaai.v24i1.7564","article-title":"Finding optimal solutions to cooperative pathfinding problems","author":"standley","year":"2010","journal-title":"Twenty-Fourth AAAI Conference on Artificial Intelligence"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/s10514-011-9265-9"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2014.11.001"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.robot.2017.10.011"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2011.6095022"}],"event":{"name":"2020 IEEE International Conference on Systems, Man, and Cybernetics (SMC)","start":{"date-parts":[[2020,10,11]]},"location":"Toronto, ON, Canada","end":{"date-parts":[[2020,10,14]]}},"container-title":["2020 IEEE International Conference on Systems, Man, and Cybernetics (SMC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9282733\/9282811\/09283286.pdf?arnumber=9283286","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,4]],"date-time":"2022-12-04T22:57:02Z","timestamp":1670194622000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9283286\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,10,11]]},"references-count":13,"URL":"https:\/\/doi.org\/10.1109\/smc42975.2020.9283286","relation":{},"subject":[],"published":{"date-parts":[[2020,10,11]]}}}