Great talk and presentation!!!

great explanation

Thanks❤

51:00 Concrete Example of Hector's language based representation of policy 57:50 Concrete Example of Hector's Langague based representation of Sub-goal structures (intrinsic rewards)

### Prerequisite : - Have basic understanding or FOL(take quick look on any website) - STRIPS www.sci.brooklyn.cuny.edu/~parsons/courses/3410-fall-2012/notes/lect07.pdf ### Atom A Minimal Non-Decomposable Fact . like "Mercy is a Cat" . also written as Cat(mercy). So, "Mercy is a Cat who likes butter" || Likes( Cat(mercy), Butter ). is not an atom. ### Classical Planning You have set of facts that describes the current state of world : Block A is on the table || OnTable(A) Similarly, OnTable(B) and OnTable(C) Suppose Goal State is : A, B ,C stacked on top of each other. And represented as : > OnTable(A), > OnTop(B,A) | B is on top of A > OnTop(C,B) Suppose there's a The Robot can do actions A like : 1. PutOnTop(x,y) >> Put x on top of y 2. Carrying(x) >> Carry object x CLASSICAL PLANNING ALGORITHMS are basically SEARCH algorithms that finds a "sequence of actions" that takes Current State of World to Goal State. IW is one such algorithm. ### Width of Problem For a given problem, the minimal number of actions that's required to reach from current state goal state is called WIDTH OF PROBLEM.

Hello, I would like to do research on full coverage path planning, would you like to share the code? Help me

10:08 "It's not that exciting" But, that's what I came here for. Boring stuff. The things that make it work. lmao

Great work :) loved the intuitive explanation!

Slides are basically illegible

No idea

can you please share your source code ?

Great video!

I'm surprised the presentation immediately skips the A* Search evaluation. Was there a reason for advancing beyond the results?

hhow we can do that ?

Thank you for the great presentation

Once upon a time there was a street musician..................

Great video giving a high-level overview of a method of solving the Watchman Route Problem. Only thing I regret they didn't cover was a method to determine the optimal (at least somewhat optimal) starting route, which would allow a circuitous path if they used full TSP instead of the variation.

i dont even know what this is but its named after me

i cant believe that this is the only resource available on jps

Philippe, your ppt is brilliant

Well Presented ! Thanks a lot

The plan is to keep on planning I suppose. :D

0:32 I will setup your blog and setup it to earn money w h a t s a p p +7 9 6 7 1 5 7 0 5 8 1

0:26 I will setup your blog and setup it to earn money w h a t s a p p +7 9 6 7 1 5 7 0 5 8 1

0:4 I will setup your blog and setup it to earn money w h a t s a p p +7 9 6 7 1 5 7 0 5 8 1

0:28 I will setup your blog and setup it to earn money w h a t s a p p +7 9 6 7 1 5 7 0 5 8 1

@Very_good Sorry I didn't get any notification of your reply. It's fine I would like to see d*-lite. I don't know why my reply is not showing probably the same reason why I missed yours I'm trying to write as new comment so hopefully you can see it.

Excellent Presentation ...

I implemented this algorithm for my bachelor thesis given the promise it would outperform D*-lite. It's a very intuitive concept for sure.

Hello Sir,,, I need your side ...May I get it ? Email: [email protected]

how can i obtain the video or clip used to show the solved parking car lot

Audio not good !!!

Nice, wonderful tutorial

Conditional plans can be implemented as linked list. The IPL-V programming language was invented for the purpose of List processing. This is equal to self-modifying code.

Hi, where can I find the tutorial slides? the tutorial slides linked on your web site is not working. Thanks in advance.

Very impressive

very nice basic explanation.

great....job

Do you have CSP example related to colony and occupation

and what about uniform-cost graphs, which cannot be represented as grid?

The ICAPS Three at the ICAPS 2014 conference banquet!