The following pages link to The Polygon Exploration Problem (Q2784471):
Displaying 32 items.
- Worst-case optimal exploration of terrains with obstacles (Q384930) (← links)
- Reconstructing visibility graphs with simple robots (Q442263) (← links)
- Online algorithms for searching and exploration in the plane (Q465662) (← links)
- Optimality and competitiveness of exploring polygons by mobile robots (Q617716) (← links)
- Weighted nearest neighbor algorithms for the graph exploration problem on cycles (Q990116) (← links)
- Polygon exploration with time-discrete vision (Q1037781) (← links)
- Evacuating two robots from multiple unknown exits in a circle (Q1686109) (← links)
- Communication and location discovery in geometric ring networks (Q1740645) (← links)
- Search on a line with faulty robots (Q2010608) (← links)
- The simple grid polygon exploration problem (Q2025057) (← links)
- Advice complexity of treasure hunt in geometric terrains (Q2051769) (← links)
- Online exploration outside a convex obstacle (Q2166745) (← links)
- Priority evacuation from a disk: the case of \(n \geq 4\) (Q2210503) (← links)
- Online graph exploration algorithms for cycles and trees by multiple searchers (Q2251142) (← links)
- Group search of the plane with faulty robots (Q2326387) (← links)
- Competitive exploration of rectilinear polygons (Q2368973) (← links)
- Characterizing and recognizing LR-visibility polygons (Q2448917) (← links)
- Online searching with an autonomous robot (Q2489019) (← links)
- Online searching with turn cost (Q2503358) (← links)
- Improved exploration of unknown polygons (Q2672604) (← links)
- An Integer-Programming-Based Approach to the Close-Enough Traveling Salesman Problem (Q2940530) (← links)
- Exploring and Triangulating a Region by a Swarm of Robots (Q3088095) (← links)
- COVERING A POINT SET BY TWO DISJOINT RECTANGLES (Q3089094) (← links)
- Inspecting a Set of Strips Optimally (Q3183473) (← links)
- Better Upper Bounds for Searching on a Line with Byzantine Robots (Q3297827) (← links)
- Reconstructing Visibility Graphs with Simple Robots (Q3408162) (← links)
- An Improved On-line Strategy for Exploring Unknown Polygons (Q3467843) (← links)
- COMPETITIVE COMPLEXITY OF MOBILE ROBOT ON-LINE MOTION PLANNING PROBLEMS (Q3575385) (← links)
- LEAVING AN UNKNOWN MAZE USING AN ERROR-PRONE COMPASS (Q3575387) (← links)
- Competitive Searching for a Line on a Line Arrangement. (Q5091041) (← links)
- Energy Consumption of Group Search on a Line (Q5092340) (← links)
- Search on a Line by Byzantine Robots (Q6114825) (← links)
