An experimental study of weighted k-link shortest path algorithms

Ovidiu Daescu, Joseph S B Mitchell, Simeon Ntafos, James D Palmer, Chee K. Yap

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

We consider the problem of computing a minimum-weight polygonal path between two points in a weighted polygonal subdivision, subject to the constraint that the path have few segments (links). We give an algorithm that generates paths of weighted length at most (1 + ε) times the weight of a minimum-cost k-link path, for any fixed ε > 0, while using at most 2k - 1 links. This is an improvement over the previous (1 + ε)-approximation algorithm, which used at most 5k - 2 links. Further, we have implemented our new algorithm and we have conducted a performance study of these algorithms (old and new) on a variety of real-world and synthetic data, comparing not only the efficiency but also the quality of paths generated using these algorithms. We also consider the implications of these results on the practical usage of these algorithms.

Original languageEnglish (US)
Title of host publicationSpringer Tracts in Advanced Robotics
Pages187-202
Number of pages16
Volume47
DOIs
StatePublished - 2008
Externally publishedYes
Event7th International Workshop on the Algorithmic Foundations of Robotics, WAFR 2006 - New York, NY, United States
Duration: Jul 16 2006Jul 18 2006

Publication series

NameSpringer Tracts in Advanced Robotics
Volume47
ISSN (Print)16107438
ISSN (Electronic)1610742X

Other

Other7th International Workshop on the Algorithmic Foundations of Robotics, WAFR 2006
CountryUnited States
CityNew York, NY
Period7/16/067/18/06

Fingerprint

Approximation algorithms
Costs

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Artificial Intelligence

Cite this

Daescu, O., Mitchell, J. S. B., Ntafos, S., Palmer, J. D., & Yap, C. K. (2008). An experimental study of weighted k-link shortest path algorithms. In Springer Tracts in Advanced Robotics (Vol. 47, pp. 187-202). (Springer Tracts in Advanced Robotics; Vol. 47). https://doi.org/10.1007/978-3-540-68405-3_12

An experimental study of weighted k-link shortest path algorithms. / Daescu, Ovidiu; Mitchell, Joseph S B; Ntafos, Simeon; Palmer, James D; Yap, Chee K.

Springer Tracts in Advanced Robotics. Vol. 47 2008. p. 187-202 (Springer Tracts in Advanced Robotics; Vol. 47).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Daescu, O, Mitchell, JSB, Ntafos, S, Palmer, JD & Yap, CK 2008, An experimental study of weighted k-link shortest path algorithms. in Springer Tracts in Advanced Robotics. vol. 47, Springer Tracts in Advanced Robotics, vol. 47, pp. 187-202, 7th International Workshop on the Algorithmic Foundations of Robotics, WAFR 2006, New York, NY, United States, 7/16/06. https://doi.org/10.1007/978-3-540-68405-3_12
Daescu O, Mitchell JSB, Ntafos S, Palmer JD, Yap CK. An experimental study of weighted k-link shortest path algorithms. In Springer Tracts in Advanced Robotics. Vol. 47. 2008. p. 187-202. (Springer Tracts in Advanced Robotics). https://doi.org/10.1007/978-3-540-68405-3_12
Daescu, Ovidiu ; Mitchell, Joseph S B ; Ntafos, Simeon ; Palmer, James D ; Yap, Chee K. / An experimental study of weighted k-link shortest path algorithms. Springer Tracts in Advanced Robotics. Vol. 47 2008. pp. 187-202 (Springer Tracts in Advanced Robotics).
@inproceedings{6b23cbe00c73499aa9d3e556bc46d99a,
title = "An experimental study of weighted k-link shortest path algorithms",
abstract = "We consider the problem of computing a minimum-weight polygonal path between two points in a weighted polygonal subdivision, subject to the constraint that the path have few segments (links). We give an algorithm that generates paths of weighted length at most (1 + ε) times the weight of a minimum-cost k-link path, for any fixed ε > 0, while using at most 2k - 1 links. This is an improvement over the previous (1 + ε)-approximation algorithm, which used at most 5k - 2 links. Further, we have implemented our new algorithm and we have conducted a performance study of these algorithms (old and new) on a variety of real-world and synthetic data, comparing not only the efficiency but also the quality of paths generated using these algorithms. We also consider the implications of these results on the practical usage of these algorithms.",
author = "Ovidiu Daescu and Mitchell, {Joseph S B} and Simeon Ntafos and Palmer, {James D} and Yap, {Chee K.}",
year = "2008",
doi = "10.1007/978-3-540-68405-3_12",
language = "English (US)",
isbn = "9783540684046",
volume = "47",
series = "Springer Tracts in Advanced Robotics",
pages = "187--202",
booktitle = "Springer Tracts in Advanced Robotics",

}

TY - GEN

T1 - An experimental study of weighted k-link shortest path algorithms

AU - Daescu, Ovidiu

AU - Mitchell, Joseph S B

AU - Ntafos, Simeon

AU - Palmer, James D

AU - Yap, Chee K.

PY - 2008

Y1 - 2008

N2 - We consider the problem of computing a minimum-weight polygonal path between two points in a weighted polygonal subdivision, subject to the constraint that the path have few segments (links). We give an algorithm that generates paths of weighted length at most (1 + ε) times the weight of a minimum-cost k-link path, for any fixed ε > 0, while using at most 2k - 1 links. This is an improvement over the previous (1 + ε)-approximation algorithm, which used at most 5k - 2 links. Further, we have implemented our new algorithm and we have conducted a performance study of these algorithms (old and new) on a variety of real-world and synthetic data, comparing not only the efficiency but also the quality of paths generated using these algorithms. We also consider the implications of these results on the practical usage of these algorithms.

AB - We consider the problem of computing a minimum-weight polygonal path between two points in a weighted polygonal subdivision, subject to the constraint that the path have few segments (links). We give an algorithm that generates paths of weighted length at most (1 + ε) times the weight of a minimum-cost k-link path, for any fixed ε > 0, while using at most 2k - 1 links. This is an improvement over the previous (1 + ε)-approximation algorithm, which used at most 5k - 2 links. Further, we have implemented our new algorithm and we have conducted a performance study of these algorithms (old and new) on a variety of real-world and synthetic data, comparing not only the efficiency but also the quality of paths generated using these algorithms. We also consider the implications of these results on the practical usage of these algorithms.

UR - http://www.scopus.com/inward/record.url?scp=53849124364&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=53849124364&partnerID=8YFLogxK

U2 - 10.1007/978-3-540-68405-3_12

DO - 10.1007/978-3-540-68405-3_12

M3 - Conference contribution

SN - 9783540684046

VL - 47

T3 - Springer Tracts in Advanced Robotics

SP - 187

EP - 202

BT - Springer Tracts in Advanced Robotics

ER -