arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1207.0867cs.LOcs.FL
收藏

安全对策的稀疏位置策略

Sparse Positional Strategies for Safety Games

Rüdiger Ehlers, Daniela Moldovan

摘要:

我们考虑安全对策的稀疏位置策略的获得问题。这种游戏是许多形式化方法中常用的模型,因为它们使系统与其环境的交互显式化。通常,其中一个玩家的获胜策略被用作证书或作为应用程序中进一步处理的人工制品。小型的此类证书,即,可以非常紧凑地写下的策略通常是优选的。对于安全博弈,我们只需要考虑位置策略。这些将玩家的游戏位置映射到每当玩家进入该位置时将由玩家采取的移动。对于复杂的位置策略,一个共同的目标是最小化获胜玩家的移动需要被定义的位置的数量,使得游戏仍然由同一玩家赢得,而不访问具有未定义的下一移动的位置。我们称之为获胜策略,其中的下一步行动是定义为少数球员的立场稀疏。不幸的是,即使粗略地近似安全博弈的稀疏策略的密度也被证明是NP困难的。因此,要在实践中获得稀疏策略,必须应用一些算法,或者使用一些穷举搜索技术,如整数线性规划(ILP)求解。在本文中,我们进行了比较研究,目前可用的方法来获得稀疏的安全游戏中的安全玩家获胜策略。我们认为,从常识的技术,如使用ILP或SAT(可满足性)解决,和一种新的技术的基础上迭代线性规划。本文的结果告诉我们,如果目前的技术已经足够可扩展的实际使用。

英文摘要:

We consider the problem of obtaining sparse positional strategies for safety games. Such games are a commonly used model in many formal methods, as they make the interaction of a system with its environment explicit. Often, a winning strategy for one of the players is used as a certificate or as an artefact for further processing in the application. Small such certificates, i.e., strategies that can be written down very compactly, are typically preferred. For safety games, we only need to consider positional strategies. These map game positions of a player onto a move that is to be taken by the player whenever the play enters that position. For representing positional strategies compactly, a common goal is to minimize the number of positions for which a winning player's move needs to be defined such that the game is still won by the same player, without visiting a position with an undefined next move. We call winning strategies in which the next move is defined for few of the player's positions sparse. Unfortunately, even roughly approximating the density of the sparsest strategy for a safety game has been shown to be NP-hard. Thus, to obtain sparse strategies in practice, one either has to apply some heuristics, or use some exhaustive search technique, like ILP (integer linear programming) solving. In this paper, we perform a comparative study of currently available methods to obtain sparse winning strategies for the safety player in safety games. We consider techniques from common knowledge, such as using ILP or SAT (satisfiability) solving, and a novel technique based on iterative linear programming. The results of this paper tell us if current techniques are already scalable enough for practical use.

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

↑