在动态犯罪场景中解决运输网络上的Stackelberg游戏:多层网络上的混合方法
Solving a Stackelberg Game on Transportation Networks in a Dynamic Crime Scenario: A Mixed Approach on Multi-Layer Networks
AI总结:
本文提出一种混合方法,利用多层网络模型解决动态犯罪场景中的Stackelberg游戏问题,通过Dijkstra算法和近似算法优化拦截策略,提升计算效率和解的质量。
摘要:
在有限警察资源下拦截移动犯罪者是一项挑战,因为犯罪者会随时间改变位置。大型运输网络进一步增加了这一场景的难度。为此,我们考虑分层图的概念。在每个时间戳,我们创建整个运输网络的副本以跟踪攻击者和防御者可能的移动。我们考虑一个动态犯罪场景中的Stackelberg游戏,其中攻击者随时间改变位置,而防御者试图在其逃亡路线中拦截攻击者。给定一组防御策略,攻击者的最优策略通过在分层网络上应用Dijkstra算法确定。这里,攻击者旨在最小化被拦截的概率,而防御者旨在最大化拦截概率。我们开发了一种近似算法来在分层网络上找到近优策略。所提出方法的有效性与采用的MILP方法进行比较。在计算时间和解质量方面比较结果。结果质量证明了所提出方法的必要性,因为它能够在短时间内有效解决复杂问题。
英文摘要:
Interdicting a criminal with limited police resources is a challenging task as the criminal changes location over time. The size of the large transportation network further adds to the difficulty of this scenario. To tackle this issue, we consider the concept of a layered graph. At each time stamp, we create a copy of the entire transportation network to track the possible movements of both players, the attacker and the defenders. We consider a Stackelberg game in a dynamic crime scenario where the attacker changes location over time while the defenders attempt to interdict the attacker on his escape route. Given a set of defender strategies, the optimal attacker strategy is determined by applying Dijkstra's algorithm on the layered networks. Here, the attacker aims to minimize while the defenders aim to maximize the probability of interdiction. We develop an approximation algorithm on the layered networks to find near-optimal strategy for defenders. The efficacy of the developed approach is compared with the adopted MILP approach. We compare the results in terms of computational time and solution quality. The quality of the results demonstrates the need for the developed approach, as it effectively solves the complex problem within a short amount of time.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。