Approximation Algorithms for the Single Robot Line Coverage Problem

DOI10.1007/978-3-030-66723-8_32zbMath1469.68119OpenAlexW3127516222MaRDI QIDQ3382005

S. Akella, Saurav Agarwal

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) Graph theory (including graph drawing) in computer science (68R10) Approximation methods and heuristics in mathematical programming (90C59) Approximation algorithms (68W25) Artificial intelligence for robotics (68T40)

Related Items (1)

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

Cites Work

• Unnamed Item
• Unnamed Item
• On the windy postman problem on Eulerian graphs
• Coverage for robotics -- a survey of recent results
• Approximation Algorithms for Some Postman Problems
• Matching, Euler tours and the Chinese postman
• An improved approximation algorithm for ATSP
• A constant-factor approximation algorithm for the asymmetric traveling salesman problem
• Arc Routing
• A Faster Strongly Polynomial Minimum Cost Flow Algorithm
• Coordinated road-network search route planning by a team of UAVs
• A parameterized approximation algorithm for the mixed and windy Capacitated Arc Routing Problem: theory and experiments

This page was built for publication: Approximation Algorithms for the Single Robot Line Coverage Problem