{"title":"Target assignment strategy for scattered robots building formation","authors":"W. Kowalczyk","doi":"10.1109/ROMOCO.2002.1177105","DOIUrl":null,"url":null,"abstract":"Presents a target assignment strategy for multiple robots that are scattered in the environment and they are expected to build an ordered formation. The described approach is general and can be used together with a variety of trajectory planning methods. The presented approach produces some constraints for trajectories generation, however, in most cases the constraints can be easily satisfied. Simulation results for Hilare-type holonomic robots are presented. The possibility of use for a group of nonholonomic mobile robots is also discussed.","PeriodicalId":213750,"journal":{"name":"Proceedings of the Third International Workshop on Robot Motion and Control, 2002. RoMoCo '02.","volume":"117 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2002-11-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"15","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the Third International Workshop on Robot Motion and Control, 2002. RoMoCo '02.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ROMOCO.2002.1177105","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 15
Abstract
Presents a target assignment strategy for multiple robots that are scattered in the environment and they are expected to build an ordered formation. The described approach is general and can be used together with a variety of trajectory planning methods. The presented approach produces some constraints for trajectories generation, however, in most cases the constraints can be easily satisfied. Simulation results for Hilare-type holonomic robots are presented. The possibility of use for a group of nonholonomic mobile robots is also discussed.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
