Andrea Maybell Peña, Miguel Zea, Luis Alberto Rivera
{"title":"多智能体机器人系统同步与控制任务的平面张力函数和最小刚性图","authors":"Andrea Maybell Peña, Miguel Zea, Luis Alberto Rivera","doi":"10.1109/CONCAPAN48024.2022.9997593","DOIUrl":null,"url":null,"abstract":"This work focuses on the development of a synchronization and formation control method for multi-agent systems. The method is based on a modified consensus equation, the implementation of minimally rigid graphs and the use of flat tension functions. The goal is to bring a group of agents to a certain formation, and then lead them to a common goal, while avoiding obstacles. The use of minimally rigid graphs makes obstacle avoidance easier, compared to using totally rigid graphs, given the looser constraints for the swarms of robots. Using flat tension functions helps dealing with issues that minimally rigid graphs may present due to the lack of edges in the graphs. As a consequence, agents will keep the formation as closely as possible in the absence of obstacles, and they will adjust their positions and even switch formation if needed, when obstacles are present.","PeriodicalId":138415,"journal":{"name":"2022 IEEE 40th Central America and Panama Convention (CONCAPAN)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-11-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Flat Tension Functions and Minimally Rigid Graphs for Tasks of Synchronization and Control of Multi-Agent Robotic Systems\",\"authors\":\"Andrea Maybell Peña, Miguel Zea, Luis Alberto Rivera\",\"doi\":\"10.1109/CONCAPAN48024.2022.9997593\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This work focuses on the development of a synchronization and formation control method for multi-agent systems. The method is based on a modified consensus equation, the implementation of minimally rigid graphs and the use of flat tension functions. The goal is to bring a group of agents to a certain formation, and then lead them to a common goal, while avoiding obstacles. The use of minimally rigid graphs makes obstacle avoidance easier, compared to using totally rigid graphs, given the looser constraints for the swarms of robots. Using flat tension functions helps dealing with issues that minimally rigid graphs may present due to the lack of edges in the graphs. As a consequence, agents will keep the formation as closely as possible in the absence of obstacles, and they will adjust their positions and even switch formation if needed, when obstacles are present.\",\"PeriodicalId\":138415,\"journal\":{\"name\":\"2022 IEEE 40th Central America and Panama Convention (CONCAPAN)\",\"volume\":\"15 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-11-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2022 IEEE 40th Central America and Panama Convention (CONCAPAN)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CONCAPAN48024.2022.9997593\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 IEEE 40th Central America and Panama Convention (CONCAPAN)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CONCAPAN48024.2022.9997593","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Flat Tension Functions and Minimally Rigid Graphs for Tasks of Synchronization and Control of Multi-Agent Robotic Systems
This work focuses on the development of a synchronization and formation control method for multi-agent systems. The method is based on a modified consensus equation, the implementation of minimally rigid graphs and the use of flat tension functions. The goal is to bring a group of agents to a certain formation, and then lead them to a common goal, while avoiding obstacles. The use of minimally rigid graphs makes obstacle avoidance easier, compared to using totally rigid graphs, given the looser constraints for the swarms of robots. Using flat tension functions helps dealing with issues that minimally rigid graphs may present due to the lack of edges in the graphs. As a consequence, agents will keep the formation as closely as possible in the absence of obstacles, and they will adjust their positions and even switch formation if needed, when obstacles are present.