Reinforcement learning is a machine learning paradigm that deals with optimisation and learns by interacting with its environment. Tabular reinforcement learning methods are popular because of their relative simplicity combined with good guarantees of finding an optimal solution. The downside is that they suffer from an exponentially growing exploration space, which will obstruct the learning of large tasks. Function approximation is the most commonly used alternative to deal with this problem. It involves interpolating of states that have never been encountered before by learning the values of generalising features. This generalising property is helpful in targeting larger problems and allows for faster learning. Unfortunately, it can be difficult to specify proper features that are required to learn a solution, and convergence cannot always be guaranteed. Generalisation at an even higher level is called transfer learning, where priorly acquired knowledge from one or more tasks is reused to aid the learning process of the next task. This thesis proposes a framework that combines tabular reinforcement learning methods with both of these generalising concepts to achieve a convergent learning process with good generalisation properties. To test the viability of the proposed method, it is used to solve discrete path planning problems. Results of these tests show that simultaneous learning with the help of function approximation in a parallel learning process can be leveraged to achieve a significant reduction in steps in both the first and consecutive tasks.

background

/pdf/tabular-reinforcement-learning-aided-by-generalisation-4e5j5ozjlj.pdf

Algebraic Structure Theory of Sequential Machines

Tabular Reinforcement Learning Aided by Generalisation Methods

/pdf/web-based-system-for-finite-state-machines-decomposition-50hce8by2o.pdf

Web-based system for finite state machines decomposition

Introduction . 1 Lecture 1. Seraiautomata and Automata . , 3 Lecture 2. Coverings and Homomorphisms of Automata 8 Lecture 3. Covering by Direct and Cascade Products of Semiautomata 15 Lecture 4. Permutation and Reset Semiautomata 24 Lecture 5. The Structure Theorem of Krohn and Rhodes . . . .31 Lecture 6. The Necessity of Certain Components in a Cascade Product Covering of a Semiautomaton . . .45 Bibliography 57

Six lectures on algebraic theory of automata

Frequency of decomposability among machines with a large number of states

https://ieeexplore.ieee.org/iel5/12/35072/01672249.pdf

Algebraic Structure Theory of Sequential Machines

Citations

Tabular Reinforcement Learning Aided by Generalisation Methods

Web-based system for finite state machines decomposition

Six lectures on algebraic theory of automata

Frequency of decomposability among machines with a large number of states

Asynchronous Machines Using Controlled Excitationand Flip-Flops

Related Papers (5)

Switching and Finite Automata Theory

Optimal State Assignment for Finite State Machines

MIS: A Multiple-Level Logic Optimization System

Introduction to Automata Theory, Languages, and Computation

Logic Minimization Algorithms for VLSI Synthesis