{"title":"仓库管理中叉车群的运动规划——布置工作的动态调度","authors":"T. Hara, T. Higashi, J. Ota, H. Tamura","doi":"10.1109/RISSP.2003.1285593","DOIUrl":null,"url":null,"abstract":"In this paper, as the first step of managing both storagability and operatability in the floor warehouse, we deal with a scheduling for assignment of forklifts on an arrangement work. We propose an algorithm that calculates a semi-optimal solution in practical time for this problem. This algorithm bases on simulated annealing and consists of three layers with a different search domain. We also propose methods of online re-planning against the model error in offline plan stage, and the uncertainty of human work. The validity of our method is verified in simulation.","PeriodicalId":205610,"journal":{"name":"IEEE International Conference on Robotics, Intelligent Systems and Signal Processing, 2003. Proceedings. 2003","volume":"15 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2003-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"Motion planning of fork lift group in warehouse management - dynamical scheduling of arrangement work\",\"authors\":\"T. Hara, T. Higashi, J. Ota, H. Tamura\",\"doi\":\"10.1109/RISSP.2003.1285593\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, as the first step of managing both storagability and operatability in the floor warehouse, we deal with a scheduling for assignment of forklifts on an arrangement work. We propose an algorithm that calculates a semi-optimal solution in practical time for this problem. This algorithm bases on simulated annealing and consists of three layers with a different search domain. We also propose methods of online re-planning against the model error in offline plan stage, and the uncertainty of human work. The validity of our method is verified in simulation.\",\"PeriodicalId\":205610,\"journal\":{\"name\":\"IEEE International Conference on Robotics, Intelligent Systems and Signal Processing, 2003. Proceedings. 2003\",\"volume\":\"15 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2003-10-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE International Conference on Robotics, Intelligent Systems and Signal Processing, 2003. Proceedings. 2003\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/RISSP.2003.1285593\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE International Conference on Robotics, Intelligent Systems and Signal Processing, 2003. Proceedings. 2003","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/RISSP.2003.1285593","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Motion planning of fork lift group in warehouse management - dynamical scheduling of arrangement work
In this paper, as the first step of managing both storagability and operatability in the floor warehouse, we deal with a scheduling for assignment of forklifts on an arrangement work. We propose an algorithm that calculates a semi-optimal solution in practical time for this problem. This algorithm bases on simulated annealing and consists of three layers with a different search domain. We also propose methods of online re-planning against the model error in offline plan stage, and the uncertainty of human work. The validity of our method is verified in simulation.