scientific article; zbMATH DE number 2085302
From MaRDI portal
Publication:4736555
zbMath1053.68847MaRDI QIDQ4736555
Tom Kamphans, Rolf Klein, Elmar Langetepe, Christian Icking
Publication date: 9 August 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2238/22380245.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
On the approximation of shortest escape paths ⋮ Inspecting a Set of Strips Optimally ⋮ Optimality and competitiveness of exploring polygons by mobile robots ⋮ Searching for an axis-parallel shoreline ⋮ The simple grid polygon exploration problem ⋮ Classifying the multi robot path finding problem into a quadratic competitive complexity class ⋮ Competitive on-line coverage of grid environments by a mobile robot