Пікірлер

• 
  @dlv_bАй бұрын

  Great talk and presentation!!!

• 
  @chouaibbenamar4272 ай бұрын

  great explanation

• 
  @abdulmuneer76836 ай бұрын

  Thanks❤

• 
  @robinranabhat312511 ай бұрын

  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)

• 
  @robinranabhat312511 ай бұрын

  ### 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.

• 
  @user-bd7pl6jo5p Жыл бұрын

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

• 
  @WingMaster562 Жыл бұрын

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

• 
  @Adityarm.08 Жыл бұрын

  Great work :) loved the intuitive explanation!

• 
  @snedunuri2946 Жыл бұрын

  Slides are basically illegible

• 
  @keeperofthelight9681 Жыл бұрын

  No idea

• 
  @babelrayan5372 жыл бұрын

  can you please share your source code ?

• 
  @gorbutt17092 жыл бұрын

  Great video!

• 
  @davidgolembiowski42752 жыл бұрын

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

• 
  @mostafatagmouti3383 жыл бұрын

  hhow we can do that ?

• 
  @mohamedelamineathmani16373 жыл бұрын

  Thank you for the great presentation

• 
  @fancynancylucille3 жыл бұрын

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

• 
  @losupa78973 жыл бұрын

  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.

• 
  @Reckless153 жыл бұрын

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

• 
  @Maric183 жыл бұрын

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

• 
  @WingMaster562 Жыл бұрын

  IKR. I really find it odd that for an efficient algorithm and suggested a lot in forums, it has really few resources for it. Aside the main paper, I can only find the introduction (which kept repeating things) by other people and one visualizer. I can't find a reliable pseudocode that I can understand. Nor a proper tutorial, just introductions.

• 
  @figfox24252 ай бұрын

  if you have some questions, I did an implementation of the classic jps and the improved one.The hard part was the twikling bits i had to figure out. (and probably not as bright as what they did)

• 
  @weistrass3 жыл бұрын

  Philippe, your ppt is brilliant

• 
  @jvankooo3 жыл бұрын

  Well Presented ! Thanks a lot

• 
  @aayamshrestha90843 жыл бұрын

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

• 
  @user-dd1kb7dv5n3 жыл бұрын

  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

• 
  @vgfffggg40003 жыл бұрын

  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

• 
  @vgfffggg40003 жыл бұрын

  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

• 
  @user-kz1kh6eh6i3 жыл бұрын

  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

• 
  @daveoconnel85834 жыл бұрын

  @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.

• 
  @nasiruddin32354 жыл бұрын

  Excellent Presentation ...

• 
  @ThefamousMrcroissant4 жыл бұрын

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

• 
  @daveoconnel85834 жыл бұрын

  Hi can you please share the code?

• 
  @ThefamousMrcroissant4 жыл бұрын

  @@daveoconnel8583 Absolutely will my man. It's written in C, I've exported it as shared object to use in Python. The implementation is not pure MPAA*, but rather D*-lite using the MPAA* optimization. Before I share I'd like to fix a few things if you don't mind. If you give me an email I'll send it over.

• 
  @daveoconnel85834 жыл бұрын

  @@ThefamousMrcroissant Cool thanks for that and sure take your time. Please send it here: [email protected]

• 
  @ThefamousMrcroissant4 жыл бұрын

  @@daveoconnel8583 Will do. Probably send it over somewhere around the beginning of next week.

• 
  @daveoconnel85834 жыл бұрын

  @@ThefamousMrcroissant Grand :) will be waiting for it

• 
  @nasiruddin32354 жыл бұрын

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

• 
  @juliuskipkorir60804 жыл бұрын

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

• 
  @ICAPSConference4 жыл бұрын

  Please contact the authors directly. You find their email address on the paper (www.aaai.org/ocs/index.php/ICAPS/ICAPS17/paper/download/15586/15126).

• 
  @WahranRai5 жыл бұрын

  Audio not good !!!

• 
  @orguru5 жыл бұрын

  Nice, wonderful tutorial

• 
  @aa5new5 жыл бұрын

  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.

• 
  @JAShin-iz8jv6 жыл бұрын

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

• 
  @ICAPSConference6 жыл бұрын

  The slides are available from icaps17.icaps-conference.org/tutorials/T1-Planning-for-Robotics.pdf

• 
  @Murligopalan6 жыл бұрын

  Very impressive

• 
  @subhascse6 жыл бұрын

  very nice basic explanation.

• 
  @nahian48617 жыл бұрын

  great....job

• 
  @WahranRai7 жыл бұрын

  Do you have CSP example related to colony and occupation

• 
  @Egzvorg9 жыл бұрын

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

• 
  @rahpuser8 жыл бұрын

  +Егор Зворыкин Did you mean "non-uniform cost" ?

• 
  @Egzvorg8 жыл бұрын

  rahpuser no

• 
  @rahpuser8 жыл бұрын

  Егор Зворыкин Grid are represented as uniform graphs, what do you mean by uniform graphs that cannot be represented as grid ?

• 
  @Egzvorg8 жыл бұрын

  rahpuser any other graph with uniform cost for example {3, 2, 2, 3}.

• 
  @Egzvorg8 жыл бұрын

  rahpuser well, never mind, I don't even remember why I was asking this.

• 
  @ICAPSConference10 жыл бұрын

  The ICAPS Three at the ICAPS 2014 conference banquet!