The Global Shortest Path Visualization Approach with Obstructions

  • Dong Guan-Qiang
    Institute of Systems Science and Engineering, Henan Engineering Laboratory of Wind Power Systems, Henan University of Science and Technology
  • Yang Zong-Xiao
    Institute of Systems Science and Engineering, Henan Engineering Laboratory of Wind Power Systems, Henan University of Science and Technology
  • Song Lei
    Institute of Systems Science and Engineering, Henan Engineering Laboratory of Wind Power Systems, Henan University of Science and Technology
  • Ye Kun
    Institute of Systems Science and Engineering, Henan Engineering Laboratory of Wind Power Systems, Henan University of Science and Technology
  • Li Gen-Sheng
    Institute of Systems Science and Engineering, Henan Engineering Laboratory of Wind Power Systems, Henan University of Science and Technology

Search this article

Abstract

<p>The avoidance obstacle path planning problem is stated in an obstacle environment. The minimum Steiner tree theory is the basis of the global shortest path. It is one of the classic NP-hard problem in nonlinear combinatorial optimization. A visualization experiment approach has been used to find Steiner point and system’s shortest path is called Steiner minimum tree. However, obstacles must be considered in some problems. An Obstacle Avoiding Steiner Minimal Tree (OASMT) connects some points and avoids running through any obstacle when constructing a tree with a minimal total length. We used a geometry experiment approach (GEA) to solve OASMT by using the visualization experiment device discussed below. A GEA for some systems with obstacles is used to receive approximate optimizing results. We proved the validity of the GEA for the OASMT by solving problems in which the global shortest path is obtained successfully by using the GEA.</p>

Journal

References(13)*help

See more

Details 詳細情報について

Report a problem

Back to top