On Plans With Loops and Noise

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract / Description of output

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. He motivated a logical characterisation within the situation calculus that included binary sensing actions. 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. Increasingly, classical plan structures are being applied to stochastic environments such as robotics applications. This raises the question as to what the specification for correctness should look like, since Levesque’s account makes the assumption that sensing is exact and actions are deterministic. Building on a situation calculus theory for reasoning about degrees of belief and noise, we revisit the execution semantics of generalised plans. The specification is then used to analyse the correctness of example plans.
Original languageEnglish
Title of host publicationProceedings of the 17th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2018)
Place of PublicationStockholm, Sweden
Number of pages8
Publication statusPublished - 9 Jul 2018
Event17th International Conference on Autonomous Agents and Multiagent Systems - Stockholm, Sweden
Duration: 10 Jul 201815 Jul 2018


Conference17th International Conference on Autonomous Agents and Multiagent Systems
Abbreviated titleAAMAS 2018
Internet address


Dive into the research topics of 'On Plans With Loops and Noise'. Together they form a unique fingerprint.

Cite this