Abstract is missing.
- Exploiting Learned Policies in Focal SearchPablo Araneda, Matias Greco, Jorge A. Baier. 2-10 [doi]
- A New Boolean Encoding for MAPF and its Performance with ASP and MaxSAT SolversRoberto Javier Asín Achá, Rodrigo López, Sebastián Hagedorn, Jorge A. Baier. 11-19 [doi]
- Scaling Up Search with Partial Initial States in Optimization CrosswordsAdi Botea, Vadim Bulitko. 20-27 [doi]
- Counting Vertex-Disjoint Shortest Paths in GraphsAdi Botea, Massimiliano Mattetti, Akihiro Kishimoto, Radu Marinescu 0002, Elizabeth Daly. 28-36 [doi]
- Fast Bounded Suboptimal Probabilistic Planning with Clear Preferences on Missing InformationIshani Chatterjee 0001, Tushar Kusnur, Maxim Likhachev. 37-45 [doi]
- Generalized Conflict-Directed Search for Optimal Ordering ProblemsJingkai Chen, Yuening Zhang, Cheng Fang, Brian C. Williams. 46-54 [doi]
- A Measure of Quality for IDA* HeuristicsRobert Clausecker, Florian Schintke. 55-63 [doi]
- Revisiting the Complexity Analysis of Conflict-Based Search: New Computational Techniques and Improved BoundsOfir Gordon, Yuval Filmus, Oren Salzman. 64-72 [doi]
- Finding the Exact Diameter of a Graph with Partial Breadth-First SearchesRichard E. Korf. 73-78 [doi]
- Customised Shortest Paths Using a Distributed Reverse OracleArthur Mahéo, Shizhe Zhao, Hassan Afzaal, Daniel Harabor, Peter J. Stuckey, Mark Wallace 0001. 79-87 [doi]
- Learning-Based Synthesis of Social Laws in STRIPSRonen Nir, Alexander Shleyfman, Erez Karpas. 88-96 [doi]
- SOLO: Search Online, Learn Offline for Combinatorial Optimization ProblemsJoel Oren, Chana Ross, Maksym Lefarov, Felix Richter, Ayal Taitler, Zohar Feldman, Dotan Di Castro, Christian Daniel. 97-105 [doi]
- Suboptimally Solving the Watchman Route Problem on a Grid with Heuristic SearchTamir Yaffe, Shawn Skyler, Ariel Felner. 106-114 [doi]
- On the Benefits of Randomly Adjusting Anytime Weighted AAbhinav Bhatia, Justin Svegliato, Shlomo Zilberstein. 116-120 [doi]
- The Closed List is an Obstacle TooAriel Felner, Shahaf S. Shperberg, Hadar Buzhish. 121-125 [doi]
- Experimental Evaluation of Classical Multi Agent Path Finding AlgorithmsOmri Kaduri, Eli Boyarski, Roni Stern. 126-130 [doi]
- Pattern Databases for Stochastic Shortest Path ProblemsThorsten Klößner, Jörg Hoffmann 0001. 131-135 [doi]
- Towards Narrowing the Search in Bounded-Suboptimal Safe Interval Path PlanningTomás Rybecký, Miroslav Kulich, Anton Andreychuk, Konstantin S. Yakovlev. 136-140 [doi]
- Bi-Objective Search with Bi-directional A* (Extended Abstract)Saman Ahmadi, Guido Tack, Daniel Harabor, Philip Kilby. 142-144 [doi]
- Improving Continuous-time Conflict Based SearchAnton Andreychuk, Konstantin S. Yakovlev, Eli Boyarski, Roni Stern. 145-146 [doi]
- Conflict-Free Multi-Agent MeetingDor Atzmon, Shahar Idan Freiman, Oscar Epshtein, Oran Shichman, Ariel Felner. 147-149 [doi]
- From Classical to Colored Multi-Agent Path FindingRoman Barták, Marika Ivanová, Jirí Svancara. 150-152 [doi]
- DPLL(MAPF): an Integration of Multi-Agent Path Finding and SAT Solving TechnologiesMartin Capek, Pavel Surynek. 153-155 [doi]
- A Planning-based Approach for In-Station Train DispatchingMatteo Cardellini, Marco Maratea, Mauro Vallati, Gianluca Boleto, Luca Oneto. 156-158 [doi]
- ECBS with Flex Distribution for Bounded-Suboptimal Multi-Agent Path FindingShao-Hung Chan, Jiaoyang Li 0001, Graeme Gange, Daniel Harabor, Peter J. Stuckey, Sven Koenig. 159-161 [doi]
- Avoiding Re-expansions in Suboptimal Best-First SearchJingwei Chen, Nathan R. Sturtevant. 162-163 [doi]
- Adversary Strategy Sampling for Effective Plan GenerationLukás Chrpa, Pavel Rytír, Rostislav Horcík, Jan Cuhel, Anastasiia Livochka, Stefan Edelkamp. 164-166 [doi]
- Metareasoning for Interleaved Planning and ExecutionAmihay Elboher, Shahaf S. Shperberg, Solomon Eyal Shimony. 167-169 [doi]
- Learning Pseudo-Backdoors for Mixed Integer ProgramsAaron M. Ferber, Jialin Song, Bistra Dilkina, Yisong Yue. 170-172 [doi]
- Cooperative Multi-Agent Path Finding: Beyond Path Planning and Collision AvoidanceNir Greshler, Ofir Gordon, Oren Salzman, Nahum Shimkin. 173-175 [doi]
- Multi-Target Search in Euclidean Space with Ray ShootingRyan Hechenberger, Daniel Harabor, Muhammad Aamir Cheema, Peter J. Stuckey, Pierre Le Bodic. 176-178 [doi]
- Scalable Rail Planning and Replanning: Winning the 2020 Flatland ChallengeJiaoyang Li 0001, Zhe Chen, Yi Zheng, Shao-Hung Chan, Daniel Harabor, Peter J. Stuckey, Hang Ma 0001, Sven Koenig. 179-181 [doi]
- Extended Abstract: A Competitive Analysis of Online Multi-Agent Path FindingHang Ma 0001. 182-184 [doi]
- Contingent Planning for Robust Multi-Agent Path FindingMichal Nekvinda, Roman Barták, Meir Kalech. 185-187 [doi]
- Linear-Space Best-First Diagnosis SearchPatrick Rodler. 188-190 [doi]
- Solving Sokoban with Forward-Backward Reinforcement LearningYaron Shoham, Gal Elidan. 191-193 [doi]
- Iterative-Deepening Bidirectional Heuristic Search with Restricted MemoryShahaf S. Shperberg, Steven Danishevski, Ariel Felner, Nathan R. Sturtevant. 194-196 [doi]
- Multi-Goal Multi-Agent Path Finding via Decoupled and Integrated Goal Vertex OrderingPavel Surynek. 197-199 [doi]
- Sum of Costs Optimal Multi-Agent Path Finding with Continuous Time via Satisfiability Modulo TheoriesPavel Surynek. 200-202 [doi]
- Conceptual Comparison of Compilation-based Solvers for Multi-Agent Path Finding: MIP vs. SATPavel Surynek. 203-205 [doi]
- Multi-Agent Pickup and Delivery with Task DeadlinesXiaohu Wu, Yihao Liu, Xueyan Tang, Wentong Cai 0001, Funing Bai, Gilbert Khonstantine, Guopeng Zhao. 206-208 [doi]
- A Hierarchical Approach to Multi-Agent Path FindingHan Zhang, Mingze Yao, Ziang Liu, Jiaoyang Li 0001, Lucas Terr, Shao-Hung Chan, T. K. Satish Kumar, Sven Koenig. 209-211 [doi]
- Further Improved Heuristics For Conflict-Based SearchEli Boyarski, Ariel Felner, Pierre Le Bodic, Daniel Harabor, Peter J. Stuckey, Sven Koenig. 213-215 [doi]
- How to Speed-Up the Automated Configuration of Optimization AlgorithmsMarcelo de Souza. 216-218 [doi]
- Exploiting Learned Policies and Learned Heuristics in Bounded-Suboptimal SearchMatias Greco. 219-221 [doi]
- Distributional Metareasoning for Heuristic SearchTianyi Gu. 222-224 [doi]
- Avoiding Monochromatic Rectangles Using Shift PatternsZhenjun Liu, Leroy Chew, Marijn J. H. Heule. 225-227 [doi]
- Studying Online Multi-Agent Path FindingJonathan Morag, Roni Stern, Ariel Felner, Dor Atzmon, Eli Boyarski. 228-230 [doi]
- Explainable Problem in clingo-dl ProgramsVan Nguyen, Tran Cao Son, William Yeoh 0001. 231-232 [doi]
- Speeding Up Heuristic Function Synthesis via Extending the Formula GrammarSergio Poo Hernandez, Vadim Bulitko. 233-235 [doi]
- Meta-level Techniques for Planning, Search, and SchedulingShahaf S. Shperberg. 236-238 [doi]
- Multi-Agent Terraforming: Efficient Multi-Agent Path Finding via Environment ManipulationDavid Vainshtain, Oren Salzman. 239-241 [doi]
- Landmark Heuristics for Lifted Planning - Extended AbstractJulia Wichlacz, Daniel Höller, Jörg Hoffmann 0001. 242-244 [doi]