1 / 4

Linear Planning

Linear Planning. A plan is linear if it is a sequence of operations for solving the goals in the sequence. A planning problem is linear if there is a goal sequence with a linear plan. A planning problem can often be made linear by inserting well placed goals into the original goal sequence.

charla
Télécharger la présentation

Linear Planning

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. Linear Planning A plan is linear if it is a sequence of operations for solving the goals in the sequence. A planning problem is linear if there is a goal sequence with a linear plan. A planning problem can often be made linear by inserting well placed goals into the original goal sequence.

  2. STRIPSStanford Research Institute Problem Solver Richard E. Fikes, Nils J. Nilsson: A New(*) Approach to the Application of Theorem Proving to Problem Solving. (*) IJCAI 2, 1971, Edinburgh Also in Allen(Ed): Readings in Planning Morgan Kaufman, 1989

  3. Sussmans Anomaly A C = = = > B B A C There is no decent linear plan for this problem Goal sequence 1: ?-On(A,B), On(B,C) => move(C,A,Floor),move(A,Floor,B), {On(A,B)} move(A,B,Floor),move(B,Floor,C) {On(B,C)} [,move(A,Floor,B)] • Goal sequence 2 ?- On(B,C), On(A,B) • move(B,Floor,C), {On(B,C)} move(B,C,Fl),move(C,A,Floor),move(A,Floor,B) {On(A,B)} […..]

  4. Sussmans Anomaly(inserted goal) A C = = = > B A B C Made linear by insertion of goal Goal sequence 1: ?-On(C,Fl), On(B,C), On(A,B) => move(C,A,Fl), {On(C,Fl)} move(B,Fl,C), {On(B,C} move(A,Fl,B) {On(A,B)}

More Related