Sciweavers

595 search results - page 49 / 119
» Predictive State Representations with State Space Partitioni...
Sort
View
AIPS
1994
15 years 20 hour ago
Solving Time-critical Decision-making Problems with Predictable Computational Demands
In this work we present an approach to solving time-critical decision-making problems by taking advantage of domain structure to expand the amountof time available for processing ...
Thomas Dean, Lloyd Greenwald
AAAI
2000
15 years 1 days ago
Localizing Search in Reinforcement Learning
Reinforcement learning (RL) can be impractical for many high dimensional problems because of the computational cost of doing stochastic search in large state spaces. We propose a ...
Gregory Z. Grudic, Lyle H. Ungar
ICRA
2007
IEEE
134views Robotics» more  ICRA 2007»
15 years 5 months ago
Grasping POMDPs
Abstract— We provide a method for planning under uncertainty for robotic manipulation by partitioning the configuration space into a set of regions that are closed under complia...
Kaijen Hsiao, Leslie Pack Kaelbling, Tomás ...
AUTOMATICA
1999
62views more  AUTOMATICA 1999»
14 years 10 months ago
Complexity of stability and controllability of elementary hybrid systems
In this paper, we consider simple classes of nonlinear systems and prove that basic questions related to their stability and controllability are either undecidable or computationa...
Vincent D. Blondel, John N. Tsitsiklis
IJRR
2010
162views more  IJRR 2010»
14 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...