Robotino Bonding Hackathon 2013

Submitted by tim on 12. November 2013 - 14:40

Together with Bonding, the IMA/ZLW & IFU Institute Cluster, RWTH Aachen University and the Department for Electrical Engineering and Information Technology, Robotics Group, FH Aachen we will host the Robotino Bonding Hackathon. Students will compete in small teams to develop the behavior of a robot operating in a simplified desaster scenario to develop effective behavior strategies to recover and prioritize items from the arena.

The event is organized by the Carologistics RoboCup Team.

Einführung in die Informatik WS 2013/2014

Submitted by stf on 2. October 2013 - 18:55

Die Veranstaltung "Einführung in die Informatik" ist eine der von der Fachgruppe Informatik seit dem Wintersemester 2001/2002 angebotenen Einführungsvorlesungen für Hörer aller Fakultäten:

  • Programmierung (Java) (WS)
  • Einführung in die Informatik (WS)
  • Algorithmen und Datenstrukturen (SS)
  • Software-Entwicklung (SS)
im Online-Vorlesungsverzeichnis CAMPUS finden Sie Einträge zu zu dieser Veranstaltung.

Lecture - Introduction to Artificial Intelligence WS 2013/2014

Submitted by Christoph Schwering on 24. September 2013 - 5:17
See Campus for announcements for Note:
  • To access the L2P room, you need to register for the course in Campus ("Zum klassischen Anmeldeverfahren"). There we publish slides, announcements, etc.
  • To take the exam, you need to do the modular registration process which closes 22 November.
Lab Course "Robot System Management" WS 2013/2014 tim 9. July 2013 - 20:06

An announcement of the course can eventually be found in the course information system CAMPUS.

Diploma Thesis: Towards Decidable Verification of Non-Terminating Golog Programs [completed]

Submitted by Martin Liebenberg on 13. April 2013 - 20:45

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.

Seminar Plan and Activity Recognition SS 2013

Submitted by Christoph Schwering on 11. January 2013 - 15:14

In this seminar we will study several different approaches to and aspects of plan and activity recognition. Recognizing what other agents are doing is an important aspect of intelligent systems. For example, a domestic service robot needs to understand what the human is doing in order to interact with him in a reasonable way. And a self-driving car should know what the other traffic participants are doing right now and infer what they are going to do in the next moments. Different domains bring along different problems and needs for levels of expressiveness like partial observability, incomplete knowledge, non-deterministic actions, adversarial agents, potentially hazardous situations. We will study some of the latest research on these problems and work out the particular strengths and weaknesses.

The topics include recent papers on plan and activity recognition.