Sciweavers

27 search results - page 2 / 6
» Team Programming in Golog under Partial Observability
Sort
View
AAAI
1996
13 years 9 months ago
Computing Optimal Policies for Partially Observable Decision Processes Using Compact Representations
: Partially-observable Markov decision processes provide a very general model for decision-theoretic planning problems, allowing the trade-offs between various courses of actions t...
Craig Boutilier, David Poole
ATAL
2007
Springer
14 years 1 months ago
Subjective approximate solutions for decentralized POMDPs
A problem of planning for cooperative teams under uncertainty is a crucial one in multiagent systems. Decentralized partially observable Markov decision processes (DECPOMDPs) prov...
Anton Chechetka, Katia P. Sycara
AI
2011
Springer
12 years 11 months ago
Decentralized MDPs with sparse interactions
In this work, we explore how local interactions can simplify the process of decision-making in multiagent systems, particularly in multirobot problems. We review a recent decision-...
Francisco S. Melo, Manuela M. Veloso
ATAL
2009
Springer
14 years 2 months ago
Constraint-based dynamic programming for decentralized POMDPs with structured interactions
Decentralized partially observable MDPs (DEC-POMDPs) provide a rich framework for modeling decision making by a team of agents. Despite rapid progress in this area, the limited sc...
Akshat Kumar, Shlomo Zilberstein
KBS
2007
86views more  KBS 2007»
13 years 7 months ago
On-line monitoring of plan execution: A distributed approach
The paper introduces and formalizes a distributed approach for the model-based monitoring of the execution of a plan, where concurrent actions are carried on by a team of mobile r...
Roberto Micalizio, Pietro Torasso