Near-optimal coverage path planning with turn costs

DOI10.1137/1.9781611977929.9MaRDI QIDQ6545391zbMATH OpenFDO

Authors Dominik Krupke

Publication date 29 May 2024

Full work available at URL https://doi.org/10.1137/1.9781611977929.9

Mathematics Subject Classification ID

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

Recommendations

• The giving tree: Constructing trees for efficient offline and online multi-robot coverage
• Efficient Boustrophedon multi-robot coverage: An algorithmic approach
• Optimal multirobot coverage path planning: ideal-shaped spanning tree
• Coverage for robotics -- a survey of recent results
• A survey of multi-robot coverage

Cited in

(2)

• Estimating the coverage measure and the area explored by a line-sweep sensor on the plane
• What goes around comes around: covering tours and cycle covers with turn costs

This page was built for publication: Near-optimal coverage path planning with turn costs

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