Efficient Boustrophedon multi-robot coverage: An algorithmic approach

DOI10.1007/s10472-009-9120-2zbMath1185.68744OpenAlexW2105848344MaRDI QIDQ1022450

Ai Peng New, Edward Samuel Rankin, Howie Choset, Ioannis Rekleitis

Publication date: 22 June 2009

Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10472-009-9120-2

zbMATH Keywords

complete coverage path planninggreedy auction mechanismteam of mobile robots

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Artificial intelligence for robotics (68T40)

Related Items (6)

An innovative multi-agent search-and-rescue path planning approach ⋮ An MILP approach for persistent coverage tasks with multiple robots and performance guarantees ⋮ An information theoretic based integer linear programming approach for the discrete search path planning problem ⋮ Distributed reactive motion control for dense cooperative sweep coverage of corridor environments by swarms of non-holonomic robots ⋮ Static target search path planning optimization with heterogeneous agents ⋮ An evolutionary approach for the target search problem in uncertain environment

Uses Software

• COPL_DSDP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An opportunistic global path planner
• The giving tree: Constructing trees for efficient offline and online multi-robot coverage
• Constructing roadmaps of semi-algebraic sets. I: Completeness
• Coverage for robotics -- a survey of recent results
• An Optimal Algorithm for Euclidean Shortest Paths in the Plane

This page was built for publication: Efficient Boustrophedon multi-robot coverage: An algorithmic approach