{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,12]],"date-time":"2024-09-12T23:58:02Z","timestamp":1726185482898},"publisher-location":"Cham","reference-count":26,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031222153"},{"type":"electronic","value":"9783031222160"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-22216-0_48","type":"book-chapter","created":{"date-parts":[[2023,1,16]],"date-time":"2023-01-16T23:39:26Z","timestamp":1673912366000},"page":"724-736","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Correlated Random Walk Model to\u00a0Rapidly Approximate Hitting Time Distributions in\u00a0Multi-robot Systems"],"prefix":"10.1007","author":[{"given":"Yi","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Daniel","family":"Boley","sequence":"additional","affiliation":[]},{"given":"John","family":"Harwell","sequence":"additional","affiliation":[]},{"given":"Maria","family":"Gini","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,1,18]]},"reference":[{"issue":"4","key":"48_CR1","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1017\/S0963548311000125","volume":"20","author":"N Alon","year":"2011","unstructured":"Alon, N., Avin, C., Kouck\u1ef3, M., Kozma, G., Lotker, Z., Tuttle, M.R.: Many random walks are faster than one. Comb. Probab. Comput. 20(4), 481\u2013502 (2011)","journal-title":"Comb. Probab. Comput."},{"issue":"4","key":"48_CR2","first-page":"922","volume":"48","author":"MT Barlow","year":"2012","unstructured":"Barlow, M.T., Peres, Y., Sousi, P.: Collisions of random walks. Ann. l\u2019IHP Probab. Stat. 48(4), 922\u2013946 (2012)","journal-title":"Ann. l\u2019IHP Probab. Stat."},{"key":"48_CR3","doi-asserted-by":"crossref","unstructured":"Besenczi, R., B\u00e1tfai, N., Jeszenszky, P., Major, R., Monori, F., Isp\u00e1ny, M.: Large-scale simulation of traffic flow using Markov model. PLOS One 16(2) (2021)","DOI":"10.1371\/journal.pone.0246062"},{"key":"48_CR4","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1016\/j.laa.2020.10.018","volume":"623","author":"D Boley","year":"2021","unstructured":"Boley, D.: On fast computation of directed graph Laplacian pseudo-inverse. Linear Algebra Appl. 623, 128\u2013148 (2021)","journal-title":"Linear Algebra Appl."},{"issue":"2","key":"48_CR5","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1016\/j.laa.2011.01.030","volume":"435","author":"D Boley","year":"2011","unstructured":"Boley, D., Ranjan, G., Zhang, Z.L.: Commute times for a directed graph using an asymmetric Laplacian. Linear Algebra Appl. 435(2), 224\u2013242 (2011)","journal-title":"Linear Algebra Appl."},{"issue":"3","key":"48_CR6","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1002\/rsa.3240010303","volume":"1","author":"G Brightwell","year":"1990","unstructured":"Brightwell, G., Winkler, P.: Maximum hitting time for random walks on graphs. Random Struct. Algorithms 1(3), 263\u2013276 (1990)","journal-title":"Random Struct. Algorithms"},{"issue":"10","key":"48_CR7","doi-asserted-by":"publisher","first-page":"3106","DOI":"10.1890\/09-1729.1","volume":"91","author":"EA Codling","year":"2010","unstructured":"Codling, E.A., Bearon, R.N., Thorn, G.J.: Diffusion about the mean drift location in a biased random walk. Ecology 91(10), 3106\u20133113 (2010)","journal-title":"Ecology"},{"issue":"25","key":"48_CR8","doi-asserted-by":"publisher","first-page":"813","DOI":"10.1098\/rsif.2008.0014","volume":"5","author":"EA Codling","year":"2008","unstructured":"Codling, E.A., Plank, M.J., Benhamou, S.: Random walk models in biology. J. R. Soc. Interface 5(25), 813\u2013834 (2008)","journal-title":"J. R. Soc. Interface"},{"issue":"2","key":"48_CR9","doi-asserted-by":"publisher","first-page":"396","DOI":"10.1137\/S0895479804442462","volume":"27","author":"T Dayar","year":"2005","unstructured":"Dayar, T., Akar, N.: Computing moments of first passage times to a subset of states in Markov chains. SIAM J. Matrix Anal. 27(2), 396\u2013412 (2005)","journal-title":"SIAM J. Matrix Anal."},{"key":"48_CR10","doi-asserted-by":"crossref","unstructured":"Dimidov, C., Oriolo, G., Trianni, V.: Random walks in swarm robotics: an experiment with kilobots. In: International Conference on Swarm Intelligence, pp. 185\u2013196. Springer, Berlin (2016)","DOI":"10.1007\/978-3-319-44427-7_16"},{"key":"48_CR11","doi-asserted-by":"crossref","unstructured":"Efremenko, K., Reingold, O.: How well do random walks parallelize? In: Dinur, I., Jansen, K., Naor, S., Rolim, J. (eds.) Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, vol. 5687. Springer, Berlin (2009)","DOI":"10.1007\/978-3-642-03685-9_36"},{"issue":"3","key":"48_CR12","doi-asserted-by":"publisher","first-page":"775","DOI":"10.1016\/j.spa.2008.04.007","volume":"119","author":"A Gaudilli\u00e8re","year":"2009","unstructured":"Gaudilli\u00e8re, A.: Collision probability for random trajectories in two dimensions. Stoch. Process. Appl. 119(3), 775\u2013810 (2009)","journal-title":"Stoch. Process. Appl."},{"key":"48_CR13","unstructured":"Grinstead, C.M., Snell, J.L.: Introduction to Probability. American Mathematical Society (1997)"},{"key":"48_CR14","doi-asserted-by":"crossref","unstructured":"Hamann, H.: Modeling swarm systems and formal design methods. In: Swarm Robotics: A Formal Approach, pp. 95\u2013127. Springer, Berlin (2018)","DOI":"10.1007\/978-3-319-74528-2_5"},{"issue":"4","key":"48_CR15","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1006\/jtbi.1997.0421","volume":"186","author":"N Hill","year":"1997","unstructured":"Hill, N., H\u00e4der, D.P.: A biased random walk model for the trajectories of swimming micro-organisms. J. Theor. Biol. 186(4), 503\u2013526 (1997)","journal-title":"J. Theor. Biol."},{"key":"48_CR16","doi-asserted-by":"crossref","unstructured":"Jeong, M., Harwell, J., Gini, M.: Analysis of exploration in swarm robotic systems. IAS-16 (2021)","DOI":"10.1007\/978-3-030-95892-3_34"},{"key":"48_CR17","unstructured":"Kemeny, J.G., Snell, J.L.: Finite Markov Chains. Springer, Berlin (1976)"},{"key":"48_CR18","doi-asserted-by":"crossref","unstructured":"Khalastchi, E., Kalech, M.: Fault detection and diagnosis in multi-robot systems: a survey. Sensors 19(18) (2019)","DOI":"10.3390\/s19184019"},{"key":"48_CR19","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/j.procs.2013.09.242","volume":"20","author":"JP Lancaster","year":"2013","unstructured":"Lancaster, J.P., Gustafson, D.A.: Predicting the behavior of robotic swarms in search and tag tasks. Procedia Comput. Sci. 20, 77\u201382 (2013)","journal-title":"Procedia Comput. Sci."},{"key":"48_CR20","doi-asserted-by":"crossref","unstructured":"Lau, H.W., Szeto, K.Y.: Asymptotic analysis of first passage time in complex networks. EPL (Europhys. Lett.) 90(4), 40005 (2010)","DOI":"10.1209\/0295-5075\/90\/40005"},{"issue":"1\u201346","key":"48_CR21","first-page":"4","volume":"2","author":"L Lov\u00e1sz","year":"1993","unstructured":"Lov\u00e1sz, L.: Random walks on graphs. Combinatorics 2(1\u201346), 4 (1993)","journal-title":"Combinatorics"},{"key":"48_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.physrep.2017.07.007","volume":"716","author":"N Masuda","year":"2017","unstructured":"Masuda, N., Porter, M.A., Lambiotte, R.: Random walks and diffusion on networks. Phys. Rep. 716, 1\u201358 (2017)","journal-title":"Phys. Rep."},{"issue":"1","key":"48_CR23","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1137\/S1064827599364659","volume":"24","author":"RB Morgan","year":"2002","unstructured":"Morgan, R.B.: GMRES with deflated restarting. SIAM J. Sci. Comput. 24(1), 20\u201337 (2002)","journal-title":"SIAM J. Sci. Comput."},{"issue":"1","key":"48_CR24","doi-asserted-by":"publisher","first-page":"253","DOI":"10.2307\/3212943","volume":"17","author":"R Nain","year":"1980","unstructured":"Nain, R., Sen, K.: Transition probability matrices for correlated random walks. J. Appl. Probab. 17(1), 253\u2013258 (1980)","journal-title":"J. Appl. Probab."},{"issue":"3","key":"48_CR25","doi-asserted-by":"publisher","first-page":"933","DOI":"10.1137\/15M1010737","volume":"37","author":"R Patel","year":"2016","unstructured":"Patel, R., Carron, A., Bullo, F.: The hitting time of multiple random walks. SIAM J. Matrix Anal. 37(3), 933\u2013954 (2016)","journal-title":"SIAM J. Matrix Anal."},{"key":"48_CR26","doi-asserted-by":"crossref","unstructured":"Pinciroli, C., Trianni, V., O\u2019Grady, R., Pini, G., Brutschy, A., Brambilla, M., Mathews, N., Ferrante, E., Di\u00a0Caro, G., Ducatelle, F., et\u00a0al.: ARGoS: a modular, multi-engine simulator for heterogeneous swarm robotics. In: IEEE\/RSJ International Conference on Intelligent Robots and Systems, pp. 5027\u20135034. IEEE (2011)","DOI":"10.1109\/IROS.2011.6094829"}],"container-title":["Lecture Notes in Networks and Systems","Intelligent Autonomous Systems 17"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-22216-0_48","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,16]],"date-time":"2023-01-16T23:52:47Z","timestamp":1673913167000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-22216-0_48"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031222153","9783031222160"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-22216-0_48","relation":{},"ISSN":["2367-3370","2367-3389"],"issn-type":[{"type":"print","value":"2367-3370"},{"type":"electronic","value":"2367-3389"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"18 January 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IAS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Intelligent Autonomous Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Zagreb","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Croatia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 June 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 June 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ias2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.ias-17.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}