10.20965/jrm.2015.p0579
026803875
http://id.ndl.go.jp/bib/026803875
https://ndlsearch.ndl.go.jp/books/R000000004-I026803875
https://www.fujipress.jp/main/wp-content/themes/Fujipress/phyosetsu.php?ppno=ROBOT002700050015
130007671233
The Global Shortest Path Visualization Approach with Obstructions
en
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>
disallow
9000403157945
Dong Guan-Qiang
Institute of Systems Science and Engineering, Henan Engineering Laboratory of Wind Power Systems, Henan University of Science and Technology
9000403157946
Yang Zong-Xiao
Institute of Systems Science and Engineering, Henan Engineering Laboratory of Wind Power Systems, Henan University of Science and Technology
9000403157947
Song Lei
Institute of Systems Science and Engineering, Henan Engineering Laboratory of Wind Power Systems, Henan University of Science and Technology
9000403157948
Ye Kun
Institute of Systems Science and Engineering, Henan Engineering Laboratory of Wind Power Systems, Henan University of Science and Technology
9000403157949
Li Gen-Sheng
Institute of Systems Science and Engineering, Henan Engineering Laboratory of Wind Power Systems, Henan University of Science and Technology
09153942
18838049
000000147494
09153942
09153942
AA10809998
Journal of Robotics and Mechatronics
Journal of Robotics and Mechatronics
J. Robot. Mechatron.
Fuji Technology Press Ltd.
富士技術出版株式会社
2015-10-20
27
5
579
585
false
references
An
<i>O</i>
(
<i>n</i>
log
<i>n</i>
) algorithm for obstacle-avoiding routing tree construction in the λ-geometry plane
references
Fine Particles, Thin Films and Exchange Anisotropy (Effects of Finite Dimensions and Interfaces on the Basic Properties of Ferromagnets)
references
Using a Conic Formulation for Finding Steiner Minimal Trees
references
Electron Spectroscopy Studies on Magneto-Optical Media and Plastic Substrate Interface
references
Study on the Stability of Steiner Tree Structure of Explosion-Proof Textiles
references
New Approximation Algorithms for the Steiner Tree Problems
references
On certain integrals of Lipschitz-Hankel type involving products of bessel functions
references
Geometry-Experiment Algorithm for Steiner Minimal Tree Problem
references
Efficient rectilinear Steiner tree construction with rectilinear blockages
references
Steiner Minimal Trees
references
Steiner tree problems
references
Explosion-proof textile with hierarchical Steiner tree structure
references
CDCTree
oai:japanlinkcenter.org:2007280506
oai:ndlsearch.ndl.go.jp:R000000004-I026803875
10.20965/jrm.2015.p0579
130007671233