Deciding reachability for planar multi-polynomial systems | Zendy

Kārlis Čerāns | Zendy; Juris Víksna | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Deciding reachability for planar multi-polynomial systems

Author(s) -

Kārlis Čerāns,

Juris Víksna

Publication year - 1996

Publication title -

lecture notes in computer science

Language(s) - English

Resource type - Book series

SCImago Journal Rank - 0.249

H-Index - 400

eISSN - 1611-3349

pISSN - 0302-9743

ISBN - 3-540-61155-X

DOI - 10.1007/bfb0020962

Subject(s) - reachability , decidability , planar , reachability problem , euclidean space , euclidean geometry , polynomial , plane (geometry) , dynamical systems theory , point (geometry) , computer science , mathematics , hybrid system , discrete mathematics , combinatorics , algorithm , mathematical analysis , geometry , physics , computer graphics (images) , machine learning , quantum mechanics

In this paper we investigate the decidability of the reachability problem for planar non-linear hybrid systems. A planar hybrid system has the property that its state space corresponds to the standard Euclidean plane, which is partitioned into a finite number of (polyhedral) regions. To each of these regions is assigned some vector field which governs the dynamical behaviour of the system within this region. We prove the decidability of point to point and region to region reachability problems for planar hybrid systems for the case when trajectories within the regions can be described by polynomials of arbitrary degree.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research