The following pages link to (Q4335188):
Displaying 13 items.
- Online algorithms for searching and exploration in the plane (Q465662) (← links)
- Optimality and competitiveness of exploring polygons by mobile robots (Q617716) (← links)
- On-line path planning in an unknown polygonal environment (Q707338) (← links)
- Weighted nearest neighbor algorithms for the graph exploration problem on cycles (Q990116) (← links)
- Polygon exploration with time-discrete vision (Q1037781) (← links)
- Searching and on-line recognition of star-shaped polygons. (Q1427863) (← links)
- Evacuating two robots from multiple unknown exits in a circle (Q1686109) (← links)
- On-line parallel heuristics, processor scheduling and robot searching under the competitive framework (Q1884992) (← links)
- Lower bounds in on-line geometric searching metric searching (Q5055955) (← links)
- Position-independent near optimal searching and on-line recognition in star polygons (Q5096946) (← links)
- Parallel searching on \(m\) rays (Q5943313) (← links)
- Search and rescue on the line (Q6148070) (← links)
- Competitive searching in polygons—Beyond generalised streets (Q6487943) (← links)
