پاورپوینت کامل برنامه ریزی AI 70 اسلاید در PowerPoint

توجه : این فایل به صورت فایل power point (پاور پوینت) ارائه میگردد

 پاورپوینت کامل برنامه ریزی AI 70 اسلاید در PowerPoint دارای ۷۰ اسلاید می باشد و دارای تنظیمات کامل در PowerPoint می باشد و آماده ارائه یا چاپ است

شما با استفاده ازاین پاورپوینت میتوانید یک ارائه بسیارعالی و با شکوهی داشته باشید و همه حاضرین با اشتیاق به مطالب شما گوش خواهند داد.

لطفا نگران مطالب داخل پاورپوینت نباشید، مطالب داخل اسلاید ها بسیار ساده و قابل درک برای شما می باشد، ما عالی بودن این فایل رو تضمین می کنیم.

توجه : در صورت  مشاهده  بهم ریختگی احتمالی در متون زیر ،دلیل ان کپی کردن این مطالب از داخل فایل می باشد و در فایل اصلی پاورپوینت کامل برنامه ریزی AI 70 اسلاید در PowerPoint،به هیچ وجه بهم ریختگی وجود ندارد

بخشی از مطالب داخلی اسلاید ها

پاورپوینت کامل برنامه ریزی AI 70 اسلاید در PowerPoint

اسلاید ۴: STRIPS Representation4State is a conjunction of positive ground literalsOn(B, Table) Clear (A)Goal is a conjunction of positive ground literals Clear(A) On(A,B) On(B, Table)STRIPS Operators Conjunction of positive literals as preconditionsConjunction of positive and negative literals as effects

اسلاید ۵: More on action schema5Example: Move (b, x, y)Precondition: Block(b) Clear(b) Clear(y) On(b,x) (b x) (b y) (y x)Effect: ¬Clear(y) ¬On(b,x) Clear(x) On(b,y)An action is applicable in any state that satisfies its preconditionDelete listAdd list

اسلاید ۶: STRIPS assumptions6Closed World assumptionUnmentioned literals are false (no need to explicitly list out)STRIPS assumptionEvery literal not mentioned in the “effect” of an action remains unchangedAtomic Time (actions are instantaneous)

اسلاید ۷: STRIPS expressiveness7Literals are function free: Move (Block(x), y, z)operators can be propositionalized Move(b,x,y) and 3 blocks and table can be expressed as 48 purely propositional actionsNo disjunctive goals: On(B, Table) V On(B, C)No conditional effects: On(B, Table) if ¬On(A, Table)

اسلاید ۸: Planning algorithms8Planning algorithms are search proceduresWhich state to searchState-space searchEach node is a state of the worldPlan = path through the statesPlan-space searchEach node is a set of partially-instantiated operators and set of constraintsPlan = node

اسلاید ۹: State search9Search the space of situations, which is connected by operator instancesThe sequence of operators instances = planWe have both preconditions and effects available for each operator, so we can try different searches: Forward vs. Backward

اسلاید ۱۰: Planning: Search Space10ACBABCACBCBABACBACBCACABACBBCAABCABCABC

اسلاید ۱۱: Forward state-space search (1)11ProgressionInitial state: initial state of the problemActions:Applied to a state if all the preconditions are satisfiedSuccesor state is built by updating current state with add and delete listsGoal test: state satisfies the goal of the problem

اسلاید ۱۲: Progression (forward search)12ProgWS(world-state, goal-list, PossibleActions, path)If world-state satisfies all goals in goal-list,Then return path.Else Act = choose an action whose precondition is true in world-stateIf no such action existsThen failElse return ProgWS( result(Act, world-state), goal-list, PossibleActions, concatenate(path, Act) )

اسلاید ۱۳: Forward search in the Blocks world13……

اسلاید ۱۴: Forward state-space search (2)14AdvantagesNo functions in the declarations of goals search state is finiteSoundComplete (if algorithm used to do the search is complete)LimitationsIrrelevant actions not efficientNeed heuristic or pruning procedure

اسلاید ۱۵: Backward state-space search (1)15RegressionInitial state: goal state of the problemActions:Choose an action thatIs relevant; has one of the goal literals in its effect setIs consistent; does not negate another literalConstruct new search stateRemove all positive effects of A that appear in goalAdd all preconditions, unless already appearsGoal test: state is the initial world state

اسلاید ۱۶: Regression (backward search)16RegWS(initial-state, current-goals, PossibleActions, path)If initial-state satisfies all of current-goalsThen return pathElse Act = choose an action whose effect matches one of current-goalsIf no such action exists, or the effects of Act contradict some of current-goals, then failG = (current-goals – goals-added-by(Act)) + preconds(Act)If G contains all of current-goals, then failReturn RegWS(initial-state, G, PossibleActions, concatenate(Act, path))

اسلاید ۱۷: Backward state-space search (2)17AdvantagesConsider only relevant actions much smaller branching factorLimitationsStill need heuristic to be more efficient

اسلاید ۱۸: Comparing ProgWS and RegWS18Both algorithms are sound (they always return a valid plan)complete (if a valid plan exists they will find one)Running time is O(bn)where b = branching factor, n = number of “choose” operators

اسلاید ۱۹: Blocks world: STRIPS operators19Pickup(x)Pre: on(x, Table), clear(x), aeDel: on(x, Table), ae Add: holding(x)Putdown(x)Pre: holding(x)Del: holding(x)Add: on(x, Table), ae UnStack(x,y)Pre: on(x, y), aeDel: on(x, y), aeAdd: holding(x), clear(y) Stack(x, y)Pre: holding(x), clear(y)Del: holding(x), clear(y)Add: on(x, y), ae

اسلاید ۲۰: STRIPS Planning20Current state:on(A,table), on(C, B), on(B,table), on(D,table), clear(A), clear(C), clear(D), ae.Goalon(A,C), on(C,D)ACBDCAD

اسلاید ۲۱: STRIPS Planning21on(A,C), on(D,A)on(A,table), on(C, B), on(B,table), on(D,table), clear(A), clear(C), clear(D), ae.Current StatePlan:Goalstack:on(A,C)Stack(A, C)holding(A), clear(C)holding(A)Pickup(A)on(A,Table), clear(A), ae ACBDCAD