[Club2] Invitation: Computing Upper Bounds on Plan Lengths @ Wed Oct 30, 2019 14:00 - 14:30 (CET) (club2 at mailbroy.informatik.tu-muenchen.de)

[julianbrunner at gmail.com]

You have been invited to the following event.

Title: Computing Upper Bounds on Plan Lengths
Speaker: Dominik Berger
Type: Bachelor's Thesis Presentation

Abstract:

A successful technique for solving planning problems is based on  
propositional satisfiability (SAT). The completeness of SAT based planning  
can be shown by computing a completeness threshold. The SAT-planning bound  
k is then set to the completeness threshold. If no plan can then be found,  
there exists not any plan for the given problem. One prominent completeness  
threshold is the recurrence diameter. The recurrence diameter is the length  
of the longest path without repeated states in the state space of the  
planning problem.

We present multiple approaches for finding the recurrence diameter of both  
directed graphs, as well as for planning problems. We first calculate it  
for directed graphs, both once by using a SAT solver and once by using an  
SMT solver. For planning problems, we first show an approach whereby we  
compute the recurrence diameter by abstracting the planning problem into a  
directed graph, on which we can, in general, use one of the first two  
methods. In practice, however, only the SMT approach will be feasible.  
Furthermore, we also present a way to compute the recurrence diameter of a  
planning problem directly using an SMT solver, therefore skipping the  
translation into a directed graph, and also giving the SMT solver a better  
structured problem, which improves the performance of the computation.  
Finally, we evaluate the approaches by computing the recurrence diameter  
for multiple directed graphs, as well as for abstractions of planning  
problems.
When: Wed Oct 30, 2019 14:00 – 14:30 Central European Time - Berlin
Where: MI 00.09.038 (Turing)
Calendar: club2 at mailbroy.informatik.tu-muenchen.de
Who:
     * julianbrunner at gmail.com - creator
     * dmnkbrgr at gmail.com
     * club2 at mailbroy.informatik.tu-muenchen.de

Event details:  
https://www.google.com/calendar/event?action=VIEW&eid=NnFsdGJwMDZpaHJsNHZuZTgxNHZuMmltNzAgY2x1YjJAbWFpbGJyb3kuaW5mb3JtYXRpay50dS1tdWVuY2hlbi5kZQ&tok=NTIjc2U2ZWJlM3RvZmY0Y2g1bm11bmlibTVtOThAZ3JvdXAuY2FsZW5kYXIuZ29vZ2xlLmNvbTkyYzI0NjE2NTM1ZjY1ZDRhNWY4ZTE3ZWUyZWU0ZWZhNjhkOWVlZmY&ctz=Europe%2FBerlin&hl=en&es=0

Invitation from Google Calendar: https://www.google.com/calendar/

You are receiving this courtesy email at the account  
club2 at mailbroy.informatik.tu-muenchen.de because you are an attendee of  
this event.

To stop receiving future updates for this event, decline this event.  
Alternatively you can sign up for a Google account at  
https://www.google.com/calendar/ and control your notification settings for  
your entire calendar.

Forwarding this invitation could allow any recipient to send a response to  
the organizer and be added to the guest list, or invite others regardless  
of their own invitation status, or to modify your RSVP. Learn more at  
https://support.google.com/calendar/answer/37135#forwarding
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <https://mailman46.in.tum.de/pipermail/club2/attachments/20191014/04ec7ff6/attachment-0001.html>
-------------- next part --------------
A non-text attachment was scrubbed...
Name: not available
Type: text/calendar
Size: 3109 bytes
Desc: not available
URL: <https://mailman46.in.tum.de/pipermail/club2/attachments/20191014/04ec7ff6/attachment-0001.ics>
-------------- next part --------------
A non-text attachment was scrubbed...
Name: invite.ics
Type: application/ics
Size: 3165 bytes
Desc: not available
URL: <https://mailman46.in.tum.de/pipermail/club2/attachments/20191014/04ec7ff6/attachment-0001.bin>