Approximation algorithms for the single robot line coverage problem

DOI10.1007/978-3-030-66723-8_32MaRDI QIDQ3382005zbMATH OpenOpenAlexFDO

Authors Saurav Agarwal, S. Akella

Publication date 20 September 2021

Published in Algorithmic Foundations of Robotics XIV (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-030-66723-8_32

zbMATH Keywords

path planningarc routing problemsline coverage

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25) Artificial intelligence for robotics (68T40)

Recommendations

• scientific article; zbMATH DE number 1305467
• Approximation algorithms for some min-max postmen cover problems
• Approximation algorithms for some minimum postmen cover problems
• Approximation algorithms for some minimum postmen cover problems
• Approximation algorithms for TSP with neighborhoods in the plane

Cites work

• scientific article; zbMATH DE number 1305467 (Why is no real title available?)
• scientific article; zbMATH DE number 3793772 (Why is no real title available?)
• A Faster Strongly Polynomial Minimum Cost Flow Algorithm
• A constant-factor approximation algorithm for the asymmetric traveling salesman problem
• A parameterized approximation algorithm for the mixed and windy Capacitated Arc Routing Problem: theory and experiments
• An improved approximation algorithm for ATSP
• Approximation Algorithms for Some Postman Problems
• Arc Routing
• Coordinated road-network search route planning by a team of UAVs
• Coverage for robotics -- a survey of recent results
• Matching, Euler tours and the Chinese postman
• On the windy postman problem on Eulerian graphs

Cited in

(4)

• A Robin algorithm for unilateral contact problems
• Approximation algorithms for pick-and-place robots
• The single robot line coverage problem: Theory, algorithms, and experiments
• Covering segments on a line with drones

This page was built for publication: Approximation algorithms for the single robot line coverage problem

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