Sciweavers

62 search results - page 11 / 13
» Probabilistic inference for solving discrete and continuous ...
Sort
View
RSS
2007
136views Robotics» more  RSS 2007»
13 years 9 months ago
The Stochastic Motion Roadmap: A Sampling Framework for Planning with Markov Motion Uncertainty
— We present a new motion planning framework that explicitly considers uncertainty in robot motion to maximize the probability of avoiding collisions and successfully reaching a ...
Ron Alterovitz, Thierry Siméon, Kenneth Y. ...
UAI
2004
13 years 8 months ago
Dynamical Systems Trees
We propose dynamical systems trees (DSTs) as a flexible model for describing multiple processes that interact via a hierarchy of aggregating processes. DSTs extend nonlinear dynam...
Andrew Howard, Tony Jebara
AAAI
2006
13 years 8 months ago
Point-based Dynamic Programming for DEC-POMDPs
We introduce point-based dynamic programming (DP) for decentralized partially observable Markov decision processes (DEC-POMDPs), a new discrete DP algorithm for planning strategie...
Daniel Szer, François Charpillet
EUROS
2008
153views Robotics» more  EUROS 2008»
13 years 9 months ago
Adaptive Multiple Resources Consumption Control for an Autonomous Rover
Resources consumption control is crucial in the autonomous rover context. Most of the time, the resources consumption is probabilistic. During execution time, the rover has to adap...
Simon Le Gloannec, Abdel-Illah Mouaddib, Fran&cced...
CONCUR
2006
Springer
13 years 11 months ago
Strategy Improvement for Stochastic Rabin and Streett Games
A stochastic graph game is played by two players on a game graph with probabilistic transitions. We consider stochastic graph games with -regular winning conditions specified as Ra...
Krishnendu Chatterjee, Thomas A. Henzinger