The following pages link to Shortest paths without a map (Q809612):
Displayed 40 items.
- Discussion of ``Network routing in a dynamic environment'' (Q641087) (← links)
- Agent search in uniform b-ary trees: Multiple goals and unequal costs (Q671265) (← links)
- On-line path planning in an unknown polygonal environment (Q707338) (← links)
- Performance bounds for planning in unknown terrain (Q814477) (← links)
- An on-line multi-CBR agent dispatching algorithm (Q855211) (← links)
- Tree exploration with advice (Q958304) (← links)
- A note on the \(k\)-Canadian traveller problem (Q963338) (← links)
- On the two-dimensional cow search problem (Q987818) (← links)
- Weighted nearest neighbor algorithms for the graph exploration problem on cycles (Q990116) (← links)
- A representation theorem for minmax regret policies (Q1028893) (← links)
- The Canadian Traveller Problem and its competitive analysis (Q1037454) (← links)
- Interactive foundations of computing (Q1127523) (← links)
- Utility-based on-line exploration for repeated navigation in an embedded graph (Q1274283) (← links)
- Competitive algorithms for the weighted server problem (Q1331957) (← links)
- Agent searching in a tree and the optimality of iterative deepening (Q1341670) (← links)
- On-line algorithms for weighted bipartite matching and stable marriages (Q1342235) (← links)
- On the complexity of partially observed Markov decision processes (Q1351500) (← links)
- Optimal on-line algorithms for walking with minimum number of turns in unknown streets (Q1370934) (← links)
- Online matching on a line (Q1770389) (← links)
- Piecemeal graph exploration by a mobile robot. (Q1854296) (← links)
- Optimal robot localization in trees (Q1854481) (← links)
- The power of a pebble: Exploring and mapping directed graphs (Q1854539) (← links)
- Competitive online routing in geometric graphs (Q1887089) (← links)
- The weighted 2-server problem (Q1887090) (← links)
- The CNN problem and other \(k\)-server variants (Q1887095) (← links)
- Competitive exploration of rectilinear polygons (Q2368973) (← 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)
- COMPETITIVE COMPLEXITY OF MOBILE ROBOT ON-LINE MOTION PLANNING PROBLEMS (Q3575385) (← links)
- (Q4519131) (← links)
- LOWER BOUNDS FOR STREETS AND GENERALIZED STREETS (Q4682162) (← links)
- ONLINE ROUTING IN CONVEX SUBDIVISIONS (Q4818562) (← links)
- A Risk-Reward Competitive Analysis for the Recoverable Canadian Traveller Problem (Q5505679) (← 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)