{"title":"基于动态规划的可重复使用运载火箭足迹计算","authors":"Bo Yang, C. Wu, Dawei Li, Jing Hu","doi":"10.1109/ICNC.2009.592","DOIUrl":null,"url":null,"abstract":"The reentry process of reusable launch vehicle is very complex, so extrapolating the landing area based on original state has significant meaning for the launch vehicle reentry trajectory. This paper presents a method of calculating the landing area based on dynamic programming. The method traces out a nominal resistance boundary curve in energy-resistance space on the premise of meeting all the constraint conditions of reentry trajectory, then tracks it by using feedback linearization to get the feasible boundary, finally attains a resistance project by using interpolation method. Longitudinal trace is also attained by using feedback linearization, while transverse control is achieved by tilting motion at different times. Select the largest and the least resistance values as the top and the bottom point of the reentry landing area, and at the same time choose the point that its tilting angle is constant plus or minus as the left or right side of the reentry landing area. All these above compose the boundary of the reentry landing area. At last, validate the feasibility of the method by computer simulation, and achieve a superior predictive result.","PeriodicalId":87274,"journal":{"name":"International Conference on Computing, Networking, and Communications : [proceedings]. International Conference on Computing, Networking and Communications","volume":"74 1","pages":"376-381"},"PeriodicalIF":0.0000,"publicationDate":"2009-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Footprint Calculation for a Reusable Launch Vehicle Based on Dynamics Programming\",\"authors\":\"Bo Yang, C. Wu, Dawei Li, Jing Hu\",\"doi\":\"10.1109/ICNC.2009.592\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The reentry process of reusable launch vehicle is very complex, so extrapolating the landing area based on original state has significant meaning for the launch vehicle reentry trajectory. This paper presents a method of calculating the landing area based on dynamic programming. The method traces out a nominal resistance boundary curve in energy-resistance space on the premise of meeting all the constraint conditions of reentry trajectory, then tracks it by using feedback linearization to get the feasible boundary, finally attains a resistance project by using interpolation method. Longitudinal trace is also attained by using feedback linearization, while transverse control is achieved by tilting motion at different times. Select the largest and the least resistance values as the top and the bottom point of the reentry landing area, and at the same time choose the point that its tilting angle is constant plus or minus as the left or right side of the reentry landing area. All these above compose the boundary of the reentry landing area. At last, validate the feasibility of the method by computer simulation, and achieve a superior predictive result.\",\"PeriodicalId\":87274,\"journal\":{\"name\":\"International Conference on Computing, Networking, and Communications : [proceedings]. International Conference on Computing, Networking and Communications\",\"volume\":\"74 1\",\"pages\":\"376-381\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Conference on Computing, Networking, and Communications : [proceedings]. International Conference on Computing, Networking and Communications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICNC.2009.592\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Conference on Computing, Networking, and Communications : [proceedings]. International Conference on Computing, Networking and Communications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICNC.2009.592","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Footprint Calculation for a Reusable Launch Vehicle Based on Dynamics Programming
The reentry process of reusable launch vehicle is very complex, so extrapolating the landing area based on original state has significant meaning for the launch vehicle reentry trajectory. This paper presents a method of calculating the landing area based on dynamic programming. The method traces out a nominal resistance boundary curve in energy-resistance space on the premise of meeting all the constraint conditions of reentry trajectory, then tracks it by using feedback linearization to get the feasible boundary, finally attains a resistance project by using interpolation method. Longitudinal trace is also attained by using feedback linearization, while transverse control is achieved by tilting motion at different times. Select the largest and the least resistance values as the top and the bottom point of the reentry landing area, and at the same time choose the point that its tilting angle is constant plus or minus as the left or right side of the reentry landing area. All these above compose the boundary of the reentry landing area. At last, validate the feasibility of the method by computer simulation, and achieve a superior predictive result.