Skip to content
Book Open access

Robust Exploration in Directed Controller Synthesis via Mixture-of-Experts Reinforcement Learning

Apr 2026 · SEAMS@ICSE · pp. 38-42 · 1 citation · 38 references
Computer Science

TL;DR

A Mixture-of-Experts framework that combines multiple policies, leveraging their complementary strengths to form a more robust exploration policy is proposed, and the evaluation on the Air Traffic benchmark shows that this proposal significantly increases the number of solvable instances.

Abstract

Controller synthesis is a promising approach as a planner for self-adaptive systems, as it can automatically re-synthesize control strategies that satisfy the specified properties in response to runtime changes. To enhance efficiency, Directed Controller Synthesis prunes the search space by incrementally constructing a partial view of the system, aiming to find a valid controller without exhaustive exploration. This process is steered by an exploration policy (i.e., heuristic), and Reinforcement Learning has proven highly effective for learning such policies. However, a key challenge is anisotropic generalization, i.e., a policy trained on specific domain parameters is specialized, performing well in certain scenarios while remaining fragile in others. To this end, we propose a Mixture-of-Experts framework that combines multiple policies, leveraging their complementary strengths to form a more robust exploration policy. The evaluation on the Air Traffic benchmark shows that our proposal significantly increases the number of solvable instances.

Read PDF

Similar papers

Preprint Sep 2026

Policy Gradient over History-Dependent Policy Classes for LQR with Domain Randomization

This work first study PG of domain randomized LQR over history-dependent policy classes, such as finite impulse response controllers, as they can extend the possibilities of simultaneous stabilization, and proposes a curriculum learning based algorithm which gradually expands the memory of the controller.

Tesshu Fujinami, Bruce D. Lee, Anastasios Tsiamis et al. · 0 citations
#artificial intelligence Preprint Sep 2026

SUN: Reaching for Novelty in Reinforcement Learning

This paper proposes SUccessor-to-Novelty (SUN), an indicator derived from successor value functions to identify goals that are both novel and reachable and presents an adaptive goal-selection strategy that leverages these properties, and an accurate yet lightweight pseudocount to avoid the overhead of classic methods.

Wen-Yan Yang, A. Mustafin, Dominik Baumann et al. · 0 citations
Jul 2026

Bridging Reinforcement Learning and Optimal Control via Feasible Action Mapping

This work presents Feasible Action for Optimal Control (FAOC), a novel control framework integrating Reinforcement Learning (RL) and Optimal Control (OC), with a computationally efficient, optimization-based mapping algorithm that transforms the RL agent's action from a static abstract set into a state-dependent feasib...

Stefan Richter, Alberto Giammarino, G. Torrente et al. · 0 citations
#machine learning Preprint Sep 2026

Safe Meta-Reinforcement Learning via Information Space Reachability

This paper proposes a safe meta-RL framework that explicitly accounts for safety during adaptation, and develops a safe meta-RL algorithm that learns the safety value function and leverages it for safety filtering and constrained policy optimization.

Ze-Yang Li, Sunbochen Tang, Navid Azizan · 0 citations

Declarative Specifications for Efficient and Safe Reinforcement Learning

This dissertation presents a work in safe RL, where agents must also respect safety constraints using pure-past linear-time temporal logic (PPLTL), and presents how to enforce safety constraints using pure-past linear-time temporal logic (PPLTL).

Giovanni Varricchione · 0 citations
#natural language process... Preprint Sep 2026

Expert-Space Exploration in MoE Reinforcement Learning

ESRL is introduced, an architecture-aware framework that explicitly explores the expert-routing space of MoE models, and preserves high-confidence experts as anchors, and restricts stochastic routing to a plausible candidate pool, thereby retaining reliable computation paths.

Hong-Yi He, Zheng-Wen Lin, Xiao Liu et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.