SlideShare a Scribd company logo
4
Most read
5
Most read
7
Most read
MANDSAUR UNIVERCITY
MANDSAUR
Department of computer Application
MCA-II Year(iv sem)
SBMITED BY-
arun singh
Topic-
Problem reducing using AND-OR graph &
AO* algorithem
CONTAINT
* Defination of AND/OR graph
*AND/OR Graph Algorithm
* AND/OR searching
*AO* Algorithem
DEFINaTION
 AND/OR graph
AND-OR graph is useful for representing the
solution of problems that can be solved by
decomposing them into a set of smaller problems,
all of which must then be solved.
G=value
H’=whatever it is
F’=h’ or h’+o or h’+g
AND/OR GRAPH Algorithm:-
1. Initialiize the graph to the starting
node.
2. Loop until the starting node is
labeled solved or until its cost goes
above FUTILIIY.
A.Traverse the graph & set the nodes
that are on the path & have not yet
been expanded & labeled as solved.
B.Pick one of these unexpanded nodes &
axpand it. Of there are no successor assign
FUTTILITY us the value of this node other
vise, add it successor each of them compute f’
value (use only h’ and ignore g).
C.Change the f’ estimate of the newly
expanded nod to reflect the new information
provided by its successor.
AND/OR graph diagram-
Step-1
Step-2
A-B-C
A-C-D
Step-3
Step-4
Step-5
Unsolvable
The longer path may be better
AO* Algorithm
 AO* algorithm is a type of heuristic search algorithm is used
when problem can be divided into sub parts & which can be
combined AO* in artificial intelligence is represented using
& OR-AND graph.
 Keywords:-
 GRAPH
 INIT
 SOLVED (S)
 NODE
 FUTILITY
 SUCCESSOR
 CURRENT (C)
Prominent graph:-
A-C-E-B-A
Algorithm:-
1. Let GRAPH consist only of the NODE representing
the initial state & compute h’(INIT).
2. Until INIT is labeled SOLVED or until INIT’S h’
value becomes greater than FUTILITY repeat the
following procedure :-
A. Trace the labeled are fram INIT at select for
expantion and call the selected Node.
B. Genaret the successor of node if there are none then
assign the FUTTILITY as the h’ value of node. Not
soleved if there are successor. But not for each one
of the successor. But not also and ancestor of node
do the following:-
 i.)at successor to the graph.
 ii.) if successor is a terminate node label it solve and
assign it n h’ value of o.
 Iii.) if successor is not a terminal node compute in h’
value.
C propagate the newly decision information by the
following : Let s be a set of node that have been
labeled saved.whode h’ value has been changed and so
need to have a voice propagate back to when it. until
as is empty do the following steps:-
 i) select from s a node name of whose desent in Graph
accures. Select any node from s call this node to CURRENT
and remove from S.
 ii) compute the cast of each of the arc in margin of
CURRENT assign new h’ value the minimum of the cost
just compute for the arcs margin for it.
 iii) mark the best path out of CURRENT by making the arc
that had the minimum cost as computed in the previse state.
 iv) mark CURRENT solved if as the nodes connected to it
through the new labeled are have been labeled saved.
 V) If has been CURRENT label solved of if the cost of
current was just change then its new states must be
propagated backup the graph on the insisters of current to S.

Problem reduction AND OR GRAPH & AO* algorithm.ppt
Problem reduction AND OR GRAPH & AO* algorithm.ppt
Problem reduction AND OR GRAPH & AO* algorithm.ppt
Problem reduction AND OR GRAPH & AO* algorithm.ppt
THANK YOU

More Related Content

What's hot (20)

PDF
I. AO* SEARCH ALGORITHM
vikas dhakane
 
PPTX
Control Strategies in AI
Amey Kerkar
 
PPT
Heuristic Search Techniques Unit -II.ppt
karthikaparthasarath
 
PPTX
Problem solving agents
Megha Sharma
 
PPTX
8 queens problem using back tracking
Tech_MX
 
PDF
A* Search Algorithm
vikas dhakane
 
PDF
I. Alpha-Beta Pruning in ai
vikas dhakane
 
PDF
I. Hill climbing algorithm II. Steepest hill climbing algorithm
vikas dhakane
 
PPTX
And or graph
Ali A Jalil
 
