Pages that link to "Item:Q1194307"
From MaRDI portal
The following pages link to Walking an unknown street with bounded detour (Q1194307):
Displaying 19 items.
- Tight analysis of a self-approaching strategy for the online kernel-search problem (Q294606) (← links)
- Online algorithms for searching and exploration in the plane (Q465662) (← links)
- Agent search in uniform b-ary trees: Multiple goals and unequal costs (Q671265) (← links)
- On-line path planning in an unknown polygonal environment (Q707338) (← links)
- Optimal on-line algorithms for walking with minimum number of turns in unknown streets (Q1370934) (← links)
- Searching and on-line recognition of star-shaped polygons. (Q1427863) (← links)
- Piecemeal graph exploration by a mobile robot. (Q1854296) (← links)
- On-line parallel heuristics, processor scheduling and robot searching under the competitive framework (Q1884992) (← links)
- Walking in streets with minimal sensing (Q2355994) (← links)
- Walking in Streets with Minimal Sensing (Q2867134) (← links)
- GENERALIZING MONOTONICITY: ON RECOGNIZING SPECIAL CLASSES OF POLYGONS AND POLYHEDRA (Q3373056) (← links)
- LOWER BOUNDS FOR STREETS AND GENERALIZED STREETS (Q4682162) (← links)
- Walking streets faster (Q5054825) (← links)
- Lower bounds in on-line geometric searching metric searching (Q5055955) (← links)
- Going home through an unknown street (Q5057428) (← links)
- Position-independent near optimal searching and on-line recognition in star polygons (Q5096946) (← links)
- The ultimate strategy to search on \(m\) rays? (Q5941439) (← links)
- Parallel searching on \(m\) rays (Q5943313) (← links)
- Competitive searching in polygons—Beyond generalised streets (Q6487943) (← links)
