There has been several attempts over the years to solve the bisimulation minimization problem for finite automata. One of the most famous algorithms is the one suggested by Paige ...
Parosh Aziz Abdulla, Johann Deneux, Lisa Kaati, Ma...
— In this paper we consider state estimation carried over a sensor network. A fusion center forms a local multi-hop tree of sensors and gateways and fuses the data into a state e...
Ling Shi, Karl Henrik Johansson, Richard M. Murray
We present three new complexity results for classes of planning problems with simple causal graphs. First, we describe a polynomial-time algorithm that uses macros to generate pla...
— This paper addresses two key limitations of the unscented Kalman filter (UKF) when applied to the simultaneous localization and mapping (SLAM) problem: the cubic, in the numbe...
Guoquan Huang, Anastasios I. Mourikis, Stergios I....
State-equivalence based reduction techniques, e.g. bisimulation minimization, can be used to reduce a state transition system to facilitate subsequent verification tasks. However...