Abstract
The research is devoted to the problem of reachability sets construction and representation in a control problem of a dynamical system. The paper discusses two numerical methods for construction reachability sets of dynamical systems. These methods differ in the way of representations of the reachability sets. The first method is oriented on solution of the control problem on the plane and connected with a representation of sets in the form of polygons. The second one is connected with a pixel representation of sets in the m-dimensional Euclidian space and simplicial complexes.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
