Q-learning 方法在灾害疏散路线设计中的应用案例研究:UNNES 数字中心大楼

Hanan Iqbal Alrahma, Anan Nugroho, A. F. Hastawan, U. Arief
{"title":"Q-learning 方法在灾害疏散路线设计中的应用案例研究:UNNES 数字中心大楼","authors":"Hanan Iqbal Alrahma, Anan Nugroho, A. F. Hastawan, U. Arief","doi":"10.21609/jiki.v17i2.1236","DOIUrl":null,"url":null,"abstract":"The Digital Center (DC) building at UNNES is a new building on the campus that currently lacks evacuation routes. Therefore, it is necessary to create an evacuation route plan in accordance with the Minister of Health Regulation Number 48 of 2016. Creating a manual evacuation route plan can be inefficient and prone to errors, especially for large buildings with complex interiors. To address this issue, learning techniques such as reinforcement learning (RL) are being used. In this study, Q-learning will be utilized to find the shortest path to the exit doors from 11 rooms on the first floor of the DC building. The study makes use of the floor plan data of the DC building, information about the location of the exit doors, and the distance required to reach them. The results of the study demonstrate that Qlearning successfully identifies the shortest evacuation routes for the first-floor DC building. The routes generated by Q-learning are identical to the manually created shortest paths. Even when additional obstacles are introduced into the environment, Q-learning is still able to find the shortest routes. On average, the number of episodes required for convergence in both environments is less than 1000 episodes, and the average computation time needed for both environments is 0.54 seconds and 0.76 seconds, respectively.","PeriodicalId":31392,"journal":{"name":"Jurnal Ilmu Komputer dan Informasi","volume":"17 2","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-06-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Application of Q-learning Method for Disaster Evacuation Route Design Case Study: Digital Center Building UNNES\",\"authors\":\"Hanan Iqbal Alrahma, Anan Nugroho, A. F. Hastawan, U. Arief\",\"doi\":\"10.21609/jiki.v17i2.1236\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The Digital Center (DC) building at UNNES is a new building on the campus that currently lacks evacuation routes. Therefore, it is necessary to create an evacuation route plan in accordance with the Minister of Health Regulation Number 48 of 2016. Creating a manual evacuation route plan can be inefficient and prone to errors, especially for large buildings with complex interiors. To address this issue, learning techniques such as reinforcement learning (RL) are being used. In this study, Q-learning will be utilized to find the shortest path to the exit doors from 11 rooms on the first floor of the DC building. The study makes use of the floor plan data of the DC building, information about the location of the exit doors, and the distance required to reach them. The results of the study demonstrate that Qlearning successfully identifies the shortest evacuation routes for the first-floor DC building. The routes generated by Q-learning are identical to the manually created shortest paths. Even when additional obstacles are introduced into the environment, Q-learning is still able to find the shortest routes. On average, the number of episodes required for convergence in both environments is less than 1000 episodes, and the average computation time needed for both environments is 0.54 seconds and 0.76 seconds, respectively.\",\"PeriodicalId\":31392,\"journal\":{\"name\":\"Jurnal Ilmu Komputer dan Informasi\",\"volume\":\"17 2\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-06-03\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Jurnal Ilmu Komputer dan Informasi\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.21609/jiki.v17i2.1236\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Jurnal Ilmu Komputer dan Informasi","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.21609/jiki.v17i2.1236","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

UNNES 的数字中心(DC)大楼是校园中的一座新建筑,目前缺乏疏散路线。因此,有必要根据卫生部 2016 年第 48 号条例制定疏散路线计划。手动创建疏散路线计划可能会效率低下且容易出错,尤其是对于内部结构复杂的大型建筑而言。为解决这一问题,人们正在使用强化学习(RL)等学习技术。在本研究中,将利用 Q-learning 来寻找从 DC 大楼一楼 11 个房间到出口门的最短路径。这项研究利用了区委大楼的平面图数据、出口门的位置信息以及到达出口门所需的距离。研究结果表明,Q-learning 能成功识别出 DC 大楼一楼的最短疏散路线。Q-learning 生成的路线与人工创建的最短路径完全相同。即使在环境中引入额外的障碍物,Q-learning 仍然能够找到最短的路线。平均而言,两种环境下收敛所需的集数都少于 1000 集,两种环境下所需的平均计算时间分别为 0.54 秒和 0.76 秒。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Application of Q-learning Method for Disaster Evacuation Route Design Case Study: Digital Center Building UNNES
The Digital Center (DC) building at UNNES is a new building on the campus that currently lacks evacuation routes. Therefore, it is necessary to create an evacuation route plan in accordance with the Minister of Health Regulation Number 48 of 2016. Creating a manual evacuation route plan can be inefficient and prone to errors, especially for large buildings with complex interiors. To address this issue, learning techniques such as reinforcement learning (RL) are being used. In this study, Q-learning will be utilized to find the shortest path to the exit doors from 11 rooms on the first floor of the DC building. The study makes use of the floor plan data of the DC building, information about the location of the exit doors, and the distance required to reach them. The results of the study demonstrate that Qlearning successfully identifies the shortest evacuation routes for the first-floor DC building. The routes generated by Q-learning are identical to the manually created shortest paths. Even when additional obstacles are introduced into the environment, Q-learning is still able to find the shortest routes. On average, the number of episodes required for convergence in both environments is less than 1000 episodes, and the average computation time needed for both environments is 0.54 seconds and 0.76 seconds, respectively.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
审稿时长
4 weeks
×
引用
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学术官方微信