Pages that link to "Item:Q5956837"
From MaRDI portal
The following pages link to Exploring unknown environments with obstacles (Q5956837):
Displaying 13 items.
- Worst-case optimal exploration of terrains with obstacles (Q384930) (← links)
- Optimality and competitiveness of exploring polygons by mobile robots (Q617716) (← links)
- Efficient exploration of unknown indoor environments using a team of mobile robots (Q1022458) (← links)
- Polygon exploration with time-discrete vision (Q1037781) (← links)
- Evacuating two robots from multiple unknown exits in a circle (Q1686109) (← links)
- Search on a line with faulty robots (Q2010608) (← links)
- Advice complexity of treasure hunt in geometric terrains (Q2051769) (← links)
- Graph exploration by energy-sharing mobile agents (Q2117723) (← links)
- Evacuating from \(\ell_p\) unit disks in the wireless model (extended abstract) (Q2148885) (← links)
- Rendezvous in planar environments with obstacles and unknown initial distance (Q2321296) (← links)
- Evacuating from \(\ell_p\) unit disks in the wireless model (Q2680178) (← links)
- Better Upper Bounds for Searching on a Line with Byzantine Robots (Q3297827) (← links)
- Search on a Line by Byzantine Robots (Q6114825) (← links)