The following pages link to Online searching with turn cost (Q2503358):
Displaying 50 items.
- Searching for an axis-parallel shoreline (Q443717) (← links)
- Online algorithms for searching and exploration in the plane (Q465662) (← links)
- Infinite linear programming and online searching with turn cost (Q515543) (← links)
- Searching in an unknown environment: An optimal randomized algorithm for the cow-path problem (Q675058) (← links)
- The beachcombers' problem: walking and searching with mobile robots (Q896140) (← links)
- Network search games with immobile hider, without a designated searcher starting point (Q933761) (← links)
- On the two-dimensional cow search problem (Q987818) (← links)
- Polygon exploration with time-discrete vision (Q1037781) (← links)
- A general framework for searching on a line (Q1676358) (← links)
- Evacuating two robots from multiple unknown exits in a circle (Q1686109) (← links)
- The expanding search ratio of a graph (Q1741496) (← links)
- Linear search by a pair of distinct-speed robots (Q1755792) (← links)
- Lower bounds for searching robots, some faulty (Q1981629) (← links)
- Search on a line with faulty robots (Q2010608) (← links)
- Weighted group search on a line \& implications to the priority evacuation problem (Q2098167) (← links)
- Pebble guided near optimal treasure hunt in anonymous graphs (Q2117728) (← links)
- Further connections between contract-scheduling and ray-searching problems (Q2142675) (← links)
- Evacuating from \(\ell_p\) unit disks in the wireless model (extended abstract) (Q2148885) (← links)
- Online routing and searching on graphs with blocked edges (Q2165266) (← links)
- Competitive search in a network (Q2184175) (← links)
- Deterministic treasure hunt in the plane with angular hints (Q2205634) (← links)
- Priority evacuation from a disk: the case of \(n \geq 4\) (Q2210503) (← links)
- Treasure evacuation with one robot on a disk (Q2220826) (← links)
- Online failure diagnosis in interdependent networks (Q2226505) (← links)
- Beachcombing on strips and islands (Q2285133) (← links)
- Search for an immobile hider in a known subset of a network (Q2328862) (← links)
- Multi-processor search and scheduling problems with setup cost (Q2398209) (← links)
- The ANTS problem (Q2401118) (← links)
- Multi-target ray searching problems (Q2453158) (← links)
- Online searching with an autonomous robot (Q2489019) (← links)
- Pebble guided optimal treasure hunt in anonymous graphs (Q2672573) (← links)
- Evacuating from \(\ell_p\) unit disks in the wireless model (Q2680178) (← links)
- A General Framework for Searching on a Line (Q2803819) (← links)
- Search Games: A Review (Q2961390) (← links)
- Online Searching (Q3635018) (← links)
- A Simplex Method for Countably Infinite Linear Programs (Q5020851) (← links)
- (Q5090453) (← links)
- (Q5091040) (← links)
- Competitive Searching for a Line on a Line Arrangement. (Q5091041) (← links)
- Linear rendezvous with asymmetric clocks (Q5091103) (← links)
- Energy Consumption of Group Search on a Line (Q5092340) (← links)
- Linear Search with Terrain-Dependent Speeds (Q5283387) (← links)
- Approximations of Countably Infinite Linear Programs over Bounded Measure Spaces (Q5853565) (← links)
- Byzantine fault tolerant symmetric-persistent circle evacuation (Q5918713) (← links)
- Time-energy tradeoffs for evacuation by two robots in the wireless model (Q5919064) (← links)
- Wireless evacuation on \(m\) rays with \(k\) searchers (Q5919422) (← links)
- Best-of-both-worlds analysis of online search (Q6066770) (← links)
- Almost-Optimal Deterministic Treasure Hunt in Unweighted Graphs (Q6075758) (← links)
- Impact of knowledge on the cost of treasure hunt in trees (Q6087562) (← links)
- Search on a Line by Byzantine Robots (Q6114825) (← links)
