{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T08:45:53Z","timestamp":1743151553515,"version":"3.40.3"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319530574"},{"type":"electronic","value":"9783319530581"}],"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-53058-1_5","type":"book-chapter","created":{"date-parts":[[2017,1,23]],"date-time":"2017-01-23T09:01:41Z","timestamp":1485162101000},"page":"62-79","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["The Impact of the Gabriel Subgraph of the Visibility Graph on the Gathering of Mobile Autonomous Robots"],"prefix":"10.1007","author":[{"given":"Shouwei","family":"Li","sequence":"first","affiliation":[]},{"given":"Friedhelm","family":"Meyer auf der Heide","sequence":"additional","affiliation":[]},{"given":"Pavel","family":"Podlipyan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,1,24]]},"reference":[{"key":"5_CR1","doi-asserted-by":"crossref","unstructured":"Agathangelou, C., Georgiou, C., Mavronicolas, M.: A distributed algorithm for gathering many fat mobile robots in the plane. In: Proceedings of the 2013 ACM Symposium on Principles of Distributed Computing, PODC 2013, pp. 250\u2013259. ACM, New York, NY, USA (2013)","DOI":"10.1145\/2484239.2484266"},{"key":"5_CR2","doi-asserted-by":"crossref","unstructured":"Ando, H., Suzuki, I., Yamashita, M.: Formation and agreement problems for synchronous mobile robots with limited visibility. In: Proceedings of the 1995 IEEE International Symposium on Intelligent Control, 1995, pp. 453\u2013460 (1995)","DOI":"10.21236\/ADA296911"},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"Chrystal, G.: On the problem to construct the minimum circle enclosing n givenpoints in a plane. In: Proceedings of the Edinburgh Mathematical Society, Third Meeting, pp. 30\u201335 (1885)","DOI":"10.1017\/S0013091500037238"},{"key":"5_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1007\/978-3-540-30140-0_22","volume-title":"Algorithms \u2013 ESA 2004","author":"R Cohen","year":"2004","unstructured":"Cohen, R., Peleg, D.: Convergence properties of the gravitational algorithm in asynchronous robot systems. In: Albers, S., Radzik, T. (eds.) ESA 2004. LNCS, vol. 3221, pp. 228\u2013239. Springer, Heidelberg (2004). doi:10.1007\/978-3-540-30140-0_22"},{"key":"5_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1007\/978-3-642-18381-2_15","volume-title":"SOFSEM 2011: Theory and Practice of Computer Science","author":"A Cord-Landwehr","year":"2011","unstructured":"Cord-Landwehr, A., et al.: Collisionless gathering of robots with an extent. In: \u010cern\u00e1, I., Gyim\u00f3thy, T., Hromkovi\u010d, J., Jefferey, K., Kr\u00e1lovi\u0107, R., Vukoli\u0107, M., Wolf, S. (eds.) SOFSEM 2011. LNCS, vol. 6543, pp. 178\u2013189. Springer, Heidelberg (2011). doi:10.1007\/978-3-642-18381-2_15"},{"issue":"8","key":"5_CR6","doi-asserted-by":"publisher","first-page":"1289","DOI":"10.1109\/TAC.2006.878713","volume":"51","author":"J Cortes","year":"2006","unstructured":"Cortes, J., Martinez, S., Bullo, F.: Robust rendezvous for mobile autonomous agents via proximity graphs in arbitrary dimensions. IEEE Trans. Autom. Control 51(8), 1289\u20131298 (2006)","journal-title":"IEEE Trans. Autom. Control"},{"key":"5_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1007\/11945529_25","volume-title":"Principles of Distributed Systems","author":"J Czyzowicz","year":"2006","unstructured":"Czyzowicz, J., Gsieniec, L., Pelc, A.: Gathering few fat mobile robots in the plane. In: Shvartsman, M.M.A.A. (ed.) OPODIS 2006. LNCS, vol. 4305, pp. 350\u2013364. Springer, Heidelberg (2006). doi:10.1007\/11945529_25"},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"Degener, B., Kempkes, B., Langner, T., auf der Heide, F.M., Pietrzyk, P., Wattenhofer, R.: A tight runtime bound for synchronous gathering of autonomous robots with limited visibility. In: Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2011, pp. 139\u2013148. ACM, New York, NY, USA (2011)","DOI":"10.1145\/1989493.1989515"},{"issue":"3","key":"5_CR9","first-page":"259","volume":"18","author":"K Ruben Gabriel","year":"1969","unstructured":"Ruben Gabriel, K., Sokal, R.: A new statistical approach to geographic variation analysis. Syst. Biol. 18(3), 259\u2013278 (1969)","journal-title":"Syst. Biol."},{"key":"5_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1007\/978-3-540-28646-2_13","volume-title":"Ant Colony Optimization and Swarm Intelligence","author":"N Gordon","year":"2004","unstructured":"Gordon, N., Wagner, I.A., Bruckstein, A.M.: Gathering multiple robotic a(ge)nts with limited sensing capabilities. In: Dorigo, M., Birattari, M., Blum, C., Gambardella, L.M., Mondada, F., St\u00fctzle, T. (eds.) ANTS 2004. LNCS, vol. 3172, pp. 142\u2013153. Springer, Heidelberg (2004). doi:10.1007\/978-3-540-28646-2_13"},{"key":"5_CR11","doi-asserted-by":"crossref","unstructured":"Karp, B., Kung, H.T.: Gpsr: Greedy perimeter stateless routing for wireless networks. In: Proceedings of the 6th Annual International Conference on Mobile Computing and Networking, MobiCom 2000, pp. 243\u2013254. ACM, New York, NY, USA (2000)","DOI":"10.1145\/345910.345953"},{"key":"5_CR12","doi-asserted-by":"crossref","unstructured":"Kempkes, B., Kling, P., auf der Heide, F.M.: Optimal and competitive runtime bounds for continuous, local gathering of mobile robots. In: Proceedinbgs of the 24th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2012, pp. 18\u201326. ACM, New York, NY, USA (2012)","DOI":"10.1145\/2312005.2312009"},{"issue":"4","key":"5_CR13","doi-asserted-by":"publisher","first-page":"759","DOI":"10.1137\/0212052","volume":"12","author":"N Megiddo","year":"1983","unstructured":"Megiddo, N.: Linear-time algorithms for linear programming in $$\\mathbb{R}^3$$ and related problems. SIAM J. Comput. 12(4), 759\u2013776 (1983)","journal-title":"SIAM J. Comput."},{"key":"5_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/978-3-642-31104-8_27","volume-title":"Structural Information and Communication Complexity","author":"L Pagli","year":"2012","unstructured":"Pagli, L., Prencipe, G., Viglietta, G.: Getting close without touching. In: Even, G., Halld\u00f3rsson, M.M. (eds.) SIROCCO 2012. LNCS, vol. 7355, pp. 315\u2013326. Springer, Heidelberg (2012). doi:10.1007\/978-3-642-31104-8_27"}],"container-title":["Lecture Notes in Computer Science","Algorithms for Sensor Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-53058-1_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T14:23:24Z","timestamp":1709821404000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-53058-1_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319530574","9783319530581"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-53058-1_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"24 January 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ALGOSENSORS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Aarhus","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Denmark","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2016","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 August 2016","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 August 2016","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"algosensors2016","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/conferences.au.dk\/algo16\/algosensors\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}