Loading…
An all-geodesic algorithm for filament winding of a T-shaped form
An algorithm that generates all-geodesic paths for the complete surface coverage of a T-shaped form composed of the adjoining of two cylinders of equal radii is presented. This has been recognized as a challenging filament-winding problem as its form is nonaxisymmetric. This algorithm was implemente...
Saved in:
Published in: | IEEE transactions on industrial electronics (1982) 1991-12, Vol.38 (6), p.484-490 |
---|---|
Main Authors: | , |
Format: | Article |
Language: | English |
Subjects: | |
Citations: | Items that this one cites Items that cite this one |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Summary: | An algorithm that generates all-geodesic paths for the complete surface coverage of a T-shaped form composed of the adjoining of two cylinders of equal radii is presented. This has been recognized as a challenging filament-winding problem as its form is nonaxisymmetric. This algorithm was implemented on the robotic filament-winding system developed at Rensselaer Polytechnic Institute.< > |
---|---|
ISSN: | 0278-0046 1557-9948 |
DOI: | 10.1109/41.107105 |