This paper focuses on optimal transmission tower spotting as an application of search methods in a graph with partially ordered nodes and for the first time models the problem using preference relations between nodes. First basic results from graph theory and search algorithms are presented. Electro-mechanical and topographical constraints to obtaining the path of minimum cost are described, the nodes, arcs, costs and paths are defined, and the optimization algorithms are shown. The paper introduces and demonstrates the validity of preference relations between nodes. These are used together with cost comparisons to eliminate paths. This procedure increases the efficiency of the optimization algorithms.
transmission tower spotting; paths in graphs; sequential optimization
