English  |  正體中文  |  简体中文  |  Items with full text/Total items : 28611/40649
Visitors : 616786      Online Users : 86
RC Version 4.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Adv. Search

Please use this identifier to cite or link to this item: http://ntour.ntou.edu.tw:8080/ir/handle/987654321/41688

Title: Optimal Path Searching Algorithms for Aircraft in the Volume
Authors: G. E. Jan;C. M. Su;C. Y. Cheng;W. L. Hsieh;F. Y. Lin
Contributors: 國立臺灣海洋大學:運輸科學系
Date: 2007-10
Issue Date: 2017-03-17T06:46:32Z
Publisher: Transactions on Intelligent Transportation Systems
Abstract: Abstract:This paper presents some novel methods to solve optimal chasing and path planning problems for aircraft motion in the quadric surface. The optimal path searching algorithm in the quadric surface with 0(N) of time and space complexities is based on the higher geometry maze router, where N is the number of voxels in the volume. Furthermore, the proposed algorithm is extended to the optimal path searching for multiple pairs based on the concept of the aircraft domain and space-marking method to avoid collision and the chasing system in the quadric surface with the time complexities of 0(qN) and O(N2/α), respectively, where q is the number of the aircrafts and α is the relative speed ratio of the chaser to target. For the chasing system, it is assumed that the chaser and target have different constant speeds and the chaser should be faster than the target to catch up. In addition, it is useful to foresee the beforehand path of the target if the chaser can detect its current position.
Relation: 39(2), pp.115-122
URI: http://ntour.ntou.edu.tw:8080/ir/handle/987654321/41688
Appears in Collections:[運輸科學系] 期刊論文

Files in This Item:

File Description SizeFormat

All items in NTOUR are protected by copyright, with all rights reserved.


著作權政策宣告: 本網站之內容為國立臺灣海洋大學所收錄之機構典藏,無償提供學術研究與公眾教育等公益性使用,請合理使用本網站之內容,以尊重著作權人之權益。
網站維護: 海大圖資處 圖書系統組
DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback