Online Parallel Heuristics and Robot Searching under the Competitive Framework

DOI10.1007/3-540-45471-3_27MaRDI QIDQ3046499zbMATH OpenOpenAlexFDO

Authors Sven Schuierer, Alejandro Lopez-Ortiz

Publication date 12 August 2004

Published in Algorithm Theory — SWAT 2002 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-45471-3_27

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Artificial intelligence for robotics (68T40)

Recommendations

• On-line parallel heuristics, processor scheduling and robot searching under the competitive framework
• Parallel searching on m rays
• Search on a line with faulty robots
• The ultimate strategy to search on \(m\) rays?
• Parallel searching in the plane

Cited in

(8)

• On-line parallel heuristics, processor scheduling and robot searching under the competitive framework
• Parallel searching in the plane
• scientific article; zbMATH DE number 1003269 (Why is no real title available?)
• Optimal Constructions of Hybrid Algorithms
• A competitive analysis of nearest neighbor based algorithms for searching unknown scenes
• Experimental and Efficient Algorithms
• The ultimate strategy to search on \(m\) rays?
• Scheduling search procedures: The wheel of fortune

This page was built for publication: Online Parallel Heuristics and Robot Searching under the Competitive Framework

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