{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:23:50Z","timestamp":1759638230444},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319727509"},{"type":"electronic","value":"9783319727516"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-72751-6_1","type":"book-chapter","created":{"date-parts":[[2017,12,30]],"date-time":"2017-12-30T16:03:05Z","timestamp":1514649785000},"page":"1-12","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Collaborative Delivery by Energy-Sharing Low-Power Mobile Robots"],"prefix":"10.1007","author":[{"given":"Evangelos","family":"Bampas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shantanu","family":"Das","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dariusz","family":"Dereniowski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christina","family":"Karousatou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,12,31]]},"reference":[{"issue":"1","key":"1_CR1","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1007\/s00453-014-9939-8","volume":"74","author":"J Anaya","year":"2016","unstructured":"Anaya, J., Chalopin, J., Czyzowicz, J., Labourel, A., Pelc, A., Vax\u00e8s, Y.: Convergecast and broadcast by power-aware mobile agents. Algorithmica 74(1), 117\u2013155 (2016)","journal-title":"Algorithmica"},{"issue":"2","key":"1_CR2","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1006\/inco.1999.2795","volume":"152","author":"B Awerbuch","year":"1999","unstructured":"Awerbuch, B., Betke, M., Rivest, R.L., Singh, M.: Piecemeal graph exploration by a mobile robot. Inf. Comput. 152(2), 155\u2013172 (1999)","journal-title":"Inf. Comput."},{"key":"1_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1007\/978-3-319-48314-6_17","volume-title":"Structural Information and Communication Complexity","author":"A B\u00e4rtschi","year":"2016","unstructured":"B\u00e4rtschi, A., Chalopin, J., Das, S., Disser, Y., Geissmann, B., Graf, D., Labourel, A., Mihal\u00e1k, M.: Collaborative delivery with energy-constrained mobile robots. In: Suomela, J. (ed.) SIROCCO 2016. LNCS, vol. 9988, pp. 258\u2013274. Springer, Cham (2016). \nhttps:\/\/doi.org\/10.1007\/978-3-319-48314-6_17"},{"key":"1_CR4","unstructured":"B\u00e4rtschi, A., Chalopin, J., Das, S., Disser, Y., Graf, D., Hackfeld, J., Penna, P.: Energy-efficient delivery by heterogeneous mobile agents. In: Vollmer, H., Vall\u00e9e, B. (eds.) 34th Symposium on Theoretical Aspects of Computer Science, STACS 2017. LIPIcs, 8\u201311 March 2017, Hannover, Germany, vol. 66, pp. 10:1\u201310:14. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2017)"},{"key":"1_CR5","unstructured":"B\u00e4rtschi, A., Graf, D., Penna, P.: Truthful mechanisms for delivery with mobile agents. CoRR abs\/1702.07665 (2017)"},{"issue":"2","key":"1_CR6","first-page":"231","volume":"18","author":"M Betke","year":"1995","unstructured":"Betke, M., Rivest, R.L., Singh, M.: Piecemeal learning of an unknown environment. Mach. Learn. 18(2), 231\u2013254 (1995)","journal-title":"Mach. Learn."},{"key":"1_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/978-3-642-45346-5_6","volume-title":"Algorithms for Sensor Systems","author":"D Bil\u00f3","year":"2014","unstructured":"Bil\u00f3, D., Disser, Y., Gual\u00e1, L., Mihal\u2019\u00e1k, M., Proietti, G., Widmayer, P.: Polygon-constrained motion planning problems. In: Flocchini, P., Gao, J., Kranakis, E., Meyer auf der Heide, F. (eds.) ALGOSENSORS 2013. LNCS, vol. 8243, pp. 67\u201382. Springer, Heidelberg (2014). \nhttps:\/\/doi.org\/10.1007\/978-3-642-45346-5_6"},{"key":"1_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/978-3-642-45346-5_9","volume-title":"Algorithms for Sensor Systems","author":"J Chalopin","year":"2014","unstructured":"Chalopin, J., Das, S., Mihal\u2019\u00e1k, M., Penna, P., Widmayer, P.: Data delivery by energy-constrained mobile agents. In: Flocchini, P., Gao, J., Kranakis, E., Meyer auf der Heide, F. (eds.) ALGOSENSORS 2013. LNCS, vol. 8243, pp. 111\u2013122. Springer, Heidelberg (2014). \nhttps:\/\/doi.org\/10.1007\/978-3-642-45346-5_9"},{"key":"1_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1007\/978-3-662-43951-7_36","volume-title":"Automata, Languages, and Programming","author":"J Chalopin","year":"2014","unstructured":"Chalopin, J., Jacob, R., Mihal\u00e1k, M., Widmayer, P.: Data delivery by energy-constrained mobile agents on a line. In: Esparza, J., Fraigniaud, P., Husfeldt, T., Koutsoupias, E. (eds.) ICALP 2014 Part II. LNCS, vol. 8573, pp. 423\u2013434. Springer, Heidelberg (2014). \nhttps:\/\/doi.org\/10.1007\/978-3-662-43951-7_36"},{"key":"1_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/978-3-319-48314-6_18","volume-title":"Structural Information and Communication Complexity","author":"J Czyzowicz","year":"2016","unstructured":"Czyzowicz, J., Diks, K., Moussi, J., Rytter, W.: Communication problems for mobile agents exchanging energy. In: Suomela, J. (ed.) SIROCCO 2016. LNCS, vol. 9988, pp. 275\u2013288. Springer, Cham (2016). \nhttps:\/\/doi.org\/10.1007\/978-3-319-48314-6_18"},{"key":"1_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1007\/978-3-642-04383-3_15","volume-title":"Ad-Hoc, Mobile and Wireless Networks","author":"J Czyzowicz","year":"2009","unstructured":"Czyzowicz, J., Kranakis, E., Krizanc, D., Lambadaris, I., Narayanan, L., Opatrny, J., Stacho, L., Urrutia, J., Yazdani, M.: On minimizing the maximum sensor movement for barrier coverage of a line segment. In: Ruiz, P.M., Garcia-Luna-Aceves, J.J. (eds.) ADHOC-NOW 2009. LNCS, vol. 5793, pp. 194\u2013212. Springer, Heidelberg (2009). \nhttps:\/\/doi.org\/10.1007\/978-3-642-04383-3_15"},{"key":"1_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/978-3-319-25258-2_25","volume-title":"Structural Information and Communication Complexity","author":"S Das","year":"2015","unstructured":"Das, S., Dereniowski, D., Karousatou, C.: Collaborative exploration by energy-constrained mobile robots. In: Scheideler, C. (ed.) Structural Information and Communication Complexity. LNCS, vol. 9439, pp. 357\u2013369. Springer, Cham (2015). \nhttps:\/\/doi.org\/10.1007\/978-3-319-25258-2_25"},{"issue":"3","key":"1_CR13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1541885.1541891","volume":"5","author":"ED Demaine","year":"2009","unstructured":"Demaine, E.D., Hajiaghayi, M., Mahini, H., Sayedi-Roshkhar, A.S., Oveisgharan, S., Zadimoghaddam, M.: Minimizing movement. ACM Trans. Algorithms 5(3), 1\u201330 (2009)","journal-title":"ACM Trans. Algorithms"},{"key":"1_CR14","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/j.ic.2014.12.005","volume":"243","author":"D Dereniowski","year":"2015","unstructured":"Dereniowski, D., Disser, Y., Kosowski, A., Paj\u0105k, D., Uzna\u0144ski, P.: Fast collaborative graph exploration. Inf. Comput. 243, 37\u201349 (2015)","journal-title":"Inf. Comput."},{"key":"1_CR15","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1016\/j.tcs.2015.02.006","volume":"579","author":"S Dobrev","year":"2015","unstructured":"Dobrev, S., Durocher, S., Hesari, M.E., Georgiou, K., Kranakis, E., Krizanc, D., Narayanan, L., Opatrny, J., Shende, S.M., Urrutia, J.: Complexity of barrier coverage with relocatable sensors in the plane. Theoret. Comput. Sci. 579, 64\u201373 (2015)","journal-title":"Theoret. Comput. Sci."},{"key":"1_CR16","unstructured":"Duncan, C.A., Kobourov, S.G., Kumar, V.S.A.: Optimal constrained graph exploration. In: 12th ACM Symposium on Discrete Algorithms, SODA 2001, pp. 807\u2013814 (2001)"},{"key":"1_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/11682127_24","volume-title":"Architecture of Computing Systems - ARCS 2006","author":"M Dynia","year":"2006","unstructured":"Dynia, M., Korzeniowski, M., Schindelhauer, C.: Power-aware collective tree exploration. In: Grass, W., Sick, B., Waldschmidt, K. (eds.) ARCS 2006. LNCS, vol. 3894, pp. 341\u2013351. Springer, Heidelberg (2006). \nhttps:\/\/doi.org\/10.1007\/11682127_24"},{"key":"1_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/978-3-540-72951-8_5","volume-title":"Structural Information and Communication Complexity","author":"M Dynia","year":"2007","unstructured":"Dynia, M., \u0141opusza\u0144ski, J., Schindelhauer, C.: Why robots need maps. In: Prencipe, G., Zaks, S. (eds.) SIROCCO 2007. LNCS, vol. 4474, pp. 41\u201350. Springer, Heidelberg (2007). \nhttps:\/\/doi.org\/10.1007\/978-3-540-72951-8_5"},{"issue":"3","key":"1_CR19","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1002\/net.20127","volume":"48","author":"P Fraigniaud","year":"2006","unstructured":"Fraigniaud, P., Ga\u0327sieniec, L., Kowalski, D.R., Pelc, A.: Collective tree exploration. Networks 48(3), 166\u2013177 (2006)","journal-title":"Networks"},{"key":"1_CR20","doi-asserted-by":"crossref","unstructured":"Ortolf, C., Schindelhauer, C.: Online multi-robot exploration of grid graphs with rectangular obstacles. In: 24th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2012, pp. 27\u201336 (2012)","DOI":"10.1145\/2312005.2312010"}],"container-title":["Lecture Notes in Computer Science","Algorithms for Sensor Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-72751-6_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,12,30]],"date-time":"2017-12-30T16:03:24Z","timestamp":1514649804000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-72751-6_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319727509","9783319727516"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-72751-6_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}