The application of wireless charging technology in traditional battery-powered wireless
sensor networks (WSNs) grows rapidly recently. Although previous studies indicate that the …

Given a set of sparsely distributed sensors in the Euclidean plane, a mobile robot is required
to visit all sensors to download the data and finally return to its base. The effective range of …

This paper targets the identification of outlying sensors (that is, outlying reading sensors)
and the detection of the reach of events in sensor networks. Typical applications include the …

Recently, there have been a growing number of applications that power wireless sensor
networks (WSNs) by wireless charging technology. Although previous studies indicate that …

We study the problem of planning the motion of “data mules” for collecting the data from
stationary sensor nodes in wireless sensor networks. Use of data mules significantly …

In sparse wireless sensor networks, a mobile robot is usually exploited to collect the sensing
data. Each sensor has a limited transmission range and the mobile robot must get into the …

The Traveling Salesman Problem (TSP) is widely studied in Computer Science. There are
many publications on the TSP, ranging back to at least the late 1940's. The TSP has held the …

The Euclidean TSP with neighborhoods (TSPN) problem seeks a shortest tour that visits a
given collection of $ n $ regions ({\em neighborhoods}). We present the first polynomial-time …

Planning paths that are length or time optimized or both is an age-long problem for which
numerous approaches have been proposed with varied degree of success depending on …

We study the problem of finding the minimum-length curvature constrained closed path
through a set of regions in the plane. This problem is referred to as the Dubins Traveling …