Sciweavers

268 search results - page 6 / 54
» Solving multiagent assignment Markov decision processes
Sort
View
ICTAI
2006
IEEE
14 years 3 months ago
A New Hybrid GA-MDP Algorithm For The Frequency Assignment Problem
We propose a novel algorithm called GA-MDP for solving the frequency assigment problem. GA-MDP inherits the spirit of genetic algorithms with an adaptation of Markov Decision Proc...
Lhassane Idoumghar, René Schott
ICML
2001
IEEE
14 years 10 months ago
Symmetry in Markov Decision Processes and its Implications for Single Agent and Multiagent Learning
This paper examines the notion of symmetry in Markov decision processes (MDPs). We define symmetry for an MDP and show how it can be exploited for more effective learning in singl...
Martin Zinkevich, Tucker R. Balch
ICONIP
2009
13 years 7 months ago
A Markov Model for Multiagent Patrolling in Continuous Time
Abstract. We present a model for the multiagent patrolling problem with continuous-time. An anytime and online algorithm is then described and extended to asynchronous multiagent d...
Jean-Samuel Marier, Camille Besse, Brahim Chaib-dr...
UAI
2004
13 years 11 months ago
Solving Factored MDPs with Continuous and Discrete Variables
Although many real-world stochastic planning problems are more naturally formulated by hybrid models with both discrete and continuous variables, current state-of-the-art methods ...
Carlos Guestrin, Milos Hauskrecht, Branislav Kveto...
AAAI
2006
13 years 11 months ago
Point-based Dynamic Programming for DEC-POMDPs
We introduce point-based dynamic programming (DP) for decentralized partially observable Markov decision processes (DEC-POMDPs), a new discrete DP algorithm for planning strategie...
Daniel Szer, François Charpillet