On optimal coverage of a tree with multiple robots
From MaRDI portal
Publication:2184041
DOI10.1016/j.ejor.2020.02.035zbMath1443.90320OpenAlexW3010436840MaRDI QIDQ2184041
J. C. Catana-Salazar, Ruy Fabila-Monroy, Jorge Urrutia, I. Aldana-Galván, A. Ramírez-Vigueras, Marco A. Heredia, José-Miguel Díaz-Báñez, Frank Duque
Publication date: 27 May 2020
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2020.02.035
Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Dynamic programming (90C39)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Operations research in the space industry
- Min-max tree covers of graphs.
- Computing the \(k\)-resilience of a synchronized multi-robot system
- Location-routing: issues, models and methods
- A faster 2-approximation algorithm for the minmax \(p\)-traveling salesmen problem on a tree
- Approximation algorithms for lawn mowing and milling
- A multi-objective approach for unmanned aerial vehicle routing problem with soft time windows constraints
- Coverage for robotics -- a survey of recent results
- Approximating the minmax rooted-tree cover in a tree
- The Vehicle Routing Problem
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- Dynamic Vehicle Routing with Priority Classes of Stochastic Demands
- Complexity Results for Multiprocessor Scheduling under Resource Constraints
This page was built for publication: On optimal coverage of a tree with multiple robots