Abstraction-based Probabilistic Stability Analysis of Polyhedral Probabilistic Hybrid Systems

• URL: http://arxiv.org/abs/2304.02647v1
• Date: Wed, 29 Mar 2023 15:29:30 GMT
• Title: Abstraction-based Probabilistic Stability Analysis of Polyhedral Probabilistic Hybrid Systems
• Abstract summary: We consider the problem of probabilistic stability analysis of a subclass of Hybrid Systems, namely, Polyhedral Probabilistic Hybrid Systems (PPHS) We present an abstraction-based analysis framework that consists of constructing a finite Markov Decision Processes (MDP) Our experimental analysis demonstrates the feasibility of the approach in successfully verifying probabilistic stability on PPHS of various dimensions and sizes.
• Score: 6.574517227976925
• License: http://creativecommons.org/licenses/by-sa/4.0/
• Abstract: In this paper, we consider the problem of probabilistic stability analysis of a subclass of Stochastic Hybrid Systems, namely, Polyhedral Probabilistic Hybrid Systems (PPHS), where the flow dynamics is given by a polyhedral inclusion, the discrete switching between modes happens probabilistically at the boundaries of their invariant regions and the continuous state is not reset during switching. We present an abstraction-based analysis framework that consists of constructing a finite Markov Decision Processes (MDP) such that verification of certain property on the finite MDP ensures the satisfaction of probabilistic stability on the PPHS. Further, we present a polynomial-time algorithm for verifying the corresponding property on the MDP. Our experimental analysis demonstrates the feasibility of the approach in successfully verifying probabilistic stability on PPHS of various dimensions and sizes.

Related papers

• The Value Function Semi-Algebraic Set in Partially Observable Markov Decision Processes [0.0]
  We study the geometry of feasible value functions in infinite-horizon partially observable Markov decision processes (POMDPs) under memoryless policies.<n>Our main contribution is a characterization of the feasible set of value functions as a semi-algebraic set.<n>Our geometric characterization provides new insight into the landscape of policy optimization in both MDPs and POMDPs.
  arXiv  Detail & Related papers  (2026-06-02T02:30:49Z)
• MDP Planning as Policy Inference [1.7259824817932294]
  We cast episodic Markov decision process (MDP) planning as Bayesian inference over _policies_.<n>A policy is treated as the latent variable and is assigned an unnormalized probability of optimality that is monotone in its expected return.<n>Across grid worlds, Blackjack, Triangle Tireworld, and Academic Advising, we analyze the structure of inferred policy distributions and compare the resulting behavior to discrete Soft Actor-Critic.
  arXiv  Detail & Related papers  (2026-02-19T13:56:31Z)
• Distribution-Free Stochastic MPC for Joint-in-Time Chance-Constrained Linear Systems [6.170271503640481]
  This work presents a model predictive control (MPC) framework for linear systems subject to joint-in-time chance constraints under unknown disturbance distributions.<n>Unlike existing MPC formulations that rely on parametric or Gaussian assumptions, the proposed method leverages conformal prediction (CP) as a streamlined tool to construct finite-sample confidence regions for the system's error trajectories with minimal computational effort.
  arXiv  Detail & Related papers  (2025-12-11T15:25:02Z)
• Neural Spline Operators for Risk Quantification in Stochastic Systems [14.121384596390293]
  Accurately quantifying long-term risk probabilities in diverse systems is essential for safety-critical control.<n>We introduce physics-informed neural operator (PINO) methods to risk quantification problems.<n>Specifically, we propose Neural Spline Operators (NeSO), a PINO framework that leverages B-spline representations to improve training efficiency and achieve better initial and boundary condition enforcements.
  arXiv  Detail & Related papers  (2025-08-27T21:46:01Z)
• Stochastic Optimization with Optimal Importance Sampling [49.484190237840714]
  We propose an iterative-based algorithm that jointly updates the decision and the IS distribution without requiring time-scale separation between the two. Our method achieves the lowest possible variable variance and guarantees global convergence under convexity of the objective and mild assumptions on the IS distribution family.
  arXiv  Detail & Related papers  (2025-04-04T16:10:18Z)
• A Unified Theory of Stochastic Proximal Point Methods without Smoothness [52.30944052987393]
  Proximal point methods have attracted considerable interest owing to their numerical stability and robustness against imperfect tuning. This paper presents a comprehensive analysis of a broad range of variations of the proximal point method (SPPM)
  arXiv  Detail & Related papers  (2024-05-24T21:09:19Z)
• Probabilistic Numeric SMC Sampling for Bayesian Nonlinear System Identification in Continuous Time [0.0]
  In engineering, accurately modeling nonlinear dynamic systems from data contaminated by noise is both essential and complex. The integration of continuous-time ordinary differential equations (ODEs) is crucial for aligning theoretical models with discretely sampled data. This paper demonstrates the application of a probabilistic numerical method for solving ODEs in the joint parameter-state identification of nonlinear dynamic systems.
  arXiv  Detail & Related papers  (2024-04-19T14:52:14Z)
