6533b833fe1ef96bd129b5b0

RESEARCH PRODUCT

Deciding reachability for planar multi-polynomial systems

Juris VīksnaKārlis ČErāns

subject

Discrete mathematicsPolynomialReachability problemReachabilityTheoryofComputation_ANALYSISOFALGORITHMSANDPROBLEMCOMPLEXITYHybrid systemState spaceVector fieldFinite setMathematicsofComputing_DISCRETEMATHEMATICSDecidabilityMathematics

description

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.

yearjournalcountryeditionlanguage
1996-01-01
https://doi.org/10.1007/bfb0020962