A robotized interior work process planning algorithm based on surface minimum coverage set

Yufeng Du, Xin Jiang, P. Shan, T. Chen, Huanyong Ji, Peng Li, C. Lyu, Wei Yang, Yunhui Liu
{"title":"A robotized interior work process planning algorithm based on surface minimum coverage set","authors":"Yufeng Du, Xin Jiang, P. Shan, T. Chen, Huanyong Ji, Peng Li, C. Lyu, Wei Yang, Yunhui Liu","doi":"10.1109/ROBIO.2017.8324531","DOIUrl":null,"url":null,"abstract":"Interior finishing requires high labor intensity and finishing materials are harmful to workers during the processes, especially the one of wall surface disposal. In order to reduce labor costs and protect the health of workers, applying autonomous interior finishing robots in the wall surface disposal process will be a reasonable choice. In the application of an autonomous interior finishing robot, the path taken by the robot must be planned carefully considering that indoor environments can be very complicated. In addition, different from mobile manipulators, a mobile interior finishing robot has to access larger working space and be able to apply large force to the walls, ceilings. Thus they have to be used in a way similar to mobile crane. That is in order to guarantee stability, in each working station, mechanical stands will be released to support the platform. After finishing required processes, the stands have to be retrieved to move to the next working position. For an interior finishing robot working in this way, it needs to determine the optimal plan to minimize the times of working position change. In this paper, a method based on a minimal cover set of the planar surface is proposed for this purpose. With the derived robot moving plan with minimized steps, the whole moving sequence of the robotic interior finishing unit is determined with Genetic algorithm. The work area needed to be finished in each working position is then divided by using Voronoi graph.","PeriodicalId":197159,"journal":{"name":"2017 IEEE International Conference on Robotics and Biomimetics (ROBIO)","volume":"63 4","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 IEEE International Conference on Robotics and Biomimetics (ROBIO)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ROBIO.2017.8324531","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

Abstract

Interior finishing requires high labor intensity and finishing materials are harmful to workers during the processes, especially the one of wall surface disposal. In order to reduce labor costs and protect the health of workers, applying autonomous interior finishing robots in the wall surface disposal process will be a reasonable choice. In the application of an autonomous interior finishing robot, the path taken by the robot must be planned carefully considering that indoor environments can be very complicated. In addition, different from mobile manipulators, a mobile interior finishing robot has to access larger working space and be able to apply large force to the walls, ceilings. Thus they have to be used in a way similar to mobile crane. That is in order to guarantee stability, in each working station, mechanical stands will be released to support the platform. After finishing required processes, the stands have to be retrieved to move to the next working position. For an interior finishing robot working in this way, it needs to determine the optimal plan to minimize the times of working position change. In this paper, a method based on a minimal cover set of the planar surface is proposed for this purpose. With the derived robot moving plan with minimized steps, the whole moving sequence of the robotic interior finishing unit is determined with Genetic algorithm. The work area needed to be finished in each working position is then divided by using Voronoi graph.
一种基于曲面最小覆盖集的自动化室内工序规划算法
室内装修对劳动强度要求高,装修材料对工人有害,尤其是墙面处理。为了降低人工成本和保护工人的健康,在墙面处理过程中应用自主内饰机器人将是一种合理的选择。在自主室内装修机器人的应用中,考虑到室内环境非常复杂,必须对机器人所走的路径进行仔细规划。此外,与移动机械手不同,移动室内整理机器人需要访问更大的工作空间,并且能够对墙壁、天花板施加较大的力。因此,它们必须以类似于移动起重机的方式使用。即为了保证稳定性,在每个工作站上,都会释放机械支架来支撑平台。在完成所需的工序后,必须收回支架以移动到下一个工作位置。对于以这种方式工作的内饰机器人,需要确定最优方案,使工作位置变化次数最少。为此,本文提出了一种基于平面最小覆盖集的方法。根据导出的机器人最小步长运动方案,利用遗传算法确定机器人内部精加工单元的整体运动顺序。然后利用Voronoi图对每个工作位置需要完成的工作区域进行划分。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信