Download PDFOpen PDF in browser

A Summary of Recent Progress on Efficient Parametric Approximations of Viability and Discriminating Kernels

9 pagesPublished: December 18, 2015

Abstract

Viability and discriminating kernels are powerful constructs for analyzing system safety through model checking, but until recently the only computational algorithms available were nonparametric grid-based approaches which, although accurate, scaled exponentially with the dimension of the system's state space. In contrast, several polynomial complexity reachability algorithms have been developed using various parametric set representations. In a recent series of papers, two of these parametric approaches -- based on ellipsoids and support vectors -- have been adapted to approximate viability and discriminating kernels in the discrete, continuous and sampled data models of time. This paper briefly summarizes these algorithms and compares their key features with one another and with a representative nonparametric approach.

Keyphrases: ellipsoidal representation, reachability analysis, support function representation, viability theory

In: Sergiy Bogomolov and Ashish Tiwari (editors). Symbolic and Numerical Methods for Reachability Analysis, 1st International Workshop, SNR 2015, vol 37, pages 23--31

Links:
BibTeX entry
@inproceedings{SNR2015:Summary_of_Recent_Progress,
  author    = {Ian M. Mitchell},
  title     = {A Summary of Recent Progress on Efficient Parametric Approximations of  Viability and Discriminating Kernels},
  booktitle = {Symbolic and Numerical Methods for Reachability Analysis, 1st International Workshop, SNR 2015},
  editor    = {Sergiy Bogomolov and Ashish Tiwari},
  series    = {EPiC Series in Computing},
  volume    = {37},
  pages     = {23--31},
  year      = {2015},
  publisher = {EasyChair},
  bibsource = {EasyChair, http://www.easychair.org},
  issn      = {2398-7340},
  url       = {https://easychair.org/publications/paper/TZj},
  doi       = {10.29007/bm16}}
Download PDFOpen PDF in browser