Localizing a Robot with Minimum Travel

DOI10.1137/S0097539794279201zbMath0907.68109OpenAlexW1980745281MaRDI QIDQ4388887

Kathleen Romanik, Gregory Dudek, S. H. 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

optimizationnavigationNP-hardlocalizationvisibilitypositioningsensingrobotcompetitive strategy

Mathematics Subject Classification ID

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

Related Items (4)

On the minimum-time control problem for differential drive robots with bearing constraints ⋮ Linear search by a pair of distinct-speed robots ⋮ Linear Search by a Pair of Distinct-Speed Robots ⋮ Optimal robot localization in trees

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