{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T12:55:03Z","timestamp":1743080103199,"version":"3.40.3"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030249212"},{"type":"electronic","value":"9783030249229"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","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":[[2019]]},"DOI":"10.1007\/978-3-030-24922-9_4","type":"book-chapter","created":{"date-parts":[[2019,7,12]],"date-time":"2019-07-12T10:04:49Z","timestamp":1562925889000},"page":"52-65","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Near-Gathering of Energy-Constrained Mobile Agents"],"prefix":"10.1007","author":[{"given":"Andreas","family":"B\u00e4rtschi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Evangelos","family":"Bampas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J\u00e9r\u00e9mie","family":"Chalopin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shantanu","family":"Das","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christina","family":"Karousatou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mat\u00fa\u0161","family":"Mihal\u00e1k","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,7,13]]},"reference":[{"key":"4_CR1","volume-title":"The Theory of Search Games and Rendezvous","author":"S Alpern","year":"2003","unstructured":"Alpern, S., Gal, S.: The Theory of Search Games and Rendezvous. Kluwer, Boston (2003)"},{"issue":"1","key":"4_CR2","doi-asserted-by":"publisher","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":"4_CR3","doi-asserted-by":"publisher","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":"4_CR4","first-page":"1","volume-title":"Algorithms for Sensor Systems","author":"Evangelos Bampas","year":"2017","unstructured":"Bampas, E., Das, S., Dereniowski, D., Karousatou, C.: Collaborative delivery by energy-sharing low-power mobile robots. In: ALGOSENSORS 2017, pp. 1\u201312 (2017)"},{"key":"4_CR5","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1007\/978-3-319-48314-6_17","volume-title":"Structural Information and Communication Complexity","author":"Andreas B\u00e4rtschi","year":"2016","unstructured":"B\u00e4rtschi, A., et al.: Collaborative delivery with energy-constrained mobile robots. In: SIROCCO 2016, pp. 258\u2013274 (2016)"},{"key":"4_CR6","doi-asserted-by":"crossref","unstructured":"B\u00e4rtschi, A., et al.: Collaborative delivery with energy-constrained mobile robots. In: Theoretical Computer Science, SIROCCO 2016 (2017)","DOI":"10.1007\/978-3-319-48314-6_17"},{"issue":"2","key":"4_CR7","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":"4_CR8","first-page":"67","volume-title":"Algorithms for Sensor Systems","author":"Davide Bil\u00f2","year":"2013","unstructured":"Bil\u00f2, D., Disser, Y., Gual\u00e0, L., Mihal\u00e1k, M., Proietti, G., Widmayer, P.: Polygon-constrained motion planning problems. In: ALGOSENSORS 2013, pp. 67\u201382 (2013)"},{"key":"4_CR9","first-page":"111","volume-title":"Algorithms for Sensor Systems","author":"J\u00e9r\u00e9mie Chalopin","year":"2013","unstructured":"Chalopin, J., Das, S., Mihal\u00e1k, M., Penna, P., Widmayer, P.: Data delivery by energy-constrained mobile agents. In: ALGOSENSORS 2013, pp. 111\u2013122 (2013)"},{"key":"4_CR10","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1007\/978-3-662-43951-7_36","volume-title":"Automata, Languages, and Programming","author":"J\u00e9r\u00e9mie Chalopin","year":"2014","unstructured":"Chalopin, J., Jacob, R., Mihal\u00e1k, M., Widmayer, P.: Data delivery by energy-constrained mobile agents on a line. In: ICALP 2014, pp. 423\u2013434 (2014)"},{"issue":"1","key":"4_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00446-017-0293-3","volume":"31","author":"S Cicerone","year":"2018","unstructured":"Cicerone, S., Stefano, G.D., Navarra, A.: Gathering of robots on meeting-points: feasibility and optimal resolution algorithms. Distrib. Comput. 31(1), 1\u201350 (2018)","journal-title":"Distrib. Comput."},{"issue":"4","key":"4_CR12","doi-asserted-by":"publisher","first-page":"829","DOI":"10.1137\/100796534","volume":"41","author":"M Cieliebak","year":"2012","unstructured":"Cieliebak, M., Flocchini, P., Prencipe, G., Santoro, N.: Distributed computing by mobile robots: gathering. SIAM J. Comput. 41(4), 829\u2013879 (2012)","journal-title":"SIAM J. Comput."},{"key":"4_CR13","doi-asserted-by":"publisher","first-page":"1516","DOI":"10.1137\/S0097539704446475","volume":"34","author":"R Cohen","year":"2005","unstructured":"Cohen, R., Peleg, D.: Convergence properties of the gravitational algorithm in asynchronous robot systems. SIAM J. Comput. 34, 1516\u20131528 (2005)","journal-title":"SIAM J. Comput."},{"key":"4_CR14","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/978-3-319-48314-6_18","volume-title":"Structural Information and Communication Complexity","author":"Jurek Czyzowicz","year":"2016","unstructured":"Czyzowicz, J., Diks, K., Moussi, J., Rytter, W.: Communication problems for mobile agents exchanging energy. In: SIROCCO 2016 (2016)"},{"issue":"4","key":"4_CR15","doi-asserted-by":"publisher","first-page":"37:1","DOI":"10.1145\/2344422.2344427","volume":"8","author":"J Czyzowicz","year":"2012","unstructured":"Czyzowicz, J., Labourel, A., Pelc, A.: How to meet asynchronously (almost) everywhere. ACM Trans. Algorithms 8(4), 37:1\u201337:14 (2012)","journal-title":"ACM Trans. Algorithms"},{"key":"4_CR16","doi-asserted-by":"crossref","unstructured":"Das, S., Dereniowski, D., Karousatou, C.: Collaborative exploration by energy-constrained mobile robots. In: SIROCCO 2015, pp. 357\u2013369 (2015)","DOI":"10.1007\/978-3-319-25258-2_25"},{"issue":"3","key":"4_CR17","doi-asserted-by":"publisher","first-page":"30: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), 30:1\u201330:30 (2009)","journal-title":"ACM Trans. Algorithms"},{"issue":"2","key":"4_CR18","doi-asserted-by":"publisher","first-page":"14:1","DOI":"10.1145\/2650247","volume":"11","author":"ED Demaine","year":"2014","unstructured":"Demaine, E.D., Hajiaghayi, M., Marx, D.: Minimizing movement: fixed-parameter tractability. ACM Trans. Algorithms 11(2), 14:1\u201314:29 (2014)","journal-title":"ACM Trans. Algorithms"},{"key":"4_CR19","doi-asserted-by":"publisher","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."},{"issue":"3","key":"4_CR20","doi-asserted-by":"publisher","first-page":"380","DOI":"10.1145\/1159892.1159897","volume":"2","author":"CA Duncan","year":"2006","unstructured":"Duncan, C.A., Kobourov, S.G., Kumar, V.S.A.: Optimal constrained graph exploration. ACM Trans. Algorithms 2(3), 380\u2013402 (2006)","journal-title":"ACM Trans. Algorithms"},{"key":"4_CR21","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/11682127_24","volume-title":"Architecture of Computing Systems - ARCS 2006","author":"Miroslaw Dynia","year":"2006","unstructured":"Dynia, M., Korzeniowski, M., Schindelhauer, C.: Power-aware collective tree exploration. In: ARCS 2006, pp. 341\u2013351 (2006)"},{"key":"4_CR22","doi-asserted-by":"crossref","unstructured":"Dynia, M., \u0141opusza\u0144ski, J., Schindelhauer, C.: Why robots need maps. In: SIROCCO 2007, pp. 41\u201350 (2007)","DOI":"10.1007\/978-3-540-72951-8_5"},{"key":"4_CR23","doi-asserted-by":"publisher","unstructured":"Flocchini, P., Prencipe, G., Santoro, N. (eds.): Distributed Computing by Mobile Entities, Current Research in Moving and Computing. Lecture Notes in Computer Science, vol. 11340. Springer, Switzerland (2019). https:\/\/doi.org\/10.1007\/978-3-030-11072-7","DOI":"10.1007\/978-3-030-11072-7"},{"issue":"1\u20133","key":"4_CR24","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/j.tcs.2005.01.001","volume":"337","author":"P Flocchini","year":"2005","unstructured":"Flocchini, P., Prencipe, G., Santoro, N., Widmayer, P.: Gathering of asynchronous robots with limited visibility. Theoret. Comput. Sci. 337(1\u20133), 147\u2013168 (2005)","journal-title":"Theoret. Comput. Sci."},{"issue":"3","key":"4_CR25","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1002\/net.20127","volume":"48","author":"P Fraigniaud","year":"2006","unstructured":"Fraigniaud, P., Gasieniec, L., Kowalski, D.R., Pelc, A.: Collective tree exploration. Networks 48(3), 166\u2013177 (2006)","journal-title":"Networks"},{"issue":"6","key":"4_CR26","doi-asserted-by":"publisher","first-page":"2096","DOI":"10.1137\/040620552","volume":"46","author":"J Lin","year":"2007","unstructured":"Lin, J., Morse, A.S., Anderson, B.D.O.: The multi-agent rendezvous problem (parts 1 and 2). SIAM J. Control Optim. 46(6), 2096\u20132147 (2007)","journal-title":"SIAM J. Control Optim."},{"issue":"5","key":"4_CR27","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/s00446-015-0248-5","volume":"28","author":"L Pagli","year":"2015","unstructured":"Pagli, L., Prencipe, G., Viglietta, G.: Getting close without touching: near-gathering for autonomous mobile robots. Distrib. Comput. 28(5), 333\u2013349 (2015)","journal-title":"Distrib. Comput."},{"issue":"3","key":"4_CR28","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1002\/net.21453","volume":"59","author":"A Pelc","year":"2012","unstructured":"Pelc, A.: Deterministic rendezvous in networks: a comprehensive survey. Networks 59(3), 331\u2013347 (2012)","journal-title":"Networks"}],"container-title":["Lecture Notes in Computer Science","Structural Information and Communication Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-24922-9_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T17:56:39Z","timestamp":1710266199000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-24922-9_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030249212","9783030249229"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-24922-9_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"13 July 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SIROCCO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Colloquium on Structural Information and Communication Complexity","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"L'Aquila","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 July 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 July 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sirocco2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/cs.gssi.it\/sirocco2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"39","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"19","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"9","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"49% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"6","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}