Computer aid for automatic liaisons extraction from cad based robotic assembly

M. R. Raju Bahubalendruni, B. B. Biswal
{"title":"Computer aid for automatic liaisons extraction from cad based robotic assembly","authors":"M. R. Raju Bahubalendruni, B. B. Biswal","doi":"10.1109/ISCO.2014.7103915","DOIUrl":null,"url":null,"abstract":"Selection of optimized assembly sequence from the available feasible assembly sequences is significantly essential to achieve cost effective manufacturing process. To achieve this, at the outset generation of feasible assembly sequences with topological, geometrical, precedence and stability constraints should be prepared. The increase of part count in a product results huge number of assembly sequences. The Liaison matrix/Liaison graph generated based on the connections between the assembly components eliminates non possible assembly sequences. In this paper, automatic extraction of liaison matrix extraction from CATIA and elimination of non-feasible assembly sequences is illustrated.","PeriodicalId":119329,"journal":{"name":"2014 IEEE 8th International Conference on Intelligent Systems and Control (ISCO)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"23","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 IEEE 8th International Conference on Intelligent Systems and Control (ISCO)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISCO.2014.7103915","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 23

Abstract

Selection of optimized assembly sequence from the available feasible assembly sequences is significantly essential to achieve cost effective manufacturing process. To achieve this, at the outset generation of feasible assembly sequences with topological, geometrical, precedence and stability constraints should be prepared. The increase of part count in a product results huge number of assembly sequences. The Liaison matrix/Liaison graph generated based on the connections between the assembly components eliminates non possible assembly sequences. In this paper, automatic extraction of liaison matrix extraction from CATIA and elimination of non-feasible assembly sequences is illustrated.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
从基于 cad 的机器人装配中自动提取联络点的计算机辅助工具
从可用的可行装配序列中选择优化的装配序列对于实现具有成本效益的制造流程至关重要。为实现这一目标,一开始就应编制具有拓扑、几何、优先和稳定性约束的可行装配序列。产品中零件数量的增加导致装配序列数量巨大。根据装配组件之间的联系生成的联络矩阵/联络图可以消除不可能的装配序列。本文阐述了从 CATIA 中自动提取联络矩阵和消除不可行装配序列的方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Enhanced spread spectrum image watermarking with compression-encryption technique Efficient classification mechanism for network intrusion detection system based on data mining techniques: A survey Automated process for assessment of learners programming assignments Agpest: An efficient rule-based expert system to prevent pest diseases of rice & wheat crops Segmentation of cells with inclusions in plant cross sectional images
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1