The Shortcut Problem – Complexity and Approximation

Bauer, Reinhard; D’Angelo, Gianlorenzo; Delling, Daniel; Wagner, Dorothea

doi:10.1007/978-3-540-95891-8_13

Cited by 7 publications

(2 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…There is large interest in a theoretical foundation of the techniques developed and some rst work on the topics have been published [1,4]. In this work we focused on the preprocessing phases of the recent techniques.…”

Section: Discussionmentioning

confidence: 99%

Preprocessing Speed-Up Techniques Is Hard

Bauer

Columbus

Katz

et al. 2010

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

Abstract. During the last years, preprocessing-based techniques have been developed to compute shortest paths between two given points in a road network. These speed-up techniques make the computation a matter of microseconds even on huge networks. While there is a vast amount of experimental work in the eld, there is still large demand on theoretical foundations. The preprocessing phases of most speed-up techniques leave open some degree of freedom which, in practice, is lled in a heuristical fashion. Thus, for a given speed-up technique, the problem arises of how to ll the according degree of freedom optimally. Until now, the complexity status of these problems was unknown. In this work, we answer this question by showing NP-hardness for the recent techniques. Part of this report has been published in [3]. However, this work includes all proofs omitted there.

show abstract

Section: Discussionmentioning

confidence: 99%

Preprocessing Speed-Up Techniques Is Hard

Bauer

Columbus

Katz

et al. 2010

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

show abstract

“…The procedure of the combinatorial approach is shown in Figure 1. A search of shortcut Dijkstra algorithm (Bauer et al, 2009;Kümmerle et al, 2015) offered USV a feasible optimal global path which was as short as possible within the specific electronic map before cruise. USV moves along the global path until encountering unknown obstacles.…”

Section: Introductionmentioning

confidence: 99%

A novel method of unmanned surface vehicle autonomous cruise

Xie

Liu

et al. 2016

Industrial Robot: An International Journal

View full text Add to dashboard Cite

Purpose – This paper aims to propose a new method for combining global path planning with local path planning, to provide an efficient solution for unmanned surface vehicle (USV) path planning despite the changeable environment. Path planning is the key issue of USV navigation. A lot of research works were done on the global and local path planning. However, little attention was given to combining global path planning with local path planning. Design/methodology/approach – A search of shortcut Dijkstra algorithm was used to control the USV in the global path planning. When the USV encounters unknown obstacles, it switches to our modified artificial potential field (APF) algorithm for local path planning. The combinatorial method improves the approach of USV path planning in complex environment. Findings – The method in this paper offers a solution to the issue of path planning in changeable or unchangeable environment, and was confirmed by simulations and experiments. The USV follows the global path based on the search of shortcut Dijkstra algorithm. Both USV achieves obstacle avoidances in the local region based on the modified APF algorithm after obstacle detection. Both the simulation and experimental results demonstrate that the combinatorial path planning method is more efficient in the complex environment. Originality/value – This paper proposes a new path planning method for USV in changeable environment. The proposed method is capable of efficient navigation in changeable and unchangeable environment.

show abstract

Algorithm Engineering for Route Planning – An Update –

Wagner

2011

Algorithms and Computation

View full text Add to dashboard Cite

The Shortcut Problem – Complexity and Approximation

Cited by 7 publications

References 16 publications

Preprocessing Speed-Up Techniques Is Hard

Preprocessing Speed-Up Techniques Is Hard

A novel method of unmanned surface vehicle autonomous cruise

Algorithm Engineering for Route Planning – An Update –

Contact Info

Product

Resources

About