Uncertainty-Based Semantics for Multi-Agent Knowing How Logics

Areces, Carlos; Fervari, Raul; Saravia, Andrés R.; Velázquez–Quesada, Fernando R.

doi:10.4204/eptcs.335.3

Cited by 8 publications

(15 citation statements)

References 26 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The multi-agent epistemic planning technique addresses the environment's partial observability by allowing a single agent to reason about information owned by other agents (Areces et al, 2021). In the realm of non-reinforcement learning in multi-agent systems, epistemic planning has yielded numerous successes.…”

Section: Related Workmentioning

confidence: 99%

Consistent epistemic planning without communication for MADRL

Luo

Tian³

et al. 2023

Preprint

View full text Add to dashboard Cite

Multi-agent cooperation needs to reason about beliefs in the partially observable environment without communication, but the traditional Multi-agent Deep Reinforcement Learning (MADRL) algorithm struggles to handle the uncertainty of agents. Multi-agent Epistemic planning (MEP) tries to let the agent find a best plan to complete the cooperation task, so as to more effectively solve the uncertainty. However, inconsistent planning arises if the MADRL only adds MEP. We propose a MADRL-based policy network architecture called SMM-MEPP: Shared Mental Model - Multi-agent Epistemic Planning Policy. Firstly, Multi-agent Epistemic Planning and MADRL are investigated to build the "Perception-Planning-Action" multi-agent epistemic planning framework. Then, mental model in psychology is introduced and descript as a neural network. Thirdly, parameter sharing mechanism is utilized to achieve the shared mental model and maintain the consistency of epistemic planning. Finally, we apply the SMM-MEPP architecture to three advanced MADRL algorithms (i.e., MAAC, MADDPG and MAPPO) and conduct comparative experiments in multi-agent cooperation tasks. Experiments show that the proposed method can bring consistent planning for multiple agents, and improves convergence speed or training effect in partially observable environment without communication.

show abstract

Section: Related Workmentioning

confidence: 99%

Consistent epistemic planning without communication for MADRL

Luo

Tian³

et al. 2023

Preprint

View full text Add to dashboard Cite

show abstract

“…For (2), it can be shown by the same process as for (1). For (3), by (1) we know that L(ρ)|x = L(ρ 1 )|x and L(ρ)|x = L(ρ 2 )|x. Thus, L(ρ 1 )|x = L(ρ 2 )|x.…”

Section: Proposition 14 Let T Be a Complete And Open Subtree Ofmentioning

confidence: 99%

“…In [1], a new semantics for this knowing how modality was given, which is based on an indistinguishability relation between plans. It is shown in [1] that the satisfiability problem of this knowing how logic is NP-complete, but this logic does not include the modality for knowing that.…”

Section: Introductionmentioning

confidence: 99%

“…Inspired by the idea of automated planning under uncertainty in artificial intelligence, The author of [25,26] proposed a logical framework of knowing how which includes a binary modality of knowing how. In [1], a new semantics for this knowing how modality was given, which is based on an indistinguishability relation between plans. It is shown in [1] that the satisfiability problem of this knowing how logic is NP-complete, but this logic does not include the modality for knowing that.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Tableaux for the Logic of Strategically Knowing How

Li¹

2023

Electron. Proc. Theor. Comput. Sci.

View full text Add to dashboard Cite

The logic of goal-directed knowing how proposed in [5] extends the standard epistemic logic with an operator of knowing how. The knowing how operator is interpreted as that there exists a strategy such that the agent knows that the strategy can make sure that ϕ. This paper presents a tableau procedure for the multi-agent version of the logic of strategically knowing how and shows the soundness and completeness of this tableau procedure. This paper also shows that the satisfiability problem of the logic can be decided in PSPACE.

show abstract

“…Other approaches, related to strategic games and coalitions, have been studied in (Naumov and Tao 2018c,a,b). Finally, the logic studied in (Areces et al 2021) (called herein L U ) is based on a notion of indistinguishability over plans. Arguably, such a proposal provides a more epistemic view of knowing how than other approaches.…”

Section: Introductionmentioning

confidence: 99%

Model-Checking for Ability-Based Logics with Constrained Plans

Demri

Fervari

2023

AAAI

View full text Add to dashboard Cite

We investigate the complexity of the model-checking problem for a family of modal logics capturing the notion of “knowing how”. We consider the most standard ability-based knowing how logic, for which we show that model-checking is PSpace-complete. By contrast, a multi-agent variant based on an uncertainty relation between plans in which uncertainty is encoded by a regular language, is shown to admit a PTime model-checking problem. We extend with budgets the above-mentioned ability-logics, as done for ATL-like logics. We show that for the former logic enriched with budgets, the complexity increases to at least ExpSpace-hardness, whereas for the latter, the PTime bound is preserved. Other variant logics are discussed along the paper.

show abstract

Uncertainty-Based Semantics for Multi-Agent Knowing How Logics

Cited by 8 publications

References 26 publications

Consistent epistemic planning without communication for MADRL

Consistent epistemic planning without communication for MADRL

Tableaux for the Logic of Strategically Knowing How

Model-Checking for Ability-Based Logics with Constrained Plans

Contact Info

Product

Resources

About