Robust planning with (L)RTDP

Buffet, Olivier; Aberdeen, Douglas

Cultural advice

The Australian National University acknowledges, celebrates and pays our respects to the Ngunnawal and Ngambri people of the Canberra region and to all First Nations Australians on whose traditional lands we meet and work, and whose cultures are among the oldest continuing cultures in human history.

Aboriginal and Torres Strait Islander peoples are advised that ANU Library collections may include images, names, voices, and other representations of deceased persons.

Material in the collection may contain terms, language or views that reflect the period in which the item was created and may be considered inappropriate today.

Robust planning with (L)RTDP

Date

2005

Authors

Buffet, Olivier

Aberdeen, Douglas

Publisher

AAAI Press

Abstract

Stochastic Shortest Path problems (SSPs), a subclass of Markov Decision Problems (MDPs), can be efficiently dealt with using Real-Time Dynamic Programming (RTDP). Yet, MDP models are often uncertain (obtained through statistics or guessing). The usual app

URI

http://hdl.handle.net/1885/85411

Collections

Open Access Research

Source

Proceedings of the 19th International Joint Conference on Artificial Intelligence (IJCAI 2005)

Type

Conference paper

Full item page

Cultural advice

Robust planning with (L)RTDP

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

Keywords

Citation

URI

Collections

Source

Type

Book Title

Entity type

Access Statement

License Rights

DOI

Restricted until