Generic Algorithm for Peg-In-Hole Assembly Tasks for Pin Alignments with Impedance Controlled Robots

In this paper, a generic algorithm for peg-in-hole assembly tasks is suggested. It is applied in the project GINKO were the aim is to connect electric vehicles with charging stations automatically. This paper explains an algorithm applicable for peg-in-hole tasks by means of Cartesian impedance cont...

Full description

Saved in:
Bibliographic Details
Published inRobot 2015: Second Iberian Robotics Conference pp. 105 - 117
Main Authors Jokesch, Michael, Suchý, Jozef, Winkler, Alexander, Fross, André, Thomas, Ulrike
Format Book Chapter
LanguageEnglish
Published Cham Springer International Publishing 2016
SeriesAdvances in Intelligent Systems and Computing
Subjects
Online AccessGet full text
ISBN9783319271484
3319271482
ISSN2194-5357
2194-5365
DOI10.1007/978-3-319-27149-1_9

Cover

More Information
Summary:In this paper, a generic algorithm for peg-in-hole assembly tasks is suggested. It is applied in the project GINKO were the aim is to connect electric vehicles with charging stations automatically. This paper explains an algorithm applicable for peg-in-hole tasks by means of Cartesian impedance controlled robots. The plugging task is a specialized peg-in-hole task for which 7 pins have to be aligned simultaneously and the peg and the hole have asymmetric shapes. In addition significant forces are required for complete insertion. The initial position is inaccurately estimated by a vision system. Hence, there are translational and rotational uncertainties between the plug, carried by the robot and the socket, situated on the E-car. To compensate these errors three different steps of Cartesian impedance control are performed. To verify our approach we evaluated the algorithm from many different start positions.
Bibliography:This paper is supported by the Federal Ministry of Education and Research (Germany), under the funding code 03IPT505A. Responsibility for content lies with the authors.
ISBN:9783319271484
3319271482
ISSN:2194-5357
2194-5365
DOI:10.1007/978-3-319-27149-1_9