On optimal coverage of a tree with multiple robots

DOI10.1016/J.EJOR.2020.02.035MaRDI QIDQ2184041zbMATH OpenOpenAlexFDO

Authors I. Aldana-Galván, J. C. Catana-Salazar, R. Fabila-Monroy, A. Ramírez-Vigueras, J. Urrutia, J. M. Díaz-Báñez, Frank Duque, Marco A. Heredia

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

zbMATH Keywords

combinatorial optimizationdynamic programmingmulti-agent systemsvehicle routingtree cover

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Dynamic programming (90C39)

Recommendations

• LATIN 2004: Theoretical Informatics
• Collective tree exploration
• Patrolling trees with mobile robots
• Optimal multirobot coverage path planning: ideal-shaped spanning tree
• Smart Robot Teams Exploring Sparse Trees

Cites work

• scientific article; zbMATH DE number 1424310 (Why is no real title available?)
• A faster 2-approximation algorithm for the minmax p-traveling salesmen problem on a tree
• A multi-objective approach for unmanned aerial vehicle routing problem with soft time windows constraints
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
• Approximating the minmax rooted-tree cover in a tree
• Approximation algorithms for lawn mowing and milling
• Complexity Results for Multiprocessor Scheduling under Resource Constraints
• Computing the \(k\)-resilience of a synchronized multi-robot system
• Coverage for robotics -- a survey of recent results
• Dynamic vehicle routing with priority classes of stochastic demands
• Handbooks in operations Research \& management science: Transportation
• Location-routing: issues, models and methods
• Min-max tree covers of graphs.
• Operations research in the space industry
• The vehicle routing problem

Cited in

(6)

• The giving tree: Constructing trees for efficient offline and online multi-robot coverage
• Computing the \(k\)-resilience of a synchronized multi-robot system
• Collaborative exploration of trees by energy-constrained mobile robots
• Patrolling trees with mobile robots
• Efficient Boustrophedon multi-robot coverage: An algorithmic approach
• A new approach to optimal planning of robot motion on a tree with obstacles

Describes a project that uses

Uses Software

• VRP

This page was built for publication: On optimal coverage of a tree with multiple robots

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