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...
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...
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...
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 ...
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...