An All–Geodesic Algorithm for Filament–Winding of a T–shaped Form

Abstract: 

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.

Reference:
S. Seereeram, J.T. Wen (1991). An All–Geodesic Algorithm for Filament–Winding of a T–shaped Form.

IEEE Transaction on Industrial Electronics, December, 1991, pp. 484–490.

Publication Type: 
Archival Journals