| 摘要 |
An apparatus (2) and a method of determining a sequence of transitions for a varying state of a system, wherein the system is described by a finite number n of states ( S i ), and wherein a transition from a current state ( S i ) to a next state ( S i ) causes a cost in dependence of a distance that is dependent on a previous state ( S i ), the current state ( S i ), and the next state ( S i ). The method comprises: combining (10) each two consecutive states to generate super states, wherein the cost for a transition from a current super state to a next super state only depends on the current super state and the next super state; in an iterative process, applying (11) a dynamic programming algorithm to the super states in order to determine a minimum accumulated cost for each varying super state and to determine a preceding super state that led to the minimum accumulated cost; and after a final iteration, determining (12) a final super state with the minimum accumulated cost and retrieving (13) the sequence of the preceding super states leading to the final super state with the minimum accumulated cost. |
