A stochastic approach to solving the 2-1/2 dimensional weighted region problem
Hilton, Cary Allen, Jr.
Rowe, Neil C.
MetadataShow full item record
This thesis describes a method of computing a feasible path solution for the anisotropic weighted region problem. Heuristics are used to locate an initial starting solution. This starting solution is iteratively improved using a golden ratio search to produce a solution within a specified tolerance. The path solution is then randomly perturbed or detoured through different region frontiers, and the golden ratio search is again applied. These random detours are controlled by a process known as simulated annealing, which determines the number of detours made and decides whether to accept or reject each path solution. Better solutions are always accepted and worse solutions are accepted based on a probability distribution. Accepting worse solutions allows an opportunity to escape from a local minimum condition and continue the search for the optimal path. Since an exhaustive search is not performed, the globally optimal path may not be found, but a feasible path can be found with this method.
Approved for public release; distribution is unlimited
Showing items related by title, author, creator and subject.
Tan, Choon Seng Leon Mark (Monterey, California: Naval Postgraduate School, 2017-09);Time is critical during search and rescue operations, as human survival diminishes exponentially if survivors are not located and recovered efficiently. This thesis sought to integrate technologies into a solution that ...
Development of a computer program for determination of search areas for search and rescue operations of the United States Coast Guard Cunningham, David F.; Frantz, Donald L. (Naval Postgraduate School, 1965);The increase in trans -oceanic travel and maritime operations have created a need for new and improved search and rescue techniques and facilities. This study briefly describes the various phases of search and rescue ...
Eagle, James N.; Yee, James R. (Monterey, California. Naval Postgraduate School, 1987-12); NPS55-87-015A search is conducted for a target moving in discrete time among a finite number of cells according to a known Markov process. The searcher must choose one cell in which to search in each time period. The set of cells ...