Learning hierarchical task network domains from partially observed plan traces

, &
Artificial Intelligence 212 (C):134-157 (2014)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/j.artint.2014.04.003

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,867

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Learning to plan in continuous domains.Gerald F. DeJong - 1994 - Artificial Intelligence 65 (1):71-141.
Hierarchical clustering optimizes the tradeoff between compositionality and expressivity of task structures for flexible reinforcement learning.Rex G. Liu & Michael J. Frank - 2022 - Artificial Intelligence 312 (C):103770.
Domain-specific increases in stage of performance in a complete theory of the evolution of human intelligence.Chester Wolfsont, Sara Nora Ross, Patrice Marie Miller, Michael Lamport Commons & Miriam Chernoff - 2008 - World Futures 64 (5-7):416 – 429.
Plan recognition in exploratory domains.Yaʼakov Gal, Swapna Reddy, Stuart M. Shieber, Andee Rubin & Barbara J. Grosz - 2012 - Artificial Intelligence 176 (1):2270-2290.
Planning and acting in partially observable stochastic domains.Leslie Pack Kaelbling, Michael L. Littman & Anthony R. Cassandra - 1998 - Artificial Intelligence 101 (1-2):99-134.
AI in 5G Networks: Challenges and Use Cases.Stanislav Lange, Susanna Schwarzmann, Marija Gajić, Thomas Zinner & Frank A. Kraemer - 2021 - In Ahmad Alnafessah, Gabriele Russo Russo, Valeria Cardellini, Giuliano Casale & Francesco Lo Presti (eds.), Communication Networks and Service Management in the Era of Artificial Intelligence and Machine Learning. Wiley. pp. 101–122.
Plan aggregation for strong cyclic planning in nondeterministic domains.Ron Alford, Ugur Kuter, Dana Nau & Robert P. Goldman - 2014 - Artificial Intelligence 216 (C):206-232.
Knowledge-based programs as succinct policies for partially observable domains.Bruno Zanuttini, Jérôme Lang, Abdallah Saffidine & François Schwarzentruber - 2020 - Artificial Intelligence 288 (C):103365.
Exploiting symmetries for single- and multi-agent Partially Observable Stochastic Domains.Byung Kon Kang & Kee-Eung Kim - 2012 - Artificial Intelligence 182-183 (C):32-57.
Abstraction from demonstration for efficient reinforcement learning in high-dimensional domains.Luis C. Cobo, Kaushik Subramanian, Charles L. Isbell, Aaron D. Lanterman & Andrea L. Thomaz - 2014 - Artificial Intelligence 216 (C):103-128.

Analytics

Added to PP
2020-12-22

Downloads
9 (#1,267,182)

6 months
5 (#836,928)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Add more citations

References found in this work

O-Plan: The open planning architecture.Ken Currie & Austin Tate - 1991 - Artificial Intelligence 52 (1):49-86.

View all 10 references / Add more references