Automated Route Finder for Multiple Tank Columns

摘要

The Automated Route Finder for Multiple Tank Columns computes multiple non-competing paths for columns of tanks. The network of available paths is represented by a graph-theoretic structure. Each arc of the graph has an associated cost which represents the time required to traverse the path corresponding to the arc. A best-first algorithm is used to search the graph in order to find the specified number of optimum paths. The algorithm was implemented on the Symbolics LISP Machine with a color monitor used to display the graph as it is explored. Sample outputs of route finding are included with an analysis of the results. Future enhancements for the system are outlined.