Skip navigation
Skip navigation

Heuristic search in dual space for Constrained stochastic shortest path problems

Trevizan, Felipe; Thiebaux, Sylvie; Santana, Pedro; Williams, Brian


We consider the problem of generating optimal stochastic policies for Constrained Stochastic Shortest Path problems, which are a natural model for planning under uncertainty for resourcebounded agents with multiple competing objectives. While unconstrained SSPs enjoy a multitude of efficient heuristic search solution methods with the ability to focus on promising areas reachable from the initial state, the state of the art for constrained SSPs revolves around linear and dynamic programming...[Show more]

CollectionsANU Research Publications
Date published: 2016
Type: Conference paper
Source: Proceedings of the Twenty-Sixth International Conference on Automated Planning and Scheduling (ICAPS 2016)
Access Rights: Open Access


File Description SizeFormat Image
01_Trevizan_Heuristic_search_in_dual_space_2016.pdf528.11 kBAdobe PDFThumbnail

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

Updated:  17 November 2022/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator