Cited by 11Stochastic processes and financial applicationsAdvanced Control Systems OptimizationAdaptive Dynamic Programming Control

Memory-Limited Partially Observable Stochastic Control and Its Mean-Field Control Approach

Open access
Tottori, Takehiro, Kobayashi, Tetsuya J.·2022·Entropy

Abstract

Control problems with incomplete information and memory limitation appear in many practical situations. Although partially observable stochastic control (POSC) is a conventional theoretical framework that considers the optimal control problem with incomplete information, it cannot consider memory limitation. Furthermore, POSC cannot be solved in practice except in special cases. In order to address these issues, we propose an alternative theoretical framework, memory-limited POSC (ML-POSC). ML-POSC directly considers memory limitation as well as incomplete information, and it can be solved in practice by employing the technique of mean-field control theory. ML-POSC can generalize the linear-quadratic-Gaussian (LQG) problem to include memory limitation. Because estimation and control are not clearly separated in the LQG problem with memory limitation, the Riccati equation is modified to the partially observable Riccati equation, which improves estimation as well as control. Furthermore, we demonstrate the effectiveness of ML-POSC for a non-LQG problem by comparing it with the local LQG approximation.

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.3390/e24111599

Cites

50 of 50 references verified0 citation errors · 0 not checkable

Statistics

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Cites

Flagged first, then by citations

Research works printed but not linked: 2

  1. [17]Hansen E.A. Solving POMDPs by Searching in Policy Space Proceedings of the Fourteenth Conference on Uncertainty in Artificial Intelligence Madison, WI, USA 24–26 July 1998 211 219
  2. [21]Poupart P. Boutilier C. Bounded Finite State Controllers Advances in Neural Information Processing Systems MIT Press Cambridge, MA, USA 2003 Volume 16

Cited by

Sorted by citations

Authors
Tottori, T., & Kobayashi, T. J.
Affiliations
  • The University of Tokyo (JP)
  • Institute of Industrial Science, The University of Tokyo (JP)
Corresponding author
Tottori, Takehiro
Venue
Entropy
Publisher
MDPI AG
Published
2022-11-03
Volume
24
Issue
11
Pages
1599
ISSN
1099-4300 (ISSN-L)
OpenAlex
W4308609397
Cited by
11
References
50
Citations by year
2026: 1 · 2025: 4 · 2024: 1 · 2023: 5
FWCI
1.83
Type
journal article
Language
en
Open access
Locations
  • Entropy (publishedVersion, cc-by)
  • PubMed Central (publishedVersion, cc-by)
  • PubMed (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • DOAJ (DOAJ: Directory of Open Access Journals) (submittedVersion, cc-by-sa)
  • arXiv (Cornell University) (cc-by)
Funders
  • JSPS Research Fellowship (21J20436, 19H05799, JPMJCR2011)
  • JSPS KAKENHI (21J20436, 19H05799, JPMJCR2011)
  • JST CREST (21J20436, 19H05799, JPMJCR2011)
Topics
  • Social Sciences › Economics, Econometrics and Finance › Finance › Stochastic processes and financial applications
  • Physical Sciences › Engineering › Control and Systems Engineering › Advanced Control Systems Optimization
  • Physical Sciences › Computer Science › Computational Theory and Mathematics › Adaptive Dynamic Programming Control
Keywords
mean-field control, incomplete information, memory constraints, LQG control

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review