We propose a new heuristic for the single-searcher path-constrained discrete-time Markovian-target search. The algorithm minimizes an approximate, instead of exact, nondetection probability computed from the conditional probability that reflects the search history over the time windows of a...

It has been observed that the Handelman’s certificate of positivity of a polynomial over a compact polyhedron offers a hierarchical relaxation scheme for polynomial programs. The Handelman hierarchy seems particularly suitable for a class of combinatorial optimizations that are formulated as a...

In practice, a train-conflict resolution is decentralized around dispatchers each of whom controls a few segments in a global railway network with her rule-of-thumb to operational data. Conceptually, the global sub-optimality or infeasibility of the decentralized system is resolved by a network...