A Classification of Configuration Spaces of Planar Robot Arms with Application to a Continuous Inverse Kinematics Problem

Using results on the topology of moduli space of polygons [Jaggi, 92; Kapovich and Millson, 94], it can be shown that for a planar robot arm with $n$ segments there are some values of the base-length, $z$, at which the configuration space of the constrained arm (arm with its end effector fixed) has two disconnected components, while at other values the constrained configuration space has one connected component. We first review some of these known results. Then the main design problem addressed in this paper is the construction of pairs of continuous inverse kinematics for arbitrary robot arms, with the property that the two inverse kinematics agree when the constrained configuration space has a single connected component, but they give distinct configurations (one in each connected component) when the configuration space of the constrained arm has two components. This design is made possible by a fundamental theoretical contribution in this paper -- a classification of configuration spaces of robot arms such that the type of path that the system (robot arm) takes through certain critical values of the forward kinematics function is completely determined by the class to which the configuration space of the arm belongs. This classification result makes the aforesaid design problem tractable, making it sufficient to design a pair of inverse kinematics for each class of configuration spaces (three of them in total). We discuss the motivation for this work, which comes from a more extensive problem of motion planning for the end effector of a robot arm requiring us to continuously sample one configuration from each connected component of the constrained configuration spaces. We demonstrate the low complexity of the presented algorithm through a Javascript + HTML5 based implementation available at this http URL

[1]  Jesse Freeman,et al.  in Morse theory, , 1999 .

[2]  Stephen S. Winter,et al.  At State University of New York at Buffalo , 1965 .

[3]  Chih-Cheng Chen,et al.  A combined optimization method for solving the inverse kinematics problems of mechanical manipulators , 1991, IEEE Trans. Robotics Autom..

[4]  R. Smullyan ANNALS OF MATHEMATICS STUDIES , 1961 .

[5]  Nils J. Nilsson,et al.  A Formal Basis for the Heuristic Determination of Minimum Cost Paths , 1968, IEEE Trans. Syst. Sci. Cybern..

[6]  Anthony Stentz,et al.  The Focussed D* Algorithm for Real-Time Replanning , 1995, IJCAI.

[7]  Jeffrey C. Trinkle,et al.  Complete path planning for a planar 2-R manipulator with point obstacles , 2004, IEEE International Conference on Robotics and Automation, 2004. Proceedings. ICRA '04. 2004.

[8]  Howie Choset,et al.  Composition of local potential functions for global robot control and navigation , 2003, Proceedings 2003 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2003) (Cat. No.03CH37453).

[9]  Eric A. Hansen,et al.  Anytime Heuristic Search , 2011, J. Artif. Intell. Res..

[10]  Ramakrishnan Mukundan,et al.  Triangualation - A New Algorithm for Inverse Kinematics , 2007 .

[11]  Pradeep K. Khosla,et al.  Real-time obstacle avoidance using harmonic potential functions , 1991, IEEE Trans. Robotics Autom..

[12]  Beno Benhabib,et al.  A complete generalized solution to the inverse kinematics of robots , 1985, IEEE J. Robotics Autom..

[13]  N. Steenrod Topology of Fibre Bundles , 1951 .

[14]  Richard M. Murray,et al.  A Mathematical Introduction to Robotic Manipulation , 1994 .

[15]  M. Kapovich,et al.  On the moduli space of polygons in the Euclidean plane , 1995 .

[16]  Vijay Kumar,et al.  Topological constraints in search-based robot path planning , 2012, Auton. Robots.

[17]  Communism,et al.  University of Pennsylvania , 1847, Medical History.

[18]  Vladimir J. Lumelsky Iterative coordinate transformation procedure for one class of robots , 1984, IEEE Transactions on Systems, Man, and Cybernetics.

[19]  Subhrajit Bhattacharya,et al.  Topological and geometric techniques in graph search-based robot planning , 2012 .

[20]  W. Bowen,et al.  Philadelphia , 1892 .

[21]  Richard P. Paul,et al.  Robot manipulators : mathematics, programming, and control : the computer control of robot manipulators , 1981 .

[22]  Pradeep K. Khosla,et al.  Superquadric artificial potentials for obstacle avoidance and approach , 1988, Proceedings. 1988 IEEE International Conference on Robotics and Automation.

[23]  J. Trinkle,et al.  THE GEOMETRY OF CONFIGURATION SPACES FOR CLOSED CHAINS IN TWO AND THREE DIMENSIONS , 2004 .

[24]  R. Ho Algebraic Topology , 2022 .

[25]  K. C. Gupta,et al.  Improved numerical solutions of inverse kinematics of robots , 1985, Proceedings. 1985 IEEE International Conference on Robotics and Automation.

[26]  T. N. Payne,et al.  A comparison of total laparoscopic hysterectomy to robotically assisted hysterectomy: surgical outcomes in a community practice. , 2008, Journal of minimally invasive gynecology.

[27]  L. Nicolaescu An Invitation to Morse Theory , 2007 .

[28]  Samuel R. Buss,et al.  3D Computer Graphics: A Mathematical Introduction with OpenGL , 2003 .