Ali Nourollah - Shahid Rajaee Teacher Training University
Nooshin Behzadpour - Shahid Rajaee Teacher Training University

This paper presents a new optimization problem in the field of linkage reconfiguration. This is the problem of minimizing moving parts of a given robot arm for positioning the end effector of the given robot arm at the given target point as well as minimizing the movement of the movable parts. Initially, the formal modeling is accomplished by minimizing the movement problem. At this time, a criterion which called AM (Arithmetic Measure) is introduced, and this criterion is used to quantify the motion of the linkage. Afterward, it is indicated that the presented problem is an NP-Hard problem. Consequently, a greedy heuristic algorithm is presented to minimize movement of the robot s moving components. After identifying the moving components and the movement of these parts, an algorithm is provided to determine the final configuration of the robot arm. The mentioned algorithm solves the problem by mapping the robot arm with an arbitrary number of links to a robot with a single link or two links. The proposed heuristic approach requires  time using  space.

Formal Modeling, Robot arm, Linkage Reconfiguration, Reachability Problem, Computational Geometry