57 research outputs found
Path Planning Algorithms for Multiple Heterogeneous Vehicles
Unmanned aerial vehicles (UAVs) are becoming increasingly popular for surveillance
in civil and military applications. Vehicles built for this purpose vary in their
sensing capabilities, speed and maneuverability. It is therefore natural to assume
that a team of UAVs given the mission of visiting a set of targets would include
vehicles with differing capabilities. This paper addresses the problem of assigning
each vehicle a sequence of targets to visit such that the mission is completed with
the least "cost" possible given that the team of vehicles is heterogeneous. In order
to simplify the problem the capabilities of each vehicle are modeled as cost to travel
from one target to another. In other words, if a vehicle is particularly suited to visit
a certain target, the cost for that vehicle to visit that target is low compared to
the other vehicles in the team. After applying this simplification, the problem can be
posed as an instance of the combinatorial problem called the Heterogeneous Travelling
Salesman Problem (HTSP). This paper presents a transformation of a Heterogenous,
Multiple Depot, Multiple Traveling Salesman Problem (HMDMTSP) into a single,
Asymmetric, Traveling Salesman Problem (ATSP). As a result, algorithms available
for the single salesman problem can be used to solve the HMDMTSP. To show the
effectiveness of the transformation, the well known Lin-Kernighan-Helsgaun heuristic
was applied to the transformed ATSP. Computational results show that good quality
solutions can be obtained for the HMDMTSP relatively fast.
Additional complications to the sequencing problem come in the form of precedence
constraints which prescribe a partial order in which nodes must be visited. In this context the sequencing problem was studied seperately using the Linear Program
(LP) relaxation of a Mixed Integer Linear Program (MILP) formulation of the
combinatorial problem known as the "Precedence Constrained Asymmetric Travelling
Salesman Problem" (PCATSP)
Combinatorial Path Planning for a System of Multiple Unmanned Vehicles
In this dissertation, the problem of planning the motion of m Unmanned Vehicles (UVs) (or simply vehicles) through n points in a plane is considered. A motion plan for a vehicle is given by the sequence of points and the corresponding angles at which each point must be visited by the vehicle. We require that each vehicle return to the same initial location(depot) at the same heading after visiting the points. The objective of the motion planning problem is to choose at most q(≤ m) UVs and find their motion plans so that all the points are visited and the total cost of the tours of the chosen vehicles is a minimum amongst all the possible choices of vehicles and their tours. This problem is a generalization of the wellknown Traveling Salesman Problem (TSP) in many ways: (1) each UV takes the role of salesman (2) motion constraints of the UVs play an important role in determining the cost of travel between any two locations; in fact, the cost of the travel between any two locations depends on direction of travel along with the heading at the origin and destination, and (3) there is an additional combinatorial complexity stemming from the need to partition the points to be visited by each UV and the set of UVs that must be employed by the mission.
In this dissertation, a sub-optimal, two-step approach to motion planning is presented to solve this problem:(1) the combinatorial problem of choosing the vehicles and their associated tours is based on Euclidean distances between points and (2) once the sequence of points to be visited is specified, the heading at each point is determined based on a Dynamic Programming scheme. The solution to the first step is based on a generalization of Held-Karp’s method. We modify the Lagrangian heuristics for finding a close sub-optimal solution.
In the later chapters of the dissertation, we relax the assumption that all vehicles are homogenous. The motivation of heterogenous variant of Multi-depot, Multiple Traveling Salesmen Problem (MDMTSP) derives form applications involving Unmanned Aerial Vehicles (UAVs) or ground robots requiring multiple vehicles with different capabilities to visit a set of locations
- …