Greedy randomized adaptive search procedures, or GRASP, were introduced by T. Feo and
M. Resende in 1989 as a probabilistic heuristic for solving hard set covering problems. Soon …

This article addresses an important path planning problem for robots and Unmanned Aerial
Vehicles (UAVs), which is to find the shortest path of bounded curvature passing through a …

The complexity of unmanned aerial vehicle (UAV) missions is increasing with the rapid
development of UAV technology. Multiple UAVs usually cooperate in the form of teams to …

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 …

One of the greatest challenges towards fully autonomous cars is the understanding of
complex and dynamic scenes. Such understanding is needed for planning of maneuvers …

The herein studied problem is motivated by practical needs of our participation in the
Mohamed Bin Zayed International Robotics Challenge (MBZIRC) 2017 in which a team of …

The Dubins traveling salesman problem (DTSP) combines the combinatorial optimization of
the optimal sequence of waypoints to visit the required target locations with the continuous …

In this paper we introduce an extension of the Traveling Salesman Problem (TSP), which is
motivated by an important application in bioinformatics. In contrast to the TSP the costs do …

The Dubins traveling salesman problem (DTSP) has generated significant interest over the
last decade due to its occurrence in several civil and military surveillance applications. This …

The problem of finding a shortest curvature-constrained closed path through a set of targets
in the plane is known as Dubins traveling salesman problem (DTSP). Applications of the …