Sciweavers

350 search results - page 43 / 70
» Complexity of Planning with Partial Observability
Sort
View
ICGI
2000
Springer
13 years 11 months ago
Computation of Substring Probabilities in Stochastic Grammars
Abstract. The computation of the probability of string generation according to stochastic grammars given only some of the symbols that compose it underlies pattern recognition prob...
Ana L. N. Fred
FLAIRS
2008
13 years 10 months ago
State Space Compression with Predictive Representations
Current studies have demonstrated that the representational power of predictive state representations (PSRs) is at least equal to the one of partially observable Markov decision p...
Abdeslam Boularias, Masoumeh T. Izadi, Brahim Chai...
ICRA
2010
IEEE
133views Robotics» more  ICRA 2010»
13 years 6 months ago
Variable resolution decomposition for robotic navigation under a POMDP framework
— Partially Observable Markov Decision Processes (POMDPs) offer a powerful mathematical framework for making optimal action choices in noisy and/or uncertain environments, in par...
Robert Kaplow, Amin Atrash, Joelle Pineau
ICRA
2010
IEEE
120views Robotics» more  ICRA 2010»
13 years 6 months ago
Probabilistic search with agile UAVs
— Through their ability to rapidly acquire aerial imagery, Unmanned Aerial Vehicles (UAVs) have the potential to aid target search tasks. Many of the core algorithms which are us...
Sonia Waharte, Andrew Colquhoun Symington, Niki Tr...
ICMLA
2009
13 years 5 months ago
Sensitivity Analysis of POMDP Value Functions
In sequential decision making under uncertainty, as in many other modeling endeavors, researchers observe a dynamical system and collect data measuring its behavior over time. The...
Stéphane Ross, Masoumeh T. Izadi, Mark Merc...