Tomoaki Shimizu, Kosuke Taneda, Ayumu Goto, Tomoya Hattori, Toyokazu Kobayashi, Ryota Takamido, Jun Ota
{"title":"考虑Agent动力学的离线任务分配与运动规划算法","authors":"Tomoaki Shimizu, Kosuke Taneda, Ayumu Goto, Tomoya Hattori, Toyokazu Kobayashi, Ryota Takamido, Jun Ota","doi":"10.1109/ICARA56516.2023.10125759","DOIUrl":null,"url":null,"abstract":"The aim of this study is to develop an algorithm for task assignment and movement planning to a destination by considering the acceleration and deceleration patterns of automated guided vehicles (AGVs). In this study, we propose an algorithm for task assignment and motion planning for AGV kinematics with multiple search trees based on the conflict-based search with optimal task assignment (CBS-TA) of Hönig et al. By devising the options for AGV actions and settings for standby actions, the algorithm can perform optimal motion planning for each AGV, considering its dynamic characteristics.","PeriodicalId":443572,"journal":{"name":"2023 9th International Conference on Automation, Robotics and Applications (ICARA)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-02-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Offline Task Assignment and Motion Planning Algorithm Considering Agent's Dynamics\",\"authors\":\"Tomoaki Shimizu, Kosuke Taneda, Ayumu Goto, Tomoya Hattori, Toyokazu Kobayashi, Ryota Takamido, Jun Ota\",\"doi\":\"10.1109/ICARA56516.2023.10125759\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The aim of this study is to develop an algorithm for task assignment and movement planning to a destination by considering the acceleration and deceleration patterns of automated guided vehicles (AGVs). In this study, we propose an algorithm for task assignment and motion planning for AGV kinematics with multiple search trees based on the conflict-based search with optimal task assignment (CBS-TA) of Hönig et al. By devising the options for AGV actions and settings for standby actions, the algorithm can perform optimal motion planning for each AGV, considering its dynamic characteristics.\",\"PeriodicalId\":443572,\"journal\":{\"name\":\"2023 9th International Conference on Automation, Robotics and Applications (ICARA)\",\"volume\":\"27 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-02-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2023 9th International Conference on Automation, Robotics and Applications (ICARA)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICARA56516.2023.10125759\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2023 9th International Conference on Automation, Robotics and Applications (ICARA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICARA56516.2023.10125759","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Offline Task Assignment and Motion Planning Algorithm Considering Agent's Dynamics
The aim of this study is to develop an algorithm for task assignment and movement planning to a destination by considering the acceleration and deceleration patterns of automated guided vehicles (AGVs). In this study, we propose an algorithm for task assignment and motion planning for AGV kinematics with multiple search trees based on the conflict-based search with optimal task assignment (CBS-TA) of Hönig et al. By devising the options for AGV actions and settings for standby actions, the algorithm can perform optimal motion planning for each AGV, considering its dynamic characteristics.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
