English  |  正體中文  |  简体中文  |  Items with full text/Total items : 28598/40629
Visitors : 4212423      Online Users : 42
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/37017

Title: A new maze routing approach for path planning of a mobile robot
Authors: Gene Eu Jan;Ki-Yin Chang;Parberry, I
Contributors: 國立臺灣海洋大學:商船學系
Keywords: Path planning;h-geomehy;maze routing
Date: 2003-07
Issue Date: 2015-12-25T02:55:53Z
Publisher: Advanced Intelligent Mechatronics, 2003. AIM 2003. Proceedings. 2003 IEEE/ASME International Conference on
Abstract: Abstract:A new path planning approach for a mobile robot among obstacles of arbitrary shape is presented. This 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, the 8-geometry maze routing algorithm is applied to obtain a shortest collision-free path. The proposed method is not only able to search a shortest path with rotation scheme but also capable to rotate the robot configuration to pass a narrow passage intelligently. The time complexity of the algorithm is O(N), where N is the number of pixels in the free workspace. Furthermore, for many researchers who work on dynamic collision avoidance for multiple autonomous robots and optimal path searching among various terrains (weighted regions), the concept of this algorithm can be applied to solve these problems.
Relation: pp.552-557
URI: http://ntour.ntou.edu.tw:8080/ir/handle/987654321/37017
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