A new competitive strategy for reaching the kernel of an unknown polygon

DOI10.1007/3-540-44985-X_32MaRDI QIDQ2721995zbMATH OpenFDO

Authors Leonidas Palios

Publication date 11 July 2001

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-44985-X_32

zbMATH Keywords

competitive algorithmmotion planning

Mathematics Subject Classification ID

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

Recommendations

• On-line path planning in an unknown polygonal environment
• Walking streets faster
• An improved on-line strategy for exploring unknown polygons
• Competitive searching in polygons—Beyond generalised streets
• Going home through an unknown street

Cited in

(5)

• Searching and on-line recognition of star-shaped polygons.
• Optimizing generalized kernels of polygons
• Tight analysis of a self-approaching strategy for the online kernel-search problem
• Online algorithms for searching and exploration in the plane
• On-line path planning in an unknown polygonal environment

This page was built for publication: A new competitive strategy for reaching the kernel of an unknown polygon

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