{"type":"ScholarlyArticle","title":"In Which Graph Structures Can We Efficiently Find Temporally Disjoint Paths and Walks?","authors":[{"name":"Pascal Kunz","slug":"pascal-kunz","given":"Pascal","family":"Kunz","affiliation":"Humboldt-Universität zu Berlin , Algorithm Engineering , Berlin , Germany; Technische Universität Berlin , Algorithmics and Computational Complexity , Berlin , Germany"},{"name":"Hendrik Molter","slug":"hendrik-molter","given":"Hendrik","family":"Molter","affiliation":"Department of Computer Science , Ben-Gurion University of the Negev , Beer-Sheva , Israel"},{"name":"Meirav Zehavi","slug":"meirav-zehavi","given":"Meirav","family":"Zehavi","affiliation":"Department of Computer Science , Ben-Gurion University of the Negev , Beer-Sheva , Israel"}],"abstract":"A temporal graph has an edge set that may change over discrete time steps, and a temporal path (or walk) must traverse edges that appear at increasing time steps. Accordingly, two temporal paths (or walks) are temporally disjoint if they do not visit any vertex at the same time. The study of the computational complexity of finding temporally disjoint paths or walks in temporal graphs has recently been initiated by Klobas et al.. This problem is motivated by applications in multi-agent path finding (MAPF), which include robotics, warehouse management, aircraft management, and traffic routing.\r\n\r\nWe extend Klobas et al.’s research by providing parameterized hardness results for very restricted cases, with a focus on structural parameters of the so-called underlying graph. On the positive side, we identify sufficiently simple cases where we can solve the problem efficiently. Our results reveal some surprising differences between the “path version” and the “walk version” (where vertices may be visited multiple times) of the problem, and answer several open questions posed by Klobas et al.","doi":"10.24963/ijcai.2023/21","url":"https://ijcai.org/proceedings/2023/21","pdf":"https://ijcai.org/proceedings/2023/0021.pdf","markdown":"https://ijcai.org/proceedings/2023/21.md","bibtex":"https://ijcai.org/proceedings/2023/bibtex/21","volume":{"slug":"2023","title":"Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2023","url":"https://ijcai.org/proceedings/2023/","year":2023,"location":"Macao, SAR","dates":"19-25 August 2023","editors":"Edith Elkind","isbn":"978-1-956792-03-4","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2023"},"section":"Agent-based and Multi-agent Systems","track":"Main Track","number":21,"pages":{"first":180,"last":188},"keywords":["Agent-based and Multi-agent Systems: MAS: Multi-agent planning","Planning and Scheduling: PS: Routing"],"videos":[],"references":[{"position":1,"raw":"[Almagor and Lahijanian, 2020] Shaull Almagor and Morteza Lahijanian. Explainable multi agent path finding. In Proceedings of the 19th International Conference on Autonomous Agents and Multiagent Systems (AAMAS '20), pages 34-42, 2020.","title":"Explainable multi agent path finding","authors":"Shaull Almagor, Morteza Lahijanian","year":"2020","venue":"Proceedings of the 19th International Conference on Autonomous Agents and Multiagent Systems (AAMAS '20)","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Andreychuk et al., 2022] Anton Andreychuk, Konstantin Yakovlev, Pavel Surynek, Dor Atzmon, and Roni Stern. Multi-agent pathfinding with continuous time. Artificial Intelligence, 305:103662, 2022.","title":"Multi-agent pathfinding with continuous time","authors":"Anton Andreychuk, Konstantin Yakovlev, Pavel Surynek, Dor Atzmon, Roni Stern","year":"2022","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":"/proceedings/2019/6"},{"position":3,"raw":"[Atzmon et al., 2020] Dor Atzmon, Roni Stern, Ariel Felner, Glenn Wagner, Roman Barták, and Neng-Fa Zhou. Robust multi-agent path finding and executing. Journal of Artifi- cial Intelligence Research, 67:549-579, 2020.","title":"Robust multi-agent path finding and executing","authors":"Dor Atzmon, Roni Stern, Ariel Felner, Glenn Wagner, Roman Barták, Neng-Fa Zhou","year":"2020","venue":"Journal of Artificial Intelligence Research","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Casteigts et al., 2021] Arnaud Casteigts, Anne-Sophie Himmel, Hendrik Molter, and Philipp Zschoche. Find- ing temporal paths under waiting time constraints. Algorithmica, 83(9):2754-2802, 2021.","title":"Finding temporal paths under waiting time constraints","authors":"Arnaud Casteigts, Anne-Sophie Himmel, Hendrik Molter, Philipp Zschoche","year":"2021","venue":"Algorithmica","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Cygan et al., 2015] Marek Cygan, Fedor V. Fomin, Łukasz Kowalik, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk, Michał Pilipczuk, and Saket Saurabh. Parame- terized Algorithms. Springer, 2015.","title":"Parameterized Algorithms","authors":"Marek Cygan, V Fedor, Łukasz Fomin, Daniel Kowalik, Dániel Lokshtanov, Marcin Marx, Michał Pilipczuk, Saket Pilipczuk, Saurabh","year":"2015","venue":null,"doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Downey and Fellows, 2013] Rodney G Downey and Michael R Fellows. Fundamentals of Parameterized Complexity. Springer, 2013.","title":"Fundamentals of Parameterized Complexity","authors":"G Rodney, Michael R Downey, Fellows","year":"2013","venue":null,"doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Fellows et al., 2009] Michael R. Fellows, Danny Hermelin, Frances Rosamond, and Stéphane Vialette. On the param- eterized complexity of multiple-interval graph problems. Theoretical Computer Science, 410(1):53-61, 2009.","title":"On the parameterized complexity of multiple-interval graph problems","authors":"R Michael, Danny Fellows, Frances Hermelin, Stéphane Rosamond, Vialette","year":"2009","venue":"Theoretical Computer Science","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Flum and Grohe, 2006] Jörg Flum and Martin Grohe. Pa- rameterized Complexity Theory, volume XIV of Texts in Theoretical Computer Science. An EATCS Series. Springer, 2006.","title":"Parameterized Complexity Theory","authors":"Grohe Flum, Jörg Flum, Martin Grohe","year":"2006","venue":"XIV of Texts in Theoretical Computer Science. An EATCS Series","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Fortune et al., 1980] Steven Fortune, John Hopcroft, and James Wyllie. The directed subgraph homeomorphism problem. Theoretical Computer Science, 10(2):111-121, 1980.","title":"The directed subgraph homeomorphism problem","authors":"Steven Fortune, John Hopcroft, James Wyllie","year":"1980","venue":"Theoretical Computer Science","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Füchsle et al., 2022] Eugen Füchsle, Hendrik Molter, Rolf Niedermeier, and Malte Renken. Delay-robust routes in temporal graphs. In Proceedings of the 39th International Symposium on Theoretical Aspects of Computer Science (STACS), 2022.","title":"Delay-robust routes in temporal graphs","authors":"Eugen Füchsle, Hendrik Molter, Rolf Niedermeier, Malte Renken","year":"2022","venue":"Proceedings of the 39th International Symposium on Theoretical Aspects of Computer Science (STACS)","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Goldreich, 2011] Oded Goldreich. Finding the shortest move-sequence in the graph-generalized 15-puzzle is NP- hard. In Studies in complexity and cryptography. Miscel- lanea on the interplay between randomness and computa- tion, pages 1-5. Springer, 2011.","title":"Finding the shortest move-sequence in the graph-generalized 15-puzzle is NPhard","authors":"Oded Goldreich","year":"2011","venue":"Studies in complexity and cryptography. Miscellanea on the interplay between randomness and computation","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Holme and Saramäki, 2019] Petter Holme and Jari Saramäki. Temporal Network Theory. Springer, 2019.","title":"Temporal Network Theory","authors":"Saramäki ; Holme, Jari Holme, Saramäki","year":"2019","venue":null,"doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Jansen et al., 2013] Klaus Jansen, Stefan Kratsch, Dániel Marx, and Ildikó Schlotter. Bin packing with fixed num- ber of bins revisited. Journal of Computer and System Sciences, 79(1):39-49, 2013.","title":"Bin packing with fixed number of bins revisited","authors":"Jansen","year":"2013","venue":"Journal of Computer and System Sciences","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Karp, 1975] Richard M. Karp. On the computational com- plexity of combinatorial problems. Networks, 5(1):45-68, 1975.","title":"On the computational complexity of combinatorial problems","authors":"Richard M Karp","year":"1975","venue":"Networks","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Kawarabayashi et al., 2012] Ken-ichi Kawarabayashi, Yusuke Kobayashi, and Bruce Reed. The disjoint paths problem in quadratic time. Journal of Combinatorial Theory, Series B, 102(2):424-435, 2012.","title":"The disjoint paths problem in quadratic time","authors":"Ken-Ichi Kawarabayashi, Yusuke Kobayashi, Bruce Reed","year":"2012","venue":"Journal of Combinatorial Theory, Series B","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Kempe et al., 2002] David Kempe, Jon Kleinberg, and Amit Kumar. Connectivity and inference problems for temporal networks. Journal of Computer and System Sci- ences, 64(4):820-842, 2002.","title":"Connectivity and inference problems for temporal networks","authors":"David Kempe, Jon Kleinberg, Amit Kumar","year":"2002","venue":"Journal of Computer and System Sciences","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Klobas et al., 2023] Nina Klobas, George B. Mertzios, Hendrik Molter, Rolf Niedermeier, and Philipp Zschoche. Interference-free walks in time: temporally disjoint paths. Autonomous Agents and Multi-Agent Systems, 37(1):1, 2023.","title":"Interference-free walks in time: temporally disjoint paths","authors":"Nina Klobas, George B Mertzios, Hendrik Molter, Rolf Niedermeier, Philipp Zschoche","year":"2023","venue":"Autonomous Agents and Multi-Agent Systems","doi":null,"url":null,"internal_url":"/proceedings/2021/563"},{"position":18,"raw":"[Korte et al., 1990] Bernhard Korte, László Lovász, Hans Jürgen Prömel, and Alexander Schrijver. Paths, flows, and VLSI-layout. Springer, 1990.","title":"Paths, flows, and VLSI-layout","authors":"Bernhard Korte, László Lovász, Hans Jürgen Prömel, Alexander Schrijver","year":"1990","venue":null,"doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Kunz et al., 2023] Pascal Kunz, Hendrik Molter, and Meirav Zehavi. In which graph structures can we effi- ciently find temporally disjoint paths and walks? CoRR, abs/2301.10503, 2023.","title":"In which graph structures can we efficiently find temporally disjoint paths and walks?","authors":"Pascal Kunz, Hendrik Molter, Meirav Zehavi","year":"2023","venue":null,"doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Latapy et al., 2018] Matthieu Latapy, Tiphaine Viard, and Clémence Magnien. Stream graphs and link streams for the modeling of interactions over time. Social Network Analysis and Mining, 8(1):61:1-61:29, 2018.","title":"Stream graphs and link streams for the modeling of interactions over time","authors":"Matthieu Latapy, Tiphaine Viard, Clémence Magnien","year":"2018","venue":"Social Network Analysis and Mining","doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Li et al., 2019] Jiaoyang Li, Pavel Surynek, Ariel Felner, Hang Ma, TK Satish Kumar, and Sven Koenig. Multi- agent path finding for large agents. In Proceedings of the 33rd AAAI Conference on Artificial Intelligence (AAAI '19), pages 7627-7634, 2019.","title":"Multiagent path finding for large agents","authors":"Li","year":"2019","venue":"Proceedings of the 33rd AAAI Conference on Artificial Intelligence (AAAI '19)","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Ma et al., 2017] Hang Ma, TK Satish Kumar, and Sven Koenig. Multi-agent path finding with delay probabilities. In Proceedings of the 31st AAAI Conference on Artificial Intelligence (AAAI '17), pages 3605-3612, 2017.","title":"Multi-agent path finding with delay probabilities","authors":"Ma","year":"2017","venue":"Proceedings of the 31st AAAI Conference on Artificial Intelligence (AAAI '17)","doi":null,"url":null,"internal_url":null},{"position":23,"raw":"[Michail, 2016] Othon Michail. An introduction to temporal graphs: An algorithmic perspective. Internet Mathematics, 12(4):239-280, 2016.","title":"An introduction to temporal graphs: An algorithmic perspective","authors":"Michail ;, Othon Michail","year":"2016","venue":"Internet Mathematics","doi":null,"url":null,"internal_url":null},{"position":24,"raw":"[Neil and Seymour, 1985] Robertson Neil and Paul D. Sey- mour. Disjoint paths-a survey. SIAM Journal on Alge- braic and Discrete Methods, 6(2):300-305, 1985.","title":"Disjoint paths-a survey","authors":"Robertson Neil, Paul D Seymour","year":"1985","venue":"SIAM Journal on Algebraic and Discrete Methods","doi":null,"url":null,"internal_url":null},{"position":25,"raw":"[Neil and Seymour, 1995] Robertson Neil and Paul D. Sey- mour. Graph minors. XIII. The disjoint paths problem. Journal of Combinatorial Theory, Series B, 63(1):65-110, 1995.","title":"Graph minors. XIII. The disjoint paths problem","authors":"Robertson Neil, Paul D Seymour","year":"1995","venue":"Journal of Combinatorial Theory, Series B","doi":null,"url":null,"internal_url":null},{"position":26,"raw":"[Salzman and Stern, 2020] Oren Salzman and Roni Stern. Research challenges and opportunities in multi-agent path finding and multi-agent pickup and delivery problems. In Proceedings of the 19th International Conference on Au- tonomous Agents and Multiagent Systems (AMAAS '20), pages 1711-1715, 2020.","title":"Research challenges and opportunities in multi-agent path finding and multi-agent pickup and delivery problems","authors":"Stern ; Salzman, Oren Salzman, Roni Stern","year":"2020","venue":"Proceedings of the 19th International Conference on Autonomous Agents and Multiagent Systems (AMAAS '20)","doi":null,"url":null,"internal_url":null},{"position":27,"raw":"[Sharon et al., 2015] Guni Sharon, Roni Stern, Ariel Fel- ner, and Nathan R Sturtevant. Conflict-based search for optimal multi-agent pathfinding. Artificial Intelligence, 219:40-66, 2015.","title":"Conflict-based search for optimal multi-agent pathfinding","authors":"Guni Sharon, Roni Stern, Ariel Felner, Nathan R Sturtevant","year":"2015","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":28,"raw":"[Slivkins, 2010] Aleksandrs Slivkins. Parameterized tractability of edge-disjoint paths on directed acyclic graphs. SIAM Journal on Discrete Mathematics, 24(1):146-157, 2010.","title":"Parameterized tractability of edge-disjoint paths on directed acyclic graphs","authors":"Aleksandrs Slivkins","year":"2010","venue":"SIAM Journal on Discrete Mathematics","doi":null,"url":null,"internal_url":null},{"position":29,"raw":"[Standley, 2010] Trevor Scott Standley. Finding optimal so- lutions to cooperative pathfinding problems. In Proceed- ings of the 24th AAAI Conference on Artificial Intelligence (AAAI '10), pages 173-178, 2010.","title":"Finding optimal solutions to cooperative pathfinding problems","authors":"Trevor Scott, Standley","year":"2010","venue":"Proceedings of the 24th AAAI Conference on Artificial Intelligence (AAAI '10)","doi":null,"url":null,"internal_url":null},{"position":30,"raw":"[Stern et al., 2019] Roni Stern, Nathan R Sturtevant, Ariel Felner, Sven Koenig, Hang Ma, Thayne T. Walker, Jiaoyang Li, Dor Atzmon, Liron Cohen, T. K. Satish Kumar, Eli Boyarski, and Roman Barták. Multi-agent pathfinding: Definitions, variants, and benchmarks. In Proceedings of the 12th International Symposium on Com- binatorial Search (SOCS), pages 151-159, 2019.","title":"Multi-agent pathfinding: Definitions, variants, and benchmarks","authors":"Roni Stern, Nathan R Sturtevant, Ariel Felner, Sven Koenig, Hang Ma, Thayne T Walker, Jiaoyang Li, Dor Atzmon, Liron Cohen, T K Satish Kumar, Eli Boyarski, Roman Barták","year":"2019","venue":"Proceedings of the 12th International Symposium on Combinatorial Search (SOCS)","doi":null,"url":null,"internal_url":null},{"position":31,"raw":"[Stern, 2019] Roni Stern. Multi-agent path finding -an overview. In Artificial Intelligence -5th RAAI Sum- mer School, pages 96-115, Dolgoprudny, Russia, 2019. Springer.","title":"Multi-agent path finding -an overview","authors":"Roni Stern","year":"2019","venue":"Artificial Intelligence -5th RAAI Summer School","doi":null,"url":null,"internal_url":null},{"position":32,"raw":"[Švancara et al., 2019] Jiří Švancara, Marek Vlk, Roni Stern, Dor Atzmon, and Roman Barták. Online multi-agent pathfinding. In Proceedings of the 33rd AAAI Conference on Artificial Intelligence (AAAI '19), pages 7732-7739, 2019.","title":"Online multi-agent pathfinding","authors":"Švancara","year":"2019","venue":"Proceedings of the 33rd AAAI Conference on Artificial Intelligence (AAAI '19)","doi":null,"url":null,"internal_url":null},{"position":33,"raw":"[Wu et al., 2016] Huanhuan Wu, James Cheng, Yiping Ke, Silu Huang, Yuzhen Huang, and Hejun Wu. Efficient algo- rithms for temporal path computation. IEEE Transactions on Knowledge and Data Engineering, 28(11):2927-2942, 2016.","title":"Efficient algorithms for temporal path computation","authors":"Huanhuan Wu, James Cheng, Yiping Ke, Silu Huang, Yuzhen Huang, Hejun Wu","year":"2016","venue":"IEEE Transactions on Knowledge and Data Engineering","doi":null,"url":null,"internal_url":null},{"position":34,"raw":"[Yu and LaValle, 2013] Jingjin Yu and Steven M LaValle. Structure and intractability of optimal multi-robot path planning on graphs. In Proceedings of the 27th AAAI Con- ference on Artificial Intelligence (AAAI '13), pages 1443- 1449, 2013.","title":"Structure and intractability of optimal multi-robot path planning on graphs","authors":"Lavalle ; ] Jingjin Yu, Steven M Yu, Lavalle","year":"2013","venue":"Proceedings of the 27th AAAI Conference on Artificial Intelligence (AAAI '13)","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}