A local strategy for cleaning expanding cellular domains by simple robots

DOI10.1016/j.tcs.2015.08.036zbMath1330.68272arXiv1502.03985OpenAlexW2963566383MaRDI QIDQ888433

Elmar Langetepe, Rolf Klein, David Kriesel

Publication date: 30 October 2015

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

Full work available at URL: https://arxiv.org/abs/1502.03985

zbMATH Keywords

motion planningfinite automatacleaning strategyexpanding contamination

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Artificial intelligence for robotics (68T40)

Related Items (1)

On-line exploration of rectangular cellular environments with a rectangular hole

Cites Work

• Unnamed Item
• Static and expanding grid coverage with ant robots: complexity results
• An annotated bibliography on guaranteed graph searching
• How many lions are needed to clear a grid?
• Approximation algorithms for lawn mowing and milling
• Competitive on-line coverage of grid environments by a mobile robot
• Coverage for robotics -- a survey of recent results
• On Minimal Perimeter Polyminoes
• Computing and Combinatorics

This page was built for publication: A local strategy for cleaning expanding cellular domains by simple robots