Generalized streets revisited

DOI10.1007/3-540-61680-2_81MaRDI QIDQ4595514zbMATH OpenOpenAlexFDO

Authors Sven Schuierer, Alejandro Lopez-Ortiz

Publication date 5 December 2017

Published in Algorithms — ESA '96 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-61680-2_81

Mathematics Subject Classification ID

Artificial intelligence for robotics (68T40) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Competitive searching in a generalized street
• Competitive searching in polygons—Beyond generalised streets
• Going home through an unknown street
• scientific article; zbMATH DE number 176578
• On-line path planning in an unknown polygonal environment

Cited in

(17)

• Walking an unknown street with bounded detour
• Searching and on-line recognition of star-shaped polygons.
• Competitive searching in a generalized street
• On-line parallel heuristics, processor scheduling and robot searching under the competitive framework
• Walking in streets with minimal sensing
• scientific article; zbMATH DE number 2185606 (Why is no real title available?)
• scientific article; zbMATH DE number 176578 (Why is no real title available?)
• Online algorithms for searching and exploration in the plane
• Walking streets faster
• Lower bounds in on-line geometric searching metric searching
• Position-independent near optimal searching and on-line recognition in star polygons
• Lower bounds in on-line geometric searching
• The ultimate strategy to search on \(m\) rays?
• Parallel searching on m rays
• Competitive searching in polygons—Beyond generalised streets
• Competitive searching over terrains
• On-line path planning in an unknown polygonal environment

This page was built for publication: Generalized streets revisited

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