Polygon exploration with time-discrete vision

DOI10.1016/j.comgeo.2009.06.003zbMath1192.65023OpenAlexW1982918678MaRDI QIDQ1037781

Sándor P. Fekete, Christiane Schmidt

Publication date: 16 November 2009

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.comgeo.2009.06.003

zbMATH Keywords

searchingautonomous mobile robotsonline searchingvisibility problemscompetitive strategiesscan costwatchman problems

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Related Items (4)

Minimum covering with travel cost ⋮ Online algorithms for searching and exploration in the plane ⋮ Exploring and Triangulating a Region by a Swarm of Robots ⋮ Rendezvous in planar environments with obstacles and unknown initial distance

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A nearly optimal sensor placement algorithm for boundary coverage
• Optimum watchman routes
• Computing vision points in polygons
• A combinatorial theorem in plane geometry
• Finding the shortest watchman route in a simple polygon
• Approximation algorithms for lawn mowing and milling
• Competitive exploration of rectilinear polygons
• Online searching with an autonomous robot
• Online searching with turn cost
• The Polygon Exploration Problem
• How to learn an unknown environment. I
• AN INCREMENTAL ALGORITHM FOR CONSTRUCTING SHORTEST WATCHMAN ROUTES
• Two NP‐Hard Art‐Gallery Problems for Ortho‐Polygons
• CORRIGENDUM TO "AN INCREMENTAL ALGORITHM FOR CONSTRUCTING SHORTEST WATCHMAN ROUTES"
• Exploring unknown environments with obstacles

This page was built for publication: Polygon exploration with time-discrete vision