Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/20485
Title: Online path searching for autonomous robot navigation
Authors: Wang, M
Liu, JNK
Keywords: Collision avoidance
Mobile robots
Navigation
Issue Date: 2004
Publisher: IEEE
Source: 2004 IEEE Conference on Robotics, Automation and Mechatronics, 1-3 December 2004, v. 2, p. 746-751 How to cite?
Abstract: Blind goal reaching, a common autonomous robot navigation task, is applied in highly dynamic and unknown environments. In this it differs from "heuristic" goal reaching, which makes use of a geometrical or topological environmental map. Traditionally, blind goal reaching combines both obstacle-avoidance (OA) and goal-seeking (GS) behaviors, yet this is not a sufficient way to obtain a smooth path. And even more seriously, if the robot meets a dead end, the "OA+GS" approach may cause the dead-cycle (or local minimum) problem. This paper proposes a novel approach, memory grid (MG), which imitates the human memory and decision making functions. MG-based online path searching (PS) behavior provides a novel alternative to blind goal reaching. The experiments, including tests on a real sonar-based robot navigating in dead ends, have demonstrated not only that the performance of the "OA+GS+PS" approach is superior to that of "OA+GS" navigation algorithms, but also that, unlike the traditional "OA+GS" approach, it can solve the dead-cycle problem.
URI: http://hdl.handle.net/10397/20485
ISBN: 0-7803-8645-0
DOI: 10.1109/RAMECH.2004.1438011
Appears in Collections:Conference Paper

Access
View full-text via PolyU eLinks SFX Query
Show full item record

Page view(s)

32
Last Week
2
Last month
Checked on Oct 16, 2017

Google ScholarTM

Check

Altmetric



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