Show simple item record

contributor authorMadhavan Shanmugavel
contributor authorAntonios Tsourdos
contributor authorBrian A. White
contributor authorRafaeł Żbikowski
date accessioned2017-05-09T00:23:08Z
date available2017-05-09T00:23:08Z
date copyrightSeptember, 2007
date issued2007
identifier issn0022-0434
identifier otherJDSMAA-26405#620_1.pdf
identifier urihttp://yetl.yabesh.ir/yetl/handle/yetl/135431
description abstractSafe 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.
publisherThe American Society of Mechanical Engineers (ASME)
titleDifferential Geometric Path Planning of Multiple UAVs
typeJournal Paper
journal volume129
journal issue5
journal titleJournal of Dynamic Systems, Measurement, and Control
identifier doi10.1115/1.2767657
journal fristpage620
journal lastpage632
identifier eissn1528-9028
keywordsUnmanned aerial vehicles
keywordsPath planning
keywordsSafety AND Design
treeJournal of Dynamic Systems, Measurement, and Control:;2007:;volume( 129 ):;issue: 005
contenttypeFulltext


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record