Diploma/Master's/Bachelor's Theses and Job Offers
Topics for diploma theses concern the following research areas:
Please contact one of the staff members of the Knowledge-Based Systems Group in case of questions or interest.
Submitted by stf on 27. November 2007 - 18:24 categories [ ]
Here's the general procedure of a thesis at the Knowledge-Based Systems Group:
Finally, we have some general remarks for you.
Submitted by stf on 26. July 2010 - 21:19 categories [ ]
Humanity has crossed the line from being a rural to urban species since 2007. For the first time in history, more people live in cities and urban areas than in the countryside. Starting in the developed ations, where the urbanisation process has been significantly decelerated in the meantime, urbanisation has especially increased in Asia and South America as well as in Africa to a substantial extent in the second half of the last century. Processes of urbanisation have a negative influence on the availability and quality of water resources. Especially in developing and emerging countries, the hydrological and hydrogeological setting of each region is deteriorated through the growing urbanization processes. Often the hydrological and hydrogeological basis of an area is strongly affected by rocesses of urbanisation in these countries. Changes of the structure of urban development going along with the urbanisation will not be without consequences for the environment and water resources.
In frame of this background the Department of Engineering Geology and Hydrogeology of the RWTH Aachen University analysis the interaction between high speed urbanisation/mega-urbanisation and water resources in China and India. In context to this we want to develop a knowledge-based planning and simulation framework.
Submitted by Martin Liebenberg on 12. January 2015 - 18:33 categories [ ]
The goal of this thesis was to integrate Answer Set Programming (ASP) into a Golog system in order to obtain an agent framework that is capable of efficient non-monotonic reasoning with introspection.
Submitted by Jens Claßen on 16. December 2014 - 19:00 categories [ ]
The aim in General Game Playing (GGP) is to create programs called agents that are able to play a yet unknown game after they are given the rules. These programs must thus be as intelligent and as independent as possible to solve problems on their own. A similar research field is represented by Golog and the Situation-Calculus that are well-studied languages and allow reasoning about dynamic domains and diversified sets of problems.
All agents must be able to reason about actions. Hence one approach is to use the Situation-Calculus and Golog to represent games and to express strategies in such games. By introducing Golog to GGP we allow results and methods from both areas to be applied in GGP and vice versa. Accordingly we present an exemplary Golog setup and how to realize it in order to build a General Game Player. For this purpose we discuss how one can overcome the difficulties of translating a formalized game description to its corresponding Golog representation and show how simulations of games can be utilized with methods from Programming by Demonstration (PbD) in order to dynamically develop and maintain executable game strategies during runtime.
We show that our proof of concept agent GologPlayer is able to play turn-based games, supports most Game Description Language (GDL) features and show that it is able to beat randomly playing agents with a success rate of about 70%.
Submitted by Jens Claßen on 16. March 2014 - 19:00 categories [ ]
Based on the framework provided for the Angry Birds AI Competition the task is to develop and implement an agent that is capable to successfully play the game of Angry Birds.
Submitted by stf on 21. August 2013 - 13:20 categories [ ]
Claßen and Lakemeyer recently introduced algorithms for the verification of temporal properties of non-terminating Golog programs, based on the first-order modal Situation Calculus variant ES, and regression-based reasoning. However, while Golog’s high expressiveness is a desirable feature, it also means that their verification procedures cannot be guaranteed to terminate in general. In this thesis, we address this problem by showing that, for a relevant subset, the verification of non-terminating Golog programs is indeed decidable, which is achieved by means of three restrictions. First, we use the ES variant of a decidable two-variable fragment of the Situation Calculus that was introduced by Gu and Soutchanski. Second, we have to restrict the Golog program to contain ground action only. Finally, we consider special classes of successor state axioms, namely the context-free ones and those that only admit local effects.
Submitted by Martin Liebenberg on 13. April 2013 - 19:45 categories [ ]
Our sound localization framework should be adapted to speech signals to enhance human-machine interaction. In order to do this, the system should be able to distinguish between speech signals and ambient noise. Currently, the whole sound mixture that is captured by the microphones is taken into account to establish the sound localization map.
Submitted by Tom Goeckel on 10. January 2011 - 16:18 categories [ ]
To simulate the filtering processes of the cochlea a digital signal should be segregated into an arbitrary number of narrowband signals. In subsequent stages, the software should be able to process the narrowband signals in real time. This requires a high degree of parallelism that is unsufficiently supported by currently available CPUs.
Submitted by Tom Goeckel on 10. January 2011 - 13:04 categories [ ]
In Domestic Service Robotics (DSR) human-robot interaction has to be as natural as possible since the robot should be easily operable even by laymen. Spoken language is a feasible means to do so but commands issued to a robot are often ill-formed or incomplete. The goal is to develop a system that is capable of successfully interpreting such commands.
Submitted by stf on 2. September 2010 - 16:44 categories [ ]