The polygon exploration problem
From MaRDI portal
Recommendations
Cited in
(40)- Polygon exploration with time-discrete vision
- Evacuating two robots from multiple unknown exits in a circle
- Communication and location discovery in geometric ring networks
- Search on a line with faulty robots
- The simple grid polygon exploration problem
- Advice complexity of treasure hunt in geometric terrains
- Online exploration outside a convex obstacle
- Priority evacuation from a disk: the case of \(n \geq 4\)
- Online graph exploration algorithms for cycles and trees by multiple searchers
- Group search of the plane with faulty robots
- Competitive exploration of rectilinear polygons
- Characterizing and recognizing LR-visibility polygons
- Online searching with an autonomous robot
- Online searching with turn cost
- Improved exploration of unknown polygons
- scientific article; zbMATH DE number 1729272 (Why is no real title available?)
- Online exploration of polygons with holes
- An Integer-Programming-Based Approach to the Close-Enough Traveling Salesman Problem
- Touring a sequence of disjoint polygons: complexity and extension
- Exploring and triangulating a region by a swarm of robots
- Covering a point set by two disjoint rectangles
- scientific article; zbMATH DE number 1809601 (Why is no real title available?)
- Inspecting a Set of Strips Optimally
- Better upper bounds for searching on a line with Byzantine robots
- Reconstructing visibility graphs with simple robots
- An improved on-line strategy for exploring unknown polygons
- Competitive complexity of mobile robot on-line motion planning problems
- Leaving an unknown maze using an error-prone compass
- Touring a sequence of polygons
- Worst-case optimal exploration of terrains with obstacles
- Reconstructing visibility graphs with simple robots
- Online algorithms for searching and exploration in the plane
- Competitive Searching for a Line on a Line Arrangement.
- Energy consumption of group search on a line
- Search on a Line by Byzantine Robots
- Optimality and competitiveness of exploring polygons by mobile robots
- Competitive searching over terrains
- Exploration of convex terrains by a deterministic automaton with pebbles
- On-line exploration of an unbounded region with one obstacle
- Weighted nearest neighbor algorithms for the graph exploration problem on cycles
This page was built for publication: The polygon exploration problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2784471)
