In this work we present a multiagent deep reinforcement learning approach for autonomous driving vehicles that is able to operate in traffic networks with unsignalized intersections. The key aspects of the proposed study are the introduction of route-agents as the main building block of the system, as well as a collision term that allows the cooperation among vehicles and the construction of an efficient reward function. These have the advantage of establishing an enhanced collaborative multiagent deep reinforcement learning scheme that manages to control multiple vehicles and navigate them safely and efficiently-economically to their destination. In addition, it provides the beneficial flexibility to lay down a platform for transfer learning and reusing knowledge from the agents’ policies in handling unknown traffic scenarios. We provide several experimental results in simulated road traffic networks of variable complexity and diverse characteristics using the SUMO environment that empirically illustrate the efficiency of the proposed multiagent framework.

We present a system for multi-class protein classification based on neural networks. The basic issue concerning the construction of neural network systems for protein classification is the sequence encoding scheme that must be used in order to feed the neural network. To deal with this problem we propose a method that maps a protein sequence into a numerical feature space using the matching scores of the sequence to groups of conserved patterns (called motifs) into protein families. We consider two alternative ways for identifying the motifs to be used for feature generation and provide a comparative evaluation of the two schemes. We also evaluate the impact of the incorporation of background features (2-grams) on the performance of the neural system. Experimental results on real datasets indicate that the proposed method is highly efficient and is superior to other well-known methods for protein classification.

Motivation: This paper studies the problem of discovering subsequences, known as motifs, that are common to a given collection of related biosequences, by proposing a greedy algorithm for learning a mixture of motifs model through likelihood maximization. The approach adds sequentially a new motif to a mixture model by performing a combined scheme of global and local search for appropriately initializing its parameters. In addition, a hierarchical partitioning scheme based on kd-trees is presented for partitioning the input dataset in order to speed-up the global searching procedure. The proposed method compares favorably over the well-known MEME approach and treats successfully several drawbacks of MEME. Results: Experimental results indicate that the algorithm is advantageous in identifying larger groups of motifs characteristic of biological families with significant conservation. In addition, it offers better diagnostic capabilities by building more powerful statistical motif-models with improved classification accuracy. Availability: Source code in Matlab is available at http://www.cs.uoi.gr/~kblekas/greedy/GreedyEM.html Contact: kblekas@cs.uoi.gr