Localizing a Robot with Minimum Travel

DOI10.1137/S0097539794279201MaRDI QIDQ4388887zbMATH OpenOpenAlexFDO

Authors Gregory Dudek, Kathleen Romanik, Sue Whitesides

Publication date 10 May 1998

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

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

zbMATH Keywords

competitive strategylocalizationnavigationNP-hardoptimizationpositioningrobotsensingvisibility

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Artificial intelligence (68T99) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computing methodologies and applications (68U99)

Recommendations

• scientific article; zbMATH DE number 910901
• The Robot Localization Problem
• A Robust and E±cient Algorithm for Mobile Robot Localization
• A near-tight approximation algorithm for the robot localization problem
• Robot location estimation in the situation calculus
• Optimal robot localization in trees

Cited in

(13)

• Linear search by a pair of distinct-speed robots
• Optimal robot localization in trees
• On the minimum-time control problem for differential drive robots with bearing constraints
• Linear search by a pair of distinct-speed robots
• scientific article; zbMATH DE number 1803766 (Why is no real title available?)
• A near-tight approximation algorithm for the robot localization problem
• The Robot Localization Problem
• Robot Navigation with Distance Queries
• scientific article; zbMATH DE number 910901 (Why is no real title available?)
• Can a skywalker localize the midpoint of a rope?
• Simple Robots in Polygonal Environments: A Hierarchy
• Mapping a polygon with holes using a compass
• Locating a robot with angle measurements

This page was built for publication: Localizing a Robot with Minimum Travel

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