Table of Contents

• Frontmatter [doi]
• Falsification of Cyber-Physical Systems Using PDDL+ PlanningDiego Aineto, Enrico Scala, Eva Onaindia, Ivan Serina. 2-6 [doi]
• Explainable Goal Recognition: A Framework Based on Weight of EvidenceAbeer Alshehri, Tim Miller 0001, Mor Vered. 7-16 [doi]
• Exploiting Geometric Constraints in Multi-Agent PathfindingDor Atzmon, Sara Bernardini, Fabio Fagnani, David Fairbairn. 17-25 [doi]
• W-restrained Bidirectional Bounded-Suboptimal Heuristic SearchDor Atzmon, Shahaf S. Shperberg, Netanel Sabah, Ariel Felner, Nathan R. Sturtevant. 26-30 [doi]
• Runahead A*: Speculative Parallelism for A* with Slow ExpansionsMohammad Bakhshalipour, Mohamad Qadri, Dominic Guri, Seyed Borna Ehsani, Maxim Likhachev, Phillip B. Gibbons. 31-41 [doi]
• On Partial Satisfaction Planning with Total-Order HTNsGregor Behnke, David Speck 0001, Michael Katz 0001, Shirin Sohrabi. 42-51 [doi]
• Convexity Hierarchies in Grid NetworksJohannes Blum 0001, Ruoying Li, Sabine Storandt. 52-60 [doi]
• Planning for Temporally Extended Goals in Pure-Past Linear Temporal LogicLuigi Bonassi, Giuseppe De Giacomo, Marco Favorito, Francesco Fuggitti, Alfonso Emilio Gerevini, Enrico Scala. 61-69 [doi]
• Landmark Progression in Heuristic SearchClemens Büchner, Thomas Keller 0001, Salomé Eriksson, Malte Helmert. 70-79 [doi]
• Safety Shielding under Delayed ObservationFilip Cano Córdoba, Alexander Palmisano, Martin Fränzle, Roderick Bloem, Bettina Könighofer. 80-85 [doi]
• Planning for Attacker Entrapment in Adversarial SettingsBrittany Cates, Anagha Kulkarni 0002, Sarath Sreedharan. 86-94 [doi]
• Sensitivity Analysis for Dynamic Control of PSTNs with Skewed DistributionsRosy Chen, Yiran Ma, Siqi Wu, James C. Boerkoel Jr.. 95-99 [doi]
• Grounding Planning Tasks Using Tree Decompositions and Iterated SolvingAugusto B. Corrêa, Markus Hecher, Malte Helmert, Davide Mario Longo, Florian Pommerening, Stefan Woltran. 100-108 [doi]
• Automatic Metamorphic Test Oracles for Action-Policy TestingJan Eisenhut, Álvaro Torralba, Maria Christakis, Jörg Hoffmann 0001. 109-117 [doi]
• Operator Pruning Using Lifted Mutex Groups via Compilation on Lifted LevelDaniel Fiser. 118-127 [doi]
• Cost Splitting for Multi-Objective Conflict-Based SearchCheng Ge, Han Zhang, Jiaoyang Li 0001, Sven Koenig. 128-137 [doi]
• Efficient Evaluation of Large Abstractions for Decoupled Search: Merge-and-Shrink and Symbolic Pattern DatabasesDaniel Gnad 0001, Silvan Sievers, Álvaro Torralba. 138-147 [doi]
• Planning over Integers: Compilations and UndecidabilityDaniel Gnad 0001, Malte Helmert, Peter Jonsson, Alexander Shleyfman. 148-152 [doi]
• A Planning Approach to Repair Domains with Incomplete Action EffectsAlba Gragera, Raquel Fuentetaja 0001, Ángel García Olaya, Fernando Fernández 0001. 153-161 [doi]
• Model Checking for Adversarial Multi-Agent Reinforcement Learning with Reactive Defense MethodsDennis Gross, Christoph Schmidl, Nils Jansen 0001, Guillermo A. Pérez 0001. 162-170 [doi]
• Parallel Batch Processing for the Coating ProblemMatthias Horn, Emir Demirovic, Neil Yorke-Smith. 171-179 [doi]
• Planning with Multi-Agent Belief Using Justified PerspectivesGuang Hu, Tim Miller 0001, Nir Lipovetzky. 180-188 [doi]
• Deadline-Aware Multi-Agent Tour PlanningTaoan Huang, Vikas Shivashankar, Michael Caldara, Joseph W. Durham, Jiaoyang Li 0001, Bistra Dilkina, Sven Koenig. 189-197 [doi]
• Online Planning for Constrained POMDPs with Continuous Spaces through Dual AscentArec L. Jamgochian, Anthony Corso 0001, Mykel J. Kochenderfer. 198-202 [doi]
• A Theory of Merge-and-Shrink for Stochastic Shortest Path ProblemsThorsten Klößner, Álvaro Torralba, Marcel Steinmetz, Silvan Sievers. 203-211 [doi]
• Act-Then-Measure: Reinforcement Learning for Partially Observable Environments with Active MeasuringMerlijn Krale, Thiago D. Simão, Nils Jansen 0001. 212-220 [doi]
• Computing Domain Abstractions for Optimal Classical Planning with Counterexample-Guided Abstraction RefinementRaphael Kreft, Clemens Büchner, Silvan Sievers, Malte Helmert. 221-226 [doi]
• Using Simple Incentives to Improve Two-Sided Fairness in Ridesharing SystemsAshwin Kumar, Yevgeniy Vorobeychik, William Yeoh 0001. 227-235 [doi]
• Domain-Independent Dynamic Programming: Generic State Space Search for Combinatorial OptimizationRyo Kuroiwa 0002, J. Christopher Beck. 236-244 [doi]
• Solving Domain-Independent Dynamic Programming Problems with Anytime Heuristic SearchRyo Kuroiwa 0002, J. Christopher Beck. 245-253 [doi]
• Exact Anytime Multi-Agent Path Finding Using Branch-and-Cut-and-Price and Large Neighborhood SearchEdward Lam 0001, Daniel Damir Harabor, Peter J. Stuckey, Jiaoyang Li 0001. 254-258 [doi]
• On Using Action Inheritance and Modularity in PDDL Domain ModellingAlan Lindsay. 259-267 [doi]
• Efficient Reasoning about Infeasible One Machine SequencingRaúl Mencía, Carlos Mencía, João Marques-Silva 0001. 268-276 [doi]
• A Best-First Search Algorithm for FOND Planning and Heuristic Functions to Optimize Decompressed Solution SizeFrederico Messa, André Grahl Pereira. 277-285 [doi]
• Optimality Certificates for Classical PlanningEsther Mugdan, Remo Christen, Salomé Eriksson. 286-294 [doi]
• A Column Generation Approach to Correlated Simple Temporal NetworksAndrew Murray, Ashwin Arulselvan, Michael Cashmore, Marc Roper, Jeremy Frank. 295-303 [doi]
• The Small Solution Hypothesis for MAPF on Strongly Connected Directed Graphs Is TrueBernhard Nebel. 304-313 [doi]
• Can They Come Together? A Computational Complexity Analysis of Conjunctive Possible Effects of Compound HTN Planning TasksConny Olz, Pascal Bercher. 314-323 [doi]
• Fixing Plans for PDDL+ Problems: Theoretical and Practical ImplicationsFrancesco Percassi, Enrico Scala, Mauro Vallati. 324-333 [doi]
• Planning in Multi-Agent Domains with Untruthful AnnouncementsLoc Pham, Tran Cao Son, Enrico Pontelli. 334-342 [doi]
• An Efficient Hybrid Genetic Algorithm for the Quadratic Traveling Salesman ProblemQuang Anh Pham, Hoong Chuin Lau, Minh Hoàng Hà, Lam Vu. 343-351 [doi]
• A Constraint Programming Solution to the Guillotine Rectangular Cutting ProblemSergey Polyakovskiy, Peter J. Stuckey. 352-360 [doi]
• Binary Branching Multi-Objective Conflict-Based Search for Multi-Agent Path FindingZhongqiang Ren, Jiaoyang Li 0001, Han Zhang 0018, Sven Koenig, Sivakumar Rathinam, Howie Choset. 361-369 [doi]
• Lifted Stackelberg PlanningPhilipp Sauer, Marcel Steinmetz, Robert Künnemann, Jörg Hoffmann 0001. 370-374 [doi]
• Robust Metric Hybrid Planning in Stochastic Nonlinear Domains Using Mathematical OptimizationBuser Say. 375-383 [doi]
• Beyond Pairwise Reasoning in Multi-Agent Path FindingBojie Shen, Zhe Che 0016n, Jiaoyang Li 0001, Muhammad Aamir Cheema, Daniel Damir Harabor, Peter J. Stuckey. 384-392 [doi]
• Symmetry Detection and Breaking in Linear Cost-Optimal Numeric PlanningAlexander Shleyfman, Ryo Kuroiwa 0002, J. Christopher Beck. 393-401 [doi]
• Multi Agent Path Finding under Obstacle UncertaintyBar Shofer, Guy Shani, Roni Stern. 402-410 [doi]
• Finding Matrix Multiplication Algorithms with Classical PlanningDavid Speck 0001, Paul Höft, Daniel Gnad 0001, Jendrik Seipp. 411-416 [doi]
• Generalizing Action Justification and Causal Links to PoliciesSarath Sreedharan, Christian Muise, Subbarao Kambhampati. 417-426 [doi]
• Planning with Multiple Action-Cost EstimatesEyal Weiss 0001, Gal A. Kaminka. 427-437 [doi]
• Improving Zero-Shot Coordination Performance Based on Policy SimilarityLebin Yu, Yunbo Qiu, Quanming Yao, Xudong Zhang, Jian Wang. 438-442 [doi]
• Goal Recognition with Timing InformationChenyuan Zhang, Charles Kemp, Nir Lipovetzky. 443-451 [doi]
• Efficient Multi-Query Bi-Objective Search via Contraction HierarchiesHan Zhang, Oren Salzman, Ariel Felner, T. K. Satish Kumar, Carlos Hernández Ulloa, Sven Koenig. 452-461 [doi]
• Adaptation and Communication in Human-Robot Teaming to Handle Discrepancies in Agents' Beliefs about PlansYuening Zhang, Brian C. Williams. 462-471 [doi]
• Priority-Based Search for the Virtual Network Embedding ProblemYi Zheng, Hang Ma 0001, Sven Koenig, Erik Kline, T. K. Satish Kumar. 472-480 [doi]
• Moving Trains like Pebbles: A Feasibility Study on Tree YardsIssa K. Hanou, Mathijs Michiel de Weerdt, Jesse Mulderij. 482-490 [doi]
• Solving the Multi-Choice Two Dimensional Shelf Strip Packing Problem with Time WindowsMatthias Horn, Emir Demirovic, Neil Yorke-Smith. 491-499 [doi]
• Automated Planning to Prioritise Digital Forensics Investigation Cases Containing Indecent Images of ChildrenSaad Khan 0001, Simon Parkinson, Monika Roopak, Rachel Armitage, Andrew Barlow. 500-508 [doi]
• Dynamic Weight Setting for Personnel Scheduling with Many ObjectivesLucas Kletzander, Nysret Musliu. 509-517 [doi]
• Heuristic Search for Physics-Based Problems: Angry Birds in PDDL+Wiktor Piotrowski, Yoni Sher, Sachin Grover, Roni Stern, Shiwali Mohan. 518-526 [doi]
• Combining Heuristic Search and Linear Programming to Compute Realistic Financial PlansAlberto Pozanco, Kassiani Papasotiriou, Daniel Borrajo, Manuela Veloso. 527-531 [doi]
• Combining Clinical and Spatial Constraints into Temporal Planning to Personalize Physical RehabilitationAlessandro Umbrico, Marco Benadduci, Roberta Bevilacqua, Amedeo Cesta, Francesca Fracasso, Elvira Maranesi, Andrea Orlandini, Gabriella Cortellessa. 532-540 [doi]
• Task Phasing: Automated Curriculum Learning from DemonstrationsVaibhav Bajaj, Guni Sharon, Peter Stone. 542-550 [doi]
• Imitation Improvement Learning for Large-Scale Capacitated Vehicle Routing ProblemsViet The Bui, Tien Mai. 551-559 [doi]
• Goal Recognition as a Deep Learning Task: The GRNet ApproachMattia Chiari, Alfonso Emilio Gerevini, Francesco Percassi, Luca Putelli, Ivan Serina, Matteo Olivato. 560-568 [doi]
• Exploration Policies for On-the-Fly Controller Synthesis: A Reinforcement Learning ApproachTomás Delgado, Marco Sánchez Sorondo, Víctor A. Braberman, Sebastián Uchitel. 569-577 [doi]
• Reinforcement Learning for Omega-Regular Specifications on Continuous-Time MDPAmin Falah, Shibashis Guha, Ashutosh Trivedi 0001. 578-586 [doi]
• Deceptive Reinforcement Learning in Model-Free DomainsAlan Lewis, Tim Miller. 587-595 [doi]
• Safe MDP Planning by Learning Temporal Patterns of Undesirable Trajectories and Averting Negative Side EffectsSiow Meng Low, Akshat Kumar, Scott Sanner. 596-604 [doi]
• Automaton-Guided Curriculum Generation for Reinforcement Learning AgentsYash Shukla, Abhishek Kulkarni, Robert Wright, Alvaro Velasquez, Jivko Sinapov. 605-613 [doi]
• An End-to-End Reinforcement Learning Approach for Job-Shop Scheduling Problems Based on Constraint ProgrammingPierre Tassel, Martin Gebser, Konstantin Schekotihin. 614-622 [doi]
• Fast and Robust Resource-Constrained Scheduling with Graph Neural NetworksFlorent Teichteil-Königsbuch, Guillaume Povéda, Guillermo González de Garibay Barba, Tim Luchterhand, Sylvie Thiébaux. 623-633 [doi]
• Learning Local Heuristics for Search-Based Navigation PlanningRishi Veerapaneni, Muhammad Suhail Saleem, Maxim Likhachev. 634-638 [doi]
• Timed Partial Order Inference AlgorithmKandai Watanabe, Georgios Fainekos, Bardh Hoxha, Morteza Lahijanian, Danil V. Prokhorov, Sriram Sankaranarayanan 0001, Tomoya Yamaguchi 0001. 639-647 [doi]
• Planning for Automated Testing of Implicit Constraints in Behavior TreesUwe Köckemann, Daniele Calisi, Guglielmo Gemignani, Jennifer Renoux, Alessandro Saffiotti. 649-658 [doi]
• Understanding Natural Language in ContextAvichai Levy, Erez Karpas. 659-667 [doi]
• Planning for Manipulation among Movable Objects: Deciding Which Objects Go Where, in What Order, and HowDhruv Saxena, Maxim Likhachev. 668-676 [doi]
• Approximating the Value of Collaborative Team Actions for Efficient Multiagent Navigation in Uncertain GraphsMartina Stadler, Jacopo Banfi, Nicholas Roy. 677-685 [doi]