高不确定性路由的逆向思考:多智能体网络中基于因果熵的路由

Zhonghu Xu, Kai Xing, Xuefeng Liu, Jiannong Cao
{"title":"高不确定性路由的逆向思考:多智能体网络中基于因果熵的路由","authors":"Zhonghu Xu, Kai Xing, Xuefeng Liu, Jiannong Cao","doi":"10.1109/PAC.2018.00021","DOIUrl":null,"url":null,"abstract":"This paper is motivated by the task of modeling routing decisions with sequential forwarding interactions in multi-agent networks with topology uncertainties, e.g., agents' mobility traces with uncertain speed and direction, links to someone unknown in stranger social networks, both making their interactions come across at uncertain time and location. Since most routing designs assume that agents' behaviors be regular or with known probability distribution and envision the future of topology as stable/predictable (namely limited uncertainty), these approaches may suffer the difficulty dealing with the networks with high uncertainties. The proposed research aims to provide an effective solution for message routing among agents in such networks. Specifically, we introduce a new principle of causal entropy force in multi-agent networks for routing with high uncertainties, provide a new thinking way of routing, backward thinking, and build connections between individual intelligence, topology uncertainties, and message routing through path entropy in phase space. The experiment results with real dataset (30K taxies) indicate that the proposed method could achieve 83% message delivery rate, compared with 20%-25% of traditional approaches, and generally achieve much less latency compared with typical methods.","PeriodicalId":208309,"journal":{"name":"2018 IEEE Symposium on Privacy-Aware Computing (PAC)","volume":"67 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Backward Thinking of Routing with High Uncertainties: Causal Entropy Based Routing in Multi-Agent Networks\",\"authors\":\"Zhonghu Xu, Kai Xing, Xuefeng Liu, Jiannong Cao\",\"doi\":\"10.1109/PAC.2018.00021\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper is motivated by the task of modeling routing decisions with sequential forwarding interactions in multi-agent networks with topology uncertainties, e.g., agents' mobility traces with uncertain speed and direction, links to someone unknown in stranger social networks, both making their interactions come across at uncertain time and location. Since most routing designs assume that agents' behaviors be regular or with known probability distribution and envision the future of topology as stable/predictable (namely limited uncertainty), these approaches may suffer the difficulty dealing with the networks with high uncertainties. The proposed research aims to provide an effective solution for message routing among agents in such networks. Specifically, we introduce a new principle of causal entropy force in multi-agent networks for routing with high uncertainties, provide a new thinking way of routing, backward thinking, and build connections between individual intelligence, topology uncertainties, and message routing through path entropy in phase space. The experiment results with real dataset (30K taxies) indicate that the proposed method could achieve 83% message delivery rate, compared with 20%-25% of traditional approaches, and generally achieve much less latency compared with typical methods.\",\"PeriodicalId\":208309,\"journal\":{\"name\":\"2018 IEEE Symposium on Privacy-Aware Computing (PAC)\",\"volume\":\"67 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 IEEE Symposium on Privacy-Aware Computing (PAC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/PAC.2018.00021\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 IEEE Symposium on Privacy-Aware Computing (PAC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PAC.2018.00021","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

本文的动机是对具有拓扑不确定性的多智能体网络中具有顺序转发交互的路由决策建模的任务,例如,智能体的移动轨迹具有不确定的速度和方向,链接到陌生人社交网络中未知的人,这些都使得它们的交互在不确定的时间和位置发生。由于大多数路由设计假设智能体的行为是规则的或具有已知的概率分布,并将拓扑的未来设想为稳定/可预测的(即有限的不确定性),因此这些方法可能在处理具有高不确定性的网络时遇到困难。本研究旨在为此类网络中代理之间的消息路由提供一种有效的解决方案。具体来说,我们在高不确定性路由的多智能体网络中引入了新的因果熵力原理,提供了一种新的路由思维方式,即逆向思维,并通过相空间中的路径熵建立了个体智能、拓扑不确定性和消息路由之间的联系。真实数据集(30K辆出租车)的实验结果表明,与传统方法的20%-25%相比,该方法可以达到83%的消息传递率,并且与典型方法相比,通常可以实现更小的延迟。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Backward Thinking of Routing with High Uncertainties: Causal Entropy Based Routing in Multi-Agent Networks
This paper is motivated by the task of modeling routing decisions with sequential forwarding interactions in multi-agent networks with topology uncertainties, e.g., agents' mobility traces with uncertain speed and direction, links to someone unknown in stranger social networks, both making their interactions come across at uncertain time and location. Since most routing designs assume that agents' behaviors be regular or with known probability distribution and envision the future of topology as stable/predictable (namely limited uncertainty), these approaches may suffer the difficulty dealing with the networks with high uncertainties. The proposed research aims to provide an effective solution for message routing among agents in such networks. Specifically, we introduce a new principle of causal entropy force in multi-agent networks for routing with high uncertainties, provide a new thinking way of routing, backward thinking, and build connections between individual intelligence, topology uncertainties, and message routing through path entropy in phase space. The experiment results with real dataset (30K taxies) indicate that the proposed method could achieve 83% message delivery rate, compared with 20%-25% of traditional approaches, and generally achieve much less latency compared with typical methods.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信