Tim de Bruin

Tim de Bruin

Auto-generated profile, based on publicly available information

Tim de Bruin

Cognitive Robotics Department, Delft University of Technology, Delft, The Netherlands

Research Focus & Metrics

Academic Career Length

11Years (2016-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 January 2018 in Annual Reviews in Control
Verified
Journal Article
Closed access
LBLucian Busoniu
Lucian Busoniu
TBTim de Bruin
Tim de Bruin
DTDomagoj Tolić
Domagoj Tolić
JKJens Kober
Jens Kober
IPIvana Palunko
Ivana Palunko

21 April 2016 in IEEE Transactions on Neural Networks and Learning Systems
Verified
Journal Article
Closed access
TBTim de Bruin
Tim de Bruin
KVKim Verbert
Kim Verbert
RBRobert Babuska
Robert Babuska
Timely detection and identification of faults in railway track circuits are crucial for the safety and availability of railway networks. In this paper, the use of the long-short-term memory (LSTM) recurrent neural network is proposed to accomplish these tasks based on the commonly available measurement signals. By considering the signals from multiple track circuits in a geographic area, faults are diagnosed from their spatial and temporal dependences. A generative model is used to show that the LSTM network can learn these dependences directly from the data. The network correctly classifies 99.7% of the test input sequences, with no false positive fault detections. In addition, the t-Distributed Stochastic Neighbor Embedding (t-SNE) method is used to examine the resulting network, further showing that it has learned the relevant dependences in the data. Finally, we compare our LSTM network with a convolutional network trained on the same task. From this comparison, we conclude that the LSTM network architecture is better suited for the railway track circuit fault detection and identification tasks than the convolutional network.

31 January 2018 in IEEE Robotics and Automation Letters
Verified
Journal Article
Closed access
TBTim de Bruin
Tim de Bruin
JKJens Kober
Jens Kober
KTKarl Tuyls
Karl Tuyls
RBRobert Babuska
Robert Babuska
Most deep reinforcement learning techniques are unsuitable for robotics, as they require too much interaction time to learn useful, general control policies. This problem can be largely attributed to the fact that a state representation needs to be learned as a part of learning control policies, which can only be done through fitting expected returns based on observed rewards. While the reward function provides information on the desirability of the state of the world, it does not necessarily provide information on how to distill a good, general representation of that state from the sensory observations. State representation learning objectives can be used to help learn such a representation. While many of these objectives have been proposed, they are typically not directly combined with reinforcement learning algorithms. We investigate several methods for integrating state representation learning into reinforcement learning. In these methods, the state representation learning objectives help regularize the state representation during the reinforcement learning, and the reinforcement learning itself is viewed as a crucial state representation learning objective and allowed to help shape the representation. Using autonomous racing tests in the TORCS simulator, we show how the integrated methods quickly learn policies that generalize to new environments much better than deep reinforcement learning without state representation learning.