REVIEW 2 cited by
Data-driven Construction of Finite Abstractions for Interconnected Systems: A Compositional Approach
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
Signed reviews
read the original abstract
Finite-state abstractions (a.k.a. symbolic models) present a promising avenue for the formal verification and synthesis of controllers in continuous-space control systems. These abstractions provide simplified models that capture the fundamental behaviors of the original systems. However, the creation of such abstractions typically relies on the availability of precise knowledge concerning system dynamics, which might not be available in many real-world applications. In this work, we introduce a novel data-driven and compositional approach for constructing finite abstractions for interconnected systems comprised of discrete-time control subsystems with partially unknown dynamics. These subsystems interact through a partially unknown static interconnection map. Our methodology for abstracting the interconnected system involves constructing abstractions for individual subsystems and incorporating an abstraction of the interconnection map.
Forward citations
Cited by 2 Pith papers
-
Physics-Informed Reward Machines
Physics-informed reward machines augment reward machines with ODE-driven continuous state, and experiments show that counterfactual experiences and reward shaping built on them speed up reinforcement learning.
-
On-the-Go Path Planning and Repair in Static and Dynamic Scenarios
A periodic re-planning wrapper around a static planner is demonstrated in 2D and 3D simulations with randomly appearing and adversarial obstacles, without quantitative benchmarks or comparison to existing dynamic planners.
Discussion (0). Continue with ORCID to comment.