A traveller's problem

DOI10.1145/1810959.1810991zbMath1284.68583OpenAlexW2038979061MaRDI QIDQ5405880

Florian Berger, Rolf Klein

Publication date: 3 April 2014

Published in: Proceedings of the twenty-sixth annual symposium on Computational geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1810959.1810991

zbMATH Keywords

partitionundecidabilitymotion planningcomputational geometryaffine mappingsNP-hardnesscontinuous Dijkstrafroggerpseudo-polynomial approximation

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Management decision making, including multiple objectives (90B50) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Affine analytic geometry (51N10)

Related Items (2)

On the Complexity of an Unregulated Traffic Crossing ⋮ Scheduling Autonomous Vehicle Platoons Through an Unregulated Intersection

This page was built for publication: A traveller's problem