Path Planning for Low-Altitude Flying Vehicles
碩士 === 國立臺灣大學 === 應用力學研究所 === 89 === In this thesis, the method of dynamic programming is applied to deal with the path-planning problem for low-altitude flying vehicles. The motion of the airplanes is considered to model the behavior of the vehicles. The capability of flight along a straight line...
Main Authors: | , |
---|---|
Other Authors: | |
Format: | Others |
Language: | zh-TW |
Published: |
2001
|
Online Access: | http://ndltd.ncl.edu.tw/handle/12832632469115472200 |
id |
ndltd-TW-089NTU00499023 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-TW-089NTU004990232016-07-04T04:17:15Z http://ndltd.ncl.edu.tw/handle/12832632469115472200 Path Planning for Low-Altitude Flying Vehicles 低空飛行載具之路徑規劃 Kuo Po-Ting 郭柏廷 碩士 國立臺灣大學 應用力學研究所 89 In this thesis, the method of dynamic programming is applied to deal with the path-planning problem for low-altitude flying vehicles. The motion of the airplanes is considered to model the behavior of the vehicles. The capability of flight along a straight line with constant velocity is used to deduce the rate-of-climb constraint on the possible paths. The limitations of turning at constant speeds induce the constraint of turning radius on curved paths. These physical constraints are then invoked to obtain possible paths, among which the optimal one is desired. The search of the optimal path can be categorized as the shortest path problem, for which various algorithms can be adopted. One strategy is the so-called Label Correcting Methods, among them the Dijkstra’s algorithm is a special case. On the other hand, since a shortest path problem is equivalent to a deterministic finite-state problem, it can be solved by the method of dynamic programming (DP), which is based on the Principle of Optimality. Due to its flexibility, the DP method can accommodate more complicated scenario in which the stochastic process may be involved. For a given terrain, the flight paths are envisioned to lie on the corresponding virtual terrain, which reflects the low altitude feature of the flight. After discretization of the terrain, the notions of forbidden points and forbidden paths are introduced to realize the rate-of-climb constraint and the constraint of turning radius, respectively. To expedite the algorithm, the concepts of the successive update and the spiral scheme are proposed. The simulation results show that the methodology discussed in the thesis can efficiently provide the optimal paths of a low-altitude flying vehicle under various conditions, which may have potential applications in designing the flight paths for missiles or bombers. Wang Li-Sheng Chang Fan-Jen 王立昇 張帆人 2001 學位論文 ; thesis 68 zh-TW |
collection |
NDLTD |
language |
zh-TW |
format |
Others
|
sources |
NDLTD |
description |
碩士 === 國立臺灣大學 === 應用力學研究所 === 89 === In this thesis, the method of dynamic programming is applied to deal with the path-planning problem for low-altitude flying vehicles. The motion of the airplanes is considered to model the behavior of the vehicles. The capability of flight along a straight line with constant velocity is used to deduce the rate-of-climb constraint on the possible paths. The limitations of turning at constant speeds induce the constraint of turning radius on curved paths. These physical constraints are then invoked to obtain possible paths, among which the optimal one is desired. The search of the optimal path can be categorized as the shortest path problem, for which various algorithms can be adopted. One strategy is the so-called Label Correcting Methods, among them the Dijkstra’s algorithm is a special case. On the other hand, since a shortest path problem is equivalent to a deterministic finite-state problem, it can be solved by the method of dynamic programming (DP), which is based on the Principle of Optimality. Due to its flexibility, the DP method can accommodate more complicated scenario in which the stochastic process may be involved. For a given terrain, the flight paths are envisioned to lie on the corresponding virtual terrain, which reflects the low altitude feature of the flight. After discretization of the terrain, the notions of forbidden points and forbidden paths are introduced to realize the rate-of-climb constraint and the constraint of turning radius, respectively. To expedite the algorithm, the concepts of the successive update and the spiral scheme are proposed. The simulation results show that the methodology discussed in the thesis can efficiently provide the optimal paths of a low-altitude flying vehicle under various conditions, which may have potential applications in designing the flight paths for missiles or bombers.
|
author2 |
Wang Li-Sheng |
author_facet |
Wang Li-Sheng Kuo Po-Ting 郭柏廷 |
author |
Kuo Po-Ting 郭柏廷 |
spellingShingle |
Kuo Po-Ting 郭柏廷 Path Planning for Low-Altitude Flying Vehicles |
author_sort |
Kuo Po-Ting |
title |
Path Planning for Low-Altitude Flying Vehicles |
title_short |
Path Planning for Low-Altitude Flying Vehicles |
title_full |
Path Planning for Low-Altitude Flying Vehicles |
title_fullStr |
Path Planning for Low-Altitude Flying Vehicles |
title_full_unstemmed |
Path Planning for Low-Altitude Flying Vehicles |
title_sort |
path planning for low-altitude flying vehicles |
publishDate |
2001 |
url |
http://ndltd.ncl.edu.tw/handle/12832632469115472200 |
work_keys_str_mv |
AT kuopoting pathplanningforlowaltitudeflyingvehicles AT guōbǎitíng pathplanningforlowaltitudeflyingvehicles AT kuopoting dīkōngfēixíngzàijùzhīlùjìngguīhuà AT guōbǎitíng dīkōngfēixíngzàijùzhīlùjìngguīhuà |
_version_ |
1718334706225774592 |