Table of Contents

• DREAM: An Algorithm for Mitigating the Overhead of Robust ReschedulingJordan R. Abrahams, David A. Chu, Grace Diehl, Marina Knittel, Judy Lin, William Lloyd, James C. Boerkoel Jr., Frank Jeremy. 3-12 [doi]
• Model Recognition as PlanningDiego Aineto, Sergio Jiménez 0003, Eva Onaindia, Miquel Ramírez. 13-21 [doi]
• Quantifying Degrees of Controllability in Temporal Networks with UncertaintyShyan Akmal, Savana Ammons, Hemeng Li, James C. Boerkoel Jr.. 22-30 [doi]
• Planning under LTL Environment SpecificationsBenjamin Aminof, Giuseppe De Giacomo, Aniello Murano, Sasha Rubin. 31-39 [doi]
• A Logical Semantics for PDDL+Vitaliy Batusov, Mikhail Soutchanski. 40-48 [doi]
• Cyber-Physical Planning: Deliberation for Hybrid Systems with a Continuous Numeric StateArthur Bit-Monnot, Luca Pulina, Armando Tacchella. 49-57 [doi]
• Towards a Unified View of AI Planning and Reactive SynthesisAlberto Camacho, Meghyn Bienvenu, Sheila A. McIlraith. 58-67 [doi]
• Approximate Gradient Descent Convergence Dynamics for Adaptive Control on Heterogeneous NetworksJean Carpentier, Sebastien Blandin. 68-76 [doi]
• Relaxed BDDs: An Admissible Heuristic for Delete-Free Planning Based on a Discrete RelaxationMargarita P. Castro, Chiara Piacentini, André A. Ciré, J. Christopher Beck. 77-85 [doi]
• Explicability? Legibility? Predictability? Transparency? Privacy? Security? The Emerging Landscape of Interpretable Agent BehaviorTathagata Chakraborti, Anagha Kulkarni 0002, Sarath Sreedharan, David E. Smith 0001, Subbarao Kambhampati. 86-96 [doi]
• Efficiently Exploring Ordering Problems through Conflict-Directed SearchJingkai Chen, Cheng Fang, David Wang, Andrew J. Wang, Brian C. Williams. 97-105 [doi]
• Cutting the Size of Compressed Path Databases with Wildcards and Redundant SymbolsMattia Chiari, Shizhe Zhao, Adi Botea, Alfonso Emilio Gerevini, Daniel Harabor, Alessandro Saetti, Matteo Salvetti, Peter J. Stuckey. 106-113 [doi]
• An Empirical Study of Perfect Potential HeuristicsAugusto B. Corrêa, Florian Pommerening. 114-118 [doi]
• Stochastic Planning with Lifted Symbolic Trajectory OptimizationHao Cui 0003, Thomas Keller 0001, Roni Khardon. 119-127 [doi]
• Foundations for Restraining Bolts: Reinforcement Learning with LTLf/LDLf Restraining SpecificationsGiuseppe De Giacomo, Luca Iocchi, Marco Favorito, Fabio Patrizi. 128-136 [doi]
• Mixed Discrete Continuous Non-Linear Planning through Piecewise Linear ApproximationElad Denenberg, Amanda Jane Coles. 137-145 [doi]
• An Exact Algorithm to Make a Trade-Off between Cost and Probability in SSPsValdinei Freire, Karina Valdivia Delgado, Willy Arthur Silva Reis. 146-154 [doi]
• Lazy CBS: Implicit Conflict-Based Search Using Lazy Clause GenerationGraeme Gange, Daniel Harabor, Peter J. Stuckey. 155-162 [doi]
• Best-First Width Search for Multi Agent Privacy-Preserving PlanningAlfonso Emilio Gerevini, Nir Lipovetzky, Francesco Percassi, Alessandro Saetti, Ivan Serina. 163-171 [doi]
• On the Relation between Star-Topology Decoupling and Petri Net UnfoldingDaniel Gnad 0001, Jörg Hoffmann 0001. 172-180 [doi]
• A Multi-Label A* Algorithm for Multi-Agent PathfindingFlorian Grenouilleau, Willem Jan van Hoeve, John N. Hooker. 181-185 [doi]
• Tabu-Based Large Neighbourhood Search for Time/Sequence-Dependent Scheduling Problems with Time WindowsLei He 0009, Mathijs de Weerdt, Neil Yorke-Smith. 186-194 [doi]
• Temporal Planning as Refinement-Based Model CheckingAlexander Heinz, Martin Wehrle, Sergiy Bogomolov, Daniele Magazzeni, Marius Greitschus, Andreas Podelski. 195-199 [doi]
• Improving the Combination of JPS and Geometric ContainersYue Hu, Daniel Harabor, Long Qin, Quanjun Yin, Cong Hu. 209-213 [doi]
• Online Risk-Bounded Motion Planning for Autonomous Vehicles in Dynamic EnvironmentsXin Huang 0018, Sungkweon Hong, Andreas G. Hofmann, Brian C. Williams. 214-222 [doi]
• Propagating Piecewise-Linear Weights in Temporal NetworksLuke Hunsberger, Roberto Posenato. 223-231 [doi]
• Planning with Global State Constraints and State-Dependent Action CostsFranc Ivankovic, Dan Gordon 0002, Patrik Haslum. 232-236 [doi]
• Oversubscription Planning as Classical Planning with Multiple Cost FunctionsMichael Katz 0001, Emil Keyder, Dominik Winterer, Florian Pommerening. 237-245 [doi]
• Efficient Heuristic Search for Optimal Environment RedesignSarah Keren, Luis Enrique Pineda, Avigdor Gal, Erez Karpas, Shlomo Zilberstein. 246-254 [doi]
• On the Pathological Search Behavior of Distributed Greedy Best-First SearchRyo Kuroiwa 0002, Alex Fukunaga. 255-263 [doi]
• Measuring and Optimizing Durability against Scheduling DisturbancesJoon-Young Lee, Vivaswat Ojha, James C. Boerkoel Jr.. 264-268 [doi]
• Backward Sequence Analysis for Single-Armed Cluster ToolsJun-Ho Lee, Hyun-jung Kim. 269-272 [doi]
• Using FastMap to Solve Graph Problems in a Euclidean SpaceJiaoyang Li 0001, Ariel Felner, Sven Koenig, T. K. Satish Kumar. 273-278 [doi]
• Disjoint Splitting for Multi-Agent Path Finding with Conflict-Based SearchJiaoyang Li 0001, Daniel Harabor, Peter J. Stuckey, Hang Ma 0001, Sven Koenig. 279-283 [doi]
• Error-Tolerant Anytime Approach to Plan Recognition Using a Particle FilterJean Massardi, Mathieu Gravel, Eric Beaudry. 284-291 [doi]
• Discovery of Optimal Solution Horizons in Non-Stationary Markov Decision Processes with Unbounded RewardsGrigory Neustroev, Mathijs de Weerdt, Remco A. Verzijlbergh. 292-300 [doi]
• A Multi-Agent Framework to Solve Energy-Aware Unrelated Parallel Machine Scheduling Problems with Machine-Dependent Energy Consumption and Sequence-Dependent Setup TimeGiancarlo Nicolò, Sergio Ferrer, Miguel A. Salido, Adriana Giret, Federico Barber. 301-309 [doi]
• Eliminating Redundant Actions in Partially Ordered Plans - A Complexity AnalysisConny Olz, Pascal Bercher. 310-319 [doi]
• On Compiling Away PDDL3 Soft Trajectory Constraints without Using AutomataFrancesco Percassi, Alfonso Emilio Gerevini. 320-328 [doi]
• Landmark-Enhanced Heuristics for Goal Recognition in Incomplete Domain ModelsRamon Fraga Pereira, André Grahl Pereira, Felipe Meneguzzi. 329-337 [doi]
• Lagrangian Decomposition for Optimal Cost PartitioningFlorian Pommerening, Gabriele Röger, Malte Helmert, Hadrien Cambazard, Louis-Martin Rousseau, Domenico Salvagnin. 338-347 [doi]
• Finding Centroids and Minimum Covering States in PlanningAlberto Pozanco, Yolanda E-Martín, Susana Fernández, Daniel Borrajo. 348-352 [doi]
• A Stochastic Dual Dynamic Integer Programming for the Uncapacitated Lot-Sizing Problem with Uncertain Demand and CostsFranco Quezada, Céline Gicquel, Safia Kedad-Sidhoum. 353-361 [doi]
• Counterexample-Guided Abstraction Refinement for Pattern Selection in Optimal Classical PlanningAlexander Rovner, Silvan Sievers, Malte Helmert. 362-367 [doi]
• Robust Operations Management on MarsMichael Saint-Guillain. 368-376 [doi]
• Advanced Factoring Strategies for Decoupled Search Using Linear ProgrammingFrederik Schmitt, Daniel Gnad 0001, Jörg Hoffmann 0001. 377-381 [doi]
• Tree-REX: SAT-Based Tree Exploration for Efficient and High-Quality HTN PlanningDominik Schreiber 0001, Damien Pellier, Humbert Fiorino, Tomás Balyo. 382-390 [doi]
• Subset-Saturated Cost Partitioning for Optimal Classical PlanningJendrik Seipp, Malte Helmert. 391-400 [doi]
• Learning Scheduling Models from Event DataArik Senderovich, Kyle E. C. Booth, J. Christopher Beck. 401-409 [doi]
• Robust and Adaptive Planning under Model UncertaintyApoorva Sharma, James Harrison, Matthew Tsao, Marco Pavone. 410-418 [doi]
• A Factored Approach to Deterministic Contingent Multi-Agent PlanningShashank Shekhar 0002, Ronen I. Brafman, Guy Shani. 419-427 [doi]
• On Computational Complexity of Automorphism Groups in Classical PlanningAlexander Shleyfman. 428-436 [doi]
• Algorithm Selection in Optimization and Application to Angry BirdsShahaf S. Shperberg, Solomon Eyal Shimony, Avinoam Yehezkel. 437-445 [doi]
• Theoretical Foundations for Structural Symmetries of Lifted PDDL TasksSilvan Sievers, Gabriele Röger, Martin Wehrle, Michael Katz 0001. 446-454 [doi]
• A Theoretical and Algorithmic Analysis of Configurable MDPsRui Silva, Gabriele Farina, Francisco S. Melo, Manuela Veloso. 455-463 [doi]
• Symbolic Planning with AxiomsDavid Speck 0001, Florian Geißer, Robert Mattmüller, Álvaro Torralba. 464-472 [doi]
• Bridging the Gap between Abstractions and Critical-Path Heuristics via HypergraphsMarcel Steinmetz, Álvaro Torralba. 473-481 [doi]
• Privacy Leakage of Search-Based Multi-Agent Planning AlgorithmsMichal Stolba, Daniel Fiser, Antonín Komenda. 482-490 [doi]
• Personalized Medication and Activity Planning in PDDL+Fares K. Alaboud, Andrew Coles. 492-500 [doi]
• Optimizing Parameters for Uncertain Execution and Rescheduling RobustnessWayne Chi, Jagriti Agrawal, Steve A. Chien, Elyse Fosse, Usha Guduri. 501-509 [doi]
• The Clustered Dial-a-Ride ProblemFabian Feitsch, Sabine Storandt. 510-518 [doi]
• Exact Methods for Extended Rotating Workforce Scheduling ProblemsLucas Kletzander, Nysret Musliu, Johannes Gärtner, Thomas Krennwallner, Werner Schafhauser. 519-527 [doi]
• ZAC: A Zone Path Construction Approach for Effective Real-Time RidesharingMeghna Lowalekar, Pradeep Varakantham, Patrick Jaillet. 528-538 [doi]
• Towards Automating Crime Prevention through Environmental Design (CPTED) Analysis to Predict BurglaryLeanne Monchuk, Simon Parkinson, James Kitchen. 539-547 [doi]
• Mixed Integer Programming versus Evolutionary Computation for Optimizing a Hard Real-World Staff Assignment ProblemJannik Peters 0001, Daniel Stephan, Isabel Amon, Hans Gawendowicz, Julius Lischeid, Lennart Salabarria, Jonas Umland, Felix Werner, Martin S. Krejca, Ralf Rothenberger, Timo Kötzing, Tobias Friedrich 0001. 541-554 [doi]
• Reinforcement Learning Based Querying in Camera Networks for Efficient Target TrackingAnil Sharma, Saket Anand, Sanjit K. Kaul. 555-563 [doi]
• Temporal Brittleness Analysis of Task Networks for Planetary RoversTiago Vaquero, Steve A. Chien, Jagriti Agrawal, Wayne Chi, Terrance L. Huntsberger. 564-572 [doi]
• Solution Approaches for an Automotive Paint Shop Scheduling ProblemFelix Winter, Nysret Musliu, Emir Demirovic, Christoph Mrkvicka. 573-581 [doi]
• Towards Stable Symbol Grounding with Zero-Suppressed State AutoEncoderMasataro Asai, Hiroshi Kajino. 592-600 [doi]
• Fast Feature Selection for Linear Value Function ApproximationBahram Behzadian, Soheil Gharatappeh, Marek Petrik. 601-609 [doi]
• Resource Constrained Deep Reinforcement LearningAbhinav Bhatia, Pradeep Varakantham, Akshat Kumar. 610-620 [doi]
• Learning Interpretable Models Expressed in Linear Temporal LogicAlberto Camacho, Sheila A. McIlraith. 621-630 [doi]
• Size Independent Neural Transfer for RDDL PlanningSankalp Garg, Aniket Bajpai, Mausam. 631-636 [doi]
• Learning Classical Planning Strategies with Policy GradientPawel Gomoluch, Dalal Alrajeh, Alessandra Russo. 637-645 [doi]
• Deep Policies for Width-Based Planning in Pixel DomainsMiquel Junyent, Anders Jonsson 0001, Vicenç Gómez. 646-654 [doi]
• Entropy Based Independent Learning in Anonymous Multi-Agent SettingsTanvi Verma, Pradeep Varakantham, Hoong Chuin Lau. 655-663 [doi]
• Replanning for Situated RobotsMichael Cashmore, Andrew Coles, Bence Cserna, Erez Karpas, Daniele Magazzeni, Wheeler Ruml. 665-673 [doi]
• Speeding Up Search-Based Motion Planning via Conservative HeuristicsIshani Chatterjee 0001, Maxim Likhachev, Ashwin Khadke, Manuela Veloso. 674-679 [doi]
• Trajectory Tracking Control for Robotic Vehicles Using Counterexample Guided Training of Neural NetworksArthur Clavière, Souradeep Dutta, Sriram Sankaranarayanan 0001. 680-688 [doi]
• Clothoidal Local Path Template for Intention Estimation by Assistive Mobile RobotsKevin Denis, Johan Philips, Herman Bruyninckx, Eric Demeester. 689-697 [doi]
• POMDP-Based Candy Server: Lessons Learned from a Seven Day DemoMarcus Hörger, Joshua Song, Hanna Kurniawati, Alberto Elfes. 698-706 [doi]
• Mars On-Site Shared Analytics Information and ComputingJoshua Vander Hook, Tiago Vaquero, Federico Rossi 0001, Martina Troesch, Marc Sanchez Net, Joshua Schoolcraft, Jean-Pierre de la Croix, Steve A. Chien. 707-715 [doi]
• Provable Indefinite-Horizon Real-Time Planning for Repetitive TasksFahad Islam, Oren Salzman, Maxim Likhachev. 716-724 [doi]
• Open-World Reasoning for Service RobotsYuqian Jiang, Nick Walker 0001, Justin W. Hart, Peter Stone. 725-733 [doi]
• POMHDP: Search-Based Belief Space Planning Using Multiple HeuristicsSung-Kyun Kim, Oren Salzman, Maxim Likhachev. 734-744 [doi]
• Goal Reasoning in the CLIPS Executive for Integrated Planning and ExecutionTim Niemueller, Till Hofmann, Gerhard Lakemeyer. 754-763 [doi]
• Learning Heuristic Functions for Mobile Robot Path Planning Using Deep Neural NetworksTakeshi Takahashi, He Sun, Dong Tian, Yebin Wang. 764-772 [doi]
• A Hierarchical Approach to Active Semantic Mapping Using Probabilistic Logic and Information Reward POMDPsTiago S. Veiga, Miguel Silva, Rodrigo Ventura 0001, Pedro U. Lima. 773-781 [doi]