Open AccessJournal Article
Approximation algorithms for the geometric covering salesman problem
Esther M. Arkin,Refael Hassin +1 more
TLDR
In this article, the authors introduce a geometric version of the Covering Salesman Problem, in which each salesman's clients specify a neighborhood in which they are willing to meet the salesman.About:
This article is published in Location Science.The article was published on 1996-01-01 and is currently open access. It has received 260 citations till now. The article focuses on the topics: Bottleneck traveling salesman problem & Christofides algorithm.read more
Citations
More filters
Journal ArticleDOI
Coverage for robotics – A survey of recent results
TL;DR: This paper surveys recent results in coverage path planning, a new path planning approach that determines a path for a robot to pass over all points in its free space, and organizes the coverage algorithms into heuristic, approximate, partial-approximate and exact cellular decompositions.
Journal ArticleDOI
A survey on coverage path planning for robotics
Enric Galceran,Marc Carreras +1 more
TL;DR: A review of the most successful CPP methods, focusing on the achievements made in the past decade, is presented, providing links to the most interesting and successful works.
BookDOI
Complexity and Approximation
Giorgio Ausiello,Alberto Marchetti-Spaccamela,Pierluigi Crescenzi,Giorgio Gambosi,Marco Protasi,Viggo Kann +5 more
Journal ArticleDOI
Optimization approaches for civil applications of unmanned aerial vehicles (UAVs) or aerial drones: A survey
TL;DR: This article describes the most promising aerial drone applications and outline characteristics of aerial drones relevant to operations planning, and provides insights into widespread and emerging modeling approaches to civil applications of UAVs.
Journal ArticleDOI
A neural network approach to complete coverage path planning
Simon X. Yang,Chaomin Luo +1 more
TL;DR: A novel neural network approach is proposed for complete coverage path planning with obstacle avoidance of cleaning robots in nonstationary environments and results show that the proposed model is capable of planning collision-free complete coverage robot paths.
References
More filters
Journal ArticleDOI
The Euclidean travelling salesman problem is NP-complete
TL;DR: The Travelling Salesman Problem is shown to be NP-Complete even if its instances are restricted to be realizable by sets of points on the Euclidean plane.
An analysis of several heuristics for the traveling salesman problem.
TL;DR: Several polynomial time algorithms finding “good,” but not necessarily optimal, tours for the traveling salesman problem are considered, and the closeness of a tour is measured by the ratio of the obtained tour length to the minimal tour length.
Journal ArticleDOI
Approximation Algorithms for Some Routing Problems
TL;DR: In this paper, a mixed-strategy heuristic with a bound of 9/5 is presented for the stacker-crane problem and a tour-splitting heuristic is given for k-person variants of the traveling salesman problem.
Proceedings ArticleDOI
Some NP-complete geometric problems
TL;DR: It is shown that the STEINER TREE problem and TRAVELING SALESman problem for points in the plane are NP-complete when distances are measured either by the rectilinear (Manhattan) metric or by a natural discretized version of the Euclidean metric.
Proceedings ArticleDOI
Approximation algorithms for some routing problems
TL;DR: Several polynomial time approximation algorithms for some NP-complete routing problems are presented, and the worst-case ratios of the cost of the obtained route to that of an optimal are determined.
Related Papers (5)
Approximation algorithms for the geometric covering salesman problem
Esther M. Arkin,Refael Hassin +1 more