Pith. sign in

REVIEW

Approximate Information States for Worst-Case Control and Learning in Uncertain Systems

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 2301.05089 v2 pith:FDBUPZLL submitted 2023-01-12 eess.SY cs.AIcs.SYmath.OC

classification eess.SYcs.AIcs.SYmath.OC
keywords informationapproximatestatesuncertainboundedconditionscontroldecision-making
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

In this paper, we investigate discrete-time decision-making problems in uncertain systems with partially observed states. We consider a non-stochastic model, where uncontrolled disturbances acting on the system take values in bounded sets with unknown distributions. We present a general framework for decision-making in such problems by using the notion of the information state and approximate information state, and introduce conditions to identify an uncertain variable that can be used to compute an optimal strategy through a dynamic program (DP). Next, we relax these conditions and define approximate information states that can be learned from output data without knowledge of system dynamics. We use approximate information states to formulate a DP that yields a strategy with a bounded performance loss. Finally, we illustrate the application of our results in control and reinforcement learning using numerical examples.

Discussion (0). Continue with ORCID to comment.

Pith tools