scientific article; zbMATH DE number 1617273

MaRDI QIDQ2721995zbMATH OpenFDO

Authors Leonidas Palios

Publication date 11 July 2001

zbMATH Keywords

motion planningcompetitive algorithm

Mathematics Subject Classification ID

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

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)

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

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 Q2721995)