K. Harada, Tokuo Tsuji, K. Kikuchi, K. Nagata, H. Onda, Y. Kawai
{"title":"执行一系列取放任务的双臂移动机械臂基座位置规划","authors":"K. Harada, Tokuo Tsuji, K. Kikuchi, K. Nagata, H. Onda, Y. Kawai","doi":"10.1109/HUMANOIDS.2015.7363551","DOIUrl":null,"url":null,"abstract":"In this study, we plan a sequence of the base position for dual-arm mobile manipulators performing multiple pick-and-place tasks. By using our proposed method, the robot can selectively use either the right or the left hand to pick up an object and can minimize the sequence size of the base position needed to performed the given task. We first formulate a quadratic programming (QP) problem to solve the inverse kinematics by considering robot collision. We then formulate a region on the base position where a robot can pick up an object placed anywhere in a box. A sequence of base positions is then obtained by combining the branch and bound (BB) and simulated annealing (SA) methods. We present the numerical calculation results to demonstrate the effectiveness of our proposed method.","PeriodicalId":417686,"journal":{"name":"2015 IEEE-RAS 15th International Conference on Humanoid Robots (Humanoids)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"14","resultStr":"{\"title\":\"Base position planning for dual-arm mobile manipulators performing a sequence of pick-and-place tasks\",\"authors\":\"K. Harada, Tokuo Tsuji, K. Kikuchi, K. Nagata, H. Onda, Y. Kawai\",\"doi\":\"10.1109/HUMANOIDS.2015.7363551\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this study, we plan a sequence of the base position for dual-arm mobile manipulators performing multiple pick-and-place tasks. By using our proposed method, the robot can selectively use either the right or the left hand to pick up an object and can minimize the sequence size of the base position needed to performed the given task. We first formulate a quadratic programming (QP) problem to solve the inverse kinematics by considering robot collision. We then formulate a region on the base position where a robot can pick up an object placed anywhere in a box. A sequence of base positions is then obtained by combining the branch and bound (BB) and simulated annealing (SA) methods. We present the numerical calculation results to demonstrate the effectiveness of our proposed method.\",\"PeriodicalId\":417686,\"journal\":{\"name\":\"2015 IEEE-RAS 15th International Conference on Humanoid Robots (Humanoids)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-12-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"14\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 IEEE-RAS 15th International Conference on Humanoid Robots (Humanoids)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/HUMANOIDS.2015.7363551\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 IEEE-RAS 15th International Conference on Humanoid Robots (Humanoids)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/HUMANOIDS.2015.7363551","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Base position planning for dual-arm mobile manipulators performing a sequence of pick-and-place tasks
In this study, we plan a sequence of the base position for dual-arm mobile manipulators performing multiple pick-and-place tasks. By using our proposed method, the robot can selectively use either the right or the left hand to pick up an object and can minimize the sequence size of the base position needed to performed the given task. We first formulate a quadratic programming (QP) problem to solve the inverse kinematics by considering robot collision. We then formulate a region on the base position where a robot can pick up an object placed anywhere in a box. A sequence of base positions is then obtained by combining the branch and bound (BB) and simulated annealing (SA) methods. We present the numerical calculation results to demonstrate the effectiveness of our proposed method.