English  |  正體中文  |  简体中文  |  Items with full text/Total items : 26987/38787
Visitors : 2296009      Online Users : 35
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/25816

Title: Optimal Path Planning for Mobile Robot Navigation
Authors: Gene Eu Jan;Ki-Yin Chang;Ian Parberry
Contributors: NTOU:Department of Merchant Marine
國立臺灣海洋大學:商船學系
Keywords: λ-geometry maze router;path planning;piano mover’s problem
Date: 2008-08
Issue Date: 2011-10-20T08:32:32Z
Publisher: IEEE/ASME Transactions on Mechatronics
Abstract: Abstract:Some optimal path planning algorithms for navigating mobile rectangular robot among obstacles and weighted regions are presented. The approach is based on a higher geometry maze routing algorithm. Starting from a top view of a workspace with obstacles, the so-called free workspace is first obtained by virtually expanding the obstacles in the image. After that, an 8-geomerty maze routing algorithm is applied to obtain an optimal collision-free path with linear time and space complexities. The proposed methods cannot only search an optimal path among various terrains but also find an optimal path for the 2-D piano mover's problem with 3 DOF. Furthermore, the algorithm can be easily extended to the dynamic collision avoidance problem among multiple autonomous robots or path planning in the 3-D space.
Relation: 13(4), pp.451-460
URI: http://ntour.ntou.edu.tw/handle/987654321/25816
Appears in Collections:[商船學系] 期刊論文

Files in This Item:

File Description SizeFormat
index.html0KbHTML297View/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