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 Scopus citations

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 publicationAlgorithmic Foundation of Robotics VII - Selected Contributions of the Seventh International Workshop on the Algorithmic Foundations of Robotics
Pages187-202
Number of pages16
DOIs
StatePublished - Oct 20 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)1610-7438
ISSN (Electronic)1610-742X

Other

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

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Artificial Intelligence

Fingerprint Dive into the research topics of 'An experimental study of weighted k-link shortest path algorithms'. Together they form a unique fingerprint.

Cite this