Sciweavers

49 search results - page 3 / 10
» An Iterative Algorithm for Solving Constrained Decentralized...
Sort
View
JAIR
2008
145views more  JAIR 2008»
13 years 7 months ago
Communication-Based Decomposition Mechanisms for Decentralized MDPs
Multi-agent planning in stochastic environments can be framed formally as a decentralized Markov decision problem. Many real-life distributed problems that arise in manufacturing,...
Claudia V. Goldman, Shlomo Zilberstein
JAIR
2002
120views more  JAIR 2002»
13 years 7 months ago
Learning Geometrically-Constrained Hidden Markov Models for Robot Navigation: Bridging the Topological-Geometrical Gap
Hidden Markov models hmms and partially observable Markov decision processes pomdps provide useful tools for modeling dynamical systems. They are particularly useful for represent...
Hagit Shatkay, Leslie Pack Kaelbling
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...
ATAL
2007
Springer
13 years 11 months ago
Modeling plan coordination in multiagent decision processes
In multiagent planning, it is often convenient to view a problem as two subproblems: agent local planning and coordination. Thus, we can classify agent activities into two categor...
Ping Xuan
CORR
2012
Springer
286views Education» more  CORR 2012»
12 years 3 months ago
A Faster Algorithm for Solving One-Clock Priced Timed Games
One-clock priced timed games is a class of two-player, zero-sum, continuous-time games that was defined and thoroughly studied in previous works. We show that One-clock priced ti...
Thomas Dueholm Hansen, Rasmus Ibsen-Jensen, Peter ...