PPTX
AI_Session 7 Greedy Best first search algorithm.pptx
Guru Nanak Technical Institutions
 
PPTX
Constraint satisfaction problems (csp)
Archana432045
 
PDF
Production System in AI
Bharat Bhushan
 
PPT
Hill climbing
Mohammad Faizan
 
PPTX
Breadth First Search & Depth First Search
Kevin Jadiya
 
PPTX
State space search
chauhankapil
 
PDF
Symbol table in compiler Design
Kuppusamy P
 
PPT
Heuristic Search Techniques {Artificial Intelligence}
FellowBuddy.com
 
PPTX
Knowledge representation and Predicate logic
Amey Kerkar
 
PPTX
search strategies in artificial intelligence
Hanif Ullah (Gold Medalist)
 
PPTX
Forms of learning in ai
Robert Antony
 
I. AO* SEARCH ALGORITHM
vikas dhakane
 
Control Strategies in AI
Amey Kerkar
 
Heuristic Search Techniques Unit -II.ppt
karthikaparthasarath
 
Problem solving agents
Megha Sharma
 
8 queens problem using back tracking
Tech_MX
 
A* Search Algorithm
vikas dhakane
 
I. Alpha-Beta Pruning in ai
vikas dhakane
 
I. Hill climbing algorithm II. Steepest hill climbing algorithm
vikas dhakane
 
And or graph
Ali A Jalil
 
AI_Session 7 Greedy Best first search algorithm.pptx
Guru Nanak Technical Institutions
 
Constraint satisfaction problems (csp)
Archana432045
 
Production System in AI
Bharat Bhushan
 
Hill climbing
Mohammad Faizan
 
Breadth First Search & Depth First Search
Kevin Jadiya
 
State space search
chauhankapil
 
Symbol table in compiler Design
Kuppusamy P
 
Heuristic Search Techniques {Artificial Intelligence}
FellowBuddy.com
 
Knowledge representation and Predicate logic
Amey Kerkar
 
search strategies in artificial intelligence
Hanif Ullah (Gold Medalist)
 
Forms of learning in ai
Robert Antony
 

Similar to Problem reduction AND OR GRAPH & AO* algorithm.ppt (20)

PPT
Unit 2 Topic 4 Informed search strategies AO.ppt
ssuser470a6d1
 
PPTX
5.problem reduction in artificial intelligence.pptx
VINAYTANDAVYALLAMILL
 
PPTX
Unit 3 Informed Search Strategies.pptx
DrYogeshDeshmukh1
 
PPTX
AI BEST FIRST,A-STAR,AO-STAR SEARCH.pptx
KALPANAC20
 
PPTX
AO star algorithm -Adv-Ltms-comp AI.pptx
karthikaparthasarath
 
PPTX
heuristic technique.pptx...............................
gursharansinghmavi20
 
DOCX
Game Paper
Siddharth Gupta
 
PPTX
AO Star Algorithm in Artificial Intellligence
vipulkondekar
 
PDF
IRJET- Artificial Algorithms Comparative Study
IRJET Journal
 
PDF
UNIT 2 - Artificial intelligence merged.pdf
SwarnaMugi2
 
PDF
Tao Fayan_Iso and Full_volume rendering
Fayan TAO
 
PPTX
Barcode reader
Wuhan University
 
PDF
ACM ICPC 2013 NEERC (Northeastern European Regional Contest) Problems Review
Roman Elizarov
 
PPTX
AI_CSE5005_M2_ASearch.pptx for the algorithm for machine
rkvrojinkvarughese07
 
PDF
Analysis of Pathfinding Algorithms
SigSegVSquad
 
PDF
Heuristic Searching: A* Search
IOSR Journals
 
PPT
Transportation and Assiggnment problem ppt
Hailemariam
 
PPTX
And or graph problem reduction using predicate logic
Mohanlal Sukhadia University (MLSU)
 
PDF
FADML 10 PPC Solving NP-Hard Problems.pdf
Yelah1
 
PPTX
A* algorithm
Komal Samdariya
 
Unit 2 Topic 4 Informed search strategies AO.ppt
ssuser470a6d1
 
5.problem reduction in artificial intelligence.pptx
VINAYTANDAVYALLAMILL
 
