The following pages link to Shortest paths without a map (Q809612):
Displaying 47 items.
- Optimal path discovery problem with homogeneous knowledge (Q2300623) (← links)
- Generalized Canadian traveller problems (Q2343992) (← links)
- Complexity of node coverage games (Q2344734) (← links)
- An optimal randomized online algorithm for the \(k\)-Canadian traveller problem on node-disjoint paths (Q2352354) (← links)
- Meeting a deadline: shortest paths on stochastic directed acyclic graphs with information gathering (Q2364368) (← links)
- Competitive exploration of rectilinear polygons (Q2368973) (← links)
- The \(k\)-Canadian travelers problem with communication (Q2392736) (← links)
- Fibonacci helps to evacuate from a convex region in a grid network (Q2410092) (← links)
- On the online multi-agent O-D \(k\)-Canadian traveler problem (Q2410097) (← links)
- Competitive analysis of randomized online strategies for the multi-agent \(k\)-Canadian traveler problem (Q2424652) (← links)
- On the randomized online strategies for the \(k\)-Canadian traveler problem (Q2424806) (← links)
- The covering Canadian traveller problem (Q2440168) (← links)
- Online graph exploration on trees, unicyclic graphs and cactus graphs (Q2656355) (← links)
- Approximating the Canadian traveller problem with online randomization (Q2663716) (← links)
- An online optimization approach for post-disaster relief distribution with online blocked edges (Q2669638) (← links)
- Searching game trees under a partial order (Q2674204) (← links)
- Complexity of planning for connected agents in a partially known environment (Q2680862) (← links)
- The influence of maximum \((s,t)\)-cuts on the competitiveness of deterministic strategies for the Canadian traveller problem (Q2680863) (← links)
- An \(\mathrm{AO}^{*}\) based exact algorithm for the Canadian traveler problem (Q2806869) (← links)
- Intuitionistic Layered Graph Logic (Q2817944) (← links)
- Penalty-Based Algorithms for the Stochastic Obstacle Scene Problem (Q2962565) (← links)
- The k-Canadian Travelers Problem with Communication (Q3004652) (← links)
- The reset disambiguation policy for navigating stochastic obstacle fields (Q3005837) (← links)
- Online Graph Exploration: New Results on Old and New Algorithms (Q3012942) (← links)
- MULTIDIMENSIONAL ONLINE MOTION PLANNING FOR A SPHERICAL ROBOT (Q3070042) (← links)
- Treasure Hunt with Advice (Q3460725) (← links)
- COMPETITIVE COMPLEXITY OF MOBILE ROBOT ON-LINE MOTION PLANNING PROBLEMS (Q3575385) (← links)
- Computing shortest paths with uncertainty (Q4418665) (← links)
- Impact of topographic information on graph exploration efficiency (Q4519131) (← links)
- Online Strategies for Evacuating from a Convex Region in the Plane (Q4632211) (← links)
- Efficient strategies for robot navigation in unknown environment (Q4632462) (← links)
- LOWER BOUNDS FOR STREETS AND GENERALIZED STREETS (Q4682162) (← links)
- ONLINE ROUTING IN CONVEX SUBDIVISIONS (Q4818562) (← links)
- Learning-Based Mean-Payoff Optimization in an Unknown MDP under Omega-Regular Constraints (Q5009420) (← links)
- Walking streets faster (Q5054825) (← links)
- Going home through an unknown street (Q5057428) (← links)
- On a simple depth-first search strategy for exploring unknown graphs (Q5096951) (← links)
- A Risk-Reward Competitive Analysis for the Recoverable Canadian Traveller Problem (Q5505679) (← links)
- Random disambiguation paths for traversing a mapped hazard field (Q5706240) (← links)
- (Q5708535) (← links)
- Lower bounds in on-line geometric searching (Q5931368) (← links)
- The ultimate strategy to search on \(m\) rays? (Q5941439) (← links)
- Parallel searching on \(m\) rays (Q5943313) (← links)
- Efficient, optimal stochastic-action selection when limited by an action budget (Q5962147) (← links)
- Canadian traveller problem with predictions (Q6176553) (← links)
- Competitive searching in polygons—Beyond generalised streets (Q6487943) (← links)
- A new competitive algorithm for agent searching in unknown streets (Q6567764) (← links)
