{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:42:18Z","timestamp":1742913738807,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031745799"},{"type":"electronic","value":"9783031745805"}],"license":[{"start":{"date-parts":[[2024,12,27]],"date-time":"2024-12-27T00:00:00Z","timestamp":1735257600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,12,27]],"date-time":"2024-12-27T00:00:00Z","timestamp":1735257600000},"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":[[2025]]},"DOI":"10.1007\/978-3-031-74580-5_1","type":"book-chapter","created":{"date-parts":[[2024,12,26]],"date-time":"2024-12-26T15:36:30Z","timestamp":1735227390000},"page":"1-15","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Collision-Free Robot Scheduling"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3343-2435","authenticated-orcid":false,"given":"Duncan","family":"Adamson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2798-4084","authenticated-orcid":false,"given":"Nathan","family":"Flaherty","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7192-7853","authenticated-orcid":false,"given":"Igor","family":"Potapov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5396-3749","authenticated-orcid":false,"given":"Paul G.","family":"Spirakis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,12,27]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"Adamson, D.,\u00a0Flaherty, N.,\u00a0Potapov, I., Spirakis, P.G.: Collision-free robot scheduling. arXiv:2402.12019 2024","key":"1_CR1","DOI":"10.2139\/ssrn.5007260"},{"unstructured":"Adamson, D., Gusev, V.V.,\u00a0Malyshev, D.,\u00a0Zamaraev, V.: Faster exploration of some temporal graphs. In: 1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022). Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik (2022)","key":"1_CR2"},{"key":"1_CR3","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/j.jcss.2021.04.001","volume":"120","author":"EC Akrida","year":"2021","unstructured":"Akrida, E.C., Mertzios, G.B., Spirakis, P.G., Raptopoulos, C.: The temporal explorer who returns to the base. J. Comput. Syst. Sci. 120, 179\u2013193 (2021)","journal-title":"J. Comput. Syst. Sci."},{"unstructured":"Arrighi, E., Fomin, F.V.,\u00a0Golovach, P.,\u00a0Wolf, P.: Kernelizing temporal exploration problems. arXiv preprint arXiv:2302.10110 (2023)","key":"1_CR4"},{"key":"1_CR5","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1016\/j.ipl.2018.10.016","volume":"142","author":"HL Bodlaender","year":"2019","unstructured":"Bodlaender, H.L., van der Zanden, T.C.: On exploring always-connected temporal graphs of small pathwidth. Inf. Process. Lett. 142, 68\u201371 (2019)","journal-title":"Inf. Process. Lett."},{"issue":"3","key":"1_CR6","doi-asserted-by":"publisher","first-page":"688","DOI":"10.1007\/s00453-022-01018-7","volume":"85","author":"BM Bumpus","year":"2023","unstructured":"Bumpus, B.M., Meeks, K.: Edge exploration of temporal graphs. Algorithmica 85(3), 688\u2013716 (2023)","journal-title":"Algorithmica"},{"issue":"7815","key":"1_CR7","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1038\/s41586-020-2442-2","volume":"583","author":"B Burger","year":"2020","unstructured":"Burger, B., et al.: A mobile robotic chemist. Nature 583(7815), 237\u2013241 (2020)","journal-title":"Nature"},{"key":"1_CR8","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1016\/j.jcss.2016.11.008","volume":"86","author":"J Czyzowicz","year":"2017","unstructured":"Czyzowicz, J., Dereniowski, D., Gasieniec, L., Klasing, R., Kosowski, A., Pajak, D.: Collision-free network exploration. J. Comput. Syst. Sci. 86, 70\u201381 (2017)","journal-title":"J. Comput. Syst. Sci."},{"key":"1_CR9","doi-asserted-by":"publisher","first-page":"104890","DOI":"10.1016\/j.ic.2022.104890","volume":"285","author":"A Deligkas","year":"2022","unstructured":"Deligkas, A., Potapov, I.: Optimizing reachability sets in temporal graphs by delaying. Inf. Comput. 285, 104890 (2022)","journal-title":"Inf. Comput."},{"key":"1_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jcss.2021.01.005","volume":"119","author":"T Erlebach","year":"2021","unstructured":"Erlebach, T., Hoffmann, M., Kammer, F.: On temporal graph exploration. J. Comput. Syst. Sci. 119, 1\u201318 (2021)","journal-title":"J. Comput. Syst. Sci."},{"unstructured":"Erlebach, T., Kammer, F., Luo, K., Sajenko, A., Spooner, J.T.: Two moves per time step make a difference. In: 46th International Colloquium on Automata, Languages, and Programming (ICALP: volume 132 of Leibniz International Proceedings in Informatics (LIPIcs), pp. 1\u201314. Dagstuhl, Germany (2019)","key":"1_CR11"},{"unstructured":"Erlebach, T., Spooner, J.T.: Faster exploration of degree-bounded temporal graphs. In: 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2018)","key":"1_CR12"},{"issue":"4","key":"1_CR13","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/s00236-022-00421-5","volume":"59","author":"T Erlebach","year":"2022","unstructured":"Erlebach, T., Spooner, J.T.: Exploration of k-edge-deficient temporal graphs. Acta Informatica 59(4), 387\u2013407 (2022)","journal-title":"Acta Informatica"},{"unstructured":"Erlebach, T., Spooner, J.T.: Parameterized temporal exploration problems. In: 1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022). Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik (2022)","key":"1_CR14"},{"unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability. W. H. Freeman and Company (1979)","key":"1_CR15"},{"issue":"7714","key":"1_CR16","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1038\/s41586-018-0307-8","volume":"559","author":"JM Granda","year":"2018","unstructured":"Granda, J.M., Donina, L., Dragone, V., Long, D., Cronin, L.: Controlling an organic synthesis robot with machine learning to search for new reactivity. Nature 559(7714), 377\u2013381 (2018)","journal-title":"Nature"},{"issue":"1","key":"1_CR17","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1038\/scientificamerican0111-72","volume":"304","author":"RD King","year":"2011","unstructured":"King, R.D.: Rise of the robo scientists. Sci. Am. 304(1), 72\u201377 (2011)","journal-title":"Sci. Am."},{"doi-asserted-by":"crossref","unstructured":"Langner, S., et al.: Beyond ternary OPV: high-throughput experimentation and self-driving laboratories optimize multi-component systems. arXiv:1909.03511 (2019)","key":"1_CR18","DOI":"10.1002\/adma.201907801"},{"issue":"6227","key":"1_CR19","doi-asserted-by":"publisher","first-page":"1221","DOI":"10.1126\/science.aaa5414","volume":"347","author":"J Li","year":"2015","unstructured":"Li, J., et al.: Synthesis of many different types of organic small molecules using one automated process. Science 347(6227), 1221\u20131226 (2015)","journal-title":"Science"},{"key":"1_CR20","doi-asserted-by":"publisher","first-page":"104289","DOI":"10.1016\/j.robot.2022.104289","volume":"159","author":"S Liu","year":"2023","unstructured":"Liu, S., Shen, J., Tian, W., Lin, J., Li, P., Li, B.: Balanced task allocation and collision-free scheduling of multi-robot systems in large spacecraft structure manufacturing. Robot. Auton. Syst. 159, 104289 (2023)","journal-title":"Robot. Auton. Syst."},{"doi-asserted-by":"crossref","unstructured":"MacLeod, B.P.,et al.: Self-driving laboratory for accelerated discovery of thin-film materials. arXiv:1906.05398 (2020)","key":"1_CR21","DOI":"10.1126\/sciadv.aaz8867"},{"key":"1_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tcs.2016.04.006","volume":"634","author":"O Michail","year":"2016","unstructured":"Michail, O., Spirakis, P.G.: Traveling salesman problems in temporal graphs. Theoret. Comput. Sci. 634, 1\u201323 (2016)","journal-title":"Theoret. Comput. Sci."},{"key":"1_CR23","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1016\/j.comcom.2023.04.025","volume":"206","author":"RA Qamar","year":"2023","unstructured":"Qamar, R.A., Sarfraz, M., Ghauri, S.A., Mahmood, A.: TRMaxAlloc: maximum task allocation using reassignment algorithm in multi-UAV system. Comput. Commun. 206, 110\u2013123 (2023)","journal-title":"Comput. Commun."},{"unstructured":"Taghian Alamouti, S.: Exploring temporal cycles and grids. Ph. D. thesis, Concordia University (2020)","key":"1_CR24"},{"key":"1_CR25","doi-asserted-by":"publisher","first-page":"492","DOI":"10.1016\/j.jmsy.2023.12.008","volume":"72","author":"L Zhang","year":"2024","unstructured":"Zhang, L., Yang, C., Yan, Y., Cai, Z., Hu, Y.: Automated guided vehicle dispatching and routing integration via digital twin with deep reinforcement learning. J. Manuf. Syst. 72, 492\u2013503 (2024)","journal-title":"J. Manuf. Syst."}],"container-title":["Lecture Notes in Computer Science","Algorithmics of Wireless Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-74580-5_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,26]],"date-time":"2024-12-26T16:02:24Z","timestamp":1735228944000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-74580-5_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,27]]},"ISBN":["9783031745799","9783031745805"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-74580-5_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024,12,27]]},"assertion":[{"value":"27 December 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ALGOWIN","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Algorithmics of Wireless Networks","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Egham","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 September 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 September 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"algosensors2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/algo-conference.org\/2024\/algowin\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}