Computing distances between reach flowpipes

DOI10.1145/2883817.2883850zbMATH Open1364.93246arXiv1602.03266OpenAlexW2266051591MaRDI QIDQ2988992FDOQ2988992

Authors: Rupak Majumdar, Vinayak S. Prabhu

Publication date: 19 May 2017

Published in: Proceedings of the 19th International Conference on Hybrid Systems: Computation and Control (Search for Journal in Brave)

Abstract: We investigate quantifying the difference between two hybrid dynamical systems under noise and initial-state uncertainty. While the set of traces for these systems is infinite, it is possible to symbolically approximate trace sets using emph{reachpipes} that compute upper and lower bounds on the evolution of the reachable sets with time. We estimate distances between corresponding sets of trajectories of two systems in terms of distances between the reachpipes. In case of two individual traces, the Skorokhod distance has been proposed as a robust and efficient notion of distance which captures both value and timing distortions. In this paper, we extend the computation of the Skorokhod distance to reachpipes, and provide algorithms to compute upper and lower bounds on the distance between two sets of traces. Our algorithms use new geometric insights that are used to compute the worst-case and best-case distances between two polyhedral sets evolving with time.

Full work available at URL: https://arxiv.org/abs/1602.03266

Recommendations

zbMATH Keywords

conformance testing Skorokhod metric reachpipes trace metrics Fréchet metric

Mathematics Subject Classification ID

Control/observation systems governed by functional relations other than differential equations (such as hybrid and switching systems) (93C30) Control/observation systems with incomplete information (93C41)

Cited In (2)

This page was built for publication: Computing distances between reach flowpipes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2988992)