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.