English
Related papers

Related papers: Piecewise deterministic Markov process - recent re…

200 papers

In this paper, a condition-based imperfect maintenance model based on piecewise deterministic Markov process (PDMP) is constructed. The degradation of the system includes two types: natural degradation and random shocks. The natural…

Systems and Control · Electrical Eng. & Systems 2025-03-25 Weikai Wang , Xian Chen

The paper deals with finite-state Markov decision processes (MDPs) with integer weights assigned to each state-action pair. New algorithms are presented to classify end components according to their limiting behavior with respect to the…

Logic in Computer Science · Computer Science 2018-05-01 Christel Baier , Nathalie Bertrand , Clemens Dubslaff , Daniel Gburek , Ocan Sankur

Piecewise deterministic Markov processes (PDMPs) can be used to model complex dynamical industrial systems. The counterpart of this modeling capability is their simulation cost, which makes reliability assessment untractable with standard…

Computation · Statistics 2023-06-08 Guillaume Chennetier , Hassane Chraibi , Anne Dutfoy , Josselin Garnier

We register a random sequence which has the following properties: it has three segments being the homogeneous Markov processes. Each segment has his own one step transition probability law and the length of the segment is unknown and…

Probability · Mathematics 2011-11-21 Krzysztof Szajowski

We consider a general piecewise deterministic Markov process (PDMP) $X=\{X_t\}_{t\geqslant 0}$ with measure-valued generator $\mathcal{A}$, for which the conditional distribution function of the inter-occurrence time is not necessarily…

Probability · Mathematics 2017-04-27 Zhaoyang Liu , Yuying Liu , Guoxin Liu

This article presents the complexity of reachability decision problems for parametric Markov decision processes (pMDPs), an extension to Markov decision processes (MDPs) where transitions probabilities are described by polynomials over a…

Logic in Computer Science · Computer Science 2020-09-29 Sebastian Junges , Joost-Pieter Katoen , Guillermo A. Pérez , Tobias Winkler

We consider partially observable Markov decision processes (POMDPs) with limit-average payoff, where a reward value in the interval [0,1] is associated to every transition, and the payoff of an infinite path is the long-run average of the…

Artificial Intelligence · Computer Science 2014-08-12 Krishnendu Chatterjee , Martin Chmelik

We study observation-based strategies for partially-observable Markov decision processes (POMDPs) with omega-regular objectives. An observation-based strategy relies on partial information about the history of a play, namely, on the past…

Logic in Computer Science · Computer Science 2015-05-14 Krishnendu Chatterjee , Laurent Doyen , Thomas A. Henzinger

POMDPs are useful models for systems where the true underlying state is not known completely to an outside observer; the outside observer incompletely knows the true state of the system, and observes a noisy version of the true system…

Machine Learning · Computer Science 2021-09-01 Caleb M. Bowyer

Markov decision processes (MDPs) are widely used for modeling decision-making problems in robotics, automated control, and economics. Traditional MDPs assume that the decision maker (DM) knows all states and actions. However, this may not…

Artificial Intelligence · Computer Science 2014-07-29 Joseph Y. Halpern , Nan Rong , Ashutosh Saxena

Markov decision processes (MDPs) are widely used for modeling decision-making problems in robotics, automated control, and economics. Traditional MDPs assume that the decision maker (DM) knows all states and actions. However, this may not…

Artificial Intelligence · Computer Science 2010-06-14 Joseph Y. Halpern , Nan Rong , Ashutosh Saxena

A biochemical network can be simulated by a set of ordinary differential equations (ODE) under well stirred reactor conditions, for large numbers of molecules, and frequent reactions. This is no longer a robust representation when some…

Quantitative Methods · Quantitative Biology 2021-12-17 Guilherme C. P. Innocentini , Arran Hodgkinson , Fernando Antoneli , Arnaud Debussche , Ovidiu Radulescu

Markov automata combine non-determinism, probabilistic branching, and exponentially distributed delays. This compositional variant of continuous-time Markov decision processes is used in reliability engineering, performance evaluation and…

Logic in Computer Science · Computer Science 2017-05-11 Tim Quatmann , Sebastian Junges , Joost-Pieter Katoen

Robust Markov decision processes (MDPs) allow to compute reliable solutions for dynamic decision problems whose evolution is modeled by rewards and partially-known transition probabilities. Unfortunately, accounting for uncertainty in the…

Machine Learning · Computer Science 2020-06-18 Chin Pang Ho , Marek Petrik , Wolfram Wiesemann

A determinantal point process (DPP) is a random process useful for modeling the combinatorial problem of subset selection. In particular, DPPs encourage a random subset Y to contain a diverse set of items selected from a base set Y. For…

Machine Learning · Computer Science 2012-10-19 Raja Hafiz Affandi , Alex Kulesza , Emily B. Fox

Motivated by wide-ranging applications such as video delivery over networks using Multiple Description Codes, congestion control, and inventory management, we study the state-tracking of a Markovian random process with a known transition…

Information Theory · Computer Science 2017-03-06 Parisa Mansourifard , Tara Javidi , Bhaskar Krishnamachari

In this paper we consider the optimal control of Hilbert space-valued infinite-dimensional Piecewise Deterministic Markov Processes (PDMP) and we prove that the corresponding value function can be represented via a Feynman-Kac type formula…

Optimization and Control · Mathematics 2019-06-07 Elena Bandini , Michele Thieullen

The main goal of this paper is to derive sufficient conditions for the existence of an optimal control strategy for the long run average continuous control problem of piecewise deterministic Markov processes (PDMP's) taking values in a…

Probability · Mathematics 2008-12-05 O. L. V. Costa , F. Dufour

The dynamics in games involving multiple players, who adaptively learn from their past experience, is not yet well understood. We analyzed a class of stochastic games with Markov strategies in which players choose their actions…

Probability · Mathematics 2018-04-30 Shohei Hidaka

We review some recent results of quantitative long-time convergence for the law of a killed Markov process conditioned to survival toward a quasi-stationary distribution, and on the analogous question for the particle systems used in…

Probability · Mathematics 2023-05-26 Bertrand Cloez , Lucas Journel , Pierre Monmarché , Boris Nectoux , Mouad Ramil