h-approximation: History-Based Approximation of Possible World Semantics as ASP

04/17/2013
by   Manfred Eppe, et al.
0

We propose an approximation of the Possible Worlds Semantics (PWS) for action planning. A corresponding planning system is implemented by a transformation of the action specification to an Answer-Set Program. A novelty is support for postdiction wrt. (a) the plan existence problem in our framework can be solved in NP, as compared to Σ_2^P for non-approximated PWS of Baral(2000); and (b) the planner generates optimal plans wrt. a minimal number of actions in Δ_2^P. We demo the planning system with standard problems, and illustrate its integration in a larger software framework for robot control in a smart home.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/26/2011

Answer Set Planning Under Action Costs

Recently, planning based on answer set programming has been proposed as ...
research
06/04/2013

Narrative based Postdictive Reasoning for Cognitive Robotics

Making sense of incomplete and conflicting narrative knowledge in the pr...
research
09/26/2011

PDDL2.1 - The Art of the Possible? Commentary on Fox and Long

PDDL2.1 was designed to push the envelope of what planning algorithms ca...
research
05/27/2015

Qsmodels: ASP Planning in Interactive Gaming Environment

Qsmodels is a novel application of Answer Set Programming to interactive...
research
07/31/2019

Domain-Independent Cost-Optimal Planning in ASP

We investigate the problem of cost-optimal planning in ASP. Current ASP ...
research
07/03/2023

Novelty and Lifted Helpful Actions in Generalized Planning

It has been shown recently that successful techniques in classical plann...
research
09/27/2011

Probabilistic Hybrid Action Models for Predicting Concurrent Percept-driven Robot Behavior

This article develops Probabilistic Hybrid Action Models (PHAMs), a real...

Please sign up or login with your details

Forgot password? Click here to reset