Bounds on the cleaning times of robot vacuums

DOI10.1016/J.ORL.2009.09.002MaRDI QIDQ2270327zbMATH OpenOpenAlexFDO

Authors Adrian Vetta, Zhentao Li

Publication date 18 March 2010

Published in Operations Research Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.orl.2009.09.002

zbMATH Keywords

cleaning processcover timedeterministic walk

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph theory (including graph drawing) in computer science (68R10) Artificial intelligence for robotics (68T40) Combinatorial optimization (90C27)

Recommendations

• The robot cleans up
• The Robot Cleans Up
• scientific article; zbMATH DE number 7075870
• Parallel cleaning of a network with brushes
• A local strategy for cleaning expanding cellular domains by simple robots

Cites work

• Simulating a Random Walk with Constant Error
• The Robot Cleans Up

Cited in

(7)

• The robot crawler graph process
• scientific article; zbMATH DE number 2115527 (Why is no real title available?)
• scientific article; zbMATH DE number 7075870 (Why is no real title available?)
• How often should you clean your room?
• The Robot Cleans Up
• Autonomous robot vacuum system composed of a cleaner robot and a dust storage robot
• The robot cleans up

This page was built for publication: Bounds on the cleaning times of robot vacuums

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