Pages that link to "Item:Q2368973"
From MaRDI portal
The following pages link to Competitive exploration of rectilinear polygons (Q2368973):
Displaying 11 items.
- Online algorithms for searching and exploration in the plane (Q465662) (← links)
- Optimality and competitiveness of exploring polygons by mobile robots (Q617716) (← links)
- Polygon exploration with time-discrete vision (Q1037781) (← links)
- Improved exploration of unknown polygons (Q2672604) (← links)
- Online Exploration of Polygons with Holes (Q2848914) (← links)
- (Q3150180) (← links)
- Chasing Convex Bodies with Linear Competitive Ratio (Q5056421) (← links)
- Off-line exploration of rectangular cellular environments with a rectangular obstacle (Q5058395) (← links)
- Fundamentals of Computation Theory (Q5900800) (← links)
- Tight bounds for deterministic high-dimensional grid exploration (Q6535010) (← links)
- Competitive searching over terrains (Q6547937) (← links)