Sciweavers

260 search results - page 50 / 52
» Quasi-Deterministic Partially Observable Markov Decision Pro...
Sort
View
MOBIHOC
2008
ACM
14 years 7 months ago
Routing in a cyclic mobispace
A key challenge of routing in delay tolerant networks (DTNs) is to find routes that have high delivery rates and low endto-end delays. When oracles are not available for future co...
Cong Liu, Jie Wu
AAAI
2010
13 years 9 months ago
Symbolic Dynamic Programming for First-order POMDPs
Partially-observable Markov decision processes (POMDPs) provide a powerful model for sequential decision-making problems with partially-observed state and are known to have (appro...
Scott Sanner, Kristian Kersting
INFFUS
2006
112views more  INFFUS 2006»
13 years 7 months ago
Target motion analysis and track association with a network of proximity sensors
Target motion analysis and track association are the aims of this paper. It is assumed that the target trajectory is only partially observable by using temporal processing of a si...
Régis Donati, Jean-Pierre Le Cadre
PROMAS
2004
Springer
14 years 27 days ago
Coordinating Teams in Uncertain Environments: A Hybrid BDI-POMDP Approach
Distributed partially observable Markov decision problems (POMDPs) have emerged as a popular decision-theoretic approach for planning for multiagent teams, where it is imperative f...
Ranjit Nair, Milind Tambe
IFM
2010
Springer
190views Formal Methods» more  IFM 2010»
13 years 6 months ago
On Model Checking Techniques for Randomized Distributed Systems
Abstract. The automata-based model checking approach for randomized distributed systems relies on an operational interleaving semantics of the system by means of a Markov decision ...
Christel Baier