Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
[HTML][HTML] Routing for unmanned aerial vehicles: Touring dimensional sets
In this paper we deal with an extension of the crossing postman problem to design routes
that have to visit different shapes of dimensional elements rather than edges. This problem …
that have to visit different shapes of dimensional elements rather than edges. This problem …
Constrained heterogeneous vehicle path planning for large-area coverage
There is a strong demand for covering a large area autonomously by multiple UAVs
(Unmanned Aerial Vehicles) supported by a ground vehicle. Limited by UAVs' battery life …
(Unmanned Aerial Vehicles) supported by a ground vehicle. Limited by UAVs' battery life …
Mobile data gathering with bounded relay in wireless sensor networks
CF Cheng, CF Yu - IEEE Internet of Things Journal, 2018 - ieeexplore.ieee.org
Sensing data gathering is an important and fundamental issue in the Internet of Things.
However, for battery-powered sensors, energy depletion is unavoidable. Using mobile sinks …
However, for battery-powered sensors, energy depletion is unavoidable. Using mobile sinks …
Energy-efficient UAV-assisted IoT data collection via TSP-based solution space reduction
This paper presents a wireless data collection frame-work that employs an unmanned aerial
vehicle (UAV) to efficiently gather data from distributed IoT sensors deployed in a large area …
vehicle (UAV) to efficiently gather data from distributed IoT sensors deployed in a large area …
[HTML][HTML] The Hampered Travelling Salesman problem with Neighbourhoods
This paper deals with two different route design problems in a continuous space with
neighbours and barriers: the shortest path and the travelling salesman problems with …
neighbours and barriers: the shortest path and the travelling salesman problems with …
The Hampered k-Median Problem with Neighbourhoods
This paper deals with facility location problems in a continuous space with neighbours and
barriers. Each one of these two elements, neighbours and barriers, makes the problems …
barriers. Each one of these two elements, neighbours and barriers, makes the problems …
On the travelling salesman problem with neighborhoods in a polygonal world
Abstract The Travelling Salesman Problem with Neighborhoods (TSPN), as an extension of
the broadly studied Travelling Salesman Problem, has many practical applications in …
the broadly studied Travelling Salesman Problem, has many practical applications in …
A closer cut: Computing near-optimal lawn mowing tours
For a given polygonal region P, the Lawn Mowing Problem (LMP) asks for a shortest tour T
that gets within Euclidean distance 1 of every point in P; this is equivalent to computing a …
that gets within Euclidean distance 1 of every point in P; this is equivalent to computing a …