Pseudo approximation algorithms, with applications to optimal motion planning

DOI10.1145/513400.513422zbMath1414.68145OpenAlexW2052672081MaRDI QIDQ4557552

Chee-Keng Yap, Tetsuo Asano, David G. Kirkpatrick

Publication date: 23 November 2018

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

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

zbMATH Keywords

approximation algorithmsNP-hard problembinary searchEuclidean shortest pathrobot motion planningoptimal motion planning\(d_1\)-optimal motionpseudo approximation

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Artificial intelligence for robotics (68T40)

Related Items (1)

Recent progress in exact geometric computation

This page was built for publication: Pseudo approximation algorithms, with applications to optimal motion planning