6,501 Hits in 8.4 sec

Epistemic Planning (Dagstuhl Seminar 17231)

Chitta Baral, Thomas Bolander, Hans Van Ditmarsch, Sheila McIlrath, Marc Herbstritt
2017 Dagstuhl Reports  
The original goals of the seminar were to develop benchmarks for epistemic planning, to explore the relationship between knowledge and belief in multi-agent epistemic planning, to develop models of agency  ...  The seminar Epistemic Planning brought together the research communities of Dynamic Epistemic Logic, Knowledge Representation and Reasoning, and Automated Planning to address fundamental problems on the  ...  For example, a single source agent knows a set of secrets and wants a destination agent to know all of these, but can communicate only via other agents, to whom the secret should not be revealed.  ... 
doi:10.4230/dagrep.7.6.1 dblp:journals/dagstuhl-reports/BaralBDM17 fatcat:gpx3gj7f2jajzbximybwmjjjjm

Social Planning for Trusted Autonomy [chapter]

Tim Miller, Adrian R. Pearce, Liz Sonenberg
2018 Foundations of Trusted Autonomy  
A Formal Model for Multi-agent Epistemic Planning In this section, we present a formal model for our multi-agent epistemic planning problem.  ...  We have covered two emerging solution techniques for solving multi-agent epistemic planning problems, including an approach for compiling away epistemic fluents, where multi-agent problems are posed as  ...  The images or other third party material in this chapter are included in the chapter's Creative Commons license, unless indicated otherwise in a credit line to the material.  ... 
doi:10.1007/978-3-319-64816-3_4 fatcat:6jfxw2qqufgojnljs5tv62qtie

Knowing How to Plan

Yanjun Li, Yanjing Wang
2021 Electronic Proceedings in Theoretical Computer Science  
Various planning-based know-how logics have been studied in the recent literature. In this paper, we use such a logic to do know-how-based planning via model checking.  ...  In particular, we can handle the higher-order epistemic planning involving know-how formulas as the goal, e.g., find a plan to make sure p such that the adversary does not know how to make p false in the  ...  Comparing to the coalition-based know-how approaches such as [20] , we do not have any group know-how modality, but use a much more general notion of plans than the single-step joint action there.  ... 
doi:10.4204/eptcs.335.22 fatcat:xhl3732nwvdm5lzqgebjqib5dq

Conditional Epistemic Planning [chapter]

Mikkel Birkegaard Andersen, Thomas Bolander, Martin Holm Jensen
2012 Lecture Notes in Computer Science  
Recent work has shown that Dynamic Epistemic Logic (DEL) offers a solid foundation for automated planning under partial observability and non-determinism.  ...  We show how to formulate planning in uncertain domains using DEL and give a language of conditional plans.  ...  Dynamic Epistemic Logic Dynamic epistemic logics describe knowledge and how actions change it. These changes may be epistemic (changing knowledge), ontic (changing facts) or both.  ... 
doi:10.1007/978-3-642-33353-8_8 fatcat:fc5yt42f5bbh7hor6to4mz5iku

Implicit Coordination Using FOND Planning

Thorsten Engesser, Tim Miller
Epistemic planning can be used to achieve implicit coordination in cooperative multi-agent settings where knowledge and capabilities are distributed between the agents.  ...  We provide a small case study, modeling the problem of multi-agent path finding with destination uncertainty in FOND, to show that our approach can be successfully applied in practice.  ...  Compilation of Epistemic Actions Based on the compilation of epistemic states and formulas from before, we now show how an action a = ( E, (Q i ), pre, eff , E d ) that can be partitioned into distinct  ... 
doi:10.1609/aaai.v34i05.6204 fatcat:a4yzt5oxsjhhzaunwmxebmaequ

A Gentle Introduction to Epistemic Planning: The DEL Approach

Thomas Bolander
2017 Electronic Proceedings in Theoretical Computer Science  
Epistemic planning can be used for decision making in multi-agent situations with distributed knowledge and capabilities.  ...  Dynamic Epistemic Logic (DEL) has been shown to provide a very natural and expressive framework for epistemic planning.  ...  We start with the most classical framework for planning, STRIPS, and then stepwise we expand and generalise the framework until finally reaching full multi-agent planning based on dynamic epistemic logic  ... 
doi:10.4204/eptcs.243.1 fatcat:u5e4ep3tnjhnzbaajkobj6v5fe

Cooperative Epistemic Multi-Agent Planning for Implicit Coordination

Thorsten Engesser, Thomas Bolander, Robert Mattmüller, Bernhard Nebel
2017 Electronic Proceedings in Theoretical Computer Science  
Recently, Dynamic Epistemic Logic (DEL) has been shown to provide a very natural and expressive framework for epistemic planning.  ...  Epistemic planning can be used for decision making in multi-agent situations with distributed knowledge and capabilities.  ...  In particular this possibility of perspective shifts distinguishes these approaches from more traditional multi-agent planning (Brenner and Nebel 2009) .  ... 
doi:10.4204/eptcs.243.6 fatcat:72wisngztfhr5nijut3255zlfm

Dynamic Term-Modal Logics for Epistemic Planning [article]

Andreas Achen, Andrés Occhipinti Liberman, Rasmus K. Rendsvig
2019 arXiv   pre-print
The semantics are given a dynamic extension using first-order "action models" allowing for epistemic planning, and it is shown how corresponding "action schemas" allow for a very compact action representation  ...  finite agent case, and shows a general completeness result for the dynamic extension by reduction axioms.  ...  The multi-agent planning frameworks in [45, 60] follow a compilation approach, translating restricted fragments of epistemic planning into classical planning languages.  ... 
arXiv:1906.06047v1 fatcat:pr4dgaepkze4rghdzrxcwtfl6e

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

