Search

Search Results

• An Empirical Study of Perfect Potential Heuristics

  Augusto B. Correa, Florian Pommerening

  114-118

  2019-07-05

• Stochastic Planning with Lifted Symbolic Trajectory Optimization

  Hao Cui, Thomas Keller, Roni Khardon

  119-127

  2019-07-05

• Mixed Discrete Continuous Non-Linear Planning through Piecewise Linear Approximation

  Elad Denenberg, Amanda Coles

  137-145

  2019-07-05

• An Exact Algorithm to Make a Trade-Off between Cost and Probability in SSPs

  Valdinei Freire, Karina Valdivia Delgado, Willy Arthur Silva Reis

  146-154

  2019-07-05

• Lazy CBS: Implicit Conflict-Based Search Using Lazy Clause Generation

  Graeme Gange, Daniel Harabor, Peter J. Stuckey

  155-162

  2019-07-05

• Best-First Width Search for Multi Agent Privacy-Preserving Planning

  Alfonso E. Gerevini, Nir Lipovetzky, Francesco Percassi, Alessandro Saetti, Ivan Serina

  163-171

  2019-07-05

• On the Relation between Star-Topology Decoupling and Petri Net Unfolding

  Daniel Gnad, Jorg Hoffmann

  172-180

  2019-07-05

• A Multi-Label A* Algorithm for Multi-Agent Pathfinding

  Florian Grenouilleau, Willem-Jan van Hoeve, J. N. Hooker

  181-185

  2019-07-05

• Tabu-Based Large Neighbourhood Search for Time/Sequence-Dependent Scheduling Problems with Time Windows

  Lei He, Mathijs de Weerdt, Neil Yorke-Smith

  186-194

  2019-07-05

• Temporal Planning as Refinement-Based Model Checking

  Alexander Heinz, Martin Wehrle, Sergiy Bogomolov, Daniele Magazzeni, Marius Greitschus, Andreas Podelski

  195-199

  2019-07-05

• Using Bi-Directional Information Exchange to Improve Decentralized Schedule-Driven Traffic Control

  Hsu-Chieh Hu, Stephen F. Smith

  200-208

  2019-07-05

• Improving the Combination of JPS and Geometric Containers

  Yue Hu, Daniel Harabor, Long Qin, Quanjun Yin, Cong Hu

  209-213

  2019-07-05

• Online Risk-Bounded Motion Planning for Autonomous Vehicles in Dynamic Environments

  Xin Huang, Sungkweon Hong, Andreas Hofmann, Brian C. Williams

  214-222

  2019-07-05

• Propagating Piecewise-Linear Weights in Temporal Networks

  Luke Hunsberger, Roberto Posenato

  223-231

  2019-07-05

• Planning with Global State Constraints and State-Dependent Action Costs

  Franc Ivankovic, Dan Gordon, Patrik Haslum

  232-236

  2019-07-05

• Oversubscription Planning as Classical Planning with Multiple Cost Functions

  Michael Katz, Emil Keyder, Dominik Winterer, Florian Pommerening

  237-245

  2019-07-05

• Efficient Heuristic Search for Optimal Environment Redesign

  Sarah Keren, Luis Pineda, Avigdor Gal, Erez Karpas, Shlomo Zilberstein

  246-254

  2019-07-05

• On the Pathological Search Behavior of Distributed Greedy Best-First Search

  Ryo Kuroiwa, Alex Fukunaga

  255-263

  2019-07-05

• Measuring and Optimizing Durability against Scheduling Disturbances

  Joon Young Lee, Vivaswat Ojha, James C. Boerkoel Jr

  264-268

  2019-07-05

• Disjoint Splitting for Multi-Agent Path Finding with Conflict-Based Search

  Jiaoyang Li, Daniel Harabor, Peter J. Stuckey, Ariel Felner, Hang Ma, Sven Koenig

  279-283

  2019-07-05

• Using FastMap to Solve Graph Problems in a Euclidean Space

  Jiaoyang Li, Ariel Felner, Sven Koenig, T. K. Satish Kumar

  273-278

  2019-07-05

• Error-Tolerant Anytime Approach to Plan Recognition Using a Particle Filter

  Jean Massardi, Mathieu Gravel, Éric Beaudry

  284-291

  2019-07-05

• Discovery of Optimal Solution Horizons in Non-Stationary Markov Decision Processes with Unbounded Rewards

  Grigory Neustroev, Mathijs de Weerdt, Remco Verzijlbergh

  292-300

  2019-07-05

• A Multi-Agent Framework to Solve Energy-Aware Unrelated Parallel Machine Scheduling Problems with Machine-Dependent Energy Consumption and Sequence-Dependent Setup Time

  Giancarlo Nicolò, Sergio Ferrer, Miguel A. Salido, Adriana Giret, Federico Barber

  301-309

  2019-07-05

• Eliminating Redundant Actions in Partially Ordered Plans — A Complexity Analysis

  Conny Olz, Pascal Bercher

  310-319

  2019-07-05