In some daily tasks, such as pick and place, the robot is requested to reach with its hand tip a desired target location while it is operating in its environment. Such tasks become more complex in environments cluttered with obstacles, since the constraint for collision-free movement must be also taken into account. This paper presents a new technique based on genetic algorithms (GAs) to solve the path planning problem of articulated redundant robot manipulators. The efficiency of the proposed GA is demonstrated through multiple experiments carried out on several robots with redundant degrees-of-freedom. Finally, the computational complexity of the proposed solution is estimated, in the worst case.