Global shortest path visualization approach with obstructions

The minimum Steiner tree theory is the basis theory of global shortest path. It is one of the classic NP-hard problems in nonlinear combinatorial optimization. A visualization experiment approach has been used to find Steiner points and the system shortest path named Steiner minimum tree. However, the obstacles must be taken into consideration in some problems. An obstacle-avoiding Steiner minimal tree (OASMT) connects some points and avoids running through any obstacle to construct a tree with a minimal total lengths. Geometry-experiment algorithm (GEA) is constructed to solve OASMT by using the visualization experiment device in this paper. The approximate optimizing results are received by GEA for some systems with obstacles. The validity of GEA for OASMT was proved by solving some problems and the global shortest path can be obtained by GEA successfully.