基于改进蚁群算法的公共建筑空间层次优化路径优化方法

Zeng Guo, Jiaying Zhu
{"title":"基于改进蚁群算法的公共建筑空间层次优化路径优化方法","authors":"Zeng Guo, Jiaying Zhu","doi":"10.1109/PHM-Yantai55411.2022.9941767","DOIUrl":null,"url":null,"abstract":"Aiming at the problem of indoor optimal path planning, based on the hierarchical characteristics of public building space, a hierarchical optimal path optimization method for public building space based on improved ant colony algorithm is proposed, and the indoor hierarchical optimal path algorithm is implemented. The algorithm regards the road network and floor connections of each floor as an independent structure, and dynamically constructs a structured network model spanning two floors on a floor-by-floor basis according to the floor distribution of the stops. The proposed method uses the network model to analyze the path across floors, thereby obtaining the optimal path traversing all stops in the public building space. The experimental results show that compared with the traditional optimal path algorithm, the time efficiency of this algorithm is significantly improved when the path planning results are more reasonable.","PeriodicalId":315994,"journal":{"name":"2022 Global Reliability and Prognostics and Health Management (PHM-Yantai)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Hierarchical Optimal Path Optimization Method for Public Building Space Based on Improved Ant Colony Algorithm\",\"authors\":\"Zeng Guo, Jiaying Zhu\",\"doi\":\"10.1109/PHM-Yantai55411.2022.9941767\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Aiming at the problem of indoor optimal path planning, based on the hierarchical characteristics of public building space, a hierarchical optimal path optimization method for public building space based on improved ant colony algorithm is proposed, and the indoor hierarchical optimal path algorithm is implemented. The algorithm regards the road network and floor connections of each floor as an independent structure, and dynamically constructs a structured network model spanning two floors on a floor-by-floor basis according to the floor distribution of the stops. The proposed method uses the network model to analyze the path across floors, thereby obtaining the optimal path traversing all stops in the public building space. The experimental results show that compared with the traditional optimal path algorithm, the time efficiency of this algorithm is significantly improved when the path planning results are more reasonable.\",\"PeriodicalId\":315994,\"journal\":{\"name\":\"2022 Global Reliability and Prognostics and Health Management (PHM-Yantai)\",\"volume\":\"24 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-10-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2022 Global Reliability and Prognostics and Health Management (PHM-Yantai)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/PHM-Yantai55411.2022.9941767\",\"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 Global Reliability and Prognostics and Health Management (PHM-Yantai)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PHM-Yantai55411.2022.9941767","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

针对室内最优路径规划问题,基于公共建筑空间的层次性特点,提出了一种基于改进蚁群算法的公共建筑空间分层最优路径优化方法,并实现了室内分层最优路径算法。该算法将每一层的路网和楼层连接视为一个独立的结构,根据车站的楼层分布,逐层动态构建一个跨越两层的结构化网络模型。该方法利用网络模型对各楼层的路径进行分析,从而得到公共建筑空间中穿越各站点的最优路径。实验结果表明,与传统的最优路径算法相比,当路径规划结果更加合理时,该算法的时间效率显著提高。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Hierarchical Optimal Path Optimization Method for Public Building Space Based on Improved Ant Colony Algorithm
Aiming at the problem of indoor optimal path planning, based on the hierarchical characteristics of public building space, a hierarchical optimal path optimization method for public building space based on improved ant colony algorithm is proposed, and the indoor hierarchical optimal path algorithm is implemented. The algorithm regards the road network and floor connections of each floor as an independent structure, and dynamically constructs a structured network model spanning two floors on a floor-by-floor basis according to the floor distribution of the stops. The proposed method uses the network model to analyze the path across floors, thereby obtaining the optimal path traversing all stops in the public building space. The experimental results show that compared with the traditional optimal path algorithm, the time efficiency of this algorithm is significantly improved when the path planning results are more reasonable.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Abnormal Data Detection Method of Web Database Based on Improved K-Means Algorithm Research on Quantitative Monitoring Method of Milling Tool Wear Condition Based on Multi-Source Data Feature Learning and Extraction Simulation of seasonal variation characteristics of offshore water temperature based on ROMS model Research On Data Mining Of Elderly Inpatients With Chronic Diseases In Panxi Area Badminton Trajectory Accurate Tracking and Positioning Method Based on Machine Vision
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1