<?xml version="1.0" encoding="UTF-8"?><rss xmlns:dc="http://purl.org/dc/elements/1.1/" version="2.0">
<channel>
<title>Künstliche Intelligenz 28(1) - März 2014</title>
<link>http://dl.gi.de/handle/20.500.12116/11088</link>
<description/>
<pubDate>Thu, 23 Jul 2026 05:49:34 GMT</pubDate>
<dc:date>2026-07-23T05:49:34Z</dc:date>
<item>
<title>Towards Learning of Generic Skills for Robotic Manipulation</title>
<link>http://dl.gi.de/handle/20.500.12116/11396</link>
<description>Towards Learning of Generic Skills for Robotic Manipulation
Metzen, Jan Hendrik; Fabisch, Alexander; Senger, Lisa; Gea Fernández, José; Kirchner, Elsa Andrea
Learning versatile, reusable skills is one of the key prerequisites for autonomous robots. Imitation and reinforcement learning are among the most prominent approaches for learning basic robotic skills. However, the learned skills are often very specific and cannot be reused in different but related tasks. In the project 'Behaviors for Mobile Manipulation', we develop hierarchical and transfer learning methods which allow a robot to learn a repertoire of versatile skills that can be reused in different situations. The development of new methods is closely integrated with the analysis of complex human behavior.
</description>
<pubDate>Wed, 01 Jan 2014 00:00:00 GMT</pubDate>
<guid isPermaLink="false">http://dl.gi.de/handle/20.500.12116/11396</guid>
<dc:date>2014-01-01T00:00:00Z</dc:date>
</item>
<item>
<title>Transfer of Domain Knowledge in Plan Generation: Learning Goal-dependent Annulling Conditions for Actions</title>
<link>http://dl.gi.de/handle/20.500.12116/11395</link>
<description>Transfer of Domain Knowledge in Plan Generation: Learning Goal-dependent Annulling Conditions for Actions
Siebers, Michael
In this paper we present an approach to avoid dead-ends during automated plan generation. A first-order logic formula can be learned that holds in a state if the application of a specific action will lead to a dead-end. Starting from small problems within a problem domain examples of states where the application of the action will lead to a dead-end will be collected. The states will be generalized using inductive logic programming to a first-order logic formula. We will show how different notions of goal-dependence could be integrated in this approach. The formula learned will be used to speed-up automated plan generation. Furthermore, it provides insight into the planning domain under consideration.
</description>
<pubDate>Wed, 01 Jan 2014 00:00:00 GMT</pubDate>
<guid isPermaLink="false">http://dl.gi.de/handle/20.500.12116/11395</guid>
<dc:date>2014-01-01T00:00:00Z</dc:date>
</item>
<item>
<title>Regularization-Based Multitask Learning With Applications to Genome Biology and Biological Imaging</title>
<link>http://dl.gi.de/handle/20.500.12116/11390</link>
<description>Regularization-Based Multitask Learning With Applications to Genome Biology and Biological Imaging
Widmer, Christian; Kloft, Marius; Lou, Xinghua; Rätsch, Gunnar
The aim of multitask learning is to improve the generalization performance of a set of related tasks by exploiting complementary information about the tasks. In this paper, we review established approaches for regularization based multitask learning, sketch some recent developments, and demonstrate their applications in Computational Biology and Biological Imaging.
</description>
<pubDate>Wed, 01 Jan 2014 00:00:00 GMT</pubDate>
<guid isPermaLink="false">http://dl.gi.de/handle/20.500.12116/11390</guid>
<dc:date>2014-01-01T00:00:00Z</dc:date>
</item>
<item>
<title>Interview with Peter Stone and Matthew E. Taylor</title>
<link>http://dl.gi.de/handle/20.500.12116/11389</link>
<description>Interview with Peter Stone and Matthew E. Taylor
Kudenko, Daniel
</description>
<pubDate>Wed, 01 Jan 2014 00:00:00 GMT</pubDate>
<guid isPermaLink="false">http://dl.gi.de/handle/20.500.12116/11389</guid>
<dc:date>2014-01-01T00:00:00Z</dc:date>
</item>
</channel>
</rss>
