...-based method is adopted to construct probabilistic finite state automata (PFSA) for identification of the current state (i.e., operational regime) of the Lorenz system; and a simple Q-map-based (and model-free) RL control strategy is formulated to reach the target state from the (identified) current...

...) in their various configurations; however, these NN-based methods may require large-volume data and prolonged computational time for training. An alternative feasible method is the STSA-based probabilistic finite state automata (PFSA), which has been shown in recent literature to require significantly less training...

...., detection of unanticipated obstacles). The underlying theory is developed as an extension of a grid-based path planning algorithm, called ν ⋆ , which was formulated in the framework of probabilistic finite state automata (PFSA) and language measure from a control-theoretic perspective...

... on Irreducible and Synchronizable Probabilistic Finite State Automata ,” Math. Control, Signals, Syst. , 23 ( 4 ), pp. 281 – 310 . 10.1007/s00498-012-0075-1 [22] Adenis , P. , Mukherjee , K. , and Ray , A. , 2011 , “ State Splitting and State Merging in Probabilistic Finite State Automata...