Table of Contents

• PrefaceSylvie Thiébaux, William Yeoh 0001, Akshat Kumar, Pradeep Varakantham. [doi]
• It Costs to Get Costs! A Heuristic-Based Scalable Goal Assignment Algorithm for Multi-Robot SystemsAakash, Indranil Saha. 2-10 [doi]
• Best-First Width Search for Lifted Classical PlanningAugusto B. Corrêa, Jendrik Seipp. 11-15 [doi]
• Merge and Shrink Abstractions for Temporal PlanningMartim Brandao, Amanda Jane Coles, Andrew Coles, Jörg Hoffmann 0001. 16-25 [doi]
• Flexible FOND HTN Planning: A Complexity AnalysisDillon Chen, Pascal Bercher. 26-34 [doi]
• Crossword Puzzle Resolution via Monte Carlo Tree SearchLihan Chen, JingPing Liu, Sihang Jiang, Chao Wang, Jiaqing Liang, Yanghua Xiao, Sheng Zhang, Rui Song 0006. 35-43 [doi]
• Detecting Unsolvability Based on Separating FunctionsRemo Christen, Salomé Eriksson, Florian Pommerening, Malte Helmert. 44-52 [doi]
• Task-Guided Inverse Reinforcement Learning under Partial InformationFranck Djeumou, Murat Cubuktepe, Craig Lennon, Ufuk Topcu. 53-61 [doi]
• Learning Sketches for Decomposing Planning Problems into Subproblems of Bounded WidthDominik Drexler, Jendrik Seipp, Hector Geffner. 62-70 [doi]
• Efficient Computation and Informative Estimation of h+ by Integer and Linear ProgrammingMasood Feyzbakhsh Rankooh, Jussi Rintanen. 71-79 [doi]
• Operator-Potentials in Symbolic Search: From Forward to Bi-directional SearchDaniel Fiser, Álvaro Torralba, Jörg Hoffmann 0001. 80-89 [doi]
• Iterative Depth-First Search for FOND PlanningRamon Fraga Pereira, André Grahl Pereira, Frederico Messa, Giuseppe De Giacomo. 90-99 [doi]
• Admissible Heuristics for Multi-Objective PlanningFlorian Geißer, Patrik Haslum, Sylvie Thiébaux, Felipe W. Trevizan. 100-109 [doi]
• Beyond Stars - Generalized Topologies for Decoupled SearchDaniel Gnad 0001, Álvaro Torralba, Daniel Fiser. 110-118 [doi]
• Assignment and Prioritization of Tasks with Uncertain Durations for Satisfying Makespans in Decentralized ExecutionSriram Gopalakrishnan, Daniel Borrajo. 119-123 [doi]
• On the Complexity of Heuristic Synthesis for Satisficing Classical Planning: Potential Heuristics and BeyondMalte Helmert, Silvan Sievers, Alexander Rovner, Augusto B. Corrêa. 124-133 [doi]
• Encoding Lifted Classical Planning in Propositional LogicDaniel Höller, Gregor Behnke. 134-144 [doi]
• Compiling HTN Plan Verification Problems into HTN Planning ProblemsDaniel Höller, Julia Wichlacz, Pascal Bercher, Gregor Behnke. 145-150 [doi]
• An Exact Algorithm for the Linear Tape Scheduling ProblemValentin Honoré, Bertrand Simon, Frédéric Suter. 151-159 [doi]
• Optimal Mixed Strategies for Cost-Adversarial Planning GamesRostislav Horcík, Álvaro Torralba, Pavel Rytír, Lukás Chrpa, Stefan Edelkamp. 160-168 [doi]
• Multi-Agent Path Finding with Temporal Jump Point SearchShuli Hu, Daniel Damir Harabor, Graeme Gange, Peter J. Stuckey, Nathan R. Sturtevant. 169-173 [doi]
• A Compilation Based Approach to Finding Centroids and Minimum Covering States in PlanningErez Karpas. 174-178 [doi]
• Who Needs These Operators Anyway: Top Quality Planning with Operator Subset CriteriaMichael Katz 0001, Shirin Sohrabi. 179-183 [doi]
• Pattern Selection Strategies for Pattern Databases in Probabilistic PlanningThorsten Klößner, Marcel Steinmetz, Álvaro Torralba, Jörg Hoffmann 0001. 184-192 [doi]
• Cost Partitioning Heuristics for Stochastic Shortest Path ProblemsThorsten Klößner, Florian Pommerening, Thomas Keller 0001, Gabriele Röger. 193-202 [doi]
• LM-Cut Heuristics for Optimal Linear Numeric PlanningRyo Kuroiwa 0002, Alexander Shleyfman, J. Christopher Beck. 203-212 [doi]
• Biased Exploration for Satisficing Heuristic SearchRyo Kuroiwa 0002, J. Christopher Beck. 213-221 [doi]
• Beam Search: Faster and MonotonicSofia Lemons, Carlos Linares López, Robert C. Holte, Wheeler Ruml. 222-230 [doi]
• On the Expressive Power of Planning Formalisms in Conjunction with LTLSongtuan Lin, Pascal Bercher. 231-240 [doi]
• Generalized Linear Integer Numeric PlanningXiaoyou Lin, Qingliang Chen, Liangda Fang, Quanlong Guan, Weiqi Luo, Kaile Su. 241-251 [doi]
• On Speeding Up Methods for Identifying Redundant Actions in PlansJakub Med, Lukás Chrpa. 252-260 [doi]
• Simple Temporal Networks for Improvisational TeamworkMalia Morgan, Julianna Schalkwyk, Huaxiaoyue Wang, Hannah Davalos, Ryan Martinez, Vibha Rohilla, James Boerkoel. 261-269 [doi]
• Solving Simultaneous Target Assignment and Path Planning Efficiently with Time-Independent ExecutionKeisuke Okumura 0001, Xavier Défago. 270-278 [doi]
• Conflict-Directed Diverse Planning for Logic-Geometric ProgrammingJoaquim Ortiz de Haro, Erez Karpas, Marc Toussaint, Michael Katz 0001. 279-287 [doi]
• The Power of Reformulation: From Validation to Planning in PDDL+Francesco Percassi, Enrico Scala, Mauro Vallati. 288-296 [doi]
• A Hybrid Genetic Algorithm for the Vehicle Routing Problem with Roaming Delivery LocationsQuang Anh Pham, Minh Hoàng Hà, Duy Manh Vu, Huy-Hoang Nguyen. 297-306 [doi]
• Planning for Risk-Aversion and Expected Value in MDPsMarc Rigter, Paul Duckworth, Bruno Lacerda, Nick Hawes. 307-315 [doi]
• Optimising the Stability in Plan Repair via CompilationAlessandro Saetti, Enrico Scala. 316-320 [doi]
• Euclidean Distance-Optimal Post-processing of Grid-Based PathsGuru Koushik Senthil Kumar, Sandip Aine, Maxim Likhachev. 321-328 [doi]
• Classical Planning as QBF without GroundingIrfansha Shaik, Jaco van de Pol. 329-337 [doi]
• Improving Time-Dependent Contraction HierarchiesBojie Shen, Muhammad Aamir Cheema, Daniel Damir Harabor, Peter J. Stuckey. 338-347 [doi]
• New Refinement Strategies for Cartesian AbstractionsDavid Speck 0001, Jendrik Seipp. 348-352 [doi]
• Debugging a Policy: Automatic Action-Policy Testing in AI PlanningMarcel Steinmetz, Daniel Fiser, Hasan Ferit Eniser, Patrick Ferber, Timo P. Gros, Philippe Heim, Daniel Höller, Xandra Schuler, Valentin Wüstholz, Maria Christakis, Jörg Hoffmann 0001. 353-361 [doi]
• Learning to Estimate Search Progress Using Sequence of StatesMatan Sudry, Erez Karpas. 362-370 [doi]
• Neural Network Action Policy Verification via Predicate AbstractionMarcel Vinzent, Marcel Steinmetz, Jörg Hoffmann 0001. 371-379 [doi]
• Loopless Top-K PlanningJulian von Tschammer, Robert Mattmüller, David Speck 0001. 380-384 [doi]
• Lazy Rearrangement Planning in Confined SpacesRui Wang, Kai Gao, Jingjin Yu, Kostas E. Bekris. 385-393 [doi]
• A*pex: Efficient Approximate Multi-Objective Search on GraphsHan Zhang, Oren Salzman, T. K. Satish Kumar, Ariel Felner, Carlos Hernández Ulloa, Sven Koenig. 394-403 [doi]
• Solving Job-Shop Scheduling Problems with QUBO-Based Specialized HardwareJiachen Zhang, Giovanni Lo Bianco, J. Christopher Beck. 404-412 [doi]
• Uniform Machine Scheduling with PredictionsTianming Zhao, Wei Li 0058, Albert Y. Zomaya. 413-422 [doi]
• Conflict-Based Search for the Virtual Network Embedding ProblemYi Zheng, Srivatsan Ravi, Erik Kline, Sven Koenig, T. K. Satish Kumar. 423-433 [doi]
• Deep Reinforcement Learning for a Multi-Objective Online Order Batching ProblemMartijn Beeks, Reza Refaei Afshar, Yingqian Zhang, Remco M. Dijkman, Claudy van Dorst, Stijn de Looijer. 435-443 [doi]
• OFFICERS: Operational Framework for Intelligent Crime-and-Emergency Response SchedulingJonathan Chase, Siong-Thye Goh, Tran Phong, Hoong Chuin Lau. 444-452 [doi]
• Reinforcement Learning Approach to Solve Dynamic Bi-objective Police Patrol Dispatching and Rescheduling ProblemWaldy Joe, Hoong Chuin Lau, Jonathan Pan. 453-461 [doi]
• Hyper-Heuristics for Personnel Scheduling DomainsLucas Kletzander, Nysret Musliu. 462-470 [doi]
• Planning Satellite Swarm Measurements for Earth Science Models: Comparing Constraint Processing and MILP MethodsRichard Levinson, Samantha Niemoeller, Sreeja Nag, Vinay Ravindra. 471-479 [doi]
• Talking Trucks: Decentralized Collaborative Multi-Agent Order Scheduling for Self-Organizing LogisticsGeert L. J. Pingen, Christian R. van Ommeren, Cornelis J. van Leeuwen, Ruben W. Fransen, Tijmen Elfrink, Yorick C. de Vries, Janarthanan Karunakaran, Emir Demirovic, Neil Yorke-Smith. 480-489 [doi]
• Building Resource-Dependent Conditional Plans for an Earth Monitoring SatelliteCédric Pralet, David Doose, Julien Anxionnat, Jérémie Pouly. 490-498 [doi]
• Joint Pricing and Matching for City-Scale Ride-PoolingSanket Shah, Meghna Lowalekar, Pradeep Varakantham. 499-507 [doi]
• RADAR-X: An Interactive Mixed Initiative Planning Interface Pairing Contrastive Explanations and Revised Plan SuggestionsKarthik Valmeekam, Sarath Sreedharan, Sailik Sengupta, Subbarao Kambhampati. 508-517 [doi]
• Analyzing the Efficacy of Flexible Execution, Replanning, and Plan Optimization for a Planetary LanderDaniel Wang, Joseph A. Russino, Connor Basich, Steve Chien. 518-526 [doi]
• Stochastic Resource Optimization over Heterogeneous Graph Neural Networks for Failure-Predictive Maintenance SchedulingZheyuan Wang, Matthew C. Gombolay. 527-536 [doi]
• An End-to-End Automatic Cache Replacement Policy Using Deep Reinforcement LearningYang Zhou, Fang Wang 0001, Zhan Shi 0001, Dan Feng 0001. 537-545 [doi]
• Is Policy Learning Overrated?: Width-Based Planning and Active Learning for AtariBenjamin J. Ayton, Masataro Asai. 547-555 [doi]
• Tuning the Hyperparameters of Anytime Planning: A Metareasoning Approach with Deep Reinforcement LearningAbhinav Bhatia, Justin Svegliato, Samer B. Nashed, Shlomo Zilberstein. 556-564 [doi]
• Distributed Fleet Management in Noisy Environments via Model-Predictive ControlSimon Bøgh, Peter Gjøl Jensen, Martin Kristjansen, Kim Guldstrand Larsen, Ulrik Nyman. 565-573 [doi]
• Inferring Probabilistic Reward Machines from Non-Markovian Reward Signals for Reinforcement LearningTaylor Dohmen, Noah Topper, George K. Atia, Andre Beckus, Ashutosh Trivedi 0001, Alvaro Velasquez. 574-582 [doi]
• Neural Network Heuristic Functions for Classical Planning: Bootstrapping and Comparison to Other MethodsPatrick Ferber, Florian Geißer, Felipe W. Trevizan, Malte Helmert, Jörg Hoffmann 0001. 583-587 [doi]
• Reinforcement Learning for Classical Planning: Viewing Heuristics as Dense Reward GeneratorsClement Gehring, Masataro Asai, Rohan Chitnis, Tom Silver, Leslie Pack Kaelbling, Shirin Sohrabi, Michael Katz 0001. 588-596 [doi]
• TempAMLSI: Temporal Action Model Learning Based on STRIPS TranslationMaxence Grand, Damien Pellier, Humbert Fiorino. 597-605 [doi]
• Beyond Value: CheckList for Testing Inferences in Planning-Based RLKin-Ho Lam, Delyar Tabatabai, Jed Irvine, Donald Bertucci, Anita Ruangrotsakun, Minsuk Kahng, Alan Fern. 606-614 [doi]
• Verifiable and Compositional Reinforcement Learning SystemsCyrus Neary, Christos K. Verginis, Murat Cubuktepe, Ufuk Topcu. 615-623 [doi]
• Learning Multi-Agent Action Coordination via Electing First-Move AgentJingqing Ruan, Linghui Meng 0001, Xuantang Xiong, Dengpeng Xing, Bo Xu 0002. 624-628 [doi]
• Learning General Optimal Policies with Graph Neural Networks: Expressive Power, Transparency, and LimitsSimon Ståhlberg, Blai Bonet, Hector Geffner. 629-637 [doi]
• Reinforcement Learning of Dispatching Strategies for Large-Scale Industrial SchedulingPierre Tassel, Benjamin Kovács, Martin Gebser, Konstantin Schekotihin, Wolfgang Kohlenbrein, Philipp Schrott-Kostwein. 638-646 [doi]
• Active Grammatical Inference for Non-Markovian PlanningNoah Topper, George K. Atia, Ashutosh Trivedi 0001, Alvaro Velasquez. 647-651 [doi]
• Multi-Agent Tree Search with Dynamic Reward ShapingAlvaro Velasquez, Brett Bissey, Lior Barak, Daniel Melcer, Andre Beckus, Ismail Alkhouri, George K. Atia. 652-661 [doi]
• DOMA: Deep Smooth Trajectory Generation Learning for Real-Time UAV Motion PlanningJin Yu, Haiyin Piao, Yaqing Hou, Li Mo, Xin Yang, Deyun Zhou. 662-666 [doi]
• A Network Flow Interpretation of Robust Goal Legibility in Path FindingSara Bernardini, Fabio Fagnani, Santiago Franco, Alexandra Neacsu. 668-677 [doi]
• Actor-Focused Interactive Visualization for AI PlanningGabriel Dias Cantareira, Gerard Canal, Rita Borgo. 678-686 [doi]
• Evaluating Plan-Property Dependencies: A Web-Based Platform and User StudyRebecca Eifler, Martim Brandao, Amanda Jane Coles, Jeremy Frank, Jörg Hoffmann 0001. 687-691 [doi]
• Conflict-Based Search for Explainable Multi-Agent Path FindingJustin Kottinger, Shaull Almagor, Morteza Lahijanian. 692-700 [doi]
• VizXP: A Visualization Framework for Conveying Explanations to Users in Model Reconciliation ProblemsAshwin Kumar, Stylianos Loukas Vasileiou, Melanie Bancilhon, Alvitta Ottley, William Yeoh 0001. 701-709 [doi]
• Explaining Preference-Driven Schedules: The EXPRES FrameworkAlberto Pozanco, Francesca Mosca, Parisa Zehtabi, Daniele Magazzeni, Sarit Kraus. 710-718 [doi]
• Resolving Misconceptions about the Plans of Agents via Theory of MindMaayan Shvo, Toryn Q. Klassen, Sheila A. McIlraith. 719-729 [doi]
• Anxiety-Sensitive Planning: From Formal Foundations to Algorithms and ApplicationsLoïs Vanhée, Laurent Jeanpierre, Abdel-Illah Mouaddib. 730-740 [doi]