Sciweavers

42 search results - page 2 / 9
» Message-passing algorithms for large structured decentralize...
Sort
View
DAGM
2008
Springer
13 years 7 months ago
MAP-Inference for Highly-Connected Graphs with DC-Programming
The design of inference algorithms for discrete-valued Markov Random Fields constitutes an ongoing research topic in computer vision. Large state-spaces, none-submodular energy-fun...
Jörg H. Kappes, Christoph Schnörr
AAAI
2010
13 years 6 months ago
Finite-State Controllers Based on Mealy Machines for Centralized and Decentralized POMDPs
Existing controller-based approaches for centralized and decentralized POMDPs are based on automata with output known as Moore machines. In this paper, we show that several advant...
Christopher Amato, Blai Bonet, Shlomo Zilberstein
ATAL
2010
Springer
13 years 6 months ago
Point-based backup for decentralized POMDPs: complexity and new algorithms
Decentralized POMDPs provide an expressive framework for sequential multi-agent decision making. Despite their high complexity, there has been significant progress in scaling up e...
Akshat Kumar, Shlomo Zilberstein
IJCAI
2007
13 years 6 months ago
Memory-Bounded Dynamic Programming for DEC-POMDPs
Decentralized decision making under uncertainty has been shown to be intractable when each agent has different partial information about the domain. Thus, improving the applicabil...
Sven Seuken, Shlomo Zilberstein
ATAL
2009
Springer
13 years 12 months ago
Achieving goals in decentralized POMDPs
Coordination of multiple agents under uncertainty in the decentralized POMDP model is known to be NEXP-complete, even when the agents have a joint set of goals. Nevertheless, we s...
Christopher Amato, Shlomo Zilberstein