Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

A Near-Tight Approximation Algorithm for the Robot Localization Problem

From MaRDI portal
Publication:3558011
Jump to:navigation, search

DOI10.1137/070682885zbMath1202.68485OpenAlexW2089473896MaRDI QIDQ3558011

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

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 algorithmlocalizationroboticscomputational geometryhardness of approximationkidnapped robot


Mathematics Subject Classification ID

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





This page was built for publication: A Near-Tight Approximation Algorithm for the Robot Localization Problem

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3558011&oldid=16951597"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 5 February 2024, at 02:46.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki