Offline and online time in Sequential Decision-Making Problems

Research output: Chapter in Book/Report/Conference proceedingConference contribution

View graph of relations Save citation

Authors

Research units

Abstract

A connection has recently been drawn between Dynamic Optimization Problems (DOPs) and Reinforcement Learning Problems (RLPs) where they can be seen as subsets of a broader class of Sequential Decision-Making Problems (SDMPs). SDMPs require new decisions on an ongoing basis. Typically the underlying environment changes between decisions. The SDMP view is useful as it allows the unified space to be explored. Solutions can be designed for characteristics of problem instances using algorithms from either community. Little has been done on comparing algorithm performance across these communities, particularly under real-world resource constraints.

Request a copy

Request a copy

Details

Publication date9 Feb 2017
Publication title2016 IEEE Symposium Series on Computational Intelligence, SSCI 2016
PublisherIEEE
Number of pages8
ISBN (Electronic)978-1-5090-4240-1
Original languageEnglish
Event2016 IEEE Symposium Series on Computational Intelligence, SSCI 2016 - Athens, Greece

Conference

Conference2016 IEEE Symposium Series on Computational Intelligence, SSCI 2016
CountryGreece
CityAthens
Period6/12/169/12/16

Bibliographic note

-

DOI

Employable Graduates; Exploitable Research

Copy the text from this field...