Sharma Vishal, Nagpal Deepali, Monga Suhasini, Almogren Ahmad, Srivastava Durgesh, Altameem Ayman, Choi Jaeyoung
Chitkara University Institute of Engineering and Technology, Chitkara University, Rajpura, Punjab, India.
Department of Computer Science, College of Computer and Information Sciences, King Saud University, 11633, Riyadh, Saudi Arabia.
Sci Rep. 2024 Aug 29;14(1):20091. doi: 10.1038/s41598-024-71052-8.
Forest fires are the source of countless fatalities and extreme economic repercussions. The safe evacuation of residents of an area affected by forest fires is the highest priority of local authorities, and finding the most optimal course of action has been a primary research focus for years. Previous studies over several decades have attempted to find an optimal solution using the applications of bug navigation systems, road network reconfiguration, graph traversals, swarm optimization, etc. The author, with the motivation to prevent human casualties at the time of such calamity, presents a novel study which solves the problem in nearly linear time computation, surpassing the performance standards of previous research, and accommodates the unpredictability of the spread of forest fires. This includes a proposal of an algorithm which builds upon the application of Spielman and Teng's Electrical Circuit Approach to solve for maximum flow in a network and implements this with real-time sensor and Global Positioning System input.
森林火灾会造成无数人员伤亡和极其严重的经济影响。森林火灾受灾地区居民的安全疏散是地方当局的首要任务,多年来,寻找最优行动方案一直是主要研究重点。过去几十年的研究试图通过应用昆虫导航系统、道路网络重新配置、图遍历、群体优化等方法找到最优解。作者出于在这类灾难发生时防止人员伤亡的动机,提出了一项新颖的研究,该研究在近线性时间计算中解决了问题,超越了先前研究的性能标准,并适应了森林火灾蔓延的不可预测性。这包括提出一种算法,该算法基于斯皮尔曼和滕的电路方法来求解网络中的最大流,并通过实时传感器和全球定位系统输入来实现。