Sciweavers

97 search results - page 15 / 20
» An epsilon-Optimal Grid-Based Algorithm for Partially Observ...
Sort
View
IJCAI
2001
13 years 8 months ago
Complexity of Probabilistic Planning under Average Rewards
A general and expressive model of sequential decision making under uncertainty is provided by the Markov decision processes (MDPs) framework. Complex applications with very large ...
Jussi Rintanen
CDC
2008
IEEE
118views Control Systems» more  CDC 2008»
14 years 1 months ago
A density projection approach to dimension reduction for continuous-state POMDPs
Abstract— Research on numerical solution methods for partially observable Markov decision processes (POMDPs) has primarily focused on discrete-state models, and these algorithms ...
Enlu Zhou, Michael C. Fu, Steven I. Marcus
GECCO
2008
Springer
179views Optimization» more  GECCO 2008»
13 years 8 months ago
Emergent architecture in self organized swarm systems for military applications
Many sectors of the military are interested in Self-Organized (SO) systems because of their flexibility, versatility and economics. The military is researching and employing auto...
Dustin J. Nowak, Gary B. Lamont, Gilbert L. Peters...
ATAL
2007
Springer
14 years 1 months ago
Letting loose a SPIDER on a network of POMDPs: generating quality guaranteed policies
Distributed Partially Observable Markov Decision Problems (Distributed POMDPs) are a popular approach for modeling multi-agent systems acting in uncertain domains. Given the signi...
Pradeep Varakantham, Janusz Marecki, Yuichi Yabu, ...
ATAL
2006
Springer
13 years 11 months ago
Solving POMDPs using quadratically constrained linear programs
Developing scalable algorithms for solving partially observable Markov decision processes (POMDPs) is an important challenge. One promising approach is based on representing POMDP...
Christopher Amato, Daniel S. Bernstein, Shlomo Zil...