Description
An invaluable addition to the literature on UAV guidance and cooperative control, Cooperative Path Planning of Unmanned Aerial Vehicles is a dedicated, practical guide to computational path planning for UAVs. One of the key issues facing future development of UAVs is path planning: it is vital that swarm UAVs/ MAVs can cooperate together in a coordinated manner, obeying a pre-planned course but able to react to their environment by communicating and cooperating. An optimized path is necessary in order to ensure a UAV completes its mission efficiently, safely, and successfully.
Focussing on the path planning of multiple UAVs for simultaneous arrival on target, Cooperative Path Planning of Unmanned Aerial Vehicles also offers coverage of path planners that are applicable to land, sea, or space-borne vehicles.
Cooperative Path Planning of Unmanned Aerial Vehicles is authored by leading researchers from Cranfield University and provides an authoritative resource for researchers, academics and engineers working in the area of cooperative systems, cooperative control and optimization particularly in the aerospace industry.
Chapter
1.1 Path Planning Formulation
1.2 Path Planning Constraints
1.2.1 Flyable Paths: Capturing Kinematics
1.2.2 UAV Inertial Manoeuvre Coordinates
1.2.3 Generation of Safe Paths for Path Planning
1.3 Cooperative Path Planning and Mission Planning
1.4 Path Planning – An Overview
1.6 Probabilistic Methods
1.10 Optimization Techniques
1.11 Trajectories for Path Planning
2 Path Planning in Two Dimensions
2.2 Designing Dubins Paths using Analytical Geometry
2.2.1 Dubins Path: External Tangent Solution
2.2.2 Dubins Path: Internal Tangent Solution
2.3 Existence of Dubins Paths
2.4 Length of Dubins Path
2.5 Design of Dubins Paths using Principles of Differential Geometry
2.6 Paths of Continuous Curvature
2.7 Producing Flyable Clothoid Paths
2.8 Producing Flyable Pythagorean Hodograph Paths (2D)
2.8.1 Design of Flyable Path using 2D PH curve
3 Path Planning in Three Dimensions
3.1 Dubins Paths in Three Dimensions Using Differential Geometry
3.2 Path Length–Dubins 3D
3.3 Pythagorean Hodograph Paths–3D
3.4 Design of Flyable Paths Using PH Curves
3.4.1 Design of Flyable Paths
4.1 Research into Obstacle Avoidance
4.2 Obstacle Avoidance for Mapped Obstacles
4.2.1 Line Intersection Detection
4.2.2 Line Segment Intersection
4.3 Obstacle Avoidance of Unmapped Static Obstacles
4.3.1 Safety Circle Algorithm
4.3.2 Intermediate Waypoint Algorithm
4.4 Algorithmic Implementation
4.4.1 Dubins Path Modification
4.4.2 Clothoid Path Modification
4.4.3 PH Path Modification
4.4.4 Obstacle Avoidance in 3D
5 Path-Following Guidance
5.1 Path Following the Dubins Path
5.2 Linear Guidance Algorithm
5.3 Nonlinear Dynamic Inversion Guidance
5.4 Dynamic Obstacle Avoidance Guidance
5.4.1 UAV Direction Control
5.4.2 Multiple Conflict Resolution
6 Path Planning for Multiple UAVs
6.3 Phase I: Producing Flyable Paths
6.4 Phase II: Producing Feasible Paths
6.4.1 Minimum Separation Distance
6.4.2 Non-Intersection Paths
6.5 Phase III: Equalizing Path Lengths
6.6 Multiple Path Algorithm
6.7 Algorithm Application for Multiple UAVs
6.8 2D Pythagorean Hodograph Paths
6.10 3D Pythagorean Hodograph Paths
Appendix A Differential Geometry
A.1 Frenet–Serret Equations
A.2 Importance of Curvature and Torsion
Appendix B Pythagorean Hodograph
B.1 Pythagorean Hodograph