• Probabilistic Shapley Value Modeling and Inference [4.025747321359554]
  Probability Shapley inference (PSI) is a novel framework to model and infer sufficient statistics of feature attributions in flexible predictive models.<n>We introduce a masking-based neural network architecture, with a modular training and inference procedure.<n>We evaluate PSI on synthetic and real-world datasets, showing that it achieves competitive predictive performance compared to strong baselines.
  arXiv  Detail & Related papers  (2024-02-06T18:09:05Z)
• Entropic Matching for Expectation Propagation of Markov Jump Processes [38.60042579423602]
  We propose a new tractable inference scheme based on an entropic matching framework. We demonstrate the effectiveness of our method by providing closed-form results for a simple family of approximate distributions. We derive expressions for point estimation of the underlying parameters using an approximate expectation procedure.
  arXiv  Detail & Related papers  (2023-09-27T12:07:21Z)
• Probabilistic Exponential Integrators [36.98314810594263]
  Like standard solvers, they suffer performance penalties for certain stiff systems. This paper develops a class of probabilistic exponential solvers with favorable properties. We evaluate the proposed methods on multiple stiff differential equations.
  arXiv  Detail & Related papers  (2023-05-24T10:13:13Z)
• Stability-based Generalization Analysis for Mixtures of Pointwise and Pairwise Learning [27.8712875561043]
  Some algorithms of pointwise and pairwise learning (PPL) have been formulated by employing the hybrid error metric of "pointwise loss + pairwise loss" In this paper, we try to fill this theoretical gap by investigating the generalization properties of PPL.
  arXiv  Detail & Related papers  (2023-02-20T13:25:23Z)
• Formal Controller Synthesis for Markov Jump Linear Systems with Uncertain Dynamics [64.72260320446158]
  We propose a method for synthesising controllers for Markov jump linear systems. Our method is based on a finite-state abstraction that captures both the discrete (mode-jumping) and continuous (stochastic linear) behaviour of the MJLS. We apply our method to multiple realistic benchmark problems, in particular, a temperature control and an aerial vehicle delivery problem.
  arXiv  Detail & Related papers  (2022-12-01T17:36:30Z)
• Probabilities Are Not Enough: Formal Controller Synthesis for Stochastic Dynamical Models with Epistemic Uncertainty [68.00748155945047]
  Capturing uncertainty in models of complex dynamical systems is crucial to designing safe controllers. Several approaches use formal abstractions to synthesize policies that satisfy temporal specifications related to safety and reachability. Our contribution is a novel abstraction-based controller method for continuous-state models with noise, uncertain parameters, and external disturbances.
  arXiv  Detail & Related papers  (2022-10-12T07:57:03Z)
• Permutation Invariant Policy Optimization for Mean-Field Multi-Agent Reinforcement Learning: A Principled Approach [128.62787284435007]
  We propose the mean-field proximal policy optimization (MF-PPO) algorithm, at the core of which is a permutation-invariant actor-critic neural architecture. We prove that MF-PPO attains the globally optimal policy at a sublinear rate of convergence. In particular, we show that the inductive bias introduced by the permutation-invariant neural architecture enables MF-PPO to outperform existing competitors.
  arXiv  Detail & Related papers  (2021-05-18T04:35:41Z)
• Identification of Unexpected Decisions in Partially Observable Monte-Carlo Planning: a Rule-Based Approach [78.05638156687343]
  We propose a methodology for analyzing POMCP policies by inspecting their traces. The proposed method explores local properties of policy behavior to identify unexpected decisions. We evaluate our approach on Tiger, a standard benchmark for POMDPs, and a real-world problem related to mobile robot navigation.
  arXiv  Detail & Related papers  (2020-12-23T15:09:28Z)
• Identification of Probability weighted ARX models with arbitrary domains [75.91002178647165]
  PieceWise Affine models guarantees universal approximation, local linearity and equivalence to other classes of hybrid system. In this work, we focus on the identification of PieceWise Auto Regressive with eXogenous input models with arbitrary regions (NPWARX) The architecture is conceived following the Mixture of Expert concept, developed within the machine learning field.
  arXiv  Detail & Related papers  (2020-09-29T12:50:33Z)
• Probabilistic Performance-Pattern Decomposition (PPPD): analysis framework and applications to stochastic mechanical systems [8.975760915194765]
  The paper proposes a framework to obtain structuralized characterizations on behaviors of systems. The framework is named Probabilistic Performance-Pattern Decomposition (PPPD)
  arXiv  Detail & Related papers  (2020-03-04T17:18:43Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.