An Optimality Principle for Concurrent Systems

Authors:
Langford B. White;Sarah L. Hickmott
Affiliations:
School of Electrical and Electronic Engineering, The University of Adelaide, Australia;School of Electrical and Electronic Engineering, The University of Adelaide, Australia
Venue:
AI '08 Proceedings of the 21st Australasian Joint Conference on Artificial Intelligence: Advances in Artificial Intelligence
Year:
2008

Citing 5
Cited 0

Dynamic Programming and Optimal Control

Dynamic Programming and Optimal Control
Probabilistic cluster unfoldings

Fundamenta Informaticae
Automated Planning: Theory & Practice

Automated Planning: Theory & Practice
Unfoldings: A Partial-Order Approach to Model Checking (Monographs in Theoretical Computer Science. An EATCS Series)

Unfoldings: A Partial-Order Approach to Model Checking (Monographs in Theoretical Computer Science. An EATCS Series)
Planning via Petri net unfolding

IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence

Quantified Score

Hi-index	0.01

Visualization

Abstract

This paper presents a formulation of an optimality principle for a new class of concurrent decision systems formed by products of deterministic Markov decision processes (MDPs). For a single MDP, the optimality principle reduces to the usual Bellman's equation. The formulation is significant because it provides a basis for the development of optimisation algorithms for decentralised decision systems including a recently proposed method based on Petri Net unfoldings.