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

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

Title: A Fast Path Planning Algorithm for Piano Mover’s Problem on Raster
Authors: Gene Eu Jan;Tong-Ying Juang;Jun-Da Huang;Chien-Min Su;Chih-Yung Cheng
Contributors: NTOU:Department of Electrical Engineering
國立臺灣海洋大學:電機工程學系
Date: 2005-07
Issue Date: 2011-10-21T02:37:12Z
Publisher: Proceedings of the 2005 IEEE/ASME International Conference on Advanced Intelligent Mechatronics
Abstract: abstract:This article presents the near-optimal path-planning algorithm for piano mover's problem of robot motion among obstacles on raster. Beginning with a top view of a workspace arrangement among obstacles, the so-called free workspace is first obtained by virtually expanding the obstacles. The proposed method adopts virtual obstacle domain and collision avoidance scheme based on the higher geometry maze routing algorithm with all the possible directions to find the near-optimal path from the source position to the destination position. The time complexity of this method is O(RradicN) in average or O(RN) for the worst case, where N and R are the numbers of cells in the free workspace and the detection circle with the radius of VR1 as its collision-detection domain, respectively, R<N. The obtained path is the near-optimal path, which some cells can be revisited as the piano mover's problem, with no collisions between the robot and the obstacles
Relation: pp.522-527
Appears in Collections:[電機工程學系] 期刊論文

Files in This Item:

File Description SizeFormat
index.html0KbHTML323View/Open


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