263 search results - page 44 / 53 » Rigid Tree Automata |
ICRA
2000
IEEE
13 years 10 months ago
2000
IEEE
A simple and efficient randomized algorithm is presented for solving single-query path planning problems in high-dimensional configuration spaces. The method works by incrementall...
ATAL
2009
Springer
13 years 7 months ago
2009
Springer
Motion planning for mobile agents, such as robots, acting in the physical world is a challenging task, which traditionally concerns safe obstacle avoidance. We are interested in p...
PODS
2004
ACM
14 years 6 months ago
2004
ACM
Typechecking consists of statically verifying whether the output of an XML transformation is always conform to an output type for documents satisfying a given input type. We focus...
ATVA
2007
Springer
14 years 27 days ago
2007
Springer
Abstract. The bounded synthesis problem is to construct an implementation that satisfies a given temporal specification and a given bound on the number of states. We present a so...
CONCUR
2007
Springer
14 years 27 days ago
2007
Springer
We introduce strategy logic, a logic that treats strategies in two-player games as explicit first-order objects. The explicit treatment of strategies allows us to specify properti...