{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,16]],"date-time":"2026-02-16T20:41:42Z","timestamp":1771274502371,"version":"3.50.1"},"reference-count":15,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,5]]},"DOI":"10.1109\/icra.2017.7989105","type":"proceedings-article","created":{"date-parts":[[2017,7,25]],"date-time":"2017-07-25T21:44:28Z","timestamp":1501019068000},"page":"857-862","source":"Crossref","is-referenced-by-count":12,"title":["Bipartite graph matching-based coordination mechanism for multi-robot path planning under communication constraints"],"prefix":"10.1109","author":[{"given":"Ayan","family":"Dutta","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Prithviraj","family":"Dasgupta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-68111-3_74"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1137\/0105003"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ICIF.2007.4408182"},{"key":"ref13","first-page":"1","article-title":"An optimization variant of multi-robot path planning is intractable","author":"surynek","year":"2010","journal-title":"AAAI"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2014.11.001"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-36279-8_10"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TSSC.1968.300136"},{"key":"ref3","first-page":"4956","article-title":"Decentralized path planning for multiagent teams in complex environments using rapidly-exploring random trees","author":"desaraju","year":"2011","journal-title":"ICRA"},{"key":"ref6","first-page":"1","article-title":"A polynomial-time algorithm for non-optimal multi-agent pathfinding","author":"khorshid","year":"2011","journal-title":"Fourth Annual Symposium on Combinatorial Search"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2010.5509175"},{"key":"ref8","first-page":"476","article-title":"D*lite","author":"koenig","year":"2002","journal-title":"AAAI"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/978-4-431-55879-8_24"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/S0921-8890(02)00256-7"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2001.932565"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1177\/0278364913498788"}],"event":{"name":"2017 IEEE International Conference on Robotics and Automation (ICRA)","location":"Singapore, Singapore","start":{"date-parts":[[2017,5,29]]},"end":{"date-parts":[[2017,6,3]]}},"container-title":["2017 IEEE International Conference on Robotics and Automation (ICRA)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7960754\/7988677\/07989105.pdf?arnumber=7989105","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,8,16]],"date-time":"2017-08-16T16:13:50Z","timestamp":1502900030000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7989105\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,5]]},"references-count":15,"URL":"https:\/\/doi.org\/10.1109\/icra.2017.7989105","relation":{},"subject":[],"published":{"date-parts":[[2017,5]]}}}