English  |  正體中文  |  简体中文  |  Items with full text/Total items : 28611/40649
Visitors : 613154      Online Users : 65
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/10839

Title: 3D空間中航行器之多組最短路徑搜尋與避碰
Multiple Shortest Path Searching and Collision Avoidance for Vehicles in the 3D Raster
Authors: 詹景裕;張啟隱
Contributors: NTOU:Department of Computer Science and Engineering
Keywords: 最短路徑搜尋法;碰撞避免;飛航交通管制
Shortest path searching;Collision avoidance;Air traffic control (ATC)
Date: 2001-08
Issue Date: 2011-06-28T07:57:08Z
Publisher: 行政院國家科學委員會
Abstract: 摘要:本報告主要是以的詹氏O(N)二維網格最短路徑演算法為核心,進而 推演出在3D空間上的最短路徑演算法,並利用此3D最短路徑演算法 及避碰(Collision avoidance)與航行器領域(Aircraft domain)觀 念,使得二維網格平面多組最路徑搜尋演算法推展至3D空間模型。其時間與空間複雜度仍維持在O(N),此處N為3D空間中所有可通行之自 由空間的方塊數。並可實際應用在海上船舶的搜尋與追截、汽車導 航系統、航行器的空中搜尋與追截等 。
abstract:Recently, Jan, Hsu and Wu proposed a planar and spatial shortest path-searching algorithm for a single pair with O(N) of time and memory space complexities based on the nuclear fission chain reactions scheme, where N is the number of non-obstacle cells. Meanwhile, it is also extended to plural pairs in planar space using space-marking method and collision avoidance scheme with extra data structure. We extended these algorithms to 3D space without changing the time and space complexities in this report. These new algorithms have been coded in C++ language on personal computer and some illustrations are presented as well.
Relation: NSC90-2211-E019-010
URI: http://ntour.ntou.edu.tw/ir/handle/987654321/10839
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