Guang Hu, Tim Miller, Nir Lipovetzky
2019 arXiv   pre-print
Epistemic planning --- planning with knowledge and belief --- is essential in many multi-agent and human-agent interaction domains.  ...  As a result, it increases the capability and flexibility of the epistemic model itself, and avoids the exponential pre-compilation step.  ...  Bolander and Andersen (2011) first used event-based models to study epistemic planning in both single and multi agent environments, and gave a formal definition of epistemic planning problems using Dynamic  ... 
arXiv:1903.11777v2 fatcat:u52uwep4tfdlhcr4chwoq4umyy

DualSMC: Tunneling Differentiable Filtering and Planning under Continuous POMDPs

Yunbo Wang, Bo Liu, Jiajun Wu, Yuke Zhu, Simon S. Du, Li Fei-Fei, Joshua B. Tenenbaum
2020 Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence  
Based on the filtering results, we then propose a planning algorithm that extends the previous SMC planning approach [Piche et al., 2018] to continuous POMDPs with an uncertainty-dependent policy.  ...  A major difficulty of solving continuous POMDPs is to infer the multi-modal distribution of the unobserved true states and to make the planning algorithm dependent on the perceived uncertainty.  ...  For example, in an epistemic planning problem, agent a may have the following goal: "a knows the truthvalue of ϕ, while b does not know that a knows this".  ... 
doi:10.24963/ijcai.2020/575 dblp:conf/ijcai/LibermanR20 fatcat:mxm7bcjddbfknodhwwchmpbmtu

Token-based Execution Semantics for Multi-Agent Epistemic Planning

Thorsten Engesser, Robert Mattmüller, Bernhard Nebel, Felicitas Ritter
2020 Proceedings of the Seventeenth International Conference on Principles of Knowledge Representation and Reasoning  
Epistemic planning has been employed as a means to achieve implicit coordination in cooperative multi-agent systems where world knowledge is distributed between the agents, and agents plan and act individually  ...  In this paper, we analyze the idea of using a single token that can be passed around between the agents and which is used as a prerequisite for acting.  ...  The positive results that we get for our token-based approach will be based on the assumption that the planning agents act with respect to subjectively optimal policies.  ... 
doi:10.24963/kr.2020/36 dblp:conf/kr/EngesserMNR20 fatcat:3uxpwpmq5jcg7ngleqmapzrfqm

Defeasible-argumentation-based multi-agent planning

Sergio Pajares Ferrando, Eva Onaindia
2017 Information Sciences  
We compare our system with a non-argumentative planning framework and with a different approach of planning and argumentation.  ...  Defeasible-argumentationbased multi-agent planning. Information Sciences. 411:1-22.  ...  However, in complex and dynamic environments, it is required to represent and manage the know-how knowledge of a planning agent; i.e., information other than the causal inferences drawn from the application  ... 
doi:10.1016/j.ins.2017.05.014 fatcat:e5l35vyvlnethfilvvfiwqbaiu

Knowledge-Based Programs as Plans: Succinctness and the Complexity of Plan Existence [article]

Jerome Lang, Bruno Zanuttini
2013 arXiv   pre-print
Knowledge-based programs (KBPs) are high-level protocols describing the course of action an agent should perform as a function of its knowledge.  ...  Here we make this argument formal, and prove that there exists an exponential succinctness gap between knowledge-based programs and standard plans. Then we address the complexity of plan existence.  ...  Now, even if our paper does not address full multi-agent environments (which are much more complex to handle), it allows to represent at least a simple class of multi-agent planning problems, where only  ... 
arXiv:1310.6429v1 fatcat:w6tosdnrdbb2fipwq67kcaoo5m

Efficient Multi-agent Epistemic Planning: Teaching Planners About Nested Belief [article]

Christian Muise, Vaishak Belle, Paolo Felli, Sheila McIlraith, Tim Miller, Adrian R. Pearce, Liz Sonenberg
2021 arXiv   pre-print
Our approach represents an important step towards applying the well-established field of automated planning to the challenging task of planning involving nested beliefs of multiple agents.  ...  We plan from the perspective of a single agent with the potential for goals and actions that involve nested beliefs, non-homogeneous agents, co-present observations, and the ability for one agent to reason  ...  Multi-Agent Epistemic Planning Problem A multi-agent epistemic planning (MEP) problem D is a tuple of the form P, A, Ag, I, G , where P and Ag are as above, A is a set of RP-MEP planning actions, I is  ... 
arXiv:2110.02480v1 fatcat:w7r56nj45ba6dasbskdomrzwm4

On Plans With Loops and Noise [article]

Vaishak Belle
2018 arXiv   pre-print
In an influential paper, Levesque proposed a formal specification for analysing the correctness of program-like plans, such as conditional plans, iterative plans, and knowledge-based plans.  ...  While the characterisation does not immediately yield a practical algorithm, the specification serves as a general skeleton to explore the synthesis of program-like plans for reasonable, tractable fragments  ...  Moreover, recent advances in multi-agent epistemic planning [6, 7] are encouraging, and a formal characterisation like the one by Levesque can help relate that work to generalised planning.  ... 
arXiv:1809.05309v1 fatcat:ctk726yp5nhnjpo7db3npxc7lq
« Previous Showing results 1 — 15 out of 6,501 results