On the approximation of shortest escape paths

DOI10.1016/J.COMGEO.2020.101709MaRDI QIDQ827333zbMATH OpenOpenAlexFDO

Authors David Kübel, Elmar Langetepe

Publication date 7 January 2021

Published in Computational Geometry (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.comgeo.2020.101709

zbMATH Keywords

approximationcompetitive analysisescape pathspiral search

Mathematics Subject Classification ID

Inequalities and extremum problems in real or complex geometry (51M16) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25) Analysis of algorithms (68W40)

Recommendations

• Optimal online escape path against a certificate
• Lost in a forest
• Shortest paths without a map
• Competitive Online Approximation of the Optimal Search Ratio
• An Optimal Competitive Strategy for Walking in Streets

Cites work

• A question of Bellman
• Besicovitch triangles cover unit arcs
• Competitive Online Approximation of the Optimal Search Ratio
• scientific article; zbMATH DE number 3179414 (Why is no real title available?)
• scientific article; zbMATH DE number 2085302 (Why is no real title available?)
• scientific article; zbMATH DE number 2102754 (Why is no real title available?)
• scientific article; zbMATH DE number 6297684 (Why is no real title available?)
• Hyperbolic Dovetailing
• Lost in a forest
• Minimum covers for arcs of constant length
• On Arcs that Cannot be Covered by an Open Equilateral Triangle of Side 1
• Problems, problems, problems
• Searching in the plane
• The Shortest Planar Arc of Width 1
• Universale Rettungskurven. I. (Universal rescue curves. I)

Cited in

(6)

• Lost in a forest
• Optimal online escape path against a certificate
• Escaping Off-Line Searchers and a Discrete Isoperimetric Theorem
• Maximal distortion of geodesic diameters in polygonal domains
• Non-stationary value iteration for adaptive average control of piecewise deterministic Markov processes
• Escaping offline searchers and isoperimetric theorems

This page was built for publication: On the approximation of shortest escape paths

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q827333)