Optimality and Competitiveness of Exploring Polygons by Mobile Robots

DOI10.1007/978-3-642-04128-0_23zbMATH Open1256.68148OpenAlexW1537414353MaRDI QIDQ3639251

Arnaud Labourel, Andrzej Pelc, Jurek Czyzowicz

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

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

Related Items (2)

Off-line exploration of rectangular cellular environments with a rectangular obstacle ⋮ Optimal torus exploration by oblivious 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)