{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,13]],"date-time":"2025-10-13T09:10:16Z","timestamp":1760346616038,"version":"3.28.0"},"reference-count":17,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,9]]},"DOI":"10.1109\/ecmr.2017.8098693","type":"proceedings-article","created":{"date-parts":[[2017,11,9]],"date-time":"2017-11-09T16:50:13Z","timestamp":1510246213000},"page":"1-6","source":"Crossref","is-referenced-by-count":1,"title":["Algorithms for limited-buffer shortest path problems in communication-restricted environments"],"prefix":"10.1109","author":[{"given":"Alessandro","family":"Riva","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jacopo","family":"Banfi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arlind","family":"Rufi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Francesco","family":"Amigoni","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/0-387-25486-2_2"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1287\/moor.17.1.36"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/s11590-014-0742-x"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/2820783.2820826"},{"key":"ref14","article-title":"Routing of electric vehicles: constrained shortest path problems with resource recovering nodes","author":"merting","year":"2015","journal-title":"Proc ATMOS"},{"journal-title":"Computers and Intractability A Guide to the Theory of NP-Completeness","year":"1979","author":"garey","key":"ref15"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2011.06.003"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2015.2412051"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546877"},{"key":"ref3","first-page":"26","article-title":"Analyzing IEEE 802.11 n standard: outdoor performance","author":"jansons","year":"2012","journal-title":"Proceedings of The ICDIP"},{"key":"ref6","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1613\/jair.2994","article-title":"Theta*: Any-angle path planning on grids","volume":"39","author":"daniel","year":"2010","journal-title":"J Artif Intell Res"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386390"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1002\/rob.21459"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.1994.407601"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/MILCOM.2016.7795496"},{"key":"ref1","first-page":"616","article-title":"Minimizing communication latency in mutirobot situation-aware patrolling","author":"banfi","year":"2015","journal-title":"Proc IROS"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2012.2190178"}],"event":{"name":"2017 European Conference on Mobile Robots (ECMR)","start":{"date-parts":[[2017,9,6]]},"location":"Paris, France","end":{"date-parts":[[2017,9,8]]}},"container-title":["2017 European Conference on Mobile Robots (ECMR)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8090483\/8098653\/08098693.pdf?arnumber=8098693","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,5]],"date-time":"2019-10-05T19:12:45Z","timestamp":1570302765000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8098693\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,9]]},"references-count":17,"URL":"https:\/\/doi.org\/10.1109\/ecmr.2017.8098693","relation":{},"subject":[],"published":{"date-parts":[[2017,9]]}}}