Sciweavers

519 search results - page 3 / 104
» A Meta-CSP Model for Optimal Planning
Sort
View
SIGMOD
2011
ACM
267views Database» more  SIGMOD 2011»
12 years 10 months ago
A latency and fault-tolerance optimizer for online parallel query plans
We address the problem of making online, parallel query plans fault-tolerant: i.e., provide intra-query fault-tolerance without blocking. We develop an approach that not only achi...
Prasang Upadhyaya, YongChul Kwon, Magdalena Balazi...
CORR
2011
Springer
135views Education» more  CORR 2011»
13 years 2 months ago
Planning with Partial Preference Models
In many real-world planning scenarios, the users are interested in optimizing multiple objectives (such as makespan and execution cost), but are unable to express their exact trad...
Tuan A. Nguyen, Minh Binh Do, Alfonso Gerevini, Iv...
ML
2002
ACM
143views Machine Learning» more  ML 2002»
13 years 7 months ago
A Sparse Sampling Algorithm for Near-Optimal Planning in Large Markov Decision Processes
An issue that is critical for the application of Markov decision processes MDPs to realistic problems is how the complexity of planning scales with the size of the MDP. In stochas...
Michael J. Kearns, Yishay Mansour, Andrew Y. Ng
ICPR
2010
IEEE
13 years 5 months ago
Online Next-Best-View Planning for Accuracy Optimization Using an Extended E-Criterion
Next-best-view (NBV) planning is an important aspect for three-dimensional (3D) reconstruction within controlled environments, such as a camera mounted on a robotic arm. NBV metho...
Michael Trummer, Christoph Munkelt, Joachim Denzle...
IJRR
2011
130views more  IJRR 2011»
12 years 11 months ago
LQG-MP: Optimized path planning for robots with motion uncertainty and imperfect state information
— This paper presents LQG-MP (linear-quadratic Gaussian motion planning), a new approach to robot motion planning that takes into account the sensors and the controller that will...
Jur van den Berg, Pieter Abbeel, Ken Goldberg