skip to main content
research-article

Multi-objective decision-theoretic planning: abstract

Published:08 December 2016Publication History
Skip Abstract Section

Abstract

Decision making is hard. It often requires reasoning about uncertain environments, partial observability and action spaces that are too large to enumerate. In such tasks decision-theoretic agents can often assist us. In most research on decision-theoretic agents, the desirability of actions and their effects is codified in a scalar reward function. However, many real-world decision problems have multiple objectives. In such cases the problem is more naturally expressed using a vector-valued reward function, leading to a multi-objective decision problem (MODP).

References

  1. Guestrin, C., Koller, D., & Parr, R. (2002). Multiagent planning with factored MDPs. In NIPS. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Liu, Q., & Ihler, A. T. (2011). Bounding the partition function using Hölder's inequality. In ICML (pp. 849--856).Google ScholarGoogle Scholar
  3. Mateescu, R., & Dechter, R. (2005). The relationship between AND/OR search and variable elimination. UAI (pp. 380--387). Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Roijers, D., Scharpff, J., Spaan, M., Oliehoek, F., de Weerdt, M., & Whiteson, S. (2014). Bounded approximations for linear multi-objective planning under uncertainty. In ICAPS (pp. 262--270).Google ScholarGoogle Scholar
  5. Roijers, D. M., Whiteson, S., Ihler, A. T., & Oliehoek, F. A. (2015). Variational multi-objective coordination. In Malic.Google ScholarGoogle Scholar
  6. Roijers, D. M., Whiteson, S., & Oliehoek, F. A. (2015a). Computing convex coverage sets for faster multi-objective coordination. JAIR, 52, 399--443. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. Roijers, D. M., Whiteson, S., & Oliehoek, F. A. (2015b). Point-based planning for multi-objective POMDPs. In IJCAI. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. Spaan, M. T. J., & Vlassis, N. (2005). Perseus: Randomized point-based value iteration for POMDPs. JAIR, 195--220. Google ScholarGoogle ScholarDigital LibraryDigital Library

Recommendations

Comments

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Sign in

Full Access

  • Published in

    cover image AI Matters
    AI Matters  Volume 2, Issue 4
    Summer 2016
    21 pages
    EISSN:2372-3483
    DOI:10.1145/3008665
    Issue’s Table of Contents

    Copyright © 2016 Author

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    • Published: 8 December 2016

    Check for updates

    Qualifiers

    • research-article

PDF Format

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader