Results 51 to 60 of about 26,957 (159)
Comparing Labelled Markov Decision Processes
35 pages, 7 ...
Stefan Kiefer, Qiyi Tang 0001
openaire +4 more sources
Factored Beliefs for Machine Agents in Decentralized Partially Observable Markov Decision Processes
A shared mental model (SMM) is a foundational structure in high performing, task-oriented teams and aid humans in determining their teammate's goals and intentions.
Joshua Lapso, Gilbert Peterson
doaj +1 more source
Communicating via Markov Decision Processes
ICML ...
Sokota, S +8 more
openaire +4 more sources
Markov Decision Processing Networks
We introduce Markov Decision Processing Networks (MDPNs) as a multiclass queueing network model where service is a controlled, finite-state Markov process. The model exhibits a decision-dependent service process where actions taken influence future service availability.
Sanidhay Bhambay +2 more
openaire +2 more sources
Robust Synchronization in Markov Decision Processes [PDF]
We consider synchronizing properties of Markov decision processes (MDP), viewed as generators of sequences of probability distributions over states. A probability distribution is p-synchronizing if the probability mass is at least p in some state, and a sequence of probability distributions is weakly p-synchronizing, or strongly p-synchronizing if ...
Doyen, Laurent +2 more
openaire +3 more sources
Bounded-parameter Markov decision processes
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Robert Givan +2 more
openaire +1 more source
Limit Synchronization in Markov Decision Processes [PDF]
Markov decision processes (MDP) are finite-state systems with both strategic and probabilistic choices. After fixing a strategy, an MDP produces a sequence of probability distributions over states. The sequence is eventually synchronizing if the probability mass accumulates in a single state, possibly in the limit.
Doyen, Laurent +2 more
openaire +3 more sources
Modeling Local Search Metaheuristics Using Markov Decision Processes
Local search metaheuristics like tabu search or simulated annealing are popular heuristic optimization algorithms for finding near-optimal solutions for combinatorial optimization problems.
Rubén Ruiz-Torrubiano +3 more
doaj +1 more source
Planning Under Uncertainty Applications in Power Plants Using Factored Markov Decision Processes
Due to its ability to deal with non-determinism and partial observability, represent goals as an immediate reward function and find optimal solutions, planning under uncertainty using factored Markov Decision Processes (FMDPs) has increased its ...
Alberto Reyes +3 more
doaj +1 more source
Algebraic Markov Decision Processes [PDF]
In this paper, we provide an algebraic approach to Markov Decision Processes (MDPs), which allows a unified treatment of MDPs and includes many existing models (quantitative or qualitative) as particular cases. In algebraic MDPs, rewards are expressed in a semiring structure, uncertainty is represented by a decomposable plausibility measure valued on a
Perny, Patrice +2 more
openaire +1 more source

