The following pages link to (Q4335188):
Displaying 28 items.
- Online algorithms for searching and exploration in the plane (Q465662) (← links)
- Optimality and competitiveness of exploring polygons by mobile robots (Q617716) (← 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)
- Weighted nearest neighbor algorithms for the graph exploration problem on cycles (Q990116) (← links)
- Polygon exploration with time-discrete vision (Q1037781) (← 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)
- 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)
- Search on a line with faulty robots (Q2010608) (← links)
- Graph exploration by energy-sharing mobile agents (Q2117723) (← links)
- Online exploration outside a convex obstacle (Q2166745) (← links)
- Rendezvous in planar environments with obstacles and unknown initial distance (Q2321296) (← links)
- Group search of the plane with faulty robots (Q2326387) (← links)
- Walking in streets with minimal sensing (Q2355994) (← links)
- Competitive exploration of rectilinear polygons (Q2368973) (← links)
- Walking in Streets with Minimal Sensing (Q2867134) (← links)
- Better Upper Bounds for Searching on a Line with Byzantine Robots (Q3297827) (← 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)
- Energy Consumption of Group Search on a Line (Q5092340) (← links)
- Position-independent near optimal searching and on-line recognition in star polygons (Q5096946) (← links)
- An optimal online algorithm for halfplane intersection (Q5938679) (← links)
- Parallel searching on \(m\) rays (Q5943313) (← links)
- Search on a Line by Byzantine Robots (Q6114825) (← links)
- Competitive searching in polygons—Beyond generalised streets (Q6487943) (← links)
