131 citations · 137 across the 3 of their papers we have counts for
3 papers
cs.AI2016
Instrumenting an SMT Solver to Solve Hybrid Network Reachability Problems
Daniel Bryce, Sergiy Bogomolov, Alexander Heinz +1
PDDL+ planning has its semantics rooted in hybrid automata (HA) and recent work has shown that it can be modeled as a network of HAs. Addressing the complexity of nonlinear PDDL+ p…
cs.AI2012★ 6 cited
Cost Sensitive Reachability Heuristics for Handling State Uncertainty
Daniel Bryce, Subbarao Kambhampati
While POMDPs provide a general platform for non-deterministic conditional planning under a variety of quality metrics they have limited scalability. On the other hand, non-determin…
cs.AI2011★ 131 cited
Planning Graph Heuristics for Belief Space Search
D. Bryce, S. Kambhampati, D. E. Smith
Some recent works in conditional planning have proposed reachability heuristics to improve planner scalability, but many lack a formal description of the properties of their distan…