{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T04:49:19Z","timestamp":1743050959223,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030603755"},{"type":"electronic","value":"9783030603762"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","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":[[2020]]},"DOI":"10.1007\/978-3-030-60376-2_15","type":"book-chapter","created":{"date-parts":[[2020,10,22]],"date-time":"2020-10-22T12:02:22Z","timestamp":1603368142000},"page":"190-202","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Modeling Pathfinding for Swarm Robotics"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2255-3277","authenticated-orcid":false,"given":"Sebastian","family":"Mai","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9917-5227","authenticated-orcid":false,"given":"Sanaz","family":"Mostaghim","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,10,23]]},"reference":[{"key":"15_CR1","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1613\/jair.1.11734","volume":"67","author":"D Atzmon","year":"2020","unstructured":"Atzmon, D., Stern, R., Felner, A., Wagner, G., Bart\u00e1k, R., Zhou, N.F.: Robust multi-agent path finding and executing. J. Artif. Intell. Res. 67, 549\u2013579 (2020). https:\/\/doi.org\/10.1613\/jair.1.11734","journal-title":"J. Artif. Intell. Res."},{"key":"15_CR2","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1016\/j.neucom.2015.05.116","volume":"172","author":"L Bayindir","year":"2016","unstructured":"Bayindir, L.: A review of swarm robotics tasks. Neurocomputing 172, 292\u2013321 (2016). https:\/\/doi.org\/10.1016\/j.neucom.2015.05.116","journal-title":"Neurocomputing"},{"key":"15_CR3","unstructured":"\u010c\u00e1p, M., Nov\u00e1k, P., Vok\u0159\u00ednek, J., P\u011bchou\u010dek, M.: Multi-agent RRT*: sampling-based cooperative pathfinding. In: 12th International Conference on Autonomous Agents and Multiagent Systems 2013, AAMAS 2013 2, pp. 1263\u20131264 (2013)"},{"key":"15_CR4","doi-asserted-by":"publisher","unstructured":"De Rainville, F.M., Fortin, F.A., Gardner, M.A., Parizeau, M., Gagn\u00e9, C.: DEAP: a python framework for evolutionary algorithms. In: Proceedings of the 14th Annual Conference Companion on Genetic and Evolutionary Computation, GECCO 2012, New York, pp. 85\u201392. ACM (2012). https:\/\/doi.org\/10.1145\/2330784.2330799","DOI":"10.1145\/2330784.2330799"},{"key":"15_CR5","volume-title":"Multi-Objective Optimization using Evolutionary Algorithms","author":"K Deb","year":"2001","unstructured":"Deb, K.: Multi-Objective Optimization using Evolutionary Algorithms. Wiley, Hoboken (2001)"},{"issue":"2","key":"15_CR6","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1109\/4235.996017","volume":"6","author":"K Deb","year":"2002","unstructured":"Deb, K., Pratap, A., Agarwal, S., Meyarivan, T.: A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans. Evol. Comput. 6(2), 182\u2013197 (2002). https:\/\/doi.org\/10.1109\/4235.996017","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"3","key":"15_CR7","doi-asserted-by":"publisher","first-page":"497","DOI":"10.2307\/2372560","volume":"79","author":"LE Dubins","year":"1957","unstructured":"Dubins, L.E.: On curves of minimal length with a constraint on average curvature, and with prescribed initial and terminal positions and tangents. Am. J. Math. 79(3), 497\u2013516 (1957)","journal-title":"Am. J. Math."},{"key":"15_CR8","unstructured":"Felner, A., et al.: Search-based optimal solvers for the multi-agent pathfinding problem: summary and challenges. In: Tenth Annual Symposium on Combinatorial Search (SoCS), pp. 29\u201337 (2017). https:\/\/www.aaai.org\/ocs\/index.php\/SOCS\/SOCS17\/paper\/view\/15781"},{"key":"15_CR9","unstructured":"Krontiris, A., Sajid, Q., Bekris, K.E.: Towards using discrete multiagent pathfinding to address continuous problems. In: AAAI Workshop - Technical Report WS-12-10, pp. 26\u201331 (2012)"},{"key":"15_CR10","doi-asserted-by":"publisher","unstructured":"LaValle, S.M.: Planning algorithms (2006). https:\/\/doi.org\/10.1017\/CBO9780511546877","DOI":"10.1017\/CBO9780511546877"},{"key":"15_CR11","doi-asserted-by":"publisher","unstructured":"Metoui, F., Boussaid, B., Abdelkrim, M.N.: Path planning for a multi-robot system with decentralized control architecture. Stud. Syst. Decis. Control 270, 229\u2013259 (2020). https:\/\/doi.org\/10.1007\/978-981-15-1819-5_12","DOI":"10.1007\/978-981-15-1819-5_12"},{"key":"15_CR12","doi-asserted-by":"publisher","unstructured":"Oliveira, G.M.B., et al.: A cellular automata-based path-planning for a cooperative and decentralized team of robots. In: IEEE congress on Evolutionary Computation (CEC), pp. 739\u2013746. IEEE (2019). https:\/\/doi.org\/10.1109\/cec.2019.8790205","DOI":"10.1109\/cec.2019.8790205"},{"key":"15_CR13","doi-asserted-by":"publisher","unstructured":"Rossi, F., Bandyopadhyay, S., Wolf, M., Pavone, M.: Review of multi-agent algorithms for collective behavior: a structural taxonomy. IFAC-PapersOnLine 51(12), 112\u2013117 (2018). https:\/\/doi.org\/10.1016\/j.ifacol.2018.07.097","DOI":"10.1016\/j.ifacol.2018.07.097"},{"key":"15_CR14","doi-asserted-by":"publisher","unstructured":"Schranz, M., Umlauft, M., Sende, M., Elmenreich, W.: Swarm robotic behaviors and current applications. Front. Robot. AI 7 (2020). https:\/\/doi.org\/10.3389\/frobt.2020.00036","DOI":"10.3389\/frobt.2020.00036"},{"key":"15_CR15","doi-asserted-by":"publisher","first-page":"814","DOI":"10.1016\/j.procs.2016.05.371","volume":"80","author":"L Silva","year":"2016","unstructured":"Silva, L., Nedjah, N.: Efficient strategy for collective navigation control in swarm robotics. Procedia Comput. Sci. 80, 814\u2013823 (2016). https:\/\/doi.org\/10.1016\/j.procs.2016.05.371","journal-title":"Procedia Comput. Sci."},{"key":"15_CR16","unstructured":"Stern, R., et al.: Multi-agent pathfinding: definitions, variants, and benchmarks. ArXiv Preprint, June 2019. https:\/\/arxiv.org\/abs\/1906.08291"},{"key":"15_CR17","unstructured":"Street, C., Lacerda, B., M\u00fchlig, M., Hawes, N.: Multi-robot planning under uncertainty with congestion-aware models. In: Proceedings of the 19th International Conference on Autonomous Agents and Multiagent Systems, p. 9 (2020)"},{"key":"15_CR18","doi-asserted-by":"crossref","unstructured":"Surynek, P., Felner, A., Stern, R., Boyarski, E.: An empirical comparison of the hardness of multi-agent path finding under the makespan and the sum of costs objectives. In: Proceedings of the 9th Annual Symposium on Combinatorial Search, SoCS 2016 (SoCS), pp. 145\u2013146, January 2016","DOI":"10.1609\/socs.v7i1.18407"},{"issue":"2","key":"15_CR19","doi-asserted-by":"publisher","first-page":"1119","DOI":"10.1109\/LRA.2020.2967317","volume":"5","author":"H Wang","year":"2020","unstructured":"Wang, H., Rubenstein, M.: Walk, stop, count, and swap: decentralized multi-agent path finding with theoretical guarantees. IEEE Robot. Autom. Lett. 5(2), 1119\u20131126 (2020). https:\/\/doi.org\/10.1109\/LRA.2020.2967317","journal-title":"IEEE Robot. Autom. Lett."},{"key":"15_CR20","doi-asserted-by":"crossref","unstructured":"Weise, J., Mai, S., Zille, H., Mostaghim, S.: On the scalable multi-objective multi-agent pathfinding problem. In: Accepted at Congress on Evolutionary Computing CEC 2020 (2020)","DOI":"10.1109\/CEC48606.2020.9185585"},{"key":"15_CR21","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/j.procs.2018.07.018","volume":"133","author":"MN Zafar","year":"2018","unstructured":"Zafar, M.N., Mohanta, J.C.: Methodology for path planning and optimization of mobile robots: a review. Procedia Comput. Sci. 133, 141\u2013152 (2018). https:\/\/doi.org\/10.1016\/j.procs.2018.07.018","journal-title":"Procedia Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Swarm Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-60376-2_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,24]],"date-time":"2022-11-24T07:54:21Z","timestamp":1669276461000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-60376-2_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030603755","9783030603762"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-60376-2_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"23 October 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ANTS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Swarm Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Barcelona","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 October 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 October 2020","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":"antsw2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.swarm-intelligence.eu\/ants2020\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}