Sciweavers

268 search results - page 26 / 54
» Solving multiagent assignment Markov decision processes
Sort
View
ICML
2007
IEEE
14 years 10 months ago
Conditional random fields for multi-agent reinforcement learning
Conditional random fields (CRFs) are graphical models for modeling the probability of labels given the observations. They have traditionally been trained with using a set of obser...
Xinhua Zhang, Douglas Aberdeen, S. V. N. Vishwanat...
ATAL
2006
Springer
14 years 1 months ago
Winning back the CUP for distributed POMDPs: planning over continuous belief spaces
Distributed Partially Observable Markov Decision Problems (Distributed POMDPs) are evolving as a popular approach for modeling multiagent systems, and many different algorithms ha...
Pradeep Varakantham, Ranjit Nair, Milind Tambe, Ma...

Publication
233views
12 years 8 months ago
Sparse reward processes
We introduce a class of learning problems where the agent is presented with a series of tasks. Intuitively, if there is relation among those tasks, then the information gained duri...
Christos Dimitrakakis
AIPS
2004
13 years 11 months ago
Decision-Theoretic Military Operations Planning
Military operations planning involves concurrent actions, resource assignment, and conflicting costs. Individual tasks sometimes fail with a known probability, promoting a decisio...
Douglas Aberdeen, Sylvie Thiébaux, Lin Zhan...
CLIMA
2011
12 years 9 months ago
Verifying Team Formation Protocols with Probabilistic Model Checking
Multi-agent systems are an increasingly important software paradigm and in many of its applications agents cooperate to achieve a particular goal. This requires the design of effi...
Taolue Chen, Marta Z. Kwiatkowska, David Parker, A...