This paper contains two new works, namely (i) general task space struc
ture of any n d.o.f. manipulator, and (ii) general procedure of determ
ining admissibility of paths in task space for general manipulators. S
everal examples are presented to illustrate the general theory.