On optimal coverage of a tree with multiple robots-Reference-Cited by-同舟云学术

On optimal coverage of a tree with multiple robots

Published:2020-09 Issue:3 Volume:285 Page:844-852
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

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

Publisher

Elsevier BV

Subject

Information Systems and Management,Management Science and Operations Research,Modeling and Simulation,General Computer Science,Industrial and Manufacturing Engineering

Reference34 articles.

1. One-to-one coordination algorithm for decentralized area partition in surveillance missions with a team of aerial robots;Acevedo;Journal of Intelligent & Robotic Systems,2014

2. Optimization approaches for the traveling salesman problem with drone;Agatz;Transportation Science,2018

3. Approximation algorithms for lawn mowing and milling;Arkin;Computational Geometry,2000

4. Multi-UAV routing for area coverage and remote sensing with minimum time;Avellar;Sensors,2015

5. The multiple traveling salesman problem: an overview of formulations and solution procedures;Bektas;Omega,2006

Cited by 2 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Learning Obstacle-Avoiding Lattice Paths using Swarm Heuristics: Exploring the Bijection to Ordered Trees;2022 IEEE Congress on Evolutionary Computation (CEC);2022-07-18

2. An Efficient Scheme for the Generation of Ordered Trees in Constant Amortized Time;2021 15th International Conference on Ubiquitous Information Management and Communication (IMCOM);2021-01-04