By Topic

Discrete approximations to continuous curves

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

1 Author(s)
S. B. Andersson ; Dept. of Aerosp. & Mech. Eng., Boston Univ., MA

We consider the problem of approximating a continuous curve by a piecewise linear one whose segments are assumed to be connected by universal joints. Rather than taking a least-squares approach, we require that the endpoints of the line segments lie on the continuous curve. We show that under these assumptions a single rotational degree of freedom remains. An algorithm is derived to determine the set of angles characterizing the relative orientation of each consecutive pair of line segments as a function of this rotational degree of freedom. Two examples are given to illustrate the procedure. The motivating application for this work is the control of a snake-like robot using a set of gaits designed from shape primitives

Published in:

Proceedings 2006 IEEE International Conference on Robotics and Automation, 2006. ICRA 2006.

Date of Conference:

15-19 May 2006