A General Multi-agent Epistemic Planner Based on Higher-order Belief Change

by   Xiao Huang, et al.

In recent years, multi-agent epistemic planning has received attention from both dynamic logic and planning communities. Existing implementations of multi-agent epistemic planning are based on compilation into classical planning and suffer from various limitations, such as generating only linear plans, restriction to public actions, and incapability to handle disjunctive beliefs. In this paper, we propose a general representation language for multi-agent epistemic planning where the initial KB and the goal, the preconditions and effects of actions can be arbitrary multi-agent epistemic formulas, and the solution is an action tree branching on sensing results. To support efficient reasoning in the multi-agent KD45 logic, we make use of a normal form called alternating cover disjunctive formulas (ACDFs). We propose basic revision and update algorithms for ACDFs. We also handle static propositional common knowledge, which we call constraints. Based on our reasoning, revision and update algorithms, adapting the PrAO algorithm for contingent planning from the literature, we implemented a multi-agent epistemic planner called MEPK. Our experimental results show the viability of our approach.



There are no comments yet.


page 1

page 2

page 3

page 4


When Do Introspection Axioms Matter for Multi-Agent Epistemic Reasoning?

The early literature on epistemic logic in philosophy focused on reasoni...

Knowledge Compilation in Multi-Agent Epistemic Logics

Epistemic logics are a primary formalism for multi-agent systems but maj...

What you get is what you see: Decomposing Epistemic Planning using Functional STRIPS

Epistemic planning --- planning with knowledge and belief --- is essenti...

Modelling Multi-Agent Epistemic Planning in ASP

Designing agents that reason and act upon the world has always been one ...

Tracking and managing deemed abilities

Information about the powers and abilities of acting entities is used to...

Dynamic Epistemic Logic with ASP Updates: Application to Conditional Planning

Dynamic Epistemic Logic (DEL) is a family of multimodal logics that has ...

Interactions between Knowledge and Time in a First-Order Logic for Multi-Agent Systems: Completeness Results

We investigate a class of first-order temporal-epistemic logics for reas...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.