نتایج جستجو برای: detailed pre task planning

تعداد نتایج: 942307  

2017
Dan Wang Jesse Hoey

This paper proposes a goal recognition and planning algorithm, HTN-GRP-PO, to enable intelligent assistant agents to recognize older adults’ goals and reason about desired further steps. It will be used in a larger system aimed to help older adults with cognitive impairments to accomplish activities of daily living independently. The algorithm addresses issues including partial observability du...

1998
Stephen J. J. Smith Dana S. Nau Thomas A. Throop

The latest world-championship competition for computer bridge programs was the Baron Barclay World Bridge Computer Challenge, hosted in July 1997 by the American Contract Bridge League. As reported in The New York Times and The Washington Post, the competition’s winner was a new version of Great Game Products’ Bridge Baron program. This version, Bridge Baron 8, has since gone on the market; and...

1995
Kutluhan Erol James A. Hendler Dana S. Nau Reiko Tsuneto

Detecting interactions and resolving conflicts is one of the key issues for generative planning systems. Hierarchical Task Network (HTN) planning systems use critics for this purpose. Critics have provided extra efficiency and flexibility to HTN planning systems, but their procedural –and sometimes domain-specific – nature has not been amenable to analytical studies. As a result, little work is...

2001
S. J. J. D. S.

This paper reports on the development of a planning system for an important industrial planning problem. This planner, which is one of the modules in an integrated design-and-planning system called EDAPS, provides an integrated approach to process planning in both the electronic and mechanical domains, specifically in the manufaeture of microwave transmit-receive O/R) modules. Our planner is ba...

1999
Dana S. Nau Yue Cao Amnon Lotem Hector Muñoz-Avila

SHOP (Simple Hierarchical Ordered Planner) is a domain-independent H T N planning system with the following characteristics. • SHOP plans for tasks in the same order that they will later be executed. This avoids some goalinteraction issues that arise in other HTN planners, so that the planning algorithm is relatively simple. • Since SHOP knows the complete world-state at each step of the planni...

2016
Damir Lotinac Anders Jonsson

Hierarchical Task Networks (HTNs) are a common model for encoding knowledge about planning domains in the form of task decompositions. We present a novel algorithm that uses invariant analysis to construct an HTN from the PDDL description of a planning domain and a single representative instance. The algorithm defines two types of composite tasks that interact to achieve the goal of a planning ...

Journal: :Computational Intelligence 2011
Juan Fernández-Olivares Luis A. Castillo Juan A. Cózar Óscar García-Pérez

This paper is focused on how a general-purpose hierarchical planning representation, based on the HTN paradigm, can be used to support the representation of oncology treatment protocols. The planning algorithm used is a temporally extended HTN planning process capable of interpreting such representation and generating oncology treatment plans that have been proven to support clinical decisions ...

2004
Malik Ghallab

We present here an overview of several planning techniques in robotics. We will not be concerned with the synthesis of abstract mission and task plans, using well known classical and other domain-independent planning techniques. We will mainly focus on to how refine such abstract plans into robust sensory-motor actions and on some planning techniques that can be useful for that. The paper intro...

2006
Robert P. Goldman

This paper provides techniques for hierarchical task network (HTN) planning with durative actions. HTNs can provide useful heuristic guidance to planners, express goals that cannot be expressed in simple first principles planners, and allow plan generation to be limited by external constraints. The decomposition information in HTN plans can also help guide plan execution. This paper provides a ...

2012
Nora Ayanian Daniela Rus Vijay Kumar

This paper provides a decentralized solution to multirobot coordination in partially-known environments where the problems of task assignment, trajectory planning and safe control are concurrently solved in the presence of communication constraints. We assume that the robots are homogeneous (any robot is capable of completing any assigned task), can localize themselves and have access to a know...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید