The single robot line coverage problem: Theory, algorithms, and experiments
From MaRDI portal
Publication:6180033
DOI10.1002/net.22171arXiv2208.09861OpenAlexW4385240299MaRDI QIDQ6180033
Publication date: 18 January 2024
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2208.09861
arc routing problemspostman problemspath planning for mobile robotsline coverageinspection with UAVs
Programming involving graphs or networks (90C35) Integer programming (90C10) Combinatorial optimization (90C27)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Solving the equality generalized traveling salesman problem using the Lin-Kernighan-Helsgaun algorithm
- On the windy postman problem
- Lower bounds and heuristics for the windy rural postman problem
- Lower bounds for the mixed capacitated arc routing problem
- On the windy postman problem on Eulerian graphs
- An effective implementation of the Lin-Kernighan traveling salesman heuristic
- Approximation algorithms for lawn mowing and milling
- New heuristic algorithms for the windy rural postman problem
- Recent results on Arc Routing Problems: An annotated bibliography
- An Approximation Algorithm for the Capacitated Arc Routing Problem
- Dynamic Programming Treatment of the Travelling Salesman Problem
- A Dynamic Programming Approach to Sequencing Problems
- Approximation Algorithms for the Single Robot Line Coverage Problem
- On general routing problems
- A fundamental problem in vehicle routing
- Approximation Algorithms for Some Postman Problems
- An Efficient Transformation Of The Generalized Traveling Salesman Problem
- A 3/2-Approximation Algorithm for the Mixed Postman Problem
- Matching, Euler tours and the Chinese postman
- An improved approximation algorithm for ATSP
- A constant-factor approximation algorithm for the asymmetric traveling salesman problem
- A Faster Strongly Polynomial Minimum Cost Flow Algorithm
- Coordinated road-network search route planning by a team of UAVs
- Arc routing problems: A review of the past, present, and future
This page was built for publication: The single robot line coverage problem: Theory, algorithms, and experiments
