Pan Zhang, Jiulin Cheng, Wei Zhang, Xin Lu, Yuhao Chen
{"title":"航空行李搬运机器人轨迹规划研究","authors":"Pan Zhang, Jiulin Cheng, Wei Zhang, Xin Lu, Yuhao Chen","doi":"10.1109/ICIST55546.2022.9926842","DOIUrl":null,"url":null,"abstract":"In order to improve the accuracy and efficiency of the baggage pick-up and placement process, the problem of bag-gage pick-up and placement trajectory planning of the airline bag-gage palletizing robot is studied. Taking the baggage palletizing experiment platform as the application scenario, the trajectory of the pick-up segment for accurately picking up the baggage with the pallet is planned. The 4-3-4 polynomial interpolation method is used to plan the trajectory of the placement segment, and MATLAB is used to simulate the trajectory. The simulation results show that the planned trajectory is smooth and continuous, there is no major impact during operation. Finally, the multi-ob-jective particle swarm optimization (MOPSO) algorithm is used to optimize the trajectory with the target of trajectory running time, luggage pallet motion impact and angular acceleration. Field experiments in the laboratory show that the actual trajectory of the robot is basically consistent with the planned trajectory. The optimized trajectory running time is less than 7 seconds, the trajectory running is stable. The angular acceleration distribution of each axis is relatively uniform, which can realize the accurate retrieval and stable placement of baggage, and effectively improve the accuracy and efficiency of baggage pick-up and placement.","PeriodicalId":211213,"journal":{"name":"2022 12th International Conference on Information Science and Technology (ICIST)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-10-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Research on trajectory planning of airline baggage handling robot\",\"authors\":\"Pan Zhang, Jiulin Cheng, Wei Zhang, Xin Lu, Yuhao Chen\",\"doi\":\"10.1109/ICIST55546.2022.9926842\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In order to improve the accuracy and efficiency of the baggage pick-up and placement process, the problem of bag-gage pick-up and placement trajectory planning of the airline bag-gage palletizing robot is studied. Taking the baggage palletizing experiment platform as the application scenario, the trajectory of the pick-up segment for accurately picking up the baggage with the pallet is planned. The 4-3-4 polynomial interpolation method is used to plan the trajectory of the placement segment, and MATLAB is used to simulate the trajectory. The simulation results show that the planned trajectory is smooth and continuous, there is no major impact during operation. Finally, the multi-ob-jective particle swarm optimization (MOPSO) algorithm is used to optimize the trajectory with the target of trajectory running time, luggage pallet motion impact and angular acceleration. Field experiments in the laboratory show that the actual trajectory of the robot is basically consistent with the planned trajectory. The optimized trajectory running time is less than 7 seconds, the trajectory running is stable. The angular acceleration distribution of each axis is relatively uniform, which can realize the accurate retrieval and stable placement of baggage, and effectively improve the accuracy and efficiency of baggage pick-up and placement.\",\"PeriodicalId\":211213,\"journal\":{\"name\":\"2022 12th International Conference on Information Science and Technology (ICIST)\",\"volume\":\"27 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-10-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2022 12th International Conference on Information Science and Technology (ICIST)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICIST55546.2022.9926842\",\"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 12th International Conference on Information Science and Technology (ICIST)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICIST55546.2022.9926842","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Research on trajectory planning of airline baggage handling robot
In order to improve the accuracy and efficiency of the baggage pick-up and placement process, the problem of bag-gage pick-up and placement trajectory planning of the airline bag-gage palletizing robot is studied. Taking the baggage palletizing experiment platform as the application scenario, the trajectory of the pick-up segment for accurately picking up the baggage with the pallet is planned. The 4-3-4 polynomial interpolation method is used to plan the trajectory of the placement segment, and MATLAB is used to simulate the trajectory. The simulation results show that the planned trajectory is smooth and continuous, there is no major impact during operation. Finally, the multi-ob-jective particle swarm optimization (MOPSO) algorithm is used to optimize the trajectory with the target of trajectory running time, luggage pallet motion impact and angular acceleration. Field experiments in the laboratory show that the actual trajectory of the robot is basically consistent with the planned trajectory. The optimized trajectory running time is less than 7 seconds, the trajectory running is stable. The angular acceleration distribution of each axis is relatively uniform, which can realize the accurate retrieval and stable placement of baggage, and effectively improve the accuracy and efficiency of baggage pick-up and placement.