4 research outputs found

    Logic programming for deliberative robotic task planning

    Get PDF
    Over the last decade, the use of robots in production and daily life has increased. With increasingly complex tasks and interaction in different environments including humans, robots are required a higher level of autonomy for efficient deliberation. Task planning is a key element of deliberation. It combines elementary operations into a structured plan to satisfy a prescribed goal, given specifications on the robot and the environment. In this manuscript, we present a survey on recent advances in the application of logic programming to the problem of task planning. Logic programming offers several advantages compared to other approaches, including greater expressivity and interpretability which may aid in the development of safe and reliable robots. We analyze different planners and their suitability for specific robotic applications, based on expressivity in domain representation, computational efficiency and software implementation. In this way, we support the robotic designer in choosing the best tool for his application

    Planning in Answer Set Programming using Ordered Task Decomposition

    Get PDF
    In this paper we introduce a formalism for solving Hierarchical Task Network (HTN) Planning using Answer Set Programming (ASP). We consider the formulation of HTN planning as described in the SHOP planning system and define a systematic translation method from SHOP's representation of the planning problem into logic programs with negation. We show that our translation is sound and complete: answer sets of the logic program obtained by our translation correspond exactly to the solutions of the planning problem. We compare our method to (1) similar approaches based on non-HTN planning and (2) SHOP, a dedicated planning system. We show that our approach outperforms non-HTN methods and that its performance is better with ASP systems that allow for nonground programs than with ASP systems that require ground programs. Keywords: HTN planning, nonmonotonic reasoning, ASP systems, benchmark

    Planning in answer set programming using ordered task decomposition

    No full text
    In this paper we investigate a formalism for solving planning problems based on ordered task decomposition using Answer Set Programming (ASP). Our planning methodology is an adaptation of Hierarchical Task Network (HTN) planning, an approach that has led to some very efficient planners. The ASP paradigm evolved out of the stable semantics for logic programs in recent years and is strongly related to nonmonotonic logics. It also led to various very efficient implementations (Smodels, DLV). While all previous approaches for using ASP for planning rely on action-based planning, we consider for the first time a formulation of HTN planning as described in the SHOP planning system and define a systematic translation method from SHOP’s representation of the planning problem into logic programs with negation. We show that our translation is sound and complete: answer sets of the logic program obtained by our translation correspond exactly to the solutions of the planning problem. Our approach does not rely on a particular system for computing answer sets and serves several purposes. (1) It constitutes a mean
    corecore