Sciweavers

280 search results - page 8 / 56
» Planning for Markov Decision Processes with Sparse Stochasti...
Sort
View
JAIR
2008
130views more  JAIR 2008»
14 years 9 months ago
Online Planning Algorithms for POMDPs
Partially Observable Markov Decision Processes (POMDPs) provide a rich framework for sequential decision-making under uncertainty in stochastic domains. However, solving a POMDP i...
Stéphane Ross, Joelle Pineau, Sébast...
ORL
2006
87views more  ORL 2006»
14 years 9 months ago
SPAR: stochastic programming with adversarial recourse
We consider a general adversarial stochastic optimization model. Our model involves the design of a system that an adversary may subsequently attempt to destroy or degrade. We int...
Matthew D. Bailey, Steven M. Shechter, Andrew J. S...
GLVLSI
2005
IEEE
118views VLSI» more  GLVLSI 2005»
15 years 3 months ago
A continuous time markov decision process based on-chip buffer allocation methodology
We have presented an optimal on-chip buffer allocation and buffer insertion methodology which uses stochastic models of the architecture. This methodology uses finite buffer s...
Sankalp Kallakuri, Nattawut Thepayasuwan, Alex Dob...
FORMATS
2006
Springer
15 years 1 months ago
A Characterization of Meaningful Schedulers for Continuous-Time Markov Decision Processes
Abstract. Continuous-time Markov decision process are an important variant of labelled transition systems having nondeterminism through labels and stochasticity through exponential...
Nicolás Wolovick, Sven Johr
ICRA
2006
IEEE
134views Robotics» more  ICRA 2006»
15 years 3 months ago
Hierarchical Map Building and Planning based on Graph Partitioning
— Mobile robot localization and navigation requires a map - the robot’s internal representation of the environment. A common problem is that path planning becomes very ineffic...
Zoran Zivkovic, Bram Bakker, Ben J. A. Kröse