Author:
Dong Guan-Qiang, ,Yang Zong-Xiao,Song Lei,Ye Kun,Li Gen-Sheng
Abstract
<div class=""abs_img""> <img src=""[disp_template_path]/JRM/abst-image/00270005/15.jpg"" width=""200"" />Shortest path experiment device</div> 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. </span>
Publisher
Fuji Technology Press Ltd.
Subject
Electrical and Electronic Engineering,General Computer Science
Reference24 articles.
1. F. K. Hwang, D. S. Richards, and P. Winter, “The Steiner tree problem,” Annals of Discrete Mathematics, Vol.53, Elsevier Science Publishers, 1992.
2. X. Y. Li, G. Calinescu, and P. J. Wan, “Distributed construction of a planar spanner and routing for ad hoc wireless networks,” The 21stAnnual Joint Conf. of the IEEE Computer and Communications Societies (INFOCOM), 2002.
3. C. Sertac and C. F. Bazlamaçcci, “A distributed heuristic algorithm for the rectilinear steiner minimal tree problem,” Institute of Electrical and Electronics Engineers Inc Vol.27, pp. 2083-2087, 2008.
4. M. Fampa and N. Maculan, “Using a conic formulation for finding Steiner minimal trees,” Kluwer Academic Publishers, 2004.
5. M. Karpinski and A. Zelikovsky, “New Approximation Algorithms for the Steiner Tree Problems,” J. of Combinatorial Optimization, Vol.1, pp. 47-65, 1997.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献