Search

Search Results

• Computing Opportunities to Augment Plans for Novel Replanning during Execution

  Daniel Borrajo, Manuela Veloso

  51-55

  2021-05-17

• Explaining Path Plan Optimality: Fast Explanation Methods for Navigation Meshes Using Full and Incremental Inverse Optimization

  Martim Brandão, Amanda Coles, Daniele Magazzeni

  56-64

  2021-05-17

• Exploiting Cyclic Dependencies in Landmark Heuristics

  Clemens Büchner, Thomas Keller, Malte Helmert

  65-73

  2021-05-17

• Fully Observable Nondeterministic HTN Planning -- Formalisation and Complexity Results

  Dillon Chen, Pascal Bercher

  74-84

  2021-05-17

• S*: A Heuristic Information-Based Approximation Framework for Multi-Goal Path Finding

  Kenny Chour, Sivakumar Rathinam, Ramamoorthi Ravi

  85-93

  2021-05-17

• Delete-Relaxation Heuristics for Lifted Classical Planning

  Augusto B. Corrêa, Guillem Francès, Florian Pommerening, Malte Helmert

  94-102

  2021-05-17

• Improving AlphaZero Using Monte-Carlo Graph Search

  Johannes Czech, Patrick Korus, Kristian Kersting

  103-111

  2021-05-17

• OMCoRP: An Online Mechanism for Competitive Robot Prioritization

  Sankar Narayan Das, Swaprava Nath, Indranil Saha

  112-121

  2021-05-17

• Compositional Approach to Translate LTLf/LDLf into Deterministic Finite Automata

  Giuseppe De Giacomo, Marco Favorito

  122-130

  2021-05-17

• Subset-Saturated Transition Cost Partitioning

  Dominik Drexler, Jendrik Seipp, David Speck

  131-139

  2021-05-17

• Multiple Plans are Better than One: Diverse Stochastic Planning

  Mahsa Ghasemi, Evan Scope Crafts, Bo Zhao, Ufuk Topcu

  140-148

  2021-05-17

• Approximate Bi-Criteria Search by Efficient Representation of Subsets of the Pareto-Optimal Frontier

  Boris Goldin, Oren Salzman

  149-158

  2021-05-17

• Translating Totally Ordered HTN Planning Problems to Classical Planning Problems Using Regular Approximation of Context-Free Languages

  Daniel Höller

  159-167

  2021-05-17

• Loop Detection in the PANDA Planning System

  Daniel Höller, Gregor Behnke

  168-173

  2021-05-17

• Endomorphisms of Lifted Planning Problems

  Rostislav Horčík, Daniel Fišer

  174-183

  2021-05-17

• Jump Point Search with Temporal Obstacles

  Shuli Hu, Daniel D. Harabor, Graeme Gange, Peter J. Stuckey, Nathan R. Sturtevant

  184-191

  2021-05-17

• Total Completion Time Minimization for Scheduling with Incompatibility Cliques

  Klaus Jansen, Alexandra Lassota, Marten Maack, Tytus Pikies

  192-200

  2021-05-17

• Pattern Databases for Goal-Probability Maximization in Probabilistic Planning

  Thorsten Klößner, Jörg Hoffmann, Marcel Steinmetz, Álvaro Torralba

  201-209

  2021-05-17

• LM-cut and Operator Counting Heuristics for Optimal Numeric Planning with Simple Conditions

  Ryo Kuroiwa, Alexander Shleyfman, Chiara Piacentini, Margarita P. Castro, J. Christopher Beck

  210-218

  2021-05-17

• Width-Based Backward Search

  Chao Lei, Nir Lipovetzky

  219-224

  2021-05-17

• Decentralized Refinement Planning and Acting

  Ruoxi Li, Sunandita Patra, Dana S. Nau

  225-233

  2021-05-17

• A Competitive Analysis of Online Multi-Agent Path Finding

  Hang Ma

  234-242

  2021-05-17

• Rule-based Shielding for Partially Observable Monte-Carlo Planning

  Giulio Mazzi, Alberto Castellini, Alessandro Farinelli

  243-251

  2021-05-17

• Translations from Discretised PDDL+ to Numeric Planning

  Francesco Percassi, Enrico Scala, Mauro Vallati

  252-261

  2021-05-17

• Scheduling with Complete Multipartite Incompatibility Graph on Parallel Machines

  Tytus Pikies, Krzysztof Turowski, Marek Kubale

  262-270

  2021-05-17