Veröffentlicht: von .

The 25th Workshop Computational Intelligence 2015, an annual conference held in Nov'2015 by the Computational Intelligence (CI) Chapter of VDI-GMA (Gesellschaft für Mess- und Automatisierungstechnik) in Dortmund, has attributed the Young Author Award to Samineh Bagheri, PhD, scientific member of the research group of Professor Konen at Campus Gummersbach. Congratulations!

Mehr »

Veröffentlicht: von .

poster

The research group supervised by Prof. Wolfgang Konen from TH Köln has a collaboration with the Natural Computing group (head: Prof. Thomas H.W. Bäck) of the LIACS Computer Science department at Leiden University. On October,16th, 2015, a seminar took place in Leiden, Netherlands, in which both groups presented their recent research works.

Mehr »

Veröffentlicht: von .

SACOBRApackage

 

 

 

 

 

 

 

 

We are glad to inform you that SACOBRA package is now available on CRAN. 

SACOBRA package performs surrogate-assisted optimization by utilizing radial basis function interpolation. SACOBRA solver is a derivative-free optimizer appropriate to address constrained expensive optimization problems.

Veröffentlicht: von .

TD-TicTacToe2

A new technical report on temporal difference (TD) learning for games and "self-play" algorithms for game-agent training is available. This report by Wolfgang Konen features a gentle introduction to TD learning for game play and gives hints for the practioner on the implementation of such algorithms . It shows the references to the most recent applications in this field and discusses in an appendix the more advanced topic of eligibility traces and how and why they work.

This report should be a help for people starting new in the field of TD learning for games and for people who work already in this field but struggle with specific details. It is an updated English translation of an earlier report in German language.

Publications

Konen, Wolfgang (2015): Reinforcement Learning for Board Games: The Temporal Difference Algorithm. Research Center CIOP (Computational Intelligence, Optimization and Data Mining) Cologne University of Applied Sciences, 2015.

PDF English

PDF German

Veröffentlicht: von .

Many real-world optimization problems are dealing with constraints. The valid solution for constrained optimization problems (COP) lies somewhere in the feasible region which is a sub-set of the input-space. The borders of the feasible area are defined by one or many constraints. Existance of constraints makes the optimization problems more demanding. There are different approaches to handle the constraints but none of them can outperform all others for all different types of COPs. 

GECCO15

There are only a few constraint handlers which work on the basis of fixing a good "infeasible solution" and generating feasible solutions by using the information coming from the infeasible candidates. We proposed a new technique to repair infeasible solutions. The correspoding work was accepted as a paper in GECCO 2015. A talk about this work will be given in GECCO conference on 11-15 of July in Madrid.

Veröffentlicht: von .

The DAAD price of Cologne University of Applied Sciences (CUAS) goes this year to  Campus Gummersbach. The Iranian master student Samineh Bagheri from the Master programme "Automation & IT" is awarded with this price. Cordial congratulations!

Fachhochschule Köln

© Schmülgen/FH Köln

 

More information on this year's DAAD price are found in the official press release of CUAS (in German). Mrs. Samineh Bagheri currently writes her master thesis in the context of my research project MONREP and she works in MONREP as a student research assistant as well.

Veröffentlicht: von .

The 24th Workshop Computational Intelligence 2014, an annual conference held by Computational Intelligence (CI) Chapter of VDI-GMA (Gesellschaft für Mess- und Automatisierungstechnik) in Dortmund, has attributed the Young Author Award to Patrick Koch, PhD, scientific member of my research group at Campus Gummersbach. I am very happy for him and congratulate him cordially!

Mehr »