Pages that link to "Item:Q5946405"
From MaRDI portal
The following pages link to Searching for mobile intruders in a polygonal region by a group of mobile searchers (Q5946405):
Displaying 11 items.
- Studying the stochastic capturing of moving intruders by mobile sensors (Q356177) (← links)
- Searching for an evader in an unknown dark cave by an optimal number of asynchronous searchers (Q820530) (← links)
- Searching a polygonal region by a group of stationary \(k\)-searchers (Q834883) (← links)
- An annotated bibliography on guaranteed graph searching (Q930895) (← links)
- Meeting in a polygon by anonymous oblivious robots (Q2204780) (← links)
- Mobile sensor intrusion detection under any shape of curve (Q2450539) (← links)
- A unified and efficient solution to the room search problem (Q2479474) (← links)
- Bushiness and a tight worst-case upper bound on the search number of a simple polygon. (Q2583537) (← links)
- A COMPLETE ALGORITHM FOR SEARCHLIGHT SCHEDULING (Q3007726) (← links)
- CLEARING A POLYGON WITH TWO 1-SEARCHERS (Q3628102) (← links)
- Multiple searchers searching for a randomly distributed immobile target on a unit network (Q5228507) (← links)