|
Volumn , Issue , 2005, Pages 1594-1600
|
Solving multiagent markov decision processes: A forest management example
|
Author keywords
Multiagent reinforcement learning; Multiagent systems; Stochastic dynamic programming
|
Indexed keywords
COMPLEXITY LEVELS;
DESIGNING AGENTS;
FINITE NUMBER;
FIXED COST;
GLOBAL PROBLEMS;
LEARNING METHODS;
MARKOV DECISION PROBLEM;
MARKOV DECISION PROCESSES;
MEMORY SPACE;
MULTI-AGENT REINFORCEMENT LEARNING;
MULTI-STAND;
MULTIAGENT REINFORCEMENT LEARNING ALGORITHM;
NEAR-OPTIMAL POLICIES;
NEAR-OPTIMAL SOLUTIONS;
OPTIMAL DECISION MAKING;
OPTIMAL POLICIES;
OPTIMAL SOLUTIONS;
OPTIMAL STRATEGIES;
PLANNING ALGORITHMS;
PLANNING METHOD;
REINFORCEMENT LEARNING TECHNIQUES;
REWARD FUNCTION;
SCHNEIDER;
SEQUENTIAL DECISION MAKING;
SIMULATION TECHNIQUE;
SMALL SIZE;
STOCHASTIC DYNAMIC PROGRAMMING;
SUB-PROBLEMS;
MULTI-AGENT MARKOV DECISION PROCESS;
CONVERGENCE OF NUMERICAL METHODS;
COST ACCOUNTING;
DECISION MAKING;
DYNAMIC PROGRAMMING;
FORESTRY;
LEARNING ALGORITHMS;
MARKOV PROCESSES;
MULTI AGENT SYSTEMS;
OPTIMAL SYSTEMS;
OPTIMIZATION;
PLANT EXTRACTS;
REINFORCEMENT;
REINFORCEMENT LEARNING;
BEHAVIORAL RESEARCH;
LEARNING SYSTEMS;
PROBLEM SOLVING;
LEARNING ALGORITHMS;
|
EID: 80053116521
PISSN: None
EISSN: None
Source Type: Conference Proceeding
DOI: None Document Type: Conference Paper |
Times cited : (5)
|
References (13)
|