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 条

[21] Constraint reformulation and a Lagrangian relaxation-based solution algorithm for a least expected time path problem
Yang, Lixing
Zhou, Xuesong
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 2014, 59 : 22 - 44
[22] A DYNAMIZATION OF THE ALL PAIRS LEAST COST PATH PROBLEM
ROHNERT, H
LECTURE NOTES IN COMPUTER SCIENCE, 1985, 182 : 279 - 286
[23] On the convergence of the partial least squares path modeling algorithm
Jörg Henseler
Computational Statistics, 2010, 25 : 107 - 120
[24] On the convergence of the partial least squares path modeling algorithm
Henseler, Joerg
COMPUTATIONAL STATISTICS, 2010, 25 (01) : 107 - 120
[25] SPLZ: An efficient algorithm for single source shortest path problem using compression method
Jingwei Sun
Guangzhong Sun
GeoInformatica, 2016, 20 : 1 - 18
[26] BMA*:: An efficient algorithm for the one-to-some shortest path problem on road maps
He, Dan
ALGORITHMIC ASPECTS IN INFORMATION AND MANAGEMENT, PROCEEDINGS, 2007, 4508 : 346 - 357
[27] An efficient algorithm for the evacuation problem in a certain class of networks with uniform path-lengths
Kamiyama, Naoyuki
Katoh, Naoki
Takizawa, Atsushi
DISCRETE APPLIED MATHEMATICS, 2009, 157 (17) : 3665 - 3677
[28] Efficient path planning algorithm for mobile robot navigation with a local minima problem solving
Velagic, Jasmin
Lacevic, Bakir
Osmic, Nedim
2006 IEEE INTERNATIONAL CONFERENCE ON INDUSTRIAL TECHNOLOGY, VOLS 1-6, 2006, : 2695 - +
[29] An efficient fault-containing self-stabilizing algorithm for the shortest path problem
Tetz C. Huang
Distributed Computing, 2006, 19 : 149 - 161
[30] An efficient algorithm for the evacuation problem in a certain class of a network with uniform path-lengths
Kamiyama, Naoyuki
Katoh, Naoki
Takizawa, Atsushi
ALGORITHMIC ASPECTS IN INFORMATION AND MANAGEMENT, PROCEEDINGS, 2007, 4508 : 178 - +

← 1 2 3 4 5 →