Conditional Epistemic Planning

Mikkel Birkegaard Andersen; Thomas Bolander; Martin Holm Jensen

doi:10.1007/978-3-642-33353-8_8

Conditional Epistemic Planning

Mikkel Birkegaard Andersen, Thomas Bolander, Martin Holm Jensen

Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

Abstract

Recent work has shown that Dynamic Epistemic Logic (DEL) offers a solid foundation for automated planning under partial observability and non-determinism. Under such circumstances, a plan must branch if it is to guarantee achieving the goal under all contingencies (strong planning). Without branching, plans can offer only the possibility of achieving the goal (weak planning). We show how to formulate planning in uncertain domains using DEL and give a language of conditional plans. Translating this language to standard DEL gives verification of both strong and weak plans via model checking. In addition to plan verification, we provide a tableau-inspired algorithm for synthesising plans, and show this algorithm to be terminating, sound and complete.

Original language	English
Title of host publication	Logics in Artificial Intelligence : 13th European Conference, JELIA 2012, Toulouse, France, September 26-28, 2012. Proceedings
Publisher	Springer
Publication date	2012
Pages	94-106
ISBN (Print)	978-3-642-33352-1
ISBN (Electronic)	978-3-642-33353-8
DOIs	https://doi.org/10.1007/978-3-642-33353-8_8
Publication status	Published - 2012
Event	13th European Conference on Logics in Artificial Intelligence (JELIA 2012) - Toulouse, France Duration: 26 Sep 2012 → 28 Sep 2012 http://www.irit.fr/jelia2012/

Conference

Conference	13th European Conference on Logics in Artificial Intelligence (JELIA 2012)
Country	France
City	Toulouse
Period	26/09/2012 → 28/09/2012
Internet address	http://www.irit.fr/jelia2012/

Series	Lecture Notes in Computer Science
Volume	7519
ISSN	0302-9743

Access to Document

10.1007/978-3-642-33353-8_8

Fingerprint Dive into the research topics of 'Conditional Epistemic Planning'. Together they form a unique fingerprint.

Cite this

@inproceedings{339115dc830f482e8cc2f6bbeaf65417,

title = "Conditional Epistemic Planning",

abstract = "Recent work has shown that Dynamic Epistemic Logic (DEL) offers a solid foundation for automated planning under partial observability and non-determinism. Under such circumstances, a plan must branch if it is to guarantee achieving the goal under all contingencies (strong planning). Without branching, plans can offer only the possibility of achieving the goal (weak planning). We show how to formulate planning in uncertain domains using DEL and give a language of conditional plans. Translating this language to standard DEL gives verification of both strong and weak plans via model checking. In addition to plan verification, we provide a tableau-inspired algorithm for synthesising plans, and show this algorithm to be terminating, sound and complete. ",

author = "Andersen, {Mikkel Birkegaard} and Thomas Bolander and Jensen, {Martin Holm}",

year = "2012",

doi = "10.1007/978-3-642-33353-8_8",

language = "English",

isbn = "978-3-642-33352-1",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

pages = " 94--106",

booktitle = "Logics in Artificial Intelligence",

note = "13th European Conference on Logics in Artificial Intelligence (JELIA 2012) ; Conference date: 26-09-2012 Through 28-09-2012",

url = "http://www.irit.fr/jelia2012/",

}

Andersen, MB , Bolander, T & Jensen, MH 2012, Conditional Epistemic Planning. in Logics in Artificial Intelligence: 13th European Conference, JELIA 2012, Toulouse, France, September 26-28, 2012. Proceedings. Springer, Lecture Notes in Computer Science, vol. 7519, pp. 94-106, 13th European Conference on Logics in Artificial Intelligence (JELIA 2012), Toulouse, France, 26/09/2012. https://doi.org/10.1007/978-3-642-33353-8_8

Conditional Epistemic Planning. / Andersen, Mikkel Birkegaard ; Bolander, Thomas; Jensen, Martin Holm.

Logics in Artificial Intelligence: 13th European Conference, JELIA 2012, Toulouse, France, September 26-28, 2012. Proceedings. Springer, 2012. p. 94-106 (Lecture Notes in Computer Science, Vol. 7519).

Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

TY - GEN

T1 - Conditional Epistemic Planning

AU - Andersen, Mikkel Birkegaard

AU - Bolander, Thomas

AU - Jensen, Martin Holm

PY - 2012

Y1 - 2012

N2 - Recent work has shown that Dynamic Epistemic Logic (DEL) offers a solid foundation for automated planning under partial observability and non-determinism. Under such circumstances, a plan must branch if it is to guarantee achieving the goal under all contingencies (strong planning). Without branching, plans can offer only the possibility of achieving the goal (weak planning). We show how to formulate planning in uncertain domains using DEL and give a language of conditional plans. Translating this language to standard DEL gives verification of both strong and weak plans via model checking. In addition to plan verification, we provide a tableau-inspired algorithm for synthesising plans, and show this algorithm to be terminating, sound and complete.

AB - Recent work has shown that Dynamic Epistemic Logic (DEL) offers a solid foundation for automated planning under partial observability and non-determinism. Under such circumstances, a plan must branch if it is to guarantee achieving the goal under all contingencies (strong planning). Without branching, plans can offer only the possibility of achieving the goal (weak planning). We show how to formulate planning in uncertain domains using DEL and give a language of conditional plans. Translating this language to standard DEL gives verification of both strong and weak plans via model checking. In addition to plan verification, we provide a tableau-inspired algorithm for synthesising plans, and show this algorithm to be terminating, sound and complete.

U2 - 10.1007/978-3-642-33353-8_8

DO - 10.1007/978-3-642-33353-8_8

M3 - Article in proceedings

SN - 978-3-642-33352-1

T3 - Lecture Notes in Computer Science

SP - 94

EP - 106

BT - Logics in Artificial Intelligence

PB - Springer

T2 - 13th European Conference on Logics in Artificial Intelligence (JELIA 2012)

Y2 - 26 September 2012 through 28 September 2012

ER -