How to discretize continuous state-action spaces in Q-learning: A symbolic control approach
Sadek Belamfedel Alaoui, Adnane Saoud

TL;DR
This paper introduces a symbolic control approach with a novel Q-learning technique for discretizing continuous state-action spaces, enabling near-optimal control with bounded Q-value approximation and adjustable accuracy.
Contribution
It proposes a symbolic model with a new Q-learning algorithm that bounds Q-values and balances accuracy and complexity, advancing control synthesis for continuous spaces.
Findings
Q-tables bound original system Q-values
Algorithm achieves arbitrary accuracy in control
Case studies validate practical effectiveness
Abstract
Q-learning is widely recognized as an effective approach for synthesizing controllers to achieve specific goals. However, handling challenges posed by continuous state-action spaces remains an ongoing research focus. This paper presents a systematic analysis that highlights a major drawback in space discretization methods. To address this challenge, the paper proposes a symbolic model that represents behavioral relations, such as alternating simulation from abstraction to the controlled system. This relation allows for seamless application of the synthesized controller based on abstraction to the original system. Introducing a novel Q-learning technique for symbolic models, the algorithm yields two Q-tables encoding optimal policies. Theoretical analysis demonstrates that these Q-tables serve as both upper and lower bounds on the Q-values of the original system with continuous spaces.…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsNeural Networks and Applications
MethodsQ-Learning
