arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2001.07362cs.AI
收藏

智能互联社区应急响应系统中的决策程序

On Algorithmic Decision Procedures in Emergency Response Systems in Smart and Connected Communities

Vanderbilt University(范德堡大学);Stanford University(斯坦福大学);Washington University(华盛顿大学)

Geoffrey Pettet, Ayan Mukhopadhyay, Mykel Kochenderfer, Yevgeniy Vorobeychik, Abhishek Dubey

摘要:

应急响应管理(ERM)是全球社区面临的一个关键问题。尽管如此,在现实世界中,机构风险管理系统遵循短视的决策政策是很常见的。在不确定性条件下帮助机构风险管理决策的原则性方法已经被探索过,但未能被实际系统所接受。我们确定了一个关键的问题,阻碍他们采用-算法的方法,以应急响应的反应,事件后的调度行动,即最佳调度响应\textit{after}事件发生。然而,紧急响应的关键性质决定了当事件发生时,第一响应者总是派遣最近的可用响应者到事件。我们认为,企业风险管理系统的规划的关键时期不是事件后,但事件之间。这不是一个微不足道的规划问题-动态平衡响应者的空间分布的主要挑战是问题的复杂性。ERM系统中的一个正交问题是有限通信下的规划,这在影响通信网络的灾难场景中尤为重要。我们解决这两个问题,提出了两个部分分散的多智能体规划算法,利用物流和利用结构的调度问题。我们评估我们提出的方法,使用真实世界的数据,并发现,在几种情况下,动态重新平衡的空间分布的应急响应人员减少了平均响应时间,以及它的方差。

英文摘要:

Emergency Response Management (ERM) is a critical problem faced by communities across the globe. Despite this, it is common for ERM systems to follow myopic decision policies in the real world. Principled approaches to aid ERM decision-making under uncertainty have been explored but have failed to be accepted into real systems. We identify a key issue impeding their adoption --- algorithmic approaches to emergency response focus on reactive, post-incident dispatching actions, i.e. optimally dispatching a responder \textit{after} incidents occur. However, the critical nature of emergency response dictates that when an incident occurs, first responders always dispatch the closest available responder to the incident. We argue that the crucial period of planning for ERM systems is not post-incident, but between incidents. This is not a trivial planning problem --- a major challenge with dynamically balancing the spatial distribution of responders is the complexity of the problem. An orthogonal problem in ERM systems is planning under limited communication, which is particularly important in disaster scenarios that affect communication networks. We address both problems by proposing two partially decentralized multi-agent planning algorithms that utilize heuristics and exploit the structure of the dispatch problem. We evaluate our proposed approach using real-world data, and find that in several contexts, dynamic re-balancing the spatial distribution of emergency responders reduces both the average response time as well as its variance.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