Sciweavers

2005 search results - page 329 / 401
» Decisive Markov Chains
Sort
View
AIPS
2007
15 years 2 months ago
Discovering Relational Domain Features for Probabilistic Planning
In sequential decision-making problems formulated as Markov decision processes, state-value function approximation using domain features is a critical technique for scaling up the...
Jia-Hong Wu, Robert Givan
AAAI
2008
15 years 2 months ago
Maximum Entropy Inverse Reinforcement Learning
Recent research has shown the benefit of framing problems of imitation learning as solutions to Markov Decision Problems. This approach reduces learning to the problem of recoveri...
Brian Ziebart, Andrew L. Maas, J. Andrew Bagnell, ...
AAAI
2006
15 years 1 months ago
Compact, Convex Upper Bound Iteration for Approximate POMDP Planning
Partially observable Markov decision processes (POMDPs) are an intuitive and general way to model sequential decision making problems under uncertainty. Unfortunately, even approx...
Tao Wang, Pascal Poupart, Michael H. Bowling, Dale...
ICIS
2003
15 years 1 months ago
A Computational Approach to Compare Information Revelation Policies
Revelation policies in an e-marketplace differ in terms of the level of competitive information disseminated to participating sellers. Since sellers who repeatedly compete against...
Amy R. Greenwald, Karthik Kannan, Ramayya Krishnan
UAI
2003
15 years 1 months ago
The Revisiting Problem in Mobile Robot Map Building: A Hierarchical Bayesian Approach
We present an application of hierarchical Bayesian estimation to robot map building. The revisiting problem occurs when a robot has to decide whether it is seeing a previously-bui...
Benjamin Stewart, Jonathan Ko, Dieter Fox, Kurt Ko...