-
Notifications
You must be signed in to change notification settings - Fork 17
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Reachability for linear systems using vrep #72
Comments
If it is not too difficult, it would be good to have a "generic" algorithm that we can then also instantiate with H-rep or other set representations for comparison. Should this only be applicable to 2D systems or is the idea to have a decomposition as in |
Ok, i'll have that in mind. Assuming that the "general" set can handle linear maps and M-sums (either concrete or lazy), the additional requirement is always an
Interesting question. Yes, i think that the method can be used as a drop-in replacement. Different blocks need to use the same |
https://nbviewer.jupyter.org/github/mforets/escritoire/blob/master/sets/DiscreteSequence.ipynb
The text was updated successfully, but these errors were encountered: