关于用二进制信息部署运动学代理的注释

IEEE Conference on Decision and Control and European Control Conference Pub Date : 2011-12-01 DOI:10.1109/CDC.2011.6160576

C. D. Persis, M. Cao, F. Ceragioli

{"title":"关于用二进制信息部署运动学代理的注释","authors":"C. D. Persis, M. Cao, F. Ceragioli","doi":"10.1109/CDC.2011.6160576","DOIUrl":null,"url":null,"abstract":"The problem of deploying continuous-time kinematic agents on a line is considered. To achieve the prescribed formation each agent uses a binary information, namely whether the distance of the agent from a neighbor is below or above the prescribed inter-agent distance. A simple control law which achieves and maintains the formation despite the coarse information available is designed.","PeriodicalId":360068,"journal":{"name":"IEEE Conference on Decision and Control and European Control Conference","volume":"51 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":"{\"title\":\"A note on the deployment of kinematic agents by binary information\",\"authors\":\"C. D. Persis, M. Cao, F. Ceragioli\",\"doi\":\"10.1109/CDC.2011.6160576\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The problem of deploying continuous-time kinematic agents on a line is considered. To achieve the prescribed formation each agent uses a binary information, namely whether the distance of the agent from a neighbor is below or above the prescribed inter-agent distance. A simple control law which achieves and maintains the formation despite the coarse information available is designed.\",\"PeriodicalId\":360068,\"journal\":{\"name\":\"IEEE Conference on Decision and Control and European Control Conference\",\"volume\":\"51 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"8\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE Conference on Decision and Control and European Control Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CDC.2011.6160576\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Conference on Decision and Control and European Control Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CDC.2011.6160576","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 8

摘要

研究了在直线上部署连续时间运动智能体的问题。为了达到规定的队形，每个agent使用一个二进制信息，即agent到邻居的距离是小于还是大于规定的agent间距离。设计了一种简单的控制律，在粗糙信息条件下实现并保持编队。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

A note on the deployment of kinematic agents by binary information

The problem of deploying continuous-time kinematic agents on a line is considered. To achieve the prescribed formation each agent uses a binary information, namely whether the distance of the agent from a neighbor is below or above the prescribed inter-agent distance. A simple control law which achieves and maintains the formation despite the coarse information available is designed.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

IEEE Conference on Decision and Control and European Control Conference

自引率

0.00%

发文量