Pith. sign in

REVIEW

Optimal Control of Logically Constrained Partially Observable and Multi-Agent Markov Decision Processes

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2305.14736 v3 pith:XSTD7BJF submitted 2023-05-24 cs.AI cs.FLcs.SYeess.SY

classification cs.AIcs.FLcs.SYeess.SY
keywords constraintsapproachcontrollogicobservableoptimalpartiallytemporal
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Autonomous systems often have logical constraints arising, for example, from safety, operational, or regulatory requirements. Such constraints can be expressed using temporal logic specifications. The system state is often partially observable. Moreover, it could encompass a team of multiple agents with a common objective but disparate information structures and constraints. In this paper, we first introduce an optimal control theory for partially observable Markov decision processes (POMDPs) with finite linear temporal logic constraints. We provide a structured methodology for synthesizing policies that maximize a cumulative reward while ensuring that the probability of satisfying a temporal logic constraint is sufficiently high. Our approach comes with guarantees on approximate reward optimality and constraint satisfaction. We then build on this approach to design an optimal control framework for logically constrained multi-agent settings with information asymmetry. We illustrate the effectiveness of our approach by implementing it on several case studies.

Discussion (0). Continue with ORCID to comment.

Pith tools