Skip navigation
Skip navigation

Concurrent probabilistic temporal planning with policy-gradients

Aberdeen, Douglas; Buffet, Olivier


We present an any-time concurrent probabilistic temporal planner that includes continuous and discrete uncertainties and metric functions. Our approach is a direct policy search that attempts to optimise a parameterised policy using gradient ascent. Low memory use, plus the use of function approximation methods, plus factorisation of the policy, allow us to scale to challenging domains. This Factored Policy Gradient (FPG) Planner also attempts to optimise both steps to goal and the probability...[Show more]

CollectionsANU Research Publications
Date published: 2007
Type: Conference paper
Source: Proceedings of The 17th International Conference on Automated Planning and Scheduling (ICAPS 2007)


File Description SizeFormat Image
01_Aberdeen_Concurrent_probabilistic_2007.pdf441.84 kBAdobe PDF    Request a copy

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

Updated:  20 July 2017/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator