An Efficient Algorithm for the Least Areas Path Problem

被引：0

作者：

Fan, Gaojun ^{[1
]}

Jin, Shiyao ^{[1
]}

机构：

[1] Natl Univ Def Technol, Natl Lab Parallel & Distributed Proc, Changsha 410073, Hunan, Peoples R China

来源：

2008 ISECS INTERNATIONAL COLLOQUIUM ON COMPUTING, COMMUNICATION, CONTROL, AND MANAGEMENT, VOL 1, PROCEEDINGS | 2008年

关键词：

D O I：

10.1109/CCCM.2008.202

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

The goal of the least areas path problem (LAPP) is to find a path traversing through a given region covered by a set of areas with any arbitrary shape, between a given pair of points and with the property that each point on the path is covered by the least areas. Different the weighted region optimal path problem, the LAPP asks for the cost of each step in path is as low as possible. Based on the relationship between boundaries of sub-regions and the least areas path, we can transform this continuous-domain problem to a discrete one by calculating the coverage of curves of sub-regions' boundaries. Depending on binary-search and breadth-first-search, an efficient and fast algorithm was devised for solving the LAPP..

引用

页码：369 / 373

页数：5

共 50 条

[1] An efficient parallel algorithm for the longest path problem in meshes
Keshavarz-Kohjerdi, Fatemeh
Bagheri, Alireza
JOURNAL OF SUPERCOMPUTING, 2013, 65 (02): : 723 - 741
[2] An Efficient Algorithm for the Shortest Path Problem with Forbidden Paths
Hsu, Chiun-Chieh
Chen, Da-Ren
Ding, Hua-Yuan
ALGORITHMS AND ARCHITECTURES FOR PARALLEL PROCESSING, PROCEEDINGS, 2009, 5574 : 638 - +
[3] An efficient algorithm for linear fractional shortest path problem
Roan, J
PROCEEDINGS OF THE TWENTY-SEVENTH ANNUAL MEETING OF THE WESTERN DECISION SCIENCES INSTITUTE, 1998, : 639 - 643
[4] An efficient parallel algorithm for the longest path problem in meshes
Fatemeh Keshavarz-Kohjerdi
Alireza Bagheri
The Journal of Supercomputing, 2013, 65 : 723 - 741
[5] An efficient algorithm for solving the nonnegative tensor least squares problem
Duan, Xue-Feng
Duan, Shan-Qi
Li, Juan
Li, Jiao-fen
Wang, Qing-Wen
NUMERICAL LINEAR ALGEBRA WITH APPLICATIONS, 2021, 28 (06)
[6] A particle swarm optimization algorithm for least visual path problem in raster terrain
Science and Technology on Integrated Information System Laboratory, Institute of Software, Chinese Academy of Sciences, Beijing, China
Proc. - Int. Conf. Intelligent Comput. Bio-Med. Instrum., ICBMI, (228-231):
[7] AN EFFICIENT P-D ALGORITHM FOR SHORTEST PATH PROBLEM
杨承恩
梁枢里
Acta Mathematicae Applicatae Sinica, 1997, (02) : 221 - 224
[8] An efficient P-D algorithm for shortest path problem
Yang C.
Liang S.
Acta Mathematicae Applicatae Sinica, 1997, 13 (2) : 221 - 224
[9] An efficient Genetic Algorithm for the Global Robot Path Planning Problem
Alnasser, Sarah
Bennaceur, Hachemi
2016 SIXTH INTERNATIONAL CONFERENCE ON DIGITAL INFORMATION AND COMMUNICATION TECHNOLOGY AND ITS APPLICATIONS (DICTAP), 2016, : 97 - 102
[10] A stable and efficient algorithm for the indefinite linear least-squares problem
Chandrasekaran, S
Gu, M
Sayed, AH
SIAM JOURNAL ON MATRIX ANALYSIS AND APPLICATIONS, 1998, 20 (02) : 354 - 362

← 1 2 3 4 5 →