Covering segments on a line with drones

DOI10.1016/J.IPL.2024.106540MaRDI QIDQ6663533FDOQ6663533

Authors: Sergey Bereg, J. M. Díaz-Báñez, Alina Kasiuk, Miguel-Angel Pérez-Cutiño, Fabio Rodríguez 

Publication date: 14 January 2025

Published in: Information Processing Letters (Search for Journal in Brave)

Recommendations

• The single robot line coverage problem: Theory, algorithms, and experiments
• Solving the length constrained \(K\)-drones rural postman problem
• Polyhedral analysis and a new algorithm for the length constrained \(K\)-drones rural postman problem
• Approximation algorithms for the single robot line coverage problem
• The multi‐purpose K‐drones general routing problem

zbMATH Keywords

dynamic programminggreedy algorithmautonomous vehiclescovering segments

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Artificial intelligence for robotics (68T40)

Cites Work

• Approximation algorithms for lawn mowing and milling
• Solving the length constrained \(K\)-drones rural postman problem

Cited In (1)

• The single robot line coverage problem: Theory, algorithms, and experiments

This page was built for publication: Covering segments on a line with drones

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