Share Email Print

Proceedings Paper

GORP: a new method for mobile robot path-planning problem
Author(s): S. M. Noorhosseini; Alfred S. Malowany
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

The Goal Oriented Recursive Path-Planning (GORP) algorithm described in this paper is a sensor based technique for navigating a holonomic mobile robot in an unknown environment, cluttered with convex and simple non-convex objects. This method tries to find the longest straight path segment with predetermined clearance from the obstacles in the direction that takes the robot closer to the goal or leads to get around the obstacle. Unlike other methods which try to be as far from the obstacles as possible, this method keeps only a safe distance from the obstacle in the way. This results in a shorter path which reduces the chance of confronting a new obstacle while keeping the path found safe enough. GORP guarantees to find a path in an open area and in a convex region cluttered with convex and simple non- convex objects if one exists.

Paper Details

Date Published: 4 May 1993
PDF: 8 pages
Proc. SPIE 1831, Mobile Robots VII, (4 May 1993); doi: 10.1117/12.143811
Show Author Affiliations
S. M. Noorhosseini, McGill Univ. (Canada)
Alfred S. Malowany, McGill Univ. (Canada)

Published in SPIE Proceedings Vol. 1831:
Mobile Robots VII
William J. Wolfe; Wendell H. Chun, Editor(s)

© SPIE. Terms of Use
Back to Top