Optimality and Competitiveness of Exploring Polygons by Mobile Robots

DOI10.1007/978-3-642-04128-0_23MaRDI QIDQ3639251zbMATH OpenOpenAlexFDO

Authors Jurek Czyzowicz, Arnaud Labourel, Andrzej Pelc

Publication date 29 October 2009

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

Full work available at URL https://doi.org/10.1007/978-3-642-04128-0_23

Mathematics Subject Classification ID

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

Recommendations

• Optimality and competitiveness of exploring polygons by mobile robots
• Competitive exploration of rectilinear polygons
• Competitive exploration of rectilinear polygons.
• scientific article; zbMATH DE number 1809601
• An improved strategy for exploring a grid polygon

Cited in

(9)

• Optimal torus exploration by oblivious robots
• Competitive exploration of rectilinear polygons
• Exploring and triangulating a region by a swarm of robots
• Worst-case optimal exploration of terrains with obstacles
• Online exploration and triangulation in orthogonal polygonal regions
• 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
• Finding water on Poleless using melomaniac myopic chameleon robots

This page was built for publication: Optimality and Competitiveness of Exploring Polygons by Mobile Robots

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