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 条

[41] AN EFFICIENT PARALLEL CRITICAL PATH ALGORITHM
LIU, LR
DU, DHC
CHEN, HC
IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, 1994, 13 (07) : 909 - 919
[42] An efficient real structure-preserving algorithm for the quaternion weighted least squares problem with equality constraint
Zhang, Fengxia
Li, Ying
JOURNAL OF APPLIED MATHEMATICS AND COMPUTING, 2023, 69 (06) : 4287 - 4306
[43] An efficient real structure-preserving algorithm for the quaternion weighted least squares problem with equality constraint
Fengxia Zhang
Ying Li
Journal of Applied Mathematics and Computing, 2023, 69 : 4287 - 4306
[44] An efficient optimization algorithm for quadratic programming problem and its applications to mobile robot path planning
Cai, Lei
Yang, Juanjuan
Zhao, Li
Wu, Lan
INTERNATIONAL JOURNAL OF ADVANCED ROBOTIC SYSTEMS, 2018, 15 (01):
[45] Path nodes-driven least-cost shortest path tree algorithm
Zhou, Ling
Wang, Jianxin
Jisuanji Yanjiu yu Fazhan/Computer Research and Development, 2011, 48 (05): : 721 - 728
[46] An efficient factoring algorithm for the quickest path multi-state flow network reliability problem
El Khadiri, Mohamed
Yeh, Wei-Chang
Cancela, Hector
COMPUTERS & INDUSTRIAL ENGINEERING, 2023, 179
[47] A memory efficient stochastic evolution based algorithm for the multi-objective shortest path problem
Siddiqi, Umair F.
Shiraishi, Yoichi
Dahb, Mona
Sait, Sadiq M.
APPLIED SOFT COMPUTING, 2014, 14 : 653 - 662
[48] Least-time path algorithm based on missile guidance
Gong, Yan
Li, Sujian
Xing, Enhui
Journal of Transportation Systems Engineering and Information Technology, 2013, 13 (06) : 94 - 100
[49] Exact bidirectional algorithm for the least expected travel-time path problem on stochastic and time-dependent networks
Yamin, Daniel
Medaglia, Andres L.
Prakash, A. Arun
COMPUTERS & OPERATIONS RESEARCH, 2022, 141
[50] A parallel algorithm for solving the Toeplitz Least Squares Problem
Alonso, P
Badía, JM
Vidal, AM
VECTOR AND PARALLEL PROCESSING - VECPAR 2000, 2001, 1981 : 316 - 329

← 1 2 3 4 5 →