Unit 3 Informed Search Strategies.pptx
DrYogeshDeshmukh1
 
AI BEST FIRST,A-STAR,AO-STAR SEARCH.pptx
KALPANAC20
 
AO star algorithm -Adv-Ltms-comp AI.pptx
karthikaparthasarath
 
heuristic technique.pptx...............................
gursharansinghmavi20
 
Game Paper
Siddharth Gupta
 
AO Star Algorithm in Artificial Intellligence
vipulkondekar
 
IRJET- Artificial Algorithms Comparative Study
IRJET Journal
 
UNIT 2 - Artificial intelligence merged.pdf
SwarnaMugi2
 
Tao Fayan_Iso and Full_volume rendering
Fayan TAO
 
Barcode reader
Wuhan University
 
ACM ICPC 2013 NEERC (Northeastern European Regional Contest) Problems Review
Roman Elizarov
 
AI_CSE5005_M2_ASearch.pptx for the algorithm for machine
rkvrojinkvarughese07
 
Analysis of Pathfinding Algorithms
SigSegVSquad
 
Heuristic Searching: A* Search
IOSR Journals
 
Transportation and Assiggnment problem ppt
Hailemariam
 
And or graph problem reduction using predicate logic
Mohanlal Sukhadia University (MLSU)
 
FADML 10 PPC Solving NP-Hard Problems.pdf
Yelah1
 
A* algorithm
Komal Samdariya
 
Ad

Recently uploaded (20)

PDF
Boardroom AI: The Next 10 Moves | Cerebraix Talent Tech
ssuser73bdb11
 
DOCX
Custom vs. Off-the-Shelf Banking Software
KristenCarter35
 
PPTX
Academic Debate: Creation vs Evolution.pptx
JOHNPATRICKMARTINEZ5
 
PDF
BRKAPP-1102 - Proactive Network and Application Monitoring.pdf
fcesargonca
 
PPTX
Networking_Essentials_version_3.0_-_Module_5.pptx
ryan622010
 
PDF
BRKSP-2551 - Introduction to Segment Routing.pdf
fcesargonca
 
PDF
Top 10 Testing Procedures to Ensure Your Magento to Shopify Migration Success...
CartCoders
 
PDF
google promotion services in Delhi, India
Digital Web Future
 
PPTX
PHIPA-Compliant Web Hosting in Toronto: What Healthcare Providers Must Know
steve198109
 
PDF
Enhancing Parental Roles in Protecting Children from Online Sexual Exploitati...
ICT Frame Magazine Pvt. Ltd.
 
PDF
Cleaning up your RPKI invalids, presented at PacNOG 35
APNIC
 
PDF
FutureCon Seattle 2025 Presentation Slides - You Had One Job
Suzanne Aldrich
 
PPTX
Networking_Essentials_version_3.0_-_Module_3.pptx
ryan622010
 
PPTX
Softuni - Psychology of entrepreneurship
Kalin Karakehayov
 
PDF
The Hidden Benefits of Outsourcing IT Hardware Procurement for Small Businesses
Carley Cramer
 
PPTX
Lec15_Mutability Immutability-converted.pptx
khanjahanzaib1
 
PPTX
法国巴黎第二大学本科毕业证{Paris 2学费发票Paris 2成绩单}办理方法
Taqyea
 
PPTX
美国电子毕业证帕克大学电子版成绩单UMCP学费发票办理学历认证
Taqyea
 
PPTX
原版一样(毕业证书)法国蒙彼利埃大学毕业证文凭复刻
Taqyea
 
PDF
Digital burnout toolkit for youth workers and teachers
asociatiastart123
 
Boardroom AI: The Next 10 Moves | Cerebraix Talent Tech
ssuser73bdb11
 
Custom vs. Off-the-Shelf Banking Software
KristenCarter35
 
Academic Debate: Creation vs Evolution.pptx
JOHNPATRICKMARTINEZ5
 
BRKAPP-1102 - Proactive Network and Application Monitoring.pdf
fcesargonca
 
Networking_Essentials_version_3.0_-_Module_5.pptx
ryan622010
 
BRKSP-2551 - Introduction to Segment Routing.pdf
fcesargonca
 
Top 10 Testing Procedures to Ensure Your Magento to Shopify Migration Success...
CartCoders
 
google promotion services in Delhi, India
Digital Web Future
 
PHIPA-Compliant Web Hosting in Toronto: What Healthcare Providers Must Know
steve198109
 
Enhancing Parental Roles in Protecting Children from Online Sexual Exploitati...
ICT Frame Magazine Pvt. Ltd.
 
Cleaning up your RPKI invalids, presented at PacNOG 35
APNIC
 
FutureCon Seattle 2025 Presentation Slides - You Had One Job
Suzanne Aldrich
 
Networking_Essentials_version_3.0_-_Module_3.pptx
ryan622010
 
Softuni - Psychology of entrepreneurship
Kalin Karakehayov
 
The Hidden Benefits of Outsourcing IT Hardware Procurement for Small Businesses
Carley Cramer
 
Lec15_Mutability Immutability-converted.pptx
khanjahanzaib1
 
法国巴黎第二大学本科毕业证{Paris 2学费发票Paris 2成绩单}办理方法
Taqyea
 
美国电子毕业证帕克大学电子版成绩单UMCP学费发票办理学历认证
Taqyea
 
原版一样(毕业证书)法国蒙彼利埃大学毕业证文凭复刻
Taqyea
 
Digital burnout toolkit for youth workers and teachers
asociatiastart123
 
Ad

Problem reduction AND OR GRAPH & AO* algorithm.ppt

  • 1. MANDSAUR UNIVERCITY MANDSAUR Department of computer Application MCA-II Year(iv sem) SBMITED BY- arun singh
  • 2. Topic- Problem reducing using AND-OR graph & AO* algorithem
  • 3. CONTAINT * Defination of AND/OR graph *AND/OR Graph Algorithm * AND/OR searching *AO* Algorithem
  • 4. DEFINaTION  AND/OR graph AND-OR graph is useful for representing the solution of problems that can be solved by decomposing them into a set of smaller problems, all of which must then be solved. G=value H’=whatever it is F’=h’ or h’+o or h’+g
  • 5. AND/OR GRAPH Algorithm:- 1. Initialiize the graph to the starting node. 2. Loop until the starting node is labeled solved or until its cost goes above FUTILIIY. A.Traverse the graph & set the nodes that are on the path & have not yet been expanded & labeled as solved.
  • 6. B.Pick one of these unexpanded nodes & axpand it. Of there are no successor assign FUTTILITY us the value of this node other vise, add it successor each of them compute f’ value (use only h’ and ignore g). C.Change the f’ estimate of the newly expanded nod to reflect the new information provided by its successor.
  • 11. AO* Algorithm  AO* algorithm is a type of heuristic search algorithm is used when problem can be divided into sub parts & which can be combined AO* in artificial intelligence is represented using & OR-AND graph.  Keywords:-  GRAPH  INIT  SOLVED (S)  NODE  FUTILITY  SUCCESSOR  CURRENT (C)
  • 13. Algorithm:- 1. Let GRAPH consist only of the NODE representing the initial state & compute h’(INIT). 2. Until INIT is labeled SOLVED or until INIT’S h’ value becomes greater than FUTILITY repeat the following procedure :- A. Trace the labeled are fram INIT at select for expantion and call the selected Node. B. Genaret the successor of node if there are none then assign the FUTTILITY as the h’ value of node. Not soleved if there are successor. But not for each one of the successor. But not also and ancestor of node do the following:-
  • 14.  i.)at successor to the graph.  ii.) if successor is a terminate node label it solve and assign it n h’ value of o.  Iii.) if successor is not a terminal node compute in h’ value. C propagate the newly decision information by the following : Let s be a set of node that have been labeled saved.whode h’ value has been changed and so need to have a voice propagate back to when it. until as is empty do the following steps:-
  • 15.  i) select from s a node name of whose desent in Graph accures. Select any node from s call this node to CURRENT and remove from S.  ii) compute the cast of each of the arc in margin of CURRENT assign new h’ value the minimum of the cost just compute for the arcs margin for it.  iii) mark the best path out of CURRENT by making the arc that had the minimum cost as computed in the previse state.  iv) mark CURRENT solved if as the nodes connected to it through the new labeled are have been labeled saved.  V) If has been CURRENT label solved of if the cost of current was just change then its new states must be propagated backup the graph on the insisters of current to S. 