Solving the weighted region least cost path problem using transputers.
Kodres, Uno R.
MetadataShow full item record
The weighted region least cost path problem involves finding the minimal cost path between a source point and a goal point through a plane that has been subdivided into weighted regions. In this thesis, we investigate a new parallel approach which seeks to take advantage of the distributed, asynchronous computing environment provided by the INMOS Transputer. The algorithm consists of a family of local, asynchronous, iterative and parallel procedures. The program is implemented on a network of transputers using a parallel version of the C programming language and tested on various maps of triangulated weighted regions. Results were favorable in terms of producing a near optimum path and reduced processing time.
Approved for public release; distribution is unlimited
Showing items related by title, author, creator and subject.
A stochastic approach to the weighted-region problem : 1. the design of the path annealing algorithm Kindl, Mark R.; Rowe, Neil C.; Shing, Man-Tak (Monterey, California. Naval Postgraduate School, 1991-06); NPS-CS-91-014This paper presents an efficient heuristic algorithm for planning near-optimal high-level paths for a point agent through complex terrain modeled by the Weighted-Region Problem. The input to the Weighted-Region Problem is ...
Yale, G.; Agrawal, B.N. (1994);This paper concerns the cooperative control of multiple manipulators attached to the same base as they reposition a common payload. The theory is easily applied to inertially based problems as well as space based free-floating ...
Davis, James Patrick (Monterey, California. Naval Postgraduate School, 1995-12);The Federal Acquisition Regulation requires Government agencies to use a structured approach to determine prenegotiation profit objectives for those contracts requiring cost analysis. The structured approach utilized by ...