{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T02:57:45Z","timestamp":1725937065001},"publisher-location":"Cham","reference-count":22,"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_14","type":"book-chapter","created":{"date-parts":[[2017,12,30]],"date-time":"2017-12-30T11:03:05Z","timestamp":1514631785000},"page":"182-197","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A Continuous Strategy for Collisionless Gathering"],"prefix":"10.1007","author":[{"given":"Shouwei","family":"Li","sequence":"first","affiliation":[]},{"given":"Christine","family":"Markarian","sequence":"additional","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,12,31]]},"reference":[{"key":"14_CR1","doi-asserted-by":"crossref","unstructured":"Abshoff, S., Cord-Landwehr, A., Fischer, M., Jung, D., Meyer auf der Heide, F.: Gathering a closed chain of robots on a grid. In: Proceedings of the 30th International Parallel and Distributed Processing Symposium (IPDPS), pp. 689\u2013699. IEEE, May 2016","DOI":"10.1109\/IPDPS.2016.51"},{"key":"14_CR2","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. ACM, New York, pp. 250\u2013259 (2013)","DOI":"10.1145\/2484239.2484266"},{"key":"14_CR3","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.1109\/ISIC.1995.525098"},{"key":"14_CR4","doi-asserted-by":"crossref","unstructured":"Chrystal, G.: On the problem to construct the minimum circle enclosing n given points in a plane. In: Proceedings of the Edinburgh Mathematical Society, Third Meeting, pp. 30\u201335 (1885)","DOI":"10.1017\/S0013091500037238"},{"key":"14_CR5","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). https:\/\/doi.org\/10.1007\/978-3-540-30140-0_22"},{"key":"14_CR6","doi-asserted-by":"crossref","unstructured":"Cord-Landwehr, A., Fischer, M., Jung, D., Meyer auf der Heide, F.: Asymptotically optimal gathering on a grid. In: Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), pp. 301\u2013312. ACM, July 2016","DOI":"10.1145\/2935764.2935789"},{"key":"14_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., G\u0105sieniec, 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). https:\/\/doi.org\/10.1007\/11945529_25"},{"key":"14_CR8","doi-asserted-by":"crossref","unstructured":"Das, S., Flocchini, P., Prencipe, G., Santoro, N., Yamashita, M.: The power of lights: synchronizing asynchronous robots using visible bits. In: 2012 IEEE 32nd International Conference on Distributed Computing Systems, Macau, China, June 18\u201321, pp. 506\u2013515 (2012)","DOI":"10.1109\/ICDCS.2012.71"},{"key":"14_CR9","doi-asserted-by":"crossref","unstructured":"Degener, B., Kempkes, B., Meyer auf der Heide, F.: A local O(n2) gathering algorithm. In: Proceedings of the 22nd ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2010, pp. 217\u2013223. ACM, New York (2010)","DOI":"10.1145\/1810479.1810523"},{"key":"14_CR10","doi-asserted-by":"crossref","unstructured":"Degener, B., Kempkes, B., Langner, T., Meyer auf der Heide, F., 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. ACM, New York, pp. 139\u2013148 (2011)","DOI":"10.1145\/1989493.1989515"},{"key":"14_CR11","doi-asserted-by":"crossref","unstructured":"Fischer, M., Jung, D., Meyer auf der Heide, F.: Gathering anonymous, oblivious robots on a grid. CoRR, abs\/1702.03400 (2017)","DOI":"10.1007\/978-3-319-72751-6_13"},{"key":"14_CR12","doi-asserted-by":"crossref","unstructured":"Flocchini, P.: Distributed Computing by Oblivious Mobile Robots. Synthesis Lectures on Distributed Computing Theory, no. 10. Morgan and Claypool, San Rafael (2012)","DOI":"10.2200\/S00440ED1V01Y201208DCT010"},{"issue":"3","key":"14_CR13","first-page":"259","volume":"18","author":"RK Gabriel","year":"1969","unstructured":"Gabriel, R.K., Sokal, R.R.: A new statistical approach to geographic variation analysis. Syst. Biol. 18(3), 259\u2013278 (1969)","journal-title":"Syst. Biol."},{"key":"14_CR14","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). https:\/\/doi.org\/10.1007\/978-3-540-28646-2_13"},{"key":"14_CR15","doi-asserted-by":"crossref","unstructured":"Kempkes, B., Kling, P., Meyer auf der Heide, F.: 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. ACM, New York, pp. 18\u201326 (2012)","DOI":"10.1145\/2312005.2312009"},{"key":"14_CR16","doi-asserted-by":"crossref","unstructured":"Li, S., Markarian, C., Meyer auf der Heide, F., Podlipyan, P.: A continuous strategy for collisionless gathering. Full version, March 2017. https:\/\/www.hni.uni-paderborn.de\/pub\/9531","DOI":"10.1007\/978-3-319-72751-6_14"},{"key":"14_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1007\/978-3-319-53058-1_5","volume-title":"Algorithms for Sensor Systems","author":"S Li","year":"2017","unstructured":"Li, S., Meyer auf der Heide, F., Podlipyan, P.: The impact of the gabriel subgraph of the visibility graph on the gathering of mobile autonomous robots. In: Chrobak, M., Fern\u00e1ndez Anta, A., G\u0105sieniec, L., Klasing, R. (eds.) ALGOSENSORS 2016. LNCS, vol. 10050, pp. 62\u201379. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-53058-1_5"},{"key":"14_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1007\/978-3-319-14472-6_17","volume-title":"Principles of Distributed Systems","author":"T Lukovszki","year":"2014","unstructured":"Lukovszki, T., Meyer auf der Heide, F.: Fast collisionless pattern formation by anonymous, position-aware robots. In: Aguilera, M.K., Querzoni, L., Shapiro, M. (eds.) OPODIS 2014. LNCS, vol. 8878, pp. 248\u2013262. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-14472-6_17"},{"issue":"4","key":"14_CR19","doi-asserted-by":"crossref","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$$ R 3 and related problems. SIAM J. Comput. 12(4), 759\u2013776 (1983)","journal-title":"SIAM J. Comput."},{"key":"14_CR20","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). https:\/\/doi.org\/10.1007\/978-3-642-31104-8_27"},{"key":"14_CR21","volume-title":"Abstract Convex Analysis","author":"I Singer","year":"1997","unstructured":"Singer, I.: Abstract Convex Analysis. Wiley, Hoboken (1997)"},{"key":"14_CR22","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1016\/0031-3203(80)90066-7","volume":"12","author":"GT Toussaint","year":"1980","unstructured":"Toussaint, G.T.: The relative neighbourhood graph of a finite planar set. Pattern Recogn. 12, 261\u2013268 (1980)","journal-title":"Pattern Recogn."}],"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_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,8]],"date-time":"2019-10-08T17:54:44Z","timestamp":1570557284000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-72751-6_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319727509","9783319727516"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-72751-6_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}