914 search results - page 45 / 183 » The Computational Complexity of Probabilistic Planning |
FCT
2005
Springer
14 years 4 months ago
2005
Springer
We present several results on the complexity of various forms of Sperner’s Lemma in the black-box model of computing. We give a deterministic algorithm for Sperner problems over ...
GLOBECOM
2006
IEEE
14 years 4 months ago
2006
IEEE
Abstract— For many evolving application scenarios like ubiquitous and autonomic computing systems, trustworthy computing solutions are essential. However the fact that the autono...
WADS
2001
Springer
14 years 3 months ago
2001
Springer
This paper investigates the problem of time-optimum movement planning in two and three dimensions for a point robot which has bounded control velocity through a set of n polygonal...
CVPR
1998
IEEE
15 years 17 days ago
1998
IEEE
This paper describes an interactive sensor planning system that can be used to select viewpoints subject to camera visibility, field of view and task constraints. Application area...
IROS
2009
IEEE
14 years 5 months ago
2009
IEEE
— In this paper, we present efficient solutions for planning motions of dual-arm manipulation and re-grasping tasks. Motion planning for such tasks on humanoid robots with a hig...