2017
DOI: 10.1007/s00778-017-0455-8
|View full text |Cite
|
Sign up to set email alerts
|

Finding lowest-cost paths in settings with safe and preferred zones

Abstract: We define and study Euclidean and spatial network variants of a new path finding problem: given a set of safe or preferred zones with zero or low cost, find paths that minimize the cost of travel from an origin to a destination. In this problem, the entire space is passable, with preference given to safe or preferred zones. Existing algorithms for problems that involve unsafe regions to be avoided strictly are not effective for this new problem.To solve the Euclidean variant, we devise a transformation of the … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
24
0

Year Published

2017
2017
2023
2023

Publication Types

Select...
4
1

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(25 citation statements)
references
References 22 publications
1
24
0
Order By: Relevance
“…Essentially, computing MPUP resembles a shortest path problem where the cost of moving inside the components of the preferred graph is zero. This problem was introduced in [3,4] as the safest path via safe zones for Euclidean spaces but also studied for road networks; to the best of our knowledge, this is the most relevant work to ours. The authors proposed the HyperEdges algorithm which employs a dense hypergraph with every component of the preferred network serving as a node.…”
Section: Contributionsmentioning
confidence: 99%
See 4 more Smart Citations
“…Essentially, computing MPUP resembles a shortest path problem where the cost of moving inside the components of the preferred graph is zero. This problem was introduced in [3,4] as the safest path via safe zones for Euclidean spaces but also studied for road networks; to the best of our knowledge, this is the most relevant work to ours. The authors proposed the HyperEdges algorithm which employs a dense hypergraph with every component of the preferred network serving as a node.…”
Section: Contributionsmentioning
confidence: 99%
“…For this purpose, we introduce the problem of computing the Most Preferred Near Shortest Path (MPNSP); an early study on the problem was conducted in [8]. Note that our MPNSP differs from the safest path via preferred zones (SPPZ) also proposed in [3,4], but not studied for road networks. Essentially, SPPZ looks for a path that minimizes a linear combination of the time spent inside and outside the preferred network; however, the recommended path may still be arbitrary long and potentially of little value for the user.…”
Section: Contributionsmentioning
confidence: 99%
See 3 more Smart Citations