Competitive exploration of rectilinear polygons

DOI10.1016/J.TCS.2005.11.032MaRDI QIDQ2368973zbMATH OpenOpenAlexFDO

Authors Mia Persson, Mikael Hammar, Bengt J. Nilsson

Publication date 28 April 2006

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2005.11.032

zbMATH Keywords

Competitive analysisOnline algorithms

Mathematics Subject Classification ID

Artificial intelligence for robotics (68T40) Nonnumerical algorithms (68W05)

Recommendations

• Competitive exploration of rectilinear polygons.
• scientific article; zbMATH DE number 1809601
• Optimality and Competitiveness of Exploring Polygons by Mobile Robots
• Optimality and competitiveness of exploring polygons by mobile robots
• Online exploration of all vertices in a simple polygon

Cites work

• AN ON-LINE ALGORITHM FOR NAVIGATING IN AN UNKNOWN ENVIRONMENT
• How to learn an unknown environment. I
• scientific article; zbMATH DE number 1809601 (Why is no real title available?)
• scientific article; zbMATH DE number 1003229 (Why is no real title available?)
• Optimum watchman routes
• Shortest paths without a map
• The polygon exploration problem

Cited in

(17)

• Polygon exploration with time-discrete vision
• Improved exploration of unknown polygons
• Online exploration of polygons with holes
• Online exploration of all vertices in a simple polygon
• scientific article; zbMATH DE number 1809601 (Why is no real title available?)
• Optimality and Competitiveness of Exploring Polygons by Mobile Robots
• How to learn an unknown environment. I
• Online algorithms for searching and exploration in the plane
• scientific article; zbMATH DE number 2085302 (Why is no real title available?)
• Online exploration and triangulation in orthogonal polygonal regions
• Chasing Convex Bodies with Linear Competitive Ratio
• Off-line exploration of rectangular cellular environments with a rectangular obstacle
• Competitive exploration of rectilinear polygons.
• Optimality and competitiveness of exploring polygons by mobile robots
• Tight bounds for deterministic high-dimensional grid exploration
• Competitive searching over terrains
• On-line exploration of an unbounded region with one obstacle

This page was built for publication: Competitive exploration of rectilinear polygons

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