Sciweavers

914 search results - page 72 / 183
» The Computational Complexity of Probabilistic Planning
Sort
View
IROS
2008
IEEE
117views Robotics» more  IROS 2008»
14 years 5 months ago
Kinodynamic motion planning with hardware demonstrations
Abstract— This paper provides proof-of-concept that stateof-the-art sampling-based motion planners that are tightly integrated with a physics-based simulator can compute paths th...
Ioan Alexandru Sucan, Jonathan F. Kruse, Mark Yim,...
BMVC
2010
13 years 5 months ago
Multi-View Planning for Simultaneous Coverage and Accuracy Optimisation
View planning for three-dimensional (3D) reconstruction and inspection solves the problem of finding an efficient sequence of views allowing complete and high quality reconstructi...
Christoph Munkelt, Andreas Breitbarth, Gunther Not...
ISVC
2009
Springer
14 years 3 months ago
Deformable Proximity Queries and Their Application in Mobile Manipulation Planning
Abstract. We describe a proximity query algorithm for the exact minimum distance computation between arbitrarily shaped objects. Special characteristics of the Gilbert-Johnson-Keer...
Marc Gissler, Christian Dornhege, Bernhard Nebel, ...
IJCV
2000
180views more  IJCV 2000»
13 years 10 months ago
Probabilistic Models of Appearance for 3-D Object Recognition
We describe how to model the appearance of a 3-D object using multiple views, learn such a model from training images, and use the model for object recognition. The model uses pro...
Arthur R. Pope, David G. Lowe
IJRR
2010
162views more  IJRR 2010»
13 years 9 months ago
Planning under Uncertainty for Robotic Tasks with Mixed Observability
Partially observable Markov decision processes (POMDPs) provide a principled, general framework for robot motion planning in uncertain and dynamic environments. They have been app...
Sylvie C. W. Ong, Shao Wei Png, David Hsu, Wee Sun...