论文标题

在拥有多个共同资源的环境中仔细的自主剂

Careful Autonomous Agents in Environments With Multiple Common Resources

论文作者

Condurache, Rodica, Dima, Catalin, Jitaru, Madalina, Oualhadj, Youssouf, Troquard, Nicolas

论文摘要

在(Condurache等,2021年)中定义了仔细的有理合成,是Fisman等人的合理合成的定量扩展(Fisman等人,2010年),是一个多代理系统的模型,其中代理以基于转弯的方式在图形领域中相互作用。有一个共同的资源,每个动作可能会减少或增加资源。每个代理都有一个时间定性目标,并希望保持资源正面的价值。必须找到纳什平衡。这个问题是可以决定的。 在更实际的设置中,对多代理系统的关键属性的验证要求拥有许多资源的模型。实际上,代理商和机器人消耗并产生多种资源:电能,燃料,原材料,制造商品等。因此,我们探索了几种资源的仔细理性合成问题。我们表明问题是不确定的。然后,我们提出了一个具有有限资源的变体,这是因为在实际设置中,资源的存储是有限的。我们表明,问题变得可确定,并且与线性时间逻辑目标的控制器合成并不难。

Careful rational synthesis was defined in (Condurache et al. 2021) as a quantitative extension of Fisman et al.'s rational synthesis (Fisman et al. 2010), as a model of multi-agent systems in which agents are interacting in a graph arena in a turn-based fashion. There is one common resource, and each action may decrease or increase the resource. Each agent has a temporal qualitative objective and wants to maintain the value of the resource positive. One must find a Nash equilibrium. This problem is decidable. In more practical settings, the verification of the critical properties of multi-agent systems calls for models with many resources. Indeed, agents and robots consume and produce more than one type of resource: electric energy, fuel, raw material, manufactured goods, etc. We thus explore the problem of careful rational synthesis with several resources. We show that the problem is undecidable. We then propose a variant with bounded resources, motivated by the observation that in practical settings, the storage of resources is limited. We show that the problem becomes decidable, and is no harder than controller synthesis with Linear-time Temporal Logic objectives.

扫码加入交流群

加入微信交流群

微信交流群二维码

扫码加入学术交流群,获取更多资源