Abstract is missing.
- A TIL-Relaxed Heuristic for Planning with Time WindowsTony Allard, Charles Gretton, Patrik Haslum. 2-10 [doi]
- Validation of Hierarchical Plans via Parsing of Attribute GrammarsRoman Barták, Adrien Maillard, Rafael Cauê Cardoso. 11-19 [doi]
- Scalability of Route Planning TechniquesJohannes Blum, Sabine Storandt. 20-28 [doi]
- Finite LTL Synthesis as PlanningAlberto Camacho, Jorge A. Baier, Christian J. Muise, Sheila A. McIlraith. 29-38 [doi]
- Temporal Planning while the Clock TicksMichael Cashmore, Andrew Coles, Bence Cserna, Erez Karpas, Daniele Magazzeni, Wheeler Ruml. 39-46 [doi]
- Sensor Synthesis for POMDPs with Reachability ObjectivesKrishnendu Chatterjee, Martin Chmelik, Ufuk Topcu. 47-55 [doi]
- Algorithms and Conditional Lower Bounds for Planning ProblemsKrishnendu Chatterjee, Wolfgang Dvorák, Monika Henzinger, Alexander Svozil. 56-64 [doi]
- A Proof System for Unsolvable Planning TasksSalomé Eriksson, Gabriele Röger, Malte Helmert. 65-73 [doi]
- MS-Lite: A Lightweight, Complementary Merge-and-Shrink MethodGaojian Fan, Robert Holte, Martin Mueller. 74-82 [doi]
- Adding Heuristics to Conflict-Based Search for Multi-Agent Path FindingAriel Felner, Jiaoyang Li, Eli Boyarski, Hang Ma 0001, Liron Cohen 0002, T. K. Satish Kumar, Sven Koenig. 83-87 [doi]
- Compact Policies for Fully Observable Non-Deterministic Planning as SATTomas Geffner, Hector Geffner. 88-96 [doi]
- Sampling Strategies for Conformant PlanningAlban Grastien, Enrico Scala. 97-105 [doi]
- The Provable Virtue of Laziness in Motion PlanningNika Haghtalab, Simon Mackenzie, Ariel D. Procaccia, Oren Salzman, Siddhartha S. Srinivasa. 106-113 [doi]
- A Generic Method to Guide HTN Progression Search with Classical HeuristicsDaniel Höller, Pascal Bercher, Gregor Behnke, Susanne Biundo. 114-122 [doi]
- New Perspectives on Flexibility in Simple Temporal PlanningAmy Huang, Liam Lloyd, Mohamed Omar, James C. Boerkoel. 123-131 [doi]
- A Novel Iterative Approach to Top-k PlanningMichael Katz 0001, Shirin Sohrabi, Octavian Udrea, Dominik Winterer. 132-140 [doi]
- Strong Stubborn Sets for Efficient Goal Recognition DesignSarah Keren, Avigdor Gal, Erez Karpas. 141-149 [doi]
- Compiling Probabilistic Model Checking into Probabilistic PlanningMichaela Klauck, Marcel Steinmetz, Jörg Hoffmann 0001, Holger Hermanns. 150-154 [doi]
- Batch Random Walk for GPU-Based Classical PlanningRyo Kuroiwa, Alex Fukunaga. 155-160 [doi]
- EFP and PG-EFP: Epistemic Forward Search Planners in Multi-Agent DomainsTiep Le, Francesco Fabiano, Tran Cao Son, Enrico Pontelli. 161-170 [doi]
- Value Driven Landmarks for Oversubscription PlanningDaniel Muller, Erez Karpas. 171-179 [doi]
- Planning with Temporal Uncertainty, Resources and Non-Linear Control ParametersMikael Nilsson, Jonas Kvarnström, Patrick Doherty. 180-189 [doi]
- Planning for Partial Observability by SAT and Graph ConstraintsBinda Pandey, Jussi Rintanen. 190-198 [doi]
- Local Search for Flowshops with Setup Times and Blocking ConstraintsVahid Riahi, M. A. Hakim Newton, Kaile Su, Abdul Sattar 0001. 199-207 [doi]
- Symmetry-Based Task Reduction for Relaxed Reachability AnalysisGabriele Röger, Silvan Sievers, Michael Katz 0001. 208-217 [doi]
- Bootstrapping LPs in Value Iteration for Multi-Objective and Partially Observable MDPsDiederik M. Roijers, Erwin Walraven, Matthijs T. J. Spaan. 218-226 [doi]
- Two-Oracle Optimal Path Planning on Grid MapsMatteo Salvetti, Adi Botea, Alfonso Emilio Gerevini, Daniel Harabor, Alessandro Saetti. 227-231 [doi]
- Representing and Planning with Interacting Actions and PrivacyShashank Shekhar, Ronen I. Brafman. 232-240 [doi]
- Simulated Penetration Testing as Contingent PlanningDorin Shmaryahu, Guy Shani, Jörg Hoffmann 0001, Marcel Steinmetz. 241-249 [doi]
- Symbolic Planning with Edge-Valued Multi-Valued Decision DiagramsDavid Speck, Florian Geißer, Robert Mattmüller. 250-258 [doi]
- Online Algorithms for POMDPs with Continuous State, Action, and Observation SpacesZachary N. Sunberg, Mykel J. Kochenderfer. 259-263 [doi]
- Integrating Resource Management and Timeline-Based PlanningAlessandro Umbrico, Amedeo Cesta, Marta Cialdea Mayer, Andrea Orlandini. 264-272 [doi]
- An On-Line Planner for POMDPs with Large Discrete Action Space: A Quantile-Based ApproachErli Wang, Hanna Kurniawati, Dirk P. Kroese. 273-277 [doi]
- Plan Relaxation via Action Debinding and DeorderingMax Waters, Bernhard Nebel, Lin Padgham, Sebastian Sardiña. 278-287 [doi]
- On Stubborn Sets and Planning with ResourcesAnna Wilhelm, Marcel Steinmetz, Jörg Hoffmann 0001. 288-297 [doi]
- A Hybrid Genetic Algorithm for Parallel Machine Scheduling at Semiconductor Back-End ProductionJelle Adan, Ivo J. B. F. Adan, Alp Akcay, Rick Van den Dobbelsteen, Joep Stokkermans. 298-302 [doi]
- CHAP-E: A Plan Execution Assistant for PilotsJ. Benton, David Smith, John Kaneshige, Leslie Keely, Thomas Stucky. 303-311 [doi]
- Embedding a Scheduler in Execution for a Planetary RoverWayne Chi, Steve A. Chien, Jagriti Agrawal, Gregg Rabideau, Edward Benowitz, Daniel M. Gaines, Elyse Fosse, Stephen Kuhn, James Biehl. 312-320 [doi]
- Aligning Partially-Ordered Process-Execution Traces and Models Using Automated PlanningMassimiliano de Leoni, Giacomo Lanciano, Andrea Marrella. 321-329 [doi]
- Reserved Optimisation: Handling Incident Priorities in Emergency Response SystemsMuralidhar Konda, Supriyo Ghosh, Pradeep Varakantham. 330-338 [doi]
- Footprint Placement for Mosaic Imaging by Sampling and OptimizationScott A. Mitchell, Christopher G. Valicka, Stephen Rowe, Simon X. Zou. 339-346 [doi]
- A Scheduling Tool for Bridging the Gap Between Aircraft Design and Aircraft ManufacturingCédric Pralet, Stéphanie Roussel, Thomas Polacsek, François Bouissière, Claude Cuiller, Pierre-Eric Dereux, Stéphane Kersuzan, Marc Lelay. 347-355 [doi]
- Route Planning with Breaks and Truck Driving Bans Using Time-Dependent Contraction HierarchiesMarieke S. van der Tuin, Mathijs de Weerdt, G. Veit Batz. 356-365 [doi]
- Comparing and Integrating Constraint Programming and Temporal Planning for Quantum Circuit CompilationKyle E. C. Booth, Minh Do, J. Christopher Beck, Eleanor G. Rieffel, Davide Venturelli, Jeremy Frank. 366-374 [doi]
- Bounded Rank Optimization for Effective and Efficient Emergency ResponsePallavi Manohar, Pradeep Varakantham, Hoong Chuin Lau. 375-382 [doi]
- Compiling Optimal Numeric Planning to Mixed Integer Linear ProgrammingChiara Piacentini, Margarita P. Castro, André Augusto Ciré, J. Christopher Beck. 383-387 [doi]
- The Integrated Last-Mile Transportation Problem (ILMTP)Arvind U. Raghunathan, David Bergman, John N. Hooker, Thiago Serra, Shingo Kobori. 388-398 [doi]
- Learning STRIPS Action Models with Classical PlanningDiego Aineto, Sergio Jiménez, Eva Onaindia. 399-407 [doi]
- Learning Generalized Reactive Policies Using Deep Neural NetworksEdward Groshev, Maxwell Goldstein, Aviv Tamar, Siddharth Srivastava 0001, Pieter Abbeel. 408-416 [doi]
- An Approximate Bayesian Reinforcement Learning Approach Using Robust Control Policy and Tree SearchToru Hishinuma, Kei Senda. 417-421 [doi]
- Training Deep Reactive Policies for Probabilistic Planning ProblemsMurugeswari Issakkimuthu, Alan Fern, Prasad Tadepalli. 422-430 [doi]
- A General Approach for Configuring PDDL Problem ModelsMauro Vallati, Ivan Serina. 431-436 [doi]
- A Local Search Approach to Observation Planning with Multiple UAVsArthur Bit-Monnot, Rafael Bailon-Ruiz, Simon Lacroix. 437-445 [doi]
- Monte-Carlo Planning for Agile Legged LocomotionPatrick Clary, Pedro Morais, Alan Fern, Jonathan Hurst. 446-450 [doi]
- Minimizing Movement to Establish the Connectivity of Randomly Deployed RobotsKazim Selim Engin, Volkan Isler. 451-458 [doi]
- Planning Robust Manual Tasks in Hierarchical Belief SpacesMichael William Lanighan, Takeshi Takahashi 0002, Roderic A. Grupen. 459-467 [doi]
- RMPD - A Recursive Mid-Point Displacement Algorithm for Path PlanningFangda Li, Ankit V. Manerikar, Avinash C. Kak. 468-475 [doi]
- Lazy Receding Horizon A* for Efficient Path Planning in Graphs with Expensive-to-Evaluate EdgesAditya Mandalika, Oren Salzman, Siddhartha Srinivasa. 476-484 [doi]
- A Loosely-Coupled Approach for Multi-Robot Coordination, Motion Planning and ControlFederico Pecora, Henrik Andreasson, Masoumeh Mansouri, Vilian Petkov. 485-493 [doi]
- AD*-Cut: A Search-Tree Cutting Anytime Dynamic A* AlgorithmMaciej Przybylski. 494-499 [doi]
- Effective Footstep Planning for Humanoids Using Homotopy-Class GuidanceVinitha Ranganeni, Oren Salzman, Maxim Likhachev. 500-508 [doi]
- ASP-Based Time-Bounded Planning for Logistics RobotsBjörn Schäpers, Tim Niemueller, Gerhard Lakemeyer, Martin Gebser, Torsten Schaub. 509-517 [doi]
- Handling Model Uncertainty and Multiplicity in Explanations via Model ReconciliationSarath Sreedharan, Tathagata Chakraborti, Subbarao Kambhampati. 518-526 [doi]
- The Factored Shortest Path Problem and Its Applications in RoboticsZhi Wang, Liron Cohen 0002, Sven Koenig, T. K. Satish Kumar. 527-531 [doi]
- A Log-Approximation for Coverage Path Planning with the Energy ConstraintMinghan Wei, Volkan Isler. 532 [doi]