Skip to content

An implementation of the paper "Reach set approximation through decomposition with low-dimensional sets and high-dimensional matrices" in Python using the zonotope set representation.

Notifications You must be signed in to change notification settings

abhinavchawla/ReachabilityCartesianDecomposition

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

5 Commits
 
 
 
 
 
 
 
 

Repository files navigation

ReachabilityCartesianDecomposition

An implementation of the paper "Reach set approximation through decomposition with low-dimensional sets and high-dimensional matrices" in Python using the zonotope set representation. This was done as the final project of CSE510- Hybrid Systems and Trusted Autonomy

This is a faster way to approximate reach set approximations where the initial set is decomposed into multiple smaller sets and we try to create a reachability analysis on these smaller sets while exponentiating the high dimensional phi matrix at every step. This implementation uses the zonotope as the set representation and is implemented in Python. An example of a harmonic oscillator system using this method is shown. image

About

An implementation of the paper "Reach set approximation through decomposition with low-dimensional sets and high-dimensional matrices" in Python using the zonotope set representation.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages