<span itemscope itemtype="http://schema.org/InformAction"><span style="display:none" itemprop="about" itemscope itemtype="http://schema.org/Person"><meta itemprop="description" content="Einladung von piller@in.tum.de"/></span><span itemprop="object" itemscope itemtype="http://schema.org/Event"><div style=""><table cellspacing="0" cellpadding="8" border="0" summary="" style="width:100%;font-family:Arial,Sans-serif;border:1px Solid #ccc;border-width:1px 2px 2px 1px;background-color:#fff;"><tr><td><meta itemprop="eventStatus" content="http://schema.org/EventScheduled"/><h4 style="padding:6px 0;margin:0 0 4px 0;font-family:Arial,Sans-serif;font-size:13px;line-height:1.4;border:1px Solid #fff;background:#fff;color:#090;font-weight:normal"><strong>Sie wurden zum folgenden Termin eingeladen.</strong></h4><div style="padding:2px"><span itemprop="publisher" itemscope itemtype="http://schema.org/Organization"><meta itemprop="name" content="Google Calendar"/></span><meta itemprop="eventId/googleCalendar" content="5p22f8gglobfq3e73j5und9tah"/><h3 style="padding:0 0 6px 0;margin:0;font-family:Arial,Sans-serif;font-size:16px;font-weight:bold;color:#222"><span itemprop="name">SMT-based AI planning</span></h3><table style="display:inline-table" cellpadding="0" cellspacing="0" border="0" summary="Termindetails"><tr><td style="padding:0 1em 10px 0;font-family:Arial,Sans-serif;font-size:13px;color:#888;white-space:nowrap;width:90px" valign="top"><div><i style="font-style:normal">Wann</i></div></td><td style="padding-bottom:10px;font-family:Arial,Sans-serif;font-size:13px;color:#222" valign="top"><div style="text-indent:-1px"><time itemprop="startDate" datetime="20201021T120000Z"></time><time itemprop="endDate" datetime="20201021T122000Z"></time>Mi 21. Okt. 2020 14:00 – 14:20 <span style="color:#888">Mitteleuropäische Zeit - Berlin</span></div></td></tr><tr><td style="padding:0 1em 10px 0;font-family:Arial,Sans-serif;font-size:13px;color:#888;white-space:nowrap;width:90px" valign="top"><div><i style="font-style:normal">Wo</i></div></td><td style="padding-bottom:10px;font-family:Arial,Sans-serif;font-size:13px;color:#222" valign="top"><div style="text-indent:-1px"><span itemprop="location" itemscope itemtype="http://schema.org/Place"><span itemprop="name" class="notranslate">ls21coffee</span><span dir="ltr"> (<a href="https://www.google.com/maps/search/ls21coffee?hl=de" style="color:#20c;white-space:nowrap" target="_blank" itemprop="map">Karte</a>)</span></span></div></td></tr><tr><td style="padding:0 1em 4px 0;font-family:Arial,Sans-serif;font-size:13px;color:#888;white-space:nowrap;width:90px" valign="top"><div><i style="font-style:normal">Teilnahmeinformationen</i></div></td><td style="padding-bottom:4px;font-family:Arial,Sans-serif;font-size:13px;color:#222" valign="top"><div style="text-indent:-1px">Teilnehmen mit: Google Meet</div></td></tr><tr><td style="padding:0 1em 10px 0;font-family:Arial,Sans-serif;font-size:13px;color:#888;white-space:nowrap;width:90px"></td><td style="padding-bottom:10px;font-family:Arial,Sans-serif;font-size:13px;color:#222" valign="top"><div style="text-indent:-1px"><div style="text-indent:-1px"><span itemprop="potentialaction" itemscope itemtype="http://schema.org/JoinAction"><span itemprop="name" content="meet.google.com/jci-yqqc-doe"><span itemprop="target" itemscope itemtype="http://schema.org/EntryPoint"><span itemprop="url" content="https://meet.google.com/jci-yqqc-doe"><span itemprop="httpMethod" content="GET"><a href="https://meet.google.com/jci-yqqc-doe" style="color:#20c;white-space:nowrap" target="_blank">meet.google.com/jci-yqqc-doe</a></span></span></span></span></span> </div></div></td></tr><tr><td style="padding:0 1em 10px 0;font-family:Arial,Sans-serif;font-size:13px;color:#888;white-space:nowrap;width:90px" valign="top"><div><i style="font-style:normal">Kalender</i></div></td><td style="padding-bottom:10px;font-family:Arial,Sans-serif;font-size:13px;color:#222" valign="top"><div style="text-indent:-1px">club2@mailbroy.informatik.tu-muenchen.de</div></td></tr><tr><td style="padding:0 1em 10px 0;font-family:Arial,Sans-serif;font-size:13px;color:#888;white-space:nowrap;width:90px" valign="top"><div><i style="font-style:normal">Wer</i></div></td><td style="padding-bottom:10px;font-family:Arial,Sans-serif;font-size:13px;color:#222" valign="top"><table cellspacing="0" cellpadding="0"><tr><td style="padding-right:10px;font-family:Arial,Sans-serif;font-size:13px;color:#222;width:10px"><div style="text-indent:-1px"><span style="font-family:Courier New,monospace">&#x2022;</span></div></td><td style="padding-right:10px;font-family:Arial,Sans-serif;font-size:13px;color:#222"><div style="text-indent:-1px"><div><div style="margin:0 0 0.3em 0"><span class="notranslate">piller@in.tum.de</span><span style="font-size:11px;color:#888">- Veranstalter</span></div></div></div></td></tr><tr><td style="padding-right:10px;font-family:Arial,Sans-serif;font-size:13px;color:#222;width:10px"><div style="text-indent:-1px"><span style="font-family:Courier New,monospace">&#x2022;</span></div></td><td style="padding-right:10px;font-family:Arial,Sans-serif;font-size:13px;color:#222"><div style="text-indent:-1px"><div><div style="margin:0 0 0.3em 0"><span itemprop="attendee" itemscope itemtype="http://schema.org/Person"><span itemprop="name" class="notranslate">ge72yet@mytum.de</span><meta itemprop="email" content="ge72yet@mytum.de"/></span></div></div></div></td></tr><tr><td style="padding-right:10px;font-family:Arial,Sans-serif;font-size:13px;color:#222;width:10px"><div style="text-indent:-1px"><span style="font-family:Courier New,monospace">&#x2022;</span></div></td><td style="padding-right:10px;font-family:Arial,Sans-serif;font-size:13px;color:#222"><div style="text-indent:-1px"><div><div style="margin:0 0 0.3em 0"><span itemprop="attendee" itemscope itemtype="http://schema.org/Person"><span itemprop="name" class="notranslate">club2@mailbroy.informatik.tu-muenchen.de</span><meta itemprop="email" content="club2@mailbroy.informatik.tu-muenchen.de"/></span></div></div></div></td></tr></table></td></tr></table><div style="float:right;font-weight:bold;font-size:13px"> <a href="https://www.google.com/calendar/event?action=VIEW&eid=NXAyMmY4Z2dsb2JmcTNlNzNqNXVuZDl0YWggY2x1YjJAbWFpbGJyb3kuaW5mb3JtYXRpay50dS1tdWVuY2hlbi5kZQ&tok=NTIjc2U2ZWJlM3RvZmY0Y2g1bm11bmlibTVtOThAZ3JvdXAuY2FsZW5kYXIuZ29vZ2xlLmNvbWQ5MDQ4NWY1ODM2MTBiZGI2ZDVkYjFkNzJjNzg0NDE0MzQ3NDUxYTQ&ctz=Europe%2FBerlin&hl=de&es=0" style="color:#20c;white-space:nowrap" itemprop="url">Mehr Details »</a><br></div><div style="padding-bottom:15px;font-family:Arial,Sans-serif;font-size:13px;color:#222;white-space:pre-wrap!important;white-space:-moz-pre-wrap!important;white-space:-pre-wrap!important;white-space:-o-pre-wrap!important;white-space:pre;word-wrap:break-word"><span><br>Speaker: Malek Souissi<p>Type: Bachelor's Thesis Presentation</p><p>Abstract: A successful technique for AI planning, introduced by  Henry Kautz and Bart Selman in [KS92], is based on propositional satisfiability (SAT). The main idea lies in encoding a planning problem into a propositional formula that is satisfiable iff a plan exists for the given problem. A plan can then be extracted from the satisfying model. In some cases, it is of higher interest to find the optimal plan for a given problem (i.e. a plan with the lowest possible cost). Our aim is to adapt the SAT-based planning approach to solve the optimal planning problem by introducing action costs in an SMT-encoding of the problem. However, one crucial requirement for the completeness and efficiency of this approach is the completeness threshold. That is a bound k, such that, if no plan exists of length less or equal to k, then no plan exists for the corresponding problem (with a cost bound in case of optimal planning).</p><p>In this thesis we first port existing code for computing upper bounds on the diameter from c++ to sml. We then improve upon the existing algorithms and experiment with different approaches and configurations. In the second part of the thesis, we introduce an any-time algorithm for optimal planning which iteratively finds plans with lower costs until an optimal plan is found or a timelimit is reached. In this part, we experiment with different SMT-encodings and also SMT-solvers. We then try out some techniques that potentially reduce the time needed to prove optimality by relaxing the problem and assess the difference in performance.</p></span><meta itemprop="description" content="
Speaker: Malek Souissi

Type: Bachelor's Thesis Presentation

Abstract: A successful technique for AI planning, introduced by  Henry Kautz and Bart Selman in [KS92], is based on propositional satisfiability (SAT). The main idea lies in encoding a planning problem into a propositional formula that is satisfiable iff a plan exists for the given problem. A plan can then be extracted from the satisfying model. In some cases, it is of higher interest to find the optimal plan for a given problem (i.e. a plan with the lowest possible cost). Our aim is to adapt the SAT-based planning approach to solve the optimal planning problem by introducing action costs in an SMT-encoding of the problem. However, one crucial requirement for the completeness and efficiency of this approach is the completeness threshold. That is a bound k, such that, if no plan exists of length less or equal to k, then no plan exists for the corresponding problem (with a cost bound in case of optimal planning).

In this thesis we first port existing code for computing upper bounds on the diameter from c++ to sml. We then improve upon the existing algorithms and experiment with different approaches and configurations. In the second part of the thesis, we introduce an any-time algorithm for optimal planning which iteratively finds plans with lower costs until an optimal plan is found or a timelimit is reached. In this part, we experiment with different SMT-encodings and also SMT-solvers. We then try out some techniques that potentially reduce the time needed to prove optimality by relaxing the problem and assess the difference in performance."/></div></div><p style="color:#222;font-size:13px;margin:0"><span style="color:#888">Teilnehmen (club2@mailbroy.informatik.tu-muenchen.de)?   </span><wbr><strong><span itemprop="potentialaction" itemscope itemtype="http://schema.org/RsvpAction"><meta itemprop="attendance" content="http://schema.org/RsvpAttendance/Yes"/><span itemprop="handler" itemscope itemtype="http://schema.org/HttpActionHandler"><link itemprop="method" href="http://schema.org/HttpRequestMethod/GET"/><a href="https://www.google.com/calendar/event?action=RESPOND&eid=NXAyMmY4Z2dsb2JmcTNlNzNqNXVuZDl0YWggY2x1YjJAbWFpbGJyb3kuaW5mb3JtYXRpay50dS1tdWVuY2hlbi5kZQ&rst=1&tok=NTIjc2U2ZWJlM3RvZmY0Y2g1bm11bmlibTVtOThAZ3JvdXAuY2FsZW5kYXIuZ29vZ2xlLmNvbWQ5MDQ4NWY1ODM2MTBiZGI2ZDVkYjFkNzJjNzg0NDE0MzQ3NDUxYTQ&ctz=Europe%2FBerlin&hl=de&es=0" style="color:#20c;white-space:nowrap" itemprop="url">Ja</a></span></span><span style="margin:0 0.4em;font-weight:normal"> - </span><span itemprop="potentialaction" itemscope itemtype="http://schema.org/RsvpAction"><meta itemprop="attendance" content="http://schema.org/RsvpAttendance/Maybe"/><span itemprop="handler" itemscope itemtype="http://schema.org/HttpActionHandler"><link itemprop="method" href="http://schema.org/HttpRequestMethod/GET"/><a href="https://www.google.com/calendar/event?action=RESPOND&eid=NXAyMmY4Z2dsb2JmcTNlNzNqNXVuZDl0YWggY2x1YjJAbWFpbGJyb3kuaW5mb3JtYXRpay50dS1tdWVuY2hlbi5kZQ&rst=3&tok=NTIjc2U2ZWJlM3RvZmY0Y2g1bm11bmlibTVtOThAZ3JvdXAuY2FsZW5kYXIuZ29vZ2xlLmNvbWQ5MDQ4NWY1ODM2MTBiZGI2ZDVkYjFkNzJjNzg0NDE0MzQ3NDUxYTQ&ctz=Europe%2FBerlin&hl=de&es=0" style="color:#20c;white-space:nowrap" itemprop="url">Vielleicht</a></span></span><span style="margin:0 0.4em;font-weight:normal"> - </span><span itemprop="potentialaction" itemscope itemtype="http://schema.org/RsvpAction"><meta itemprop="attendance" content="http://schema.org/RsvpAttendance/No"/><span itemprop="handler" itemscope itemtype="http://schema.org/HttpActionHandler"><link itemprop="method" href="http://schema.org/HttpRequestMethod/GET"/><a href="https://www.google.com/calendar/event?action=RESPOND&eid=NXAyMmY4Z2dsb2JmcTNlNzNqNXVuZDl0YWggY2x1YjJAbWFpbGJyb3kuaW5mb3JtYXRpay50dS1tdWVuY2hlbi5kZQ&rst=2&tok=NTIjc2U2ZWJlM3RvZmY0Y2g1bm11bmlibTVtOThAZ3JvdXAuY2FsZW5kYXIuZ29vZ2xlLmNvbWQ5MDQ4NWY1ODM2MTBiZGI2ZDVkYjFkNzJjNzg0NDE0MzQ3NDUxYTQ&ctz=Europe%2FBerlin&hl=de&es=0" style="color:#20c;white-space:nowrap" itemprop="url">Nein</a></span></span></strong>    <wbr><a href="https://www.google.com/calendar/event?action=VIEW&eid=NXAyMmY4Z2dsb2JmcTNlNzNqNXVuZDl0YWggY2x1YjJAbWFpbGJyb3kuaW5mb3JtYXRpay50dS1tdWVuY2hlbi5kZQ&tok=NTIjc2U2ZWJlM3RvZmY0Y2g1bm11bmlibTVtOThAZ3JvdXAuY2FsZW5kYXIuZ29vZ2xlLmNvbWQ5MDQ4NWY1ODM2MTBiZGI2ZDVkYjFkNzJjNzg0NDE0MzQ3NDUxYTQ&ctz=Europe%2FBerlin&hl=de&es=0" style="color:#20c;white-space:nowrap" itemprop="url">Weitere Optionen »</a></p></td></tr><tr><td style="background-color:#f6f6f6;color:#888;border-top:1px Solid #ccc;font-family:Arial,Sans-serif;font-size:11px"><p>Einladung von <a href="https://www.google.com/calendar/" target="_blank" style="">Google Kalender</a></p><p>Sie erhalten diese E-Mail unter club2@mailbroy.informatik.tu-muenchen.de, da Sie ein Gast bei diesem Termin sind.</p><p>Lehnen Sie diesen Termin ab, um keine weiteren Informationen zu diesem Termin zu erhalten. Sie können auch unter https://www.google.com/calendar/ ein Google-Konto erstellen und Ihre Benachrichtigungseinstellungen für Ihren gesamten Kalender steuern.</p><p>Wenn Sie diese Einladung weiterleiten, kann jeder Empfänger eine Antwort an den Organisator senden und zur Gästeliste hinzugefügt werden. Außerdem könnte er weitere Nutzer einladen und Ihre Antwort ändern. <a href="https://support.google.com/calendar/answer/37135#forwarding">Weitere Informationen</a>.</p></td></tr></table></div></span></span>