{"title":"非完整移动机器人的多机器人混合","authors":"Y. Diaz-Mercado, M. Egerstedt","doi":"10.1109/CCA.2014.6981399","DOIUrl":null,"url":null,"abstract":"In this paper we investigate how much “mixing” one can impose on a team of nonholonomic unicycle robots. This notion is encoded through braids, and a controller is proposed that executes the braids while ensuring that the team is collision-free. Mixing bounds, the bounds on the amount of mixing possible under this braid controller, are also provided. Results are validated when they are implemented on a team of mobile robots which are cooperatively achieving desired mixing levels.","PeriodicalId":205599,"journal":{"name":"2014 IEEE Conference on Control Applications (CCA)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Multi-robot mixing of nonholonomic mobile robots\",\"authors\":\"Y. Diaz-Mercado, M. Egerstedt\",\"doi\":\"10.1109/CCA.2014.6981399\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper we investigate how much “mixing” one can impose on a team of nonholonomic unicycle robots. This notion is encoded through braids, and a controller is proposed that executes the braids while ensuring that the team is collision-free. Mixing bounds, the bounds on the amount of mixing possible under this braid controller, are also provided. Results are validated when they are implemented on a team of mobile robots which are cooperatively achieving desired mixing levels.\",\"PeriodicalId\":205599,\"journal\":{\"name\":\"2014 IEEE Conference on Control Applications (CCA)\",\"volume\":\"19 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-12-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 IEEE Conference on Control Applications (CCA)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CCA.2014.6981399\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 IEEE Conference on Control Applications (CCA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CCA.2014.6981399","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
In this paper we investigate how much “mixing” one can impose on a team of nonholonomic unicycle robots. This notion is encoded through braids, and a controller is proposed that executes the braids while ensuring that the team is collision-free. Mixing bounds, the bounds on the amount of mixing possible under this braid controller, are also provided. Results are validated when they are implemented on a team of mobile robots which are cooperatively achieving desired mixing levels.