By Topic

On dynamic motion planning problems

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)
R. C. Luo ; Robotics & Intelligent Syst. Lab., North Carolina State Univ., Raleigh, NC, USA ; T. -J. Pan

A novel method for solving the motion planning problem in the presence of moving obstacles is presented. Compared to previous approaches, the proposed method is more general in that obstacles are allowed to move with translation and rotation at nonlinear velocity. Using path/velocity decomposition, the method emphasizes the development of an efficient algorithm for collision detection between the robot and moving polygons. This algorithm is devised using transversability vector theory to determine the geometric relationships between any two convex polygons or convex components of concave polygons. The interference between the robot and the moving obstacles is detected and registered on the constraint map to represent time constraints on the robot's motion along the path. The constraint map is then used for velocity planning using a simple algorithm. The problem of a robot crossing the street is used as an example for computational analysis

Published in:

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

Date of Conference:

9-11 Apr 1991