Efficient Boustrophedon multi-robot coverage: An algorithmic approach

DOI10.1007/s10472-009-9120-2zbMath1185.68744MaRDI 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 planning; greedy auction mechanism; team of mobile robots

Mathematics Subject Classification ID

11Y16: Number-theoretic algorithms; complexity

68T40: Artificial intelligence for robotics

Related Items

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

Uses Software

• COPL_DSDP

Cites Work

• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item