z-logo
open-access-imgOpen Access
Algorithm design and analysis of fire rescue problems
Author(s) -
Mengshuang Fu
Publication year - 2021
Publication title -
journal of physics. conference series
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.21
H-Index - 85
eISSN - 1742-6596
pISSN - 1742-6588
DOI - 10.1088/1742-6596/2083/3/032043
Subject(s) - fire brigade , safeguarding , patrolling , firefighting , emergency rescue , computer security , rescue robot , computer science , alarm , operations research , engineering , aeronautics , political science , geography , medical emergency , law , artificial intelligence , robot , aerospace engineering , medicine , cartography , nursing , mobile robot
With the rapid economic development, the urban space environment is becoming more and more complex, various accidents and disasters occur frequently, and safety risks are increasing. The rescue tasks involved in the fire brigade are showing a trend of diversification and complexity. The fire rescue team always puts the people first and insists on serving the people wholeheartedly. It is the guardian of maintaining social stability in our country and safeguarding the health and safety of people’s lives and property and various disaster affairs. The society needs the participation in the fire rescue team. Aiming at the fire rescue problem, this paper uses the fire rescue call data onto 2016 to 2019 to predict the number of fire rescues / rescued calls based on the difference equation to improve the rescue efficiency of the fire brigade. Taking into account the impact on the domestic epidemiced in 2020 on people’s lives, the adjustment value was introduced to adjust part of the alarm data onto 2020 to ensure the accuracy and reliability of the data. Finally, the second-order difference equation is used to predict the alarm data onto 2021 through the least square method, which verifies the accuracy of the model.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here