By Topic

Motion planning amidst planar moving obstacles

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
N. Aggarwal ; Dept. of Comput. & Inf. Sci., Ohio State Univ., Columbus, OH, USA ; K. Fujimura

A method is investigated for finding a collision-free path for a mobile robot with a few degrees of freedom in a time-varying domain. The environment contains a set of obstacles with arbitrary known motion patterns. In a time-varying environment, paths are time-dependent, i.e., a path needs to be specified as a function of time, since connectivity in the environment changes over time. Given a time-varying environment, a start time, and a start location, a method is presented for finding a collision-free path from start to goal points for a finite-size robot subject to a speed bound. Our method makes use of a heuristic approach based on a transient pixel representation

Published in:

Robotics and Automation, 1994. Proceedings., 1994 IEEE International Conference on

Date of Conference:

8-13 May 1994