Artificial Intelligence

Proseminar Artificial Intelligence SS 2014

Submitted by stf on 6. January 2014 - 3:05

The SS 2014 proseminar will be on different (sub-)topics from artificial intelligence. We largely follow the lines of the well known textbook by Stuart Russell and Peter Norvig "Artificial Intelligence - A Modern Approach".

We plan to implement a peer review process for this seminar. That is, every student will read some other students' term paper and provide feedback in form of a written review. This shall not only deepen your understanding of the other topics, but it also introduces you to the academic review process.

Seminar Dynamics of Knowledge and Belief SS 2014

Submitted by Christoph Schwering on 6. January 2014 - 0:08

In this seminar we will study several modeling and reasoning techniques for knowledge and belief in dynamic systems. Knowledge is an important aspect of intelligent programs: while most of today's systems assume a closed world, i.e., everything they don't know to be true is assumed to be false, an intelligent system needs to consider possible that there are truths not known to the system. In a dynamic environment, i.e., an environment where one or multiple agents (inter)act, the system will usually have to acquire new knowledge through sensing. Potentially it may even revise its beliefs when it realizes some beliefs were wrong. In this seminar we will study various aspects of action, knowledge, and belief.

We plan to implement a peer review process for this seminar. That is, every student will read some other students' term paper and provide feedback in form of a written review. This shall not only deepen your understanding of the other topics, but it also introduces you to the academic review process.

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.

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.

Angry Birds AI Competition

Submitted by stf on 30. July 2013 - 12:43

Computer games have gained attention as a testbed for research in AI and related disciplines early already. A recent addition to the set of games that is being used in this regard is Angry Birds. It offers several interesting aspects in terms of research such as reasoning about physical effects and qualitative spatial reasoning, to name just two. The KBSG has recently engaged in this new testbed, participating as Team Akbaba in the Angry Birds AI Competition founded in 2012.

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.

Hybris-C1: Planning and Action Control under Uncertainty for Mobile Manipulation Tasks

Submitted by Jens Claßen on 1. February 2013 - 19:00

Mobile robots that are deployed, for instance, for domestic tasks, need to fulfill them even if they do not have complete information about the domain beforehand. Consider, for example, the task of fetching an object from a specific room. Consider further that the robot has a map of the environment and that it can plan a path to the living room. However, only when reaching the door of the living room, it will know whether or not the door is open. Moreover, it might not be known where in the living room the object is located such that the robot needs to make a plan how to find it. Next, a plan for grabbing the object in a safe way is required. This includes taking camera shots from different angles and finding an appropriate location to grab the object. Basically, the action control of the robot continuously needs to combine active perception and high-level planning with action execution. The robot has to deal with qualitative action and world descriptions as well as with uncertainty and quantitative data from sensors and actuators. The objective of this project is to develop methods for solving tasks like the above in an intelligent way by combining perception, high-level planning and action execution. An evaluation of the developed methods will be conducted on existing mobile robotic platforms.

Hybris-A1: Verification of Non-Terminating Action Programs

Submitted by Jens Claßen on 1. February 2013 - 19:00

The action language GOLOG has been used, among other things, for the specification of the behaviour of mobile robots. Since the task of such autonomous systems is typically open-ended, their GOLOG programs are usually non-terminating. To ensure that the program will let the robot exhibit the intended behaviour, it is often desirable to be able to formally specify and then verify the desired properties, which are often of a temporal nature. This task has been studied within our preliminary work from two perspectives: On the one hand, the problem was tackled for very expressive specification and action program formalisms, but without the goal of achieving decidability, i.e. the developed verification methods were not guaranteed to terminate. On the other hand, the verification problem was studied for action formalisms based on decidable description logics and very limited means of specifying admissible sequences of actions, which allowed us to show decidability and complexity results for the verification problem. The purpose of this project is to combine the advantages of both approaches by, on one hand, developing verification methods for GOLOG programs that are effective and practically feasible and, on the other hand, going beyond the formalisms with very limited expressiveness to enhance their usefulness. Among other things, both qualitative and quantitative temporal program properties will be addressed.