영역 확장을 이용한 이동 로봇의 경로 설정Path Planning Algorithm for Mobile Robot using Region Extension
- Other Titles
- Path Planning Algorithm for Mobile Robot using Region Extension
- Authors
- 곽재혁; 임준홍
- Issue Date
- May-2005
- Publisher
- 대한전기학회
- Keywords
- path planning; region extension; density; mobile robot
- Citation
- 2005 정보 및 제어 심포지엄 논문집(ICS '05), pp 249 - 251
- Pages
- 3
- Indexed
- OTHER
- Journal Title
- 2005 정보 및 제어 심포지엄 논문집(ICS '05)
- Start Page
- 249
- End Page
- 251
- URI
- https://scholarworks.bwise.kr/erica/handle/2021.sw.erica/45940
- Abstract
- In this paper, an algorithm of path planning and obstacle avoidance for mobile robot is proposed. We call the proposed method Random Access Sequence (RAS) method. In the proposed method, a small region is set first and numbers are assigned to its neighbors. By processing assigned numbers all regions are covered and then the path from start to destination is selected by these numbers. The RAS has an advantage of fast planning because of simple operations. This implies that new path selection may be possible within a short time and helps a robot to avoid obstacles in any direction. The algorithm can be applied to unknown environments. When moving obstacles appear, a mobile robot avoids obstacles reactively, then new path is selected by RAS.
- Files in This Item
-
Go to Link
- Appears in
Collections - COLLEGE OF ENGINEERING SCIENCES > SCHOOL OF ELECTRICAL ENGINEERING > 1. Journal Articles

Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.