2693 search results - page 6 / 539 » On Computing Complex Navigation Functions |
JAIR
2000
13 years 9 months ago
2000
Partially observable Markov decision processes (POMDPs) provide an elegant mathematical framework for modeling complex decision and planning problems in stochastic domains in whic...
ICRA
2006
IEEE
14 years 3 months ago
2006
IEEE
— A distributed feedback control architecture that guarantees collision avoidance and destination convergence for multiple sphere world holonomic agents is presented. The well es...
RAS
2006
13 years 9 months ago
2006
Humans have a remarkable ability to navigate using only vision, but mobile robots have not been nearly as successful. We propose a new approach to vision-guided local navigation, ...
CIE
2010
Springer
14 years 2 months ago
2010
Springer
In this note, we use lower bounds on Boolean multiplicative complexity to prove lower bounds on Boolean circuit complexity. We give a very simple proof of a 7n/3 − c lower bound ...
SIGGRAPH
1990
ACM
14 years 1 months ago
1990
ACM
We presenta real-time robot motion plannerthatis fastandcomplete to a resolution. The technique is guaranteed to find a path if one exists at the resolution, and all paths returne...