Distributed Control using Reinforcement Learning with Temporal-Logic-Based Reward Shaping
Not on the map. Why?
Abstract (arXiv)
We present a computational framework for synthesis of distributed control strategies for a heterogeneous team of robots in a partially observable environment. The goal is to cooperatively satisfy specifications given as Truncated Linear Temporal Logic (TLTL) formulas. Our approach formulates the synthesis problem as a stochastic game and employs a policy graph method to find a control strategy with memory for each agent. We construct the stochastic game on the product between the team transition system and a finite state automaton (FSA) that tracks the satisfaction of the TLTL formula. We use the quantitative semantics of TLTL as the reward of the game, and further reshape it using the FSA to guide and accelerate the learning process. Simulation results demonstrate the efficacy of the proposed solution under demanding task specifications and the effectiveness of reward shaping in significantly accelerating the speed of learning.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 8 of its 19 references that are in the map. First posted on arXiv 8 Mar 2022.
Builds on
8 of 19 references.
References · 8
- 2017Proximal Policy Optimization Algorithmscited by 14,441
- 2015Trust Region Policy Optimizationcited by 2,503
- 2019Multi-Agent Reinforcement Learning: A Selective Overview of Theories and Algorithmscited by 555
- 2015Deep Recurrent Q-Learning for Partially Observable MDPscited by 457
- 2016Reinforcement Learning With Temporal Logic Rewardscited by 114
- 2018Multi-Agent Reinforcement Learning Based Resource Allocation for UAV Networkscited by 54
- 2021Multi-Agent Reinforcement Learning with Temporal Logic Specificationscited by 27
- 2013Learning Finite-State Controllers for Partially Observable Environmentscited by 18
Built on by
Citing papers per year: 2022: 1; 2023: 1.
2 papers.