Upcoming SlideShare
×

Thanks for flagging this SlideShare!

Oops! An error has occurred.

×
Saving this for later? Get the SlideShare app to save on your phone or tablet. Read anywhere, anytime – even offline.
Standard text messaging rates apply

# AI: Logic in AI 2

1,898

Published on

AI: Logic in AI 2

AI: Logic in AI 2

Published in: Technology
0 Likes
Statistics
Notes
• Full Name
Comment goes here.

Are you sure you want to Yes No
• Be the first to comment

• Be the first to like this

Views
Total Views
1,898
On Slideshare
0
From Embeds
0
Number of Embeds
0
Actions
Shares
0
0
0
Likes
0
Embeds 0
No embeds

No notes for slide

### Transcript

• 1. Logic in AI 2
• 2. A simple Planning Agent
A simple planning agent uses the percepts provided by the environment to build a complete and correct model of the current world state, after which , to achieve its goal, it calls a suitable planning algorithm (which we will call IDEAL-PLANNER) to generate a plan of action.
• 3. Problem solving and Planningby a simple planning agent
Basic elements of a search-based problem-solver are
Representation of actions,
Representation of states,
Represents of goals and
Representation of plans.
• 4. Components of practical planning
(1) Restrict the language with which PLANNER we define problems. With a restrictivelanguage, there are fewer possible solutions to search through.
(2) Use a special-purpose algorithm called a planner rather than a general-purposetheorem prover to search for a solution.
• 5. Basic representation for planning
LEAST COMMITMENT this principle says that one should only make choices about things that you currently working.
PARTIAL ORDER A planner that can represent plans in some steps are ordered with respect to each other and other steps are unordered is called a partial order planner.
LINEARIZATION A totally ordered plan that is derived from a plan P by adding ordering constraints is called a linearization of P.
• 6. What is a PLAN?
A plan is formally defined as a data structure consisting of the following four components:
Set of plan steps
Set of step ordering constraints
Set of variable binding constraints
• 7. What is a Solution?
A solution is a plan that an agent can execute, and that guarantees achievement of the goal.
If we wanted to make it really easy to check that a plan is a solution, we could insist that only fully instantiated, totally ordered plans can be solutions.
• 8. How to Resolve threats in planning?
Resolve now with an equality constraint
Resolve now with an inequality constraint
Resolve Later
• 9. Knowledge Engineering for planning
Decide on a vocabulary of conditions (literals), operators, and objects.
Encode operators for the domain.
Encode a description of the specific problem instance.
Pose problems to the planner and get back plans.
• 10. Practical Planning
Hierarchical decomposition
The practical planners have adopted the idea of hierarchical decomposition: that an abstract operator can be decomposed into a group of steps that forms a plan that implements the operator.
These decompositions can be stored in a library of plans and retrieved as needed
• 11. Analysis of Hierarchical Decomposition
Abstract solution A plan that contains abstract operators, but is consistent and complete once an abstract solution is found we can prune away all other abstract plans from the search tree. This property is the downward solution property.
We can prune away all the descendants of any inconsistent abstract plan. This is called theupward solution property
• 12. Resource constraints in planning
Using measures in planningThe solution is to introduce numeric-valued measures. Measures such as the price of gas are realities with which the planner must deal, but over which it j has little control.
Other measures, such as Cash and Gas Level, are treated as resources that can be produced and consumed.
Temporal constraintsIn most ways, time can be treated like any other resource. The initial state specifies a start time for the plan.
• 13. Visit more self help tutorials
Pick a tutorial of your choice and browse through it at your own pace.
The tutorials section is free, self-guiding and will not involve any additional support.
Visit us at www.dataminingtools.net