Search

Search Results

• Multiple-Environment Markov Decision Processes: Efficient Analysis and Applications

  Krishnendu Chatterjee, Martin Chmelík, Deep Karkhanis, Petr Novotný, Amélie Royer

  48-56

  2020-06-01

• Adaptive Informative Path Planning with Multimodal Sensing

  Shushman Choudhury, Nate Gruver, Mykel J. Kochenderfer

  57-65

  2020-06-01

• Multi-Tier Automated Planning for Adaptive Behavior

  Daniel Ciolek, Nicolás D'Ippolito, Alberto Pozanco, Sebastian Sardiña

  66-74

  2020-06-01

• Solving the Longest Simple Path Problem with Heuristic Search

  Yossi Cohen, Roni Stern, Ariel Felner

  75-79

  2020-06-01

• Lifted Successor Generation Using Query Optimization Techniques

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

  80-89

  2020-06-01

• Certified Unsolvability for SAT Planning with Property Directed Reachability

  Salomé Eriksson, Malte Helmert

  90-100

  2020-06-01

• EFP 2.0: A Multi-Agent Epistemic Solver with Multiple E-State Representations

  Francesco Fabiano, Alessandro Burigana, Agostino Dovier, Enrico Pontelli

  101-109

  2020-06-01

• Solving K-MDPs

  Jonathan Ferrer-Mestres, Thomas G. Dietterich, Olivier Buffet, Iadine Chadès

  110-118

  2020-06-01

• A Novel Lookahead Strategy for Delete Relaxation Heuristics in Greedy Best-First Search

  Maximilian Fickert

  119-123

  2020-06-01

• Strengthening Potential Heuristics with Mutexes and Disambiguations

  Daniel Fišer, Rostislav Horčík, Antonín Komenda

  124-133

  2020-06-01

• Online Computation of Euclidean Shortest Paths in Two Dimensions

  Ryan Hechenberger, Peter J Stuckey, Daniel Harabor, Pierre Le Bodic, Muhammad Aamir Cheema

  134-142

  2020-06-01

• A Simple and Fast Bi-Objective Search Algorithm

  Carlos Hernández Ulloa, William Yeoh, Jorge A. Baier, Han Zhang, Luis Suazo, Sven Koenig

  143-151

  2020-06-01

• Faster Dynamic-Consistency Checking for Conditional Simple Temporal Networks

  Luke Hunsberger, Roberto Posenato

  152-160

  2020-06-01

• Algorithm Selection for Optimal Multi-Agent Pathfinding

  Omri Kaduri, Eli Boyarski, Roni Stern

  161-165

  2020-06-01

• Sequencing Operator Counts with State-Space Search

  Wesley L. Kaizer, André G. Pereira, Marcus Ritt

  166-174

  2020-06-01

• Analyzing and Avoiding Pathological Behavior in Parallel Best-First Search

  Ryo Kuroiwa, Alex Fukunaga

  175-183

  2020-06-01

• New Valid Inequalities in Branch-and-Cut-and-Price for Multi-Agent Path Finding

  Edward Lam, Pierre Le Bodic

  184-192

  2020-06-01

• New Techniques for Pairwise Symmetry Breaking in Multi-Agent Path Finding

  Jiaoyang Li, Graeme Gange, Daniel Harabor, Peter J. Stuckey, Hang Ma, Sven Koenig

  193-201

  2020-06-01

• Efficient Robot Planning for Achieving Multiple Independent Partially Observable Tasks That Evolve over Time

  Anahita Mohseni-Kabir, Manuela Veloso, Maxim Likhachev

  202-211

  2020-06-01

• On the Computational Complexity of Multi-Agent Pathfinding on Directed Graphs

  Bernhard Nebel

  212-216

  2020-06-01

• Convex Hull Monte-Carlo Tree-Search

  Michael Painter, Bruno Lacerda, Nick Hawes

  217-225

  2020-06-01

• Search-Guidance Mechanisms for Numeric Planning Through Subgoaling Relaxation

  Enrico Scala, Alessandro Saetti, Ivan Serina, Alfonso E. Gerevini

  226-234

  2020-06-01

• POMDP + Information-Decay: Incorporating Defender's Behaviour in Autonomous Penetration Testing

  Jonathon Schwartz, Hanna Kurniawati, Edwin El-Mahassni

  235-243

  2020-06-01

• Incremental Search for Counterexample-Guided Cartesian Abstraction Refinement

  Jendrik Seipp, Samuel von Allmen, Malte Helmert

  244-248

  2020-06-01

• Solving the Watchman Route Problem on a Grid with Heuristic Search

  Shawn Seiref, Tamir Jaffey, Margarita Lopatin, Ariel Felner

  249-257

  2020-06-01