| Validation of Hierarchical Plans via Parsing of Attribute Grammars
|
2018 |
Barták, Roman |
| A TIL-Relaxed Heuristic for Planning with Time Windows
|
2018 |
Allard, Tony |
| Temporal Planning While the Clock Ticks
|
2018 |
Cashmore, Michael |
| Compact Policies for Fully-Observable Non-Deterministic Planning as SAT
|
2018 |
Geffner, Tomas |
| Strong Stubborn Sets for Efficient Goal Recognition Design
|
2018 |
Keren, Sarah |
| Planning for Partial Observability by SAT and Graph Constraints
|
2018 |
Pandey, Binda |
| Symmetry-Based Task Reduction for Relaxed Reachability Analysis
|
2018 |
Röger, Gabriele |
| Bootstrapping LPs in Value Iteration for Multi-Objective and Partially Observable MDPs
|
2018 |
Roijers, Diederik M. |
| An On-Line Planner for POMDPs with Large Discrete Action Space: A Quantile-Based Approach
|
2018 |
Wang, Erli |
| On Stubborn Sets and Planning with Resources
|
2018 |
Wilhelm, Anna |
| Aligning Partially-Ordered Process-Execution Traces and Models Using Automated Planning
|
2018 |
Leoni, Massimiliano de |
| Comparing and Integrating Constraint Programming and Temporal Planning for Quantum Circuit Compilation
|
2018 |
Booth, Kyle E. C. |
| Compiling Optimal Numeric Planning to Mixed Integer Linear Programming
|
2018 |
Piacentini, Chiara |
| An Approximate Bayesian Reinforcement Learning Approach Using Robust Control Policy and Tree Search
|
2018 |
Hishinuma, Toru |
| Learning Generalized Reactive Policies Using Deep Neural Networks
|
2018 |
Groshev, Edward |
| A General Approach for Configuring PDDL Problem Models
|
2018 |
Vallati, Mauro |
| A Proof System for Unsolvable Planning Tasks
|
2018 |
Eriksson, Salome€ |
| Algorithms and Conditional Lower Bounds for Planning Problems
|
2018 |
Chatterjee, Krishnendu |
| Adding Heuristics to Conflict-Based Search for Multi-Agent Path Finding
|
2018 |
Feiner, Ariel |
| MS-Lite: A Lightweight, Complementary Merge-and-Shrink Method
|
2018 |
Fan, Gaojian |
Tag hinzufügen