Preston Culbertson, Saptarshi Bandyopadhyay, A. Goel, P. McGarey, M. Schwager
{"title":"月球背面环形山射电望远镜多机器人装配调度","authors":"Preston Culbertson, Saptarshi Bandyopadhyay, A. Goel, P. McGarey, M. Schwager","doi":"10.1109/AERO53065.2022.9843304","DOIUrl":null,"url":null,"abstract":"The Lunar Crater Radio Telescope (LCRT) is a proposed ultra-long-wavelength radio telescope to be constructed on the far side of the moon. The proposed telescope will be constructed by deploying a 1km wire mesh in a 3-5km crater using a team of wall-climbing DuAxel robots. In this work, we consider the problem of generating minimum-time assembly sequences for LCRT, using realistic models of travel speed and lighting. We pose the assembly sequencing problem as a mixed-integer linear program (MILP), which we solve to global optimality using commercial solvers. We present methods for modeling time-varying travel and assembly times, based on variable lighting conditions (including crater shadowing), and show how such time-varying parameters can be incorporated into the MILP. Finally, we present numerical studies of our method, showing how makespan varies with the number of assembly robots.","PeriodicalId":219988,"journal":{"name":"2022 IEEE Aerospace Conference (AERO)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Multi-Robot Assembly Scheduling for the Lunar Crater Radio Telescope on the Far-Side of the Moon\",\"authors\":\"Preston Culbertson, Saptarshi Bandyopadhyay, A. Goel, P. McGarey, M. Schwager\",\"doi\":\"10.1109/AERO53065.2022.9843304\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The Lunar Crater Radio Telescope (LCRT) is a proposed ultra-long-wavelength radio telescope to be constructed on the far side of the moon. The proposed telescope will be constructed by deploying a 1km wire mesh in a 3-5km crater using a team of wall-climbing DuAxel robots. In this work, we consider the problem of generating minimum-time assembly sequences for LCRT, using realistic models of travel speed and lighting. We pose the assembly sequencing problem as a mixed-integer linear program (MILP), which we solve to global optimality using commercial solvers. We present methods for modeling time-varying travel and assembly times, based on variable lighting conditions (including crater shadowing), and show how such time-varying parameters can be incorporated into the MILP. Finally, we present numerical studies of our method, showing how makespan varies with the number of assembly robots.\",\"PeriodicalId\":219988,\"journal\":{\"name\":\"2022 IEEE Aerospace Conference (AERO)\",\"volume\":\"31 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-03-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2022 IEEE Aerospace Conference (AERO)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/AERO53065.2022.9843304\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 IEEE Aerospace Conference (AERO)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/AERO53065.2022.9843304","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Multi-Robot Assembly Scheduling for the Lunar Crater Radio Telescope on the Far-Side of the Moon
The Lunar Crater Radio Telescope (LCRT) is a proposed ultra-long-wavelength radio telescope to be constructed on the far side of the moon. The proposed telescope will be constructed by deploying a 1km wire mesh in a 3-5km crater using a team of wall-climbing DuAxel robots. In this work, we consider the problem of generating minimum-time assembly sequences for LCRT, using realistic models of travel speed and lighting. We pose the assembly sequencing problem as a mixed-integer linear program (MILP), which we solve to global optimality using commercial solvers. We present methods for modeling time-varying travel and assembly times, based on variable lighting conditions (including crater shadowing), and show how such time-varying parameters can be incorporated into the MILP. Finally, we present numerical studies of our method, showing how makespan varies with the number of assembly robots.