Optimizing the Expected Mean Payoff in Energy Markov Decision Processes

2016/07/03 by Tomǎš Brázdil, Brázdil, Tomáš, Antonı́n Kučera +3
Computer Science · Engineering · #Advanced Battery Technologies Research #FOS: Computer and information sciences #Formal Methods in Verification #Logic in Computer Science (cs.LO) #Petri Nets in System Modeling

paper · pdf · doi:10.48550/arxiv.1607.00678

openalex publication_date 2016/07/03 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

Energy Markov Decision Processes (EMDPs) are finite-state Markov decision processes where each transition is assigned an integer counter update and a rational payoff. An EMDP configuration is a pair s(n), where s is a control state and n is the current counter value. The configurations are changed by performing transitions in the standard way. We consider the problem of computing a safe strategy (i.e., a strategy that keeps the counter non-negative) which maximizes the expected mean payoff.

Related

• Energy and Mean-Payoff Parity Markov Decision Processes
• Finite-memory Strategies for Almost-sure Energy-MeanPayoff Objectives in MDPs
• Optimising expectation with guarantees for window mean payoff in Markov decision processes
• Efficient Strategy Iteration for Mean Payoff in Markov Decision\n Processes
• PAC Statistical Model Checking of Mean Payoff in Discrete- and Continuous-Time MDP