ABSTRACT
At the beginning, m = 1, the cost of each node, [s1(1), s2(n)] (n = 1, 2, …, N) is saved. At step m (m ≥ 2), a path ending at [s1(m), s2(n)] with minimal accumulated cost should be found. The node [s1(m), s2(n)] is linked with each node in the previous steps, [s1(m − 1), s2(l)] (l = 1, 2, …, N). Among these paths, the one with minimal accumulated cost is selected. Above steps are repeated until at step m = M, the ultimate optimal path is the global optimum of the overall problem, {[s1(1), s2(u(1))], [s1(2), s2(u(2))], …, [s1(M), s2(u(M))]}, where u(⋅) is the matching function.
