Share Email Print

Proceedings Paper

Avoidance System for Moving Obstacles
Author(s): James Gil de Lamadrid
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper Abstract

This paper presents a system which moves a robot through Cartesian space in the presence of objects which are also moving, in predictable trajectories. The method presented calculates a piecewise linear path with piecewise constant velocities. This is done by assuming a straight-line path from the start to the goal, and recursively planning smaller subpaths if collisions are detected. Two methods for generating subgoals are presented and compared. The first is a blind method employing little information on the location of the objects at collision time. The second is a method using Khatib's artificial potential functions for locating the subgoal. The algorithm currently is implemented in two dimensions, and represents an arbitrary number of objects by their bounding circles. The robot is represented by a point. The algorithm guarantees that all movement of the robot will take place in a specified workspace. In addition the robot is required to stay on a specified time schedule, within a certain tolerance. Obstacle trajectories are constrained to be represented as quadratic parametric equations in time. The paper points out some obvious extensions to this work. These include extensions to three dimensions, fine-motion planning with complex shapes, and use of the system with objects following unknown trajectories.

Paper Details

Date Published: 25 February 1987
PDF: 10 pages
Proc. SPIE 0727, Mobile Robots I, (25 February 1987); doi: 10.1117/12.937811
Show Author Affiliations
James Gil de Lamadrid, University of Minnesota (United States)

Published in SPIE Proceedings Vol. 0727:
Mobile Robots I
Nelson Marquina; William J. Wolfe, Editor(s)

© SPIE. Terms of Use
Back to Top