Skip navigation
Skip navigation

Factored planning using decomposition trees

Kelareva, Elena; Buffet, Olivier; Huang, Jinbo; Thiebaux, Sylvie

Description

Improving AI planning algorithms relies on the ability to exploit the structure of the problem at hand. A promising direction is that of factored planning, where the domain is partitioned into subdomains with as little interaction as possible. Recent work

CollectionsANU Research Publications
Date published: 2007
Type: Conference paper
URI: http://hdl.handle.net/1885/29836
Source: Proceedings of the International Joint Conference on Artificial Intelligence

Download

File Description SizeFormat Image
01_Kelareva_Factored_planning_using_2007.pdf25.91 kBAdobe PDF    Request a copy
02_Kelareva_Factored_planning_using_2007.pdf43.92 kBAdobe PDF    Request a copy
03_Kelareva_Factored_planning_using_2007.pdf233.08 kBAdobe PDF    Request a copy
04_Kelareva_Factored_planning_using_2007.pdf299.98 kBAdobe PDF    Request a copy


Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  23 August 2018/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator