平均能量对策
Average-energy games
摘要:
两个玩家的定量零和游戏提供了一个自然的框架,合成控制器的性能保证反应系统在一个不可控的环境。经典的设置包括平均收益游戏,其目标是优化每次行动的长期平均收益,以及能量游戏,其中系统必须避免耗尽能量。我们研究平均能量博弈,目标是优化累积能量的长期平均值。我们表明,这一目标自然出现在几个应用程序中,它产生有趣的连接与以前的概念在文献中。我们证明,在这样的游戏中,决定赢家是在NP间coNP和至少一样难解决的平均支付游戏,我们建立了无记忆的策略足以赢得。我们还考虑了系统必须最小化平均能量,同时始终将累积能量保持在预定义范围内的情况:这对应于使用有限容量的能量存储进行操作。我们给出了一个球员和两个球员的游戏结果,并建立复杂性界限和内存要求。
英文摘要:
Two-player quantitative zero-sum games provide a natural framework to synthesize controllers with performance guarantees for reactive systems within an uncontrollable environment. Classical settings include mean-payoff games, where the objective is to optimize the long-run average gain per action, and energy games, where the system has to avoid running out of energy. We study average-energy games, where the goal is to optimize the long-run average of the accumulated energy. We show that this objective arises naturally in several applications, and that it yields interesting connections with previous concepts in the literature. We prove that deciding the winner in such games is in NP inter coNP and at least as hard as solving mean-payoff games, and we establish that memoryless strategies suffice to win. We also consider the case where the system has to minimize the average-energy while maintaining the accumulated energy within predefined bounds at all times: this corresponds to operating with a finite-capacity storage for energy. We give results for one-player and two-player games, and establish complexity bounds and memory requirements.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。