Sciweavers

656 search results - page 29 / 132
» Complexity of finite-horizon Markov decision process problem...
Sort
View
ATMOS
2010
183views Optimization» more  ATMOS 2010»
15 years 25 days ago
The Complexity of Integrating Routing Decisions in Public Transportation Models
To model and solve optimization problems arising in public transportation, data about the passengers is necessary and has to be included in the models in any phase of the planning...
Marie Schmidt, Anita Schöbel
ICML
2004
IEEE
16 years 2 months ago
Utile distinction hidden Markov models
This paper addresses the problem of constructing good action selection policies for agents acting in partially observable environments, a class of problems generally known as Part...
Daan Wierstra, Marco Wiering
ICRA
2007
IEEE
134views Robotics» more  ICRA 2007»
15 years 8 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 ...
97
Voted
COLT
2000
Springer
15 years 6 months ago
Estimation and Approximation Bounds for Gradient-Based Reinforcement Learning
We model reinforcement learning as the problem of learning to control a Partially Observable Markov Decision Process (  ¢¡¤£¦¥§  ), and focus on gradient ascent approache...
Peter L. Bartlett, Jonathan Baxter
113
Voted
NIPS
2004
15 years 3 months ago
Learning first-order Markov models for control
First-order Markov models have been successfully applied to many problems, for example in modeling sequential data using Markov chains, and modeling control problems using the Mar...
Pieter Abbeel, Andrew Y. Ng