scientific article; zbMATH DE number 1951564

MaRDI QIDQ4413802zbMATH OpenFDO

Authors Sven Schuierer

Publication date 21 July 2003

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2598/25980264.htm

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Artificial intelligence for robotics (68T40)

Recommendations

• The ultimate strategy to search on \(m\) rays?
• scientific article; zbMATH DE number 1222821
• Multi-target ray searching problems
• Parallel searching on \(m\) rays
• Searching on a line: a complete characterization of the optimal solution

Cited in

(14)

• The expanding search ratio of a graph
• Search games: a review
• Further connections between contract-scheduling and ray-searching problems
• Experimental and Efficient Algorithms
• The ultimate strategy to search on \(m\) rays?
• Online search with a hint
• Online algorithms for searching and exploration in the plane
• Weighted online search
• Parallel searching on \(m\) rays
• Revisiting the problem of searching on a line
• Wireless evacuation on \(m\) rays with \(k\) searchers
• Infinite linear programming and online searching with turn cost
• Multi-target ray searching problems
• Lower bounds for searching robots, some faulty

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4413802)