{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T02:57:38Z","timestamp":1725937058635},"publisher-location":"Cham","reference-count":30,"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_6","type":"book-chapter","created":{"date-parts":[[2017,12,30]],"date-time":"2017-12-30T11:03:05Z","timestamp":1514631785000},"page":"70-83","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Rendezvous on a Line by Location-Aware Robots Despite the Presence of Byzantine Faults"],"prefix":"10.1007","author":[{"given":"Huda","family":"Chuangpishit","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jurek","family":"Czyzowicz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Evangelos","family":"Kranakis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Danny","family":"Krizanc","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,12,31]]},"reference":[{"issue":"1","key":"6_CR1","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1137\/050645221","volume":"36","author":"N Agmon","year":"2006","unstructured":"Agmon, N., Peleg, D.: Fault-tolerant gathering algorithms for autonomous mobile robots. SIAM J. Comput. 36(1), 56\u201382 (2006)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"6_CR2","doi-asserted-by":"crossref","first-page":"673","DOI":"10.1137\/S0363012993249195","volume":"33","author":"S Alpern","year":"1995","unstructured":"Alpern, S.: The rendezvous search problem. SIAM J. Control Optim. 33(3), 673\u2013683 (1995)","journal-title":"SIAM J. Control Optim."},{"issue":"5","key":"6_CR3","doi-asserted-by":"crossref","first-page":"772","DOI":"10.1287\/opre.50.5.772.363","volume":"50","author":"S Alpern","year":"2002","unstructured":"Alpern, S.: Rendezvous search: a personal perspective. Oper. Res. 50(5), 772\u2013795 (2002)","journal-title":"Oper. Res."},{"key":"6_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/978-3-642-15763-9_28","volume-title":"Distributed Computing","author":"E Bampas","year":"2010","unstructured":"Bampas, E., Czyzowicz, J., G\u0105sieniec, L., Ilcinkas, D., Labourel, A.: Almost optimal asynchronous rendezvous in infinite multidimensional grids. In: Lynch, N.A., Shvartsman, A.A. (eds.) DISC 2010. LNCS, vol. 6343, pp. 297\u2013311. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15763-9_28"},{"issue":"34\u201336","key":"6_CR5","doi-asserted-by":"crossref","first-page":"3154","DOI":"10.1016\/j.tcs.2010.05.006","volume":"411","author":"Z Bouzid","year":"2010","unstructured":"Bouzid, Z., Potop-Butucaru, M.G., Tixeuil, S.: Optimal byzantine-rezilient convergence in uni-dimensional robot network. Theor. Comput. Sci. 411(34\u201336), 3154\u20133168 (2010)","journal-title":"Theor. Comput. Sci."},{"key":"6_CR6","unstructured":"Chuangpishit, H., Czyzowicz, J., Kranakis, E., Krizanc, D.: Rendezvous on a line by location-aware robots despite the presence of byzantine faults (2017). https:\/\/arxiv.org\/pdf\/1707.06776.pdf"},{"issue":"1","key":"6_CR7","doi-asserted-by":"crossref","first-page":"1516","DOI":"10.1137\/S0097539704446475","volume":"41","author":"R Cohen","year":"2005","unstructured":"Cohen, R., Peleg, D.: Convergence properties of the gravitational algorithm in asynchronous robot systems. SIAM J. Comput. 41(1), 1516\u20131528 (2005)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"6_CR8","doi-asserted-by":"crossref","first-page":"276","DOI":"10.1137\/060665257","volume":"38","author":"R Cohen","year":"2008","unstructured":"Cohen, R., Peleg, D.: Convergence of autonomous mobile robots with inaccurate sensors and movements. SIAM J. Comput. 38(1), 276\u2013302 (2008)","journal-title":"SIAM J. Comput."},{"key":"6_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1007\/978-3-642-24100-0_42","volume-title":"Distributed Computing","author":"A Collins","year":"2011","unstructured":"Collins, A., Czyzowicz, J., G\u0105sieniec, L., Kosowski, A., Martin, R.: Synchronous rendezvous for location-aware agents. In: Peleg, D. (ed.) DISC 2011. LNCS, vol. 6950, pp. 447\u2013459. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-24100-0_42"},{"key":"6_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1007\/978-3-642-14162-1_42","volume-title":"Automata, Languages and Programming","author":"A Collins","year":"2010","unstructured":"Collins, A., Czyzowicz, J., G\u0105sieniec, L., Labourel, A.: Tell me where I am so I can meet you sooner. In: Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., Spirakis, P.G. (eds.) ICALP 2010. LNCS, vol. 6199, pp. 502\u2013514. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14162-1_42"},{"key":"6_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/978-3-662-48971-0_30","volume-title":"Algorithms and Computation","author":"J Czyzowicz","year":"2015","unstructured":"Czyzowicz, J., G\u0105sieniec, L., Kosowski, A., Kranakis, E., Krizanc, D., Taleb, N.: When patrolmen become corrupted: monitoring a graph using faulty mobile robots. In: Elbassioni, K., Makino, K. (eds.) ISAAC 2015. LNCS, vol. 9472, pp. 343\u2013354. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48971-0_30"},{"issue":"2","key":"6_CR12","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1007\/s00224-011-9379-7","volume":"52","author":"J Czyzowicz","year":"2013","unstructured":"Czyzowicz, J., Kosowski, A., Pelc, A.: Deterministic rendezvous of asynchronous bounded-memory agents in polygonal terrains. Theory Comput. Syst. 52(2), 179\u2013199 (2013)","journal-title":"Theory Comput. Syst."},{"key":"6_CR13","doi-asserted-by":"crossref","unstructured":"Czyzowicz, J., Kranakis, E., Krizanc, D., Narayanan, L., Opatrny, J.: Search on a line with faulty robots. In: Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing, PODC 2016, Chicago, IL, USA, 25\u201328 July 2016, pp. 405\u2013414 (2016)","DOI":"10.1145\/2933057.2933102"},{"issue":"3","key":"6_CR14","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1016\/j.tcs.2005.12.016","volume":"355","author":"G Marco De","year":"2006","unstructured":"De Marco, G., Gargano, L., Kranakis, E., Krizanc, D., Pelc, A., Vaccaro, U.: Asynchronous deterministic rendezvous in graphs. Theor. Comput. Sci. 355(3), 315\u2013326 (2006)","journal-title":"Theor. Comput. Sci."},{"key":"6_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1007\/11864219_4","volume-title":"Distributed Computing","author":"X D\u00e9fago","year":"2006","unstructured":"D\u00e9fago, X., Gradinariu, M., Messika, S., Raipin-Parv\u00e9dy, P.: Fault-tolerant and self-stabilizing mobile robots gathering. In: Dolev, S. (ed.) DISC 2006. LNCS, vol. 4167, pp. 46\u201360. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11864219_4"},{"key":"6_CR16","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1007\/s00453-006-0074-2","volume":"46","author":"A Dessmark","year":"2006","unstructured":"Dessmark, A., Fraigniaud, P., Kowalski, D., Pelc, A.: Deterministic rendezvous in graphs. Algorithmica 46, 69\u201396 (2006)","journal-title":"Algorithmica"},{"issue":"1","key":"6_CR17","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/2629656","volume":"11","author":"Y Dieudonn\u00e9","year":"2014","unstructured":"Dieudonn\u00e9, Y., Pelc, A., Peleg, D.: Gathering despite mischief. ACM Trans. Algorithms (TALG) 11(1), 1 (2014)","journal-title":"ACM Trans. Algorithms (TALG)"},{"key":"6_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-45249-9_1","volume-title":"Distributed Computing and Networking","author":"O Feinerman","year":"2014","unstructured":"Feinerman, O., Korman, A., Kutten, S., Rodeh, Y.: Fast rendezvous on a cycle by agents with different speeds. In: Chatterjee, M., Cao, J., Kothapalli, K., Rajsbaum, S. (eds.) ICDCN 2014. LNCS, vol. 8314, pp. 1\u201313. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-45249-9_1"},{"issue":"1","key":"6_CR19","doi-asserted-by":"crossref","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. Theor. Comput. Sci. 337(1), 147\u2013168 (2005)","journal-title":"Theor. Comput. Sci."},{"key":"6_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/978-3-319-19662-6_14","volume-title":"Ad-hoc, Mobile, and Wireless Networks","author":"E Huus","year":"2015","unstructured":"Huus, E., Kranakis, E.: Rendezvous of many agents with different speeds in a cycle. In: Papavassiliou, S., Ruehrup, S. (eds.) ADHOC-NOW 2015. LNCS, vol. 9143, pp. 195\u2013209. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-19662-6_14"},{"issue":"1","key":"6_CR21","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1137\/100797916","volume":"41","author":"T Izumi","year":"2012","unstructured":"Izumi, T., Souissi, S., Katayama, Y., Inuzuka, N., D\u00e9fago, X., Wada, K., Yamashita, M.: The gathering problem for two oblivious robots with unreliable compasses. SIAM J. Comput. 41(1), 26\u201346 (2012)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"6_CR22","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/j.tcs.2007.09.032","volume":"390","author":"R Klasing","year":"2008","unstructured":"Klasing, R., Markou, E., Pelc, A.: Gathering asynchronous oblivious mobile robots in a ring. Theoret. Comput. Sci. 390(1), 27\u201339 (2008)","journal-title":"Theoret. Comput. Sci."},{"key":"6_CR23","doi-asserted-by":"crossref","unstructured":"Kranakis, E., Krizanc, D., MacQuarrie, F., Shende, S.: Randomized rendezvous algorithms for agents on a ring with different speeds. In: Proceedings of the 2015 International Conference on Distributed Computing and Networking, ICDCN 2015, Goa, India, 4\u20137 January 2015, pp. 9:1\u20139:10 (2015)","DOI":"10.1145\/2684464.2684468"},{"key":"6_CR24","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-031-01999-9","volume-title":"The Mobile Agent Rendezvous Problem in the Ring: An Introduction. Synthesis Lectures on Distributed Computing Theory Series","author":"E Kranakis","year":"2010","unstructured":"Kranakis, E., Krizanc, D., Markou, E.: The Mobile Agent Rendezvous Problem in the Ring: An Introduction. Synthesis Lectures on Distributed Computing Theory Series. Morgan & Claypool Publishers, San Rafael (2010)"},{"key":"6_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/978-3-319-51963-0_7","volume-title":"SOFSEM 2017: Theory and Practice of Computer Science","author":"E Kranakis","year":"2017","unstructured":"Kranakis, E., Krizanc, D., Markou, E., Pagourtzis, A., Ram\u00edrez, F.: Different speeds suffice for rendezvous of two agents on arbitrary graphs. In: Steffen, B., Baier, C., van den Brand, M., Eder, J., Hinchey, M., Margaria, T. (eds.) SOFSEM 2017. LNCS, vol. 10139, pp. 79\u201390. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-51963-0_7"},{"issue":"3","key":"6_CR26","doi-asserted-by":"crossref","first-page":"382","DOI":"10.1145\/357172.357176","volume":"4","author":"L Lamport","year":"1982","unstructured":"Lamport, L., Shostak, R., Pease, M.: The byzantine generals problem. ACM Trans. Program. Lang. Syst. (TOPLAS) 4(3), 382\u2013401 (1982)","journal-title":"ACM Trans. Program. Lang. Syst. (TOPLAS)"},{"key":"6_CR27","volume-title":"Distributed Algorithms","author":"NA Lynch","year":"1996","unstructured":"Lynch, N.A.: Distributed Algorithms. Morgan Kaufmann, Burlington (1996)"},{"issue":"1","key":"6_CR28","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1109\/JPROC.2006.887293","volume":"95","author":"R Olfati-Saber","year":"2007","unstructured":"Olfati-Saber, R., Fax, J.A., Murray, R.M.: Consensus and cooperation in networked multi-agent systems. Proc. IEEE 95(1), 215\u2013233 (2007)","journal-title":"Proc. IEEE"},{"key":"6_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/11945529_24","volume-title":"Principles of Distributed Systems","author":"S Souissi","year":"2006","unstructured":"Souissi, S., D\u00e9fago, X., Yamashita, M.: Gathering asynchronous mobile robots with inaccurate compasses. In: Shvartsman, M.M.A.A. (ed.) OPODIS 2006. LNCS, vol. 4305, pp. 333\u2013349. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11945529_24"},{"key":"6_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"610","DOI":"10.1007\/3-540-61440-0_163","volume-title":"Automata, Languages and Programming","author":"X Yu","year":"1996","unstructured":"Yu, X., Yung, M.: Agent rendezvous: a dynamic symmetry-breaking problem. In: Meyer, F., Monien, B. (eds.) ICALP 1996. LNCS, vol. 1099, pp. 610\u2013621. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/3-540-61440-0_163"}],"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_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,11]],"date-time":"2022-08-11T12:10:20Z","timestamp":1660219820000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-72751-6_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319727509","9783319727516"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-72751-6_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}