OTHER
The Polygon Exploration Problem I: A Competitive Strategy
Frank Hoffmann, Christian Icking, Rolf Klein, Klaus Kriegel
- Year
- 1998
- Citations
- 2
Abstract
We present an on-line strategy that enables a mobile robot with vision to explore an unknown simple polygon. We prove that the resulting tour is less than 26.5 times as long as the shortest watchman tour that could be computed o#-line.
Keywords
Polygon (computer graphics)Simple polygonHullComputer scienceArtificial intelligenceLine (geometry)Simple (philosophy)Competitive analysisMobile robotComputer vision
Related papers
OTHER
📊 26,957 cites
Statistical Learning Theory
Yuhai Wu, Vladimir Vapnik
1999
PERCEPTION
📊 22,245 cites
Artificial intelligence: a modern approach
1995
OTHER
Open access📊 20,501 cites
Fractional Differential Equations
Igor Podlubný
2025
OTHER
📊 18,993 cites
Applied Nonlinear Control
Jean-Jacques Slotine, Weiping Li
1991