多机器人交通控制的混合自治协调方法

Aditya Teja, D. Viswanath, K. Krishna
{"title":"多机器人交通控制的混合自治协调方法","authors":"Aditya Teja, D. Viswanath, K. Krishna","doi":"10.1109/ROBIO.2009.4913183","DOIUrl":null,"url":null,"abstract":"We present a method for coordinating multir-obotic/multi-agent traffic control at intersections. The robotic agents (RA) move guided by a potential field along the lanes. At the intersections an intersection agent (IA) controls the flow of traffic by assigning priorities to the agents that are about to enter the intersection. The priorities are computed based on the density of RA in a lane and the flow rate of traffic in those lanes. The RAs integrate these assigned priorities into their potential field computations. The modified potential field computations help the RAs to move through the intersection avoiding collisions. An elegant mixed autonomy scheme is thereby achieved where the IAs decide upon the priorities at the intersection while the low level collision avoidance maneuvers are left with the individual RAs. This scheme preserves the distributed nature and the autonomy of potential field maneuvers while simultaneously balancing the computation load between the IA and RAs. We compare this method with a method where the RAs navigate the intersection without a superior direction from the IAs through priorities or when IAs direct the RAs based on priorities computed on a first come first served basis. We show performance gain over both these methods in simulations.","PeriodicalId":321332,"journal":{"name":"2008 IEEE International Conference on Robotics and Biomimetics","volume":"24 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-02-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"A mixed autonomy coordination methodology for multi-robotic traffic control\",\"authors\":\"Aditya Teja, D. Viswanath, K. Krishna\",\"doi\":\"10.1109/ROBIO.2009.4913183\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We present a method for coordinating multir-obotic/multi-agent traffic control at intersections. The robotic agents (RA) move guided by a potential field along the lanes. At the intersections an intersection agent (IA) controls the flow of traffic by assigning priorities to the agents that are about to enter the intersection. The priorities are computed based on the density of RA in a lane and the flow rate of traffic in those lanes. The RAs integrate these assigned priorities into their potential field computations. The modified potential field computations help the RAs to move through the intersection avoiding collisions. An elegant mixed autonomy scheme is thereby achieved where the IAs decide upon the priorities at the intersection while the low level collision avoidance maneuvers are left with the individual RAs. This scheme preserves the distributed nature and the autonomy of potential field maneuvers while simultaneously balancing the computation load between the IA and RAs. We compare this method with a method where the RAs navigate the intersection without a superior direction from the IAs through priorities or when IAs direct the RAs based on priorities computed on a first come first served basis. We show performance gain over both these methods in simulations.\",\"PeriodicalId\":321332,\"journal\":{\"name\":\"2008 IEEE International Conference on Robotics and Biomimetics\",\"volume\":\"24 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-02-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 IEEE International Conference on Robotics and Biomimetics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ROBIO.2009.4913183\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 IEEE International Conference on Robotics and Biomimetics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ROBIO.2009.4913183","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

摘要

提出了一种多机器人/多智能体交叉口交通控制协调方法。机器人代理(RA)在一个势场的引导下沿着车道移动。在十字路口,十字路口代理(IA)通过为即将进入十字路口的代理分配优先级来控制交通流量。优先级是根据车道上RA的密度和该车道上的交通流量计算的。RAs将这些分配的优先级集成到它们的势场计算中。修正的势场计算有助于ra通过交叉口,避免碰撞。这样就实现了一种优雅的混合自治方案,其中IAs决定交叉口的优先级,而低级的避碰机动留给各个ra。该方案保留了势场机动的分布式特性和自主性,同时平衡了势场机动和势场机动之间的计算负荷。我们将这种方法与另一种方法进行比较,在这种方法中,RAs在没有从IAs通过优先级的优越方向的情况下导航交叉点,或者IAs根据先到先服务的基础计算的优先级来指导ra。我们在模拟中展示了这两种方法的性能增益。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A mixed autonomy coordination methodology for multi-robotic traffic control
We present a method for coordinating multir-obotic/multi-agent traffic control at intersections. The robotic agents (RA) move guided by a potential field along the lanes. At the intersections an intersection agent (IA) controls the flow of traffic by assigning priorities to the agents that are about to enter the intersection. The priorities are computed based on the density of RA in a lane and the flow rate of traffic in those lanes. The RAs integrate these assigned priorities into their potential field computations. The modified potential field computations help the RAs to move through the intersection avoiding collisions. An elegant mixed autonomy scheme is thereby achieved where the IAs decide upon the priorities at the intersection while the low level collision avoidance maneuvers are left with the individual RAs. This scheme preserves the distributed nature and the autonomy of potential field maneuvers while simultaneously balancing the computation load between the IA and RAs. We compare this method with a method where the RAs navigate the intersection without a superior direction from the IAs through priorities or when IAs direct the RAs based on priorities computed on a first come first served basis. We show performance gain over both these methods in simulations.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信