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.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>