Schedule
[Live Q&A] Zoom: https://zoom.us/j/92190153983
[Replayable] SlidesLives Live Stream (July 29): https://slideslive.com/38964532
The first section of this page presents the program at a glance. Then, detailed schedules for the days of July 26-30 are presented. The program can still suffer some changes.
In the program, short/long papers get 20 minutes each, split as 15 minutes for the talk and 5 minutes for questions and answers.
Extended abstract gets a 5-minute presentation and 3 for questions.
The videos of the sessions are prerecorded, while the Q/A of each paper is live. Each paper should have at least one author present in each round of its session.
Program at a Glance
Here is the shared calendar link: https://calendar.google.com/calendar/u/0?cid=c29jczIxQHVuaWJzLml0
Session 1: Analysis of Search Algorithms (Chair 1: Daniel Harabor, Chair 2: Roni Stern)
#19: Pablo Araneda, Matias Greco and Jorge A. Baier: "Exploiting Learned Policies in Focal Search" (Long Paper)
#36: Saman Ahmadi, Guido Tack, Daniel Harabor and Philip Kilby: "Bi-objective Search with Bi-directional A" (extended abstract)
#50: Adi Botea, Massimiliano Mattetti, Akihiro Kishimoto, Radu Marinescu and Elizabeth Daly: "Counting Vertex-Disjoint Shortest Paths in Graphs" (Long Paper)
#68: Jingwei Chen and Nathan Sturtevant: "Necessary and Sufficient Conditions for Avoiding Re-expansions in Suboptimal Best-First Search" (extended abstract)
#2: Robert Clausecker and Florian Schintke: "A Measure of Quality for IDA* Heuristics" (Long Paper)
Session 2: Multi-Agent Path Finding (Chair 1&2: Oren Salzman)
#31: Omri Kaduri, Eli Boyarski and Roni Stern: "Analysis of Classical Multi Agent Path Finding Algorithms" (Short Paper)
#22: Pavel Surynek: "Multi-Goal Multi-Agent Path Finding via Decoupled and Integrated Goal Vertex Ordering" (extended abstract)
#23: Pavel Surynek: "Sum of Costs Optimal Multi-Agent Path Finding via Satisfiability Modulo Theories" (extended abstract)
#28: Ofir Gordon, Oren Salzman and Yuval Filmus: "Revisiting the Complexity Analysis of Conflict-Based Search: New Computational Techniques and Improved Bounds" (Long paper)
#72: Pavel Surynek: "Conceptual Comparison of Compilation-based Solvers for Multi-Agent Path Finding: MIP vs. SAT" (extended abstract)
#21: Pavel Surynek and Martin Čapek: "DPLL(MAPF): an Integration of Multi-Agent Path Finding and SAT Solving Technologies" (extended abstract)
Session 3: Path Finding & Planning (I) (Chair 1: Roman Barták, Chair 2: Pavel Surynek)
#33: Han Zhang, Mingze Yao, Ziang Liu, Jiaoyang Li, Lucas Terr, Shao-Hung Chan, T. K. Satish Kumar and Sven Koenig: "A Hierarchical Approach to Multi-Agent Path Finding" (extended abstract)
#52: Dor Atzmon, Shahar Idan Freiman, Oscar Epshtein, Oran Shichman and Ariel Felner: "Conflict-Free Multi-Agent Meeting" (extended abstract)
#58: Shao-Hung Chan, Jiaoyang Li, Graeme Gange, Peter J. Stuckey, Daniel Harabor and Sven Koenig: "ECBS with Flex Distribution for Bounded Suboptimal Multi-Agent Path Finding" (extended abstract)
#48: Ishani Chatterjee, Tushar Kusnur and Maxim Likhachev: "Fast Bounded Suboptimal Probabilistic Planning with Clear Preferences on Missing Information" (Long paper)
#11: Nir Greshler, Ofir Gordon, Oren Salzman and Nahum Shimkin: "Cooperative Multi-Agent Path Finding: Beyond Path Planning and Collision Avoidance" (extended abstract)
#69: Michal Nekvinda, Roman Barták and Meir Kalech: "Contingent Planning for Robust Multi-Agent Path Finding" (extended abstract)
#56: Tamir Jaffey, Shawn Seiref and Ariel Felner: "Suboptimally Solving the Watchman Route Problem on a Grid with Heuristic Search" (Long paper)
Session 4: Path Finding & Planning (II) (Chair 1: Erez Karpas, Chair 2: Pavel Surynek)
#30: Anton Andreychuk, Konstantin Yakovlev, Eli Boyarski and Roni Stern: "Improving Continuous-time Conflict Based Search" (extended abstract)
#55: Roman Barták, Marika Ivanová and Jiří Švancara: "From Classical to Colored Multi-Agent Path Finding" (extended abstract)
#24: Roberto Javier Asín Achá, Rodrigo López, Sebastián A. Hagedorn and Jorge A. Baier: "A New Boolean Encoding for MAPF and its Performance with ASP and MaxSAT Solvers" (Long paper)
#12: Jiaoyang Li, Zhe Chen, Yi Zheng, Shao-Hung Chan, Daniel Harabor, Peter J. Stuckey, Hang Ma and Sven Koenig: "Scalable Rail Planning and Replanning: Winning the 2020 Flatland Challenge" (extended abstract)
#67: Hang Ma: "A Competitive Analysis of Online Multi-Agent Path Finding" (extended abstract)
#27: Arthur Mahéo, Shizhe Zhao, Afzaal Hassan, Daniel Harabor, Peter Stuckey and Mark Wallace: "Customised Shortest Paths Using a Distributed Reverse Oracle" (Long paper)
#65: Xiaohu Wu, Yihao Liu, Xueyan Tang, Wentong Cai, Funing Bai, Gilbert Khonstantine and Guopeng Zhao: "Multi-Agent Pickup and Delivery with Task Deadlines" (extended abstract)
Session 5: Heuristic Search (Chair 1: Roni Stern, Chair 2: Daniel Harabor)
#64: Abhinav Bhatia, Justin Svegliato and Shlomo Zilberstein: "On the Benefits of Randomly Adjusting Anytime Weighted A*" (short paper)
#63: Ryan Hechenberger, Daniel Harabor, Muhammad Aamir Cheema, Peter J. Stuckey and Pierre Le Bodic: "Multi-Target Search in Euclidean Space with Ray Shooting" (extended abstract)
#15: Ariel Felner, Shahaf Shperberg and Hadar Buzhish: "The Closed List is an Obstacle too" (short paper)
#13: Patrick Rodler: "Linear-space best-first diagnosis search" (extended abstract)
#43: Richard Korf: "An Improved Algorithm for Finding the Exact Diameter of a Graph" (Long paper)
#70: Shahaf Shperberg, Steven Danishevski, Ariel Felner and Nathan Sturtevant: "Iterative-deepening Bidirectional Heuristic Search with Restricted Memory" (extended abstract)
Session 6: Learning & Search (Chair 1: Shahaf Shperberg, Chair 2: Richard Korf)
#44: Adi Botea and Vadim Bulitko: "Scaling Up Search with Partial Initial States in Optimization Crosswords" (Long paper)
#60: Aaron Ferber, Jialin Song, Bistra Dilkina and Yisong Yue: "Learning Pseudo-Backdoors for Mixed Integer Programs" (extended abstract)
#39: Ronen Nir, Alexander Shleyfman and Erez Karpas: "Learning-based Synthesis of Social Laws in STRIPS" (Long paper)
#42: Joel Oren, Chana Ross, Maksym Lefarov, Felix Richter, Ayal Taitler, Zohar Feldman, Dotan Di Castro and Christian Daniel:: "SOLO: Search Online, Learn Offline for Combinatorial Optimization Problems" (Long paper)
#40: Yaron Shoham and Gal Elidan: "Solving Sokoban with forward-backward reinforcement learning" (extended abstract)
Session 7: Planning & Search (Chair 1: Roman Barták, Chair 2: Erez Karpas)
#37: Matteo Cardellini, Marco Maratea, Mauro Vallati, Gianluca Boleto and Luca Oneto: "A Planning-based Approach for In-Station Train Dispatching" (extended abstract)
#34: Jingkai Chen, Yuening Zhang, Cheng Fang and Brian Williams:"Generalized Conflict-directed Search for Optimal Ordering Problems" (Long paper)
#57: Lukas Chrpa, Pavel Rytir, Rostislav Horcik, Jan Čuhel, Anastasiia Livochka and Stefan Edelkamp: "Adversary Strategy Sampling for Effective Plan Generation" (extended abstract)
#3: Amihay Elboher, Shahaf Shperberg and Solomon Eyal Shimony: "Metareasoning for Interleaved Planning and Execution" (extended abstract)
#35: Thorsten Klößner and Joerg Hoffmann: "Pattern Databases for Stochastic Shortest Path Problems" (short paper)
#53: Tomas Rybecky, Miroslav Kulich, Anton Andreychuk and Konstantin Yakovlev: "Towards Narrowing the Search in Bounded-Suboptimal Safe Interval Path Planning" (short paper)
Late Breaking Posters (Poster Session)
#80: Shaher Ahmed, Mohamed Shekha, Suhaila Skran, Abdelrahman Bassyouny and Mohamed Abdelkader: "Investigation of Optimization Techniques on the Elevator Dispatching Problem"
#85: Zhaoxing Bu and Richard E. Korf: "A*+BFHS: A Hybrid Heuristic Search Algorithm"
#86: Robert Clausecker and Florian Schintke: "The Quality of Heuristic Functions for IDA*"
#84: Eldan Cohen, Richard Valenzano and Sheila McIlraith: "Type-WA*: Using Exploration in Bounded Suboptimal Planning"
#82: Stefan Edelkamp: "Knowledge-Based Paranoia Search in Trick-Taking"
#83: Daniel Gnad, Jan Eisenhut, Alberto Lluch Lafuente and Joerg Hoffmann: "Model Checking ω-Regular Properties with Decoupled Search"
#79: Taoan Huang, Jiaoyang Li, Bistra Dilkina and Sven Koenig: "Anytime Multi-Agent Path Finding via Machine Learning-Guided Large Neighborhood Search"
#81: Wenlong Wang and Thomas Pfeiffer: "Decision Markets for Human-Robot-Interaction Joint Contextual Bandit Learning"