Safe and simultaneous arrival of constant speed, constant altitude unmanned air vehicles (UAVs) on target is solved by design of paths of equal lengths. The starting point for our solution is the well-known Dubins path, which is composed of circular arc and line segments, thus requiring only one simple maneuver—constant rate turn. An explicit bound can be imposed on the rate during the design and the resulting paths are the minimum time solution of the problem. However, transition between arc and line segments entails discontinuous changes in lateral acceleration (latax), making this approach impractical for real fixed wing UAVs. Therefore, we replace the Dubins solution with a novel one, based on quintic Pythagorean hodograph (PH) curves, whose latax demand is continuous. The PH paths are designed to have lengths close to the lengths of the Dubins paths to stay close to the minimum time solution. To derive the PH paths, the Dubins solution is first interpreted in terms of differential geometry of curves using the path length and curvature as the key parameters. The curvature of a Dubins path is a piecewise constant and discontinuous function of its path length, which is a differential geometric expression of the discontinuous latax demand involved in transitions between the arc and the line segment. By contrast, the curvature of the PH path is a fifth order polynomial of its path length. This is not only continuous but also has enough design parameters (polynomial coefficients) to meet the latax (curvature) constraints (bounds) and make the PH solution close to the minimum time one. The solution involves the design of paths meeting the curvature constraint and is followed by producing multiple paths of equal length by increasing the lengths of the shorter paths to match the longest one. The safety constraint, intercollision avoidance is achieved by satisfying two conditions: minimum separation distance and nonintersection at equal distance. The offset curves of the PH path are used to design a safety region along each path.

1.
Chandler
,
P.
,
Rasmussen
,
S.
, and
Pachter
,
M.
, 2000,
UAV Cooperative Path Planning
,
AIAA Guidance, Navigation, and Control Conference and Exhibit
, Denver, CO, Aug. 14–17 AIAA-2000-4370.
2.
Bortoff
,
S. A.
, 2000, “
Path Planning for UAVs
,”
American Control Conference
, pp.
364
368
.
3.
McLain
,
T. W.
, and
Randal
,
B. W.
, 2000, “
Trajectory Planning for Coordinated Rendezvous of Unmanned Air Vehicels
,”
AIAA Guidance, Navigation, and Control Conference and Exhibit
, Denver, CO, Aug. 14–17, AIAA-2000-4369.
4.
Judd
,
K. B.
, and
McLain
,
T. W.
, 2001, “
Spline Based Path Planning for Unmanned Air Vehicles
,”
AIAA Guidance, Navigation, and Control Conference and Exhibit, Montreal
, Canada, Aug. 6–9, AIAA-2001-4238.
5.
Jun
,
M.
, and
D’andrea
,
R.
, 2003,
Path Planning for Unmanned Aerial Vehicles in Uncertain and Adversarial Environments
,
Kluwer Academic
,
Dordrecht
, pp.
95
110
.
6.
Schouwenaars
,
T.
,
DeMoor
,
B.
,
Feron
,
E.
, and
How
,
J.
, 2001, “
Mixed Integer Programming for Multivehicle Path Planning
,”
European Control Conference
, pp.
2603
2608
.
7.
Richards
,
A.
, and
How
,
J. P.
, 2002, “
Aircraft Trajectory Planning With Collision Avoidance Using Mixed Integer Linear Programming
,”
American Control Conference
, pp.
1936
1941
.
8.
Mitcheel
,
I. M.
, and
Sastry
,
S.
, 2003, “
Continuous Path Planning With Multiple Constraints
,”
IEEE Conference on Decision and Control
, pp.
5502
5507
.
9.
Yang
,
G.
, and
Kapila
,
V.
, 2002, “
Optimal Path Planning for Unmanned Air Vehicles With Kinematic and Tactical Constraints
,”
IEEE Conference on Decision and Control
, Vol.
2
, pp.
1301
1306
.
10.
Rabbath
,
C. A.
,
Gagnon
,
E.
, and
Lauzon
,
M
, 2004, “
On the Cooperative Control of Multiple Unmanned Aerial Vehicles
,”
IEEE Canadian Review
,
46
, pp.
15
19
.
11.
Dubins
,
L. E.
, 1957, “
On Curves of Minimal Length With A Constraint on Average Curvature, and With Prescribed Initial and Terminal Positions and Tangents
,”
Am. J. Math.
0002-9327,
79
, pp.
497
516
.
12.
Shanmugavel
,
M.
,
Tsourdos
,
A.
,
Żbikowski
,
R.
, and
White
,
B.
, 2005, “
Path Planning of Multiple UAVs Using Dubins Sets
,”
AIAA Guidance, Navigation, and Control Conference and Exhibit
, San Francisco, CA, Aug. 15–18, AIAA-2005-5827.
13.
Shanmugavel
,
M.
,
Tsourdos
,
A.
,
Żbikowski
,
R.
, and
White
,
B. A.
, 2006, “
3D Dubins Sets Based Coordinated Path Planning for Swarm of UAVs
,”
AIAA Guidance, Navigation, and Control Conference and Exhibit
, Keystone, CO, Aug. 21–24, AIAA-2006-6211.
14.
Shanmugavel
,
M.
,
Tsourdos
,
A.
,
Żbikowski
,
R.
, and
White
,
B. A.
, 2006, “
A Solution to Simultaneous Arrival of Multiple UAVs Using Pythagorean Hodograph Curves
,”
American Control Conference
, Mineapolis, Jun. 14–16, pp.
2813
2818
.
15.
Kreyszig
,
E.
, 1991,
Differential Geometry
,
Dover
,
New York
.
16.
Farouki
,
R. T.
, and
Sakkalis.
,
T.
, 1990, “
Pythagorean Hodographs
,”
IBM J. Res. Dev.
0018-8646,
34
(
5
), pp.
736
752
.
17.
Farouki
,
R.
, 1996, “
The Elastic Bending Energy of Pythagorean-Hodograph Curves
,”
Comput. Aided Geom. Des.
0167-8396,
13
, pp.
227
241
.
18.
Farouki
,
R. T.
, and
Neff
,
C. A.
, 1995, “
Hermite Interpolation by Pythagorean Hodograph Quintics
,”
Math. Comput.
0025-5718,
64
(
212
), pp.
1589
1609
.
19.
Bruyninckx
,
H.
, and
Reynaerts
,
D.
, 1997, “
Path Planning for Mobile and Hyper-Redundant Robots Using Pythagorean Hodograph Curves
,”
Eighth International Conference on Advanced Robotics
, pp.
595
600
.
You do not currently have access to this content.