agent与环境交互作用下交通网络的自主过渡

2005 International Symposium on Computational Intelligence in Robotics and Automation Pub Date : 2005-06-27 DOI:10.1109/CIRA.2005.1554284

K. Daisuke, U. Katsunori, F. Tetsuro

{"title":"agent与环境交互作用下交通网络的自主过渡","authors":"K. Daisuke, U. Katsunori, F. Tetsuro","doi":"10.1109/CIRA.2005.1554284","DOIUrl":null,"url":null,"abstract":"We have formulated and examined an autonomous organization system for transportation network system. In this paper, we have considered costs not only to traverse but also to maintain some routes on a transportation network. The results say that the proposed algorithm changes a transportation algorithm, into a feasible topology that has the smallest cost to traverse and the property of the small-world network.","PeriodicalId":162553,"journal":{"name":"2005 International Symposium on Computational Intelligence in Robotics and Automation","volume":"37 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Autonomous transition of transportation network by interactions between agents and an environment\",\"authors\":\"K. Daisuke, U. Katsunori, F. Tetsuro\",\"doi\":\"10.1109/CIRA.2005.1554284\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We have formulated and examined an autonomous organization system for transportation network system. In this paper, we have considered costs not only to traverse but also to maintain some routes on a transportation network. The results say that the proposed algorithm changes a transportation algorithm, into a feasible topology that has the smallest cost to traverse and the property of the small-world network.\",\"PeriodicalId\":162553,\"journal\":{\"name\":\"2005 International Symposium on Computational Intelligence in Robotics and Automation\",\"volume\":\"37 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2005-06-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2005 International Symposium on Computational Intelligence in Robotics and Automation\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CIRA.2005.1554284\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2005 International Symposium on Computational Intelligence in Robotics and Automation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CIRA.2005.1554284","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 2

摘要

制定并研究了交通网络系统自治组织体系。在本文中，我们不仅考虑了交通网络中某些路线的穿越成本，而且考虑了维护成本。结果表明，该算法将传输算法转化为具有最小遍历代价和小世界网络特性的可行拓扑。

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

查看原文本刊更多论文

Autonomous transition of transportation network by interactions between agents and an environment

We have formulated and examined an autonomous organization system for transportation network system. In this paper, we have considered costs not only to traverse but also to maintain some routes on a transportation network. The results say that the proposed algorithm changes a transportation algorithm, into a feasible topology that has the smallest cost to traverse and the property of the small-world network.

求助全文

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

来源期刊

2005 International Symposium on Computational Intelligence in Robotics and Automation

自引率

0.00%

发文量