Reachability Analysis of Hybrid Dynamical systems

In this paper, a novel method is developed to investigate the reachability analysis of the hybrid dynamical systems which consist of both continuous and discrete dynamics. At first, a regular mesh of the continuous state space is constructed. Then, by choosing a finite family of control signals and considering the discrete dynamic of system, a behaviour graph of the system is derived. Consequently, using Dijkstra's algorithm, which has been developed to find the minimum length path in the graph, the reachability analysis is performed. The analysis results are applied to derive the control command which constructs a bisimulation relation and finalizes the control process.

کلیدواژه ها:

hybrid automata ، Dijkstra's algorithm ، graph theory