{"title":"Automated assembly in the presence of significant system errors","authors":"Erik Vaaler, W. Seering","doi":"10.1109/ISIC.1988.65454","DOIUrl":null,"url":null,"abstract":"A primary source of difficulty in automated assembly is the uncertainty in the relative position of the parts being assembled. A logic branching approach to solving this problem is discussed. Force sensor information, responses to recent moves, and results from previous assemblies are used to generate the branching decisions. Several heuristic assembly algorithms are presented. The proposed approach generates efficient compliant motion strategies for any set of hard, smooth parts that can be modeled as a peg and hole. Two of the algorithms converge to acceptable performance levels in less than 100 assembly trials. This implies that a real assembly cell using these algorithms would converge quickly enough for the learning to be done online. This would eliminate the modeling errors introduced by learning with an assembly simulator. Logic branching is compared with other machine learning and expert system techniques.<<ETX>>","PeriodicalId":155616,"journal":{"name":"Proceedings IEEE International Symposium on Intelligent Control 1988","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1988-08-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings IEEE International Symposium on Intelligent Control 1988","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIC.1988.65454","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
Abstract
A primary source of difficulty in automated assembly is the uncertainty in the relative position of the parts being assembled. A logic branching approach to solving this problem is discussed. Force sensor information, responses to recent moves, and results from previous assemblies are used to generate the branching decisions. Several heuristic assembly algorithms are presented. The proposed approach generates efficient compliant motion strategies for any set of hard, smooth parts that can be modeled as a peg and hole. Two of the algorithms converge to acceptable performance levels in less than 100 assembly trials. This implies that a real assembly cell using these algorithms would converge quickly enough for the learning to be done online. This would eliminate the modeling errors introduced by learning with an assembly simulator. Logic branching is compared with other machine learning and expert system techniques.<>