A near-tight approximation algorithm for the robot localization problem

DOI10.1137/070682885MaRDI QIDQ3558011zbMATH OpenOpenAlexFDO

Authors Sven Koenig, Joseph S. B. Mitchell, Apurva Mudgal, Craig A. Tovey

Publication date 29 April 2010

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/070682885

zbMATH Keywords

approximation algorithmcomputational geometryhardness of approximationkidnapped robotlocalizationrobotics

Mathematics Subject Classification ID

Reasoning under uncertainty in the context of artificial intelligence (68T37) Artificial intelligence for robotics (68T40) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)

Recommendations

• scientific article; zbMATH DE number 910901
• Mobile robot self-localization without explicit landmarks
• Localizing a Robot with Minimum Travel
• Robust Monte Carlo localization for mobile robots
• The Robot Localization Problem

Cited in

(6)

• Approximation algorithms for pick-and-place robots
• Optimal robot localization in trees
• A unified and efficient solution to the room search problem
• The Robot Localization Problem
• Localizing a Robot with Minimum Travel
• scientific article; zbMATH DE number 910901 (Why is no real title available?)

This page was built for publication: A near-tight approximation algorithm for the robot localization problem

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