Unavoidable deadends in deterministic partially observable contingent planning. | 0 | 0.34 | 2023 |
Verifying Plans and Scripts for Robotics Tasks Using Performance Level Profiles. | 0 | 0.34 | 2021 |
Reinforcement Learning With Non-Markovian Rewards | 0 | 0.34 | 2020 |
Learning and Solving Regular Decision Processes | 0 | 0.34 | 2020 |
Planning for LTLf /LDLf Goals in Non-Markovian Fully Observable Nondeterministic Domains. | 0 | 0.34 | 2019 |
Regular Decision Processes - A Model for Non-Markovian Domains. | 0 | 0.34 | 2019 |
Regular Decision Processes: Modelling Dynamic Systems without Using Hidden Variables | 0 | 0.34 | 2019 |
Privacy Preserving Multi-Agent Planning with Provable Guarantees. | 0 | 0.34 | 2018 |
A Planning Approach to Monitoring Computer Programs' Behavior. | 0 | 0.34 | 2018 |
LTLf/LDLf Non-Markovian Rewards. | 0 | 0.34 | 2018 |
Representing and Planning with Interacting Actions and Privacy. | 1 | 0.35 | 2018 |
A Planning Approach to Monitoring Behavior of Computer Programs. | 0 | 0.34 | 2017 |
Service Composition in Stochastic Settings. | 0 | 0.34 | 2017 |
Specifying Non-Markovian Rewards in MDPs Using LDL on Finite Traces (Preliminary Version). | 0 | 0.34 | 2017 |
Interactions between knowledge and time in a first-order logic for multi-agent systems: completeness results | 7 | 0.50 | 2014 |
A heuristic search approach to planning with continuous resources in stochastic domains | 20 | 0.78 | 2014 |
Cooperative Monitoring to Diagnose Multiagent Plans. | 7 | 0.42 | 2014 |
Optimal ordering of independent tests with precedence constraints | 6 | 0.59 | 2014 |
Distributed Heuristic Forward Search for Multi-agent Planning. | 25 | 1.07 | 2014 |
Partially Observable Online Contingent Planning Using Landmark Heuristics. | 8 | 0.50 | 2014 |
On the complexity of planning for agent teams and its implications for single agent planning | 23 | 0.90 | 2013 |
Distributed Heuristic Forward Search for Multi-Agent Systems. | 6 | 0.48 | 2013 |
Structured reachability analysis for Markov decision processes | 20 | 2.24 | 2013 |
Introducing variable importance tradeoffs into CP-nets | 53 | 3.22 | 2013 |
Compiling Conformant Probabilistic Planning Problems into Classical Planning. | 5 | 0.41 | 2013 |
UCP-Networks: A Directed Graphical Representation of Conditional Utilities | 89 | 6.65 | 2013 |
Qualitative Planning under Partial Observability in Multi-Agent Domains. | 6 | 0.46 | 2013 |
Multi-agent A* for parallel and distributed systems | 22 | 1.34 | 2012 |
Multi-agent A* for parallel and distributed systems | 0 | 0.34 | 2012 |
A Multi-Path Compilation Approach to Contingent Planning. | 15 | 0.68 | 2012 |
Replanning in Domains with Partial Information and Sensing Actions. | 23 | 0.87 | 2012 |
Tunneling and Decomposition-Based State Reduction for Optimal Planning. | 9 | 0.54 | 2012 |
Compact value-function representations for qualitative preferences | 13 | 0.76 | 2012 |
Structure and Complexity in Planning with Unary Operators | 46 | 2.49 | 2011 |
On graphical modeling of preference and importance | 88 | 3.61 | 2011 |
Learning to Coordinate Efficiently: a model-based approach | 13 | 0.93 | 2011 |
Partial-order planning with concurrent interacting actions | 49 | 2.21 | 2011 |
Acquiring word-meaning mappings for natural language interfaces | 14 | 1.44 | 2011 |
Extended Lifted Inference with Joint Formulas | 10 | 0.76 | 2011 |
The Minimal Seed Set Problem. | 0 | 0.34 | 2011 |
Replanning in domains with partial information and sensing actions | 12 | 0.65 | 2011 |
The Next Best Solution. | 1 | 0.36 | 2011 |
Designing with interactive example galleries | 48 | 2.42 | 2010 |
A general, fully distributed multi-agent planning algorithm | 36 | 1.38 | 2010 |
Planning Games | 6 | 0.67 | 2009 |
Directional Decomposition of Multiattribute Utility Functions | 3 | 0.45 | 2009 |
Preference Handling - An Introductory Tutorial | 41 | 1.44 | 2009 |
Prioritizing Point-Based POMDP Solvers | 15 | 0.80 | 2008 |
Relational preference rules for control | 5 | 0.52 | 2008 |
Graphically structured value-function compilation | 11 | 0.54 | 2008 |