914 search results - page 22 / 183 » The Computational Complexity of Probabilistic Planning |
118
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
Abstract. Continuous first-order logic is used to apply model-theoretic analysis to analytic structures (e.g. Hilbert spaces, Banach spaces, probability spaces, etc.). Classical co...
136
click to vote
IROS
2009
IEEE
15 years 10 months ago
2009
IEEE
— In order to define an architecture for task and motion planning of a mobile robot, we propose the CellRRT path planner that combines the advantages of planning approaches by d...
115
click to vote
JCSS
2006
15 years 4 months ago
2006
We introduce the probabilistic class SBP which is defined in a BPP-like manner. This class emerges from BPP by keeping the promise of a probability gap but decreasing the probabil...
130
Voted
ISRR
2001
Springer
15 years 8 months ago
2001
Springer
This paper describes the foundations and algorithms of a new probabilistic roadmap (PRM) planner that is: (1) singlequery –i.e., it does not pre-compute a roadmap, but uses the ...
139
click to vote
COGSCI
2010
15 years 4 months ago
2010
Words are the essence of communication: they are the building blocks of any language. Learning the meaning of words is thus one of the most important aspects of language acquisiti...