Sciweavers

48 search results - page 1 / 10
» Interpolant-Based Transition Relation Approximation
Sort
View
CAV
2005
Springer
122views Hardware» more  CAV 2005»
13 years 9 months ago
Interpolant-Based Transition Relation Approximation
Abstract. In predicate abstraction, exact image computation is problematic, requiring in the worst case an exponential number of calls to a decision procedure. For this reason, sof...
Ranjit Jhala, Kenneth L. McMillan
ISRR
2005
Springer
211views Robotics» more  ISRR 2005»
13 years 9 months ago
Field D*: An Interpolation-Based Path Planner and Replanner
Abstract. We present an interpolation-based planning and replanning algorithm for generating smooth paths through non-uniform cost grids. Most grid-based path planners use discrete...
Dave Ferguson, Anthony Stentz
ICCBR
2007
Springer
13 years 9 months ago
An Analysis of Case-Based Value Function Approximation by Approximating State Transition Graphs
We identify two fundamental points of utilizing CBR for an adaptive agent that tries to learn on the basis of trial and error without a model of its environment. The first link co...
Thomas Gabel, Martin Riedmiller
AMAST
2006
Springer
13 years 7 months ago
Hyperfinite Approximations to Labeled Markov Transition Systems
The problem of finding an approximation to a labeled Markov transition system through hyperfinite transition systems is addressed. It is shown that we can find for each countable ...
Ernst-Erich Doberkat
CSFW
2007
IEEE
13 years 10 months ago
Approximated Computationally Bounded Simulation Relations for Probabilistic Automata
We study simulation relations for Probabilistic Automata that require transitions to be matched up to negligible sets provided that computation lengths are polynomially bounded. T...
Roberto Segala, Andrea Turrini