Pages that link to "Item:Q2025057"
From MaRDI portal
The following pages link to The simple grid polygon exploration problem (Q2025057):
Displaying 6 items.
- Hybrid grids and the Homing robot (Q1827843) (← links)
- Competitive on-line coverage of grid environments by a mobile robot (Q1869751) (← links)
- The polygon exploration problem (Q2784471) (← links)
- Efficient grid exploration with a stationary token (Q2929616) (← links)
- An Algorithm to Compute Any Simple $k$-gon of a Maximum Area or Perimeter Inscribed in a Region of Interest (Q5056924) (← links)
- On-line exploration of rectangular cellular environments with a rectangular hole (Q6195347) (← links)