Flowpipe Approximation and Clustering in Space-Time

In this paper, we present an approximation of the set of reachable states, called flowpipe, for a continuous system with affine dynamics. Our approach is based on a representation we call flowpipe sampling, which consists of a set of continuous, interval-valued functions over time. A flowpipe sampling attributes to each time point a polyhedral enclosure of the set of states reachable at that time point, and is capable of representing a nonconvex enclosure of a nonconvex flowpipe. The use of flowpipe samplings allows us to represent and approximate the nonconvex flowpipe efficiently. In particular, we can measure the error incurred by the initial approximation and by further processing such as simplification and convexification. A flowpipe sampling can be efficiently translated into a set of convex polyhedra in a way that minimizes the number of convex sets for a given error bound. When applying flowpipe approximation for the reachability of hybrid systems, a reduction in the number of convex sets spawned by each image computation can lead to drastic performance improvements.

@inproceedings{FrehseKLG13,
  title={Flowpipe Approximation and Clustering in Space-Time},
  author={Frehse, Goran and Kateja, Rajat and {Le~Guernic}, Colas},
  booktitle={Proc. Hybrid Systems: Computation and Control (HSCC'13)},
  pages={203--212},
  year={2013},
  organization={ACM}
}