Competitive exploration of rectilinear polygons.

DOI10.1007/B11926MaRDI QIDQ5900800zbMATH OpenOpenAlexFDO

Authors Mikael Hammar, Bengt J. Nilsson, Mia Persson

Publication date 20 April 2010

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b11926

Mathematics Subject Classification ID

Artificial intelligence for robotics (68T40) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Online algorithms; streaming algorithms (68W27)

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

Cited in

(13)

• The simple grid polygon exploration problem
• Competitive exploration of rectilinear polygons
• Online exploration of all vertices in a simple polygon
• scientific article; zbMATH DE number 1809601 (Why is no real title available?)
• An improved strategy for exploring a grid polygon
• An improved on-line strategy for exploring unknown polygons
• Optimality and Competitiveness of Exploring Polygons by Mobile Robots
• How to learn an unknown environment. I
• scientific article; zbMATH DE number 2085302 (Why is no real title available?)
• Online exploration and triangulation in orthogonal polygonal regions
• Optimality and competitiveness of exploring polygons by mobile robots
• A competitive analysis of algorithms for searching unknown scenes
• On-line path planning in an unknown polygonal environment

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 Q5900800)