Collision-free path planning for robots using B-splines and simulated annealing

Thumbnail Image
Date
1993
Authors
Martínez-Alfaro, Horacio
Major Professor
Advisor
Donald R. Flugrad
Committee Member
Journal Title
Journal ISSN
Volume Title
Publisher
Altmetrics
Authors
Research Projects
Organizational Units
Organizational Unit
Mechanical Engineering
The Department of Mechanical Engineering at Iowa State University is where innovation thrives and the impossible is made possible. This is where your passion for problem-solving and hands-on learning can make a real difference in our world. Whether you’re helping improve the environment, creating safer automobiles, or advancing medical technologies, and athletic performance, the Department of Mechanical Engineering gives you the tools and talent to blaze your own trail to an amazing career.
Journal Issue
Is Version Of
Versions
Series
Department
Mechanical Engineering
Abstract

This thesis describes a technique to obtain an optimal collision-free path for an automated guided vehicle (AGV) and/or robot in two and three dimensions by synthesizing a B-spline curve under geometric and intrinsic constraints. The problem is formulated as a combinatorial optimization problem and solved by using simulated annealing. A two-link planar manipulator is included to show that the B-spline curve can also be synthesized by adding kinematic characteristics of the robot. A cost function, which includes obstacle proximity, excessive arc length, uneven parametric distribution and, possibly, link proximity costs, is developed for the simulated annealing algorithm. Three possible cases for the orientation of the moving object are explored: (a) fixed orientation, (b) orientation as another independent variable, and (c) orientation given by the slope of the curve. To demonstrate the robustness of the technique, several examples are presented. Objects are modeled as ellipsoid type shapes. The procedure to obtain the describing parameters of the ellipsoid is also presented.

Comments
Description
Keywords
Citation
Source
Copyright
Fri Jan 01 00:00:00 UTC 1993