The document provides an introduction to artificial intelligence (AI). It discusses the goals of understanding intelligent behavior and building intelligent agents. It then examines four perspectives on defining AI: (1) acting humanly vs thinking rationally, and (2) focusing on thought processes vs behavior. Each perspective is associated with different approaches to AI like the Turing Test, cognitive modeling, laws of thought, and rational agents. The document also outlines some current capabilities of AI like robotic vehicles, speech recognition, game playing, and machine translation. It introduces the concepts of agents, percepts, and rational agents that aim to maximize performance. Finally, it categorizes different types of environments that agents can operate in.
A Heuristic is a technique to solve a problem faster than classic methods, or to find an approximate solution when classic methods cannot. This is a kind of a shortcut as we often trade one of optimality, completeness, accuracy, or precision for speed. A Heuristic (or a heuristic function) takes a look at search algorithms. At each branching step, it evaluates the available information and makes a decision on which branch to follow.
An agent is anything that can be viewed as perceiving its environment through sensors and acting upon that environment through actuators
Operates in an environment
Perceive its environment through sensors
Acts upon its environment through actuators/ effectors
Has Goals
A Heuristic is a technique to solve a problem faster than classic methods, or to find an approximate solution when classic methods cannot. This is a kind of a shortcut as we often trade one of optimality, completeness, accuracy, or precision for speed. A Heuristic (or a heuristic function) takes a look at search algorithms. At each branching step, it evaluates the available information and makes a decision on which branch to follow.
An agent is anything that can be viewed as perceiving its environment through sensors and acting upon that environment through actuators
Operates in an environment
Perceive its environment through sensors
Acts upon its environment through actuators/ effectors
Has Goals
The Foundations of Artificial Intelligence, The History of
Artificial Intelligence, and the State of the Art. Intelligent Agents: Introduction, How Agents
should Act, Structure of Intelligent Agents, Environments. Solving Problems by Searching:
problem-solving Agents, Formulating problems, Example problems, and searching for Solutions,
Search Strategies, Avoiding Repeated States, and Constraint Satisfaction Search. Informed
Search Methods: Best-First Search, Heuristic Functions, Memory Bounded Search, and Iterative
Improvement Algorithms.
AI 8 | Probability Basics, Bayes' Rule, Probability DistributionMohammad Imam Hossain
1. Uncertainty and Decision Theory
2. Basic Prob. Theory
3. Prior and posterior probabilities
4. Bayes' Rule
5. Random variable
6. Different types of probability distribution
Hill Climbing Algorithm in Artificial IntelligenceBharat Bhushan
Hill Climbing Algorithm in Artificial Intelligence
Hill climbing algorithm is a local search algorithm which continuously moves in the direction of increasing elevation/value to find the peak of the mountain or best solution to the problem. It terminates when it reaches a peak value where no neighbor has a higher value.
Hill climbing algorithm is a technique which is used for optimizing the mathematical problems. One of the widely discussed examples of Hill climbing algorithm is Traveling-salesman Problem in which we need to minimize the distance traveled by the salesman.
It is also called greedy local search as it only looks to its good immediate neighbor state and not beyond that.
A node of hill climbing algorithm has two components which are state and value.
Hill Climbing is mostly used when a good heuristic is available.
In this algorithm, we don't need to maintain and handle the search tree or graph as it only keeps a single current state.
Features of Hill Climbing:
Following are some main features of Hill Climbing Algorithm:
Generate and Test variant: Hill Climbing is the variant of Generate and Test method. The Generate and Test method produce feedback which helps to decide which direction to move in the search space.
Greedy approach: Hill-climbing algorithm search moves in the direction which optimizes the cost.
No backtracking: It does not backtrack the search space, as it does not remember the previous states.
State-space Diagram for Hill Climbing:
The state-space landscape is a graphical representation of the hill-climbing algorithm which is showing a graph between various states of algorithm and Objective function/Cost.
On Y-axis we have taken the function which can be an objective function or cost function, and state-space on the x-axis. If the function on Y-axis is cost then, the goal of search is to find the global minimum and local minimum. If the function of Y-axis is Objective function, then the goal of the search is to find the global maximum and local maximum.
I. Hill climbing algorithm II. Steepest hill climbing algorithmvikas dhakane
Artificial Intelligence: Introduction, Typical Applications. State Space Search: Depth Bounded
DFS, Depth First Iterative Deepening. Heuristic Search: Heuristic Functions, Best First Search,
Hill Climbing, Variable Neighborhood Descent, Beam Search, Tabu Search. Optimal Search: A
*
algorithm, Iterative Deepening A*
, Recursive Best First Search, Pruning the CLOSED and OPEN
Lists
In which we see how an agent can find a sequence of actions that achieves its goals, when no single action will do.
The method of solving problem through AI involves the process of defining the search space, deciding start and goal states and then finding the path from start state to goal state through search space.
State space search is a process used in the field of computer science, including artificial intelligence(AI), in which successive configurations or states of an instance are considered, with the goal of finding a goal state with a desired property.
Production System in Artificial Intelligence (AI)
A production system in AI helps create AI-based computer programs. With the help of it, the automation of various types of machines has become an easy task. The types of machines can be a computer, mobile applications, manufacturing tools, or more. The set of rules in a production system in Artificial Intelligence defines the behavior of the machine. It helps the machine respond to the surroundings.
A production system in AI is a type of cognitive architecture that defines specific actions as per certain rules. The rules represent the declarative knowledge of a machine to respond according to different conditions. Today, many expert systems and automation methodologies rely on the rules of production systems.
Global Database
A global database consists of the architecture used as a central data structure. A database contains all the necessary data and information required for the successful completion of a task. It can be divided into two parts as permanent and temporary. The permanent part of the database consists of fixed actions, whereas the temporary part alters according to circumstances.
Learn more about Artificial Neural networks in this insightful Artificial Intelligence Training now!
Production Rules
Production rules in AI are the set of rules that operates on the data fetched from the global database. Also, these production rules are bound with precondition and postcondition that gets checked by the database. If a condition is passed through a production rule and gets satisfied by the global database, then the rule is successfully applied. The rules are of the form A®B, where the right-hand side represents an outcome corresponding to the problem state represented by the left-hand side.
Control System
The control system checks the applicability of a rule. It helps decide which rule should be applied and terminates the process when the system gives the correct output. It also resolves the conflict of multiple conditions arriving at the same time. The strategy of the control system specifies the sequence of rules that compares the condition from the global database to reach the correct result.
Simplicity
The production rule in AI is in the form of an ‘IF-THEN’ statement. Every rule in the production system has a unique structure. It helps represent knowledge and reasoning in the simplest way possible to solve real-world problems. Also, it helps improve the readability and understanding of the production rules.
Control Strategies
Control Strategy in Artificial Intelligence
scenario is a technique or strategy, tells us about which rule has to be applied next while searching for the solution of a problem within problem space.
It helps us to decide which rule has to apply next without getting stuck at any point.
Characteristics of Control Strategies
A good Control strategy has two main
characteristics:
Control Strategy should cause Motion
Control strategy should be Systematic
Co ntrol Strategy should cause Motion
Each rule or strategy applied should cause the motion because if there will be no motion than such control strategy will never lead to a solution. Motion states about the change of state and if a state will not change then there be no movement from an initial state and we would never solve the problem.
Co ntrol Strategy should be Systematic
Though the strategy applied should create the
motion but if do not follow some systematic
strategy than we are likely to reach the same state
number of times before reaching the solution
which increases the number of steps. Taking care of only first strategy we may go through particular useless sequences of operators several times. Control Strategy should be systematic implies a need for global motion as well as for local motion.
Informed search algorithms are commonly used in various AI applications, including pathfinding, puzzle solving, robotics, and game playing. They are particularly effective when the search space is large and the goal state is not immediately visible. By intelligently guiding the search based on heuristic estimates, informed search algorithms can significantly reduce the search effort and find solutions more efficiently than uninformed search algorithms like depth-first search or breadth-first search.
Artificial Intelligence is a way of making a computer, a computer-controlled robot, or a software think intelligently, in the similar manner the intelligent humans think.
The Foundations of Artificial Intelligence, The History of
Artificial Intelligence, and the State of the Art. Intelligent Agents: Introduction, How Agents
should Act, Structure of Intelligent Agents, Environments. Solving Problems by Searching:
problem-solving Agents, Formulating problems, Example problems, and searching for Solutions,
Search Strategies, Avoiding Repeated States, and Constraint Satisfaction Search. Informed
Search Methods: Best-First Search, Heuristic Functions, Memory Bounded Search, and Iterative
Improvement Algorithms.
AI 8 | Probability Basics, Bayes' Rule, Probability DistributionMohammad Imam Hossain
1. Uncertainty and Decision Theory
2. Basic Prob. Theory
3. Prior and posterior probabilities
4. Bayes' Rule
5. Random variable
6. Different types of probability distribution
Hill Climbing Algorithm in Artificial IntelligenceBharat Bhushan
Hill Climbing Algorithm in Artificial Intelligence
Hill climbing algorithm is a local search algorithm which continuously moves in the direction of increasing elevation/value to find the peak of the mountain or best solution to the problem. It terminates when it reaches a peak value where no neighbor has a higher value.
Hill climbing algorithm is a technique which is used for optimizing the mathematical problems. One of the widely discussed examples of Hill climbing algorithm is Traveling-salesman Problem in which we need to minimize the distance traveled by the salesman.
It is also called greedy local search as it only looks to its good immediate neighbor state and not beyond that.
A node of hill climbing algorithm has two components which are state and value.
Hill Climbing is mostly used when a good heuristic is available.
In this algorithm, we don't need to maintain and handle the search tree or graph as it only keeps a single current state.
Features of Hill Climbing:
Following are some main features of Hill Climbing Algorithm:
Generate and Test variant: Hill Climbing is the variant of Generate and Test method. The Generate and Test method produce feedback which helps to decide which direction to move in the search space.
Greedy approach: Hill-climbing algorithm search moves in the direction which optimizes the cost.
No backtracking: It does not backtrack the search space, as it does not remember the previous states.
State-space Diagram for Hill Climbing:
The state-space landscape is a graphical representation of the hill-climbing algorithm which is showing a graph between various states of algorithm and Objective function/Cost.
On Y-axis we have taken the function which can be an objective function or cost function, and state-space on the x-axis. If the function on Y-axis is cost then, the goal of search is to find the global minimum and local minimum. If the function of Y-axis is Objective function, then the goal of the search is to find the global maximum and local maximum.
I. Hill climbing algorithm II. Steepest hill climbing algorithmvikas dhakane
Artificial Intelligence: Introduction, Typical Applications. State Space Search: Depth Bounded
DFS, Depth First Iterative Deepening. Heuristic Search: Heuristic Functions, Best First Search,
Hill Climbing, Variable Neighborhood Descent, Beam Search, Tabu Search. Optimal Search: A
*
algorithm, Iterative Deepening A*
, Recursive Best First Search, Pruning the CLOSED and OPEN
Lists
In which we see how an agent can find a sequence of actions that achieves its goals, when no single action will do.
The method of solving problem through AI involves the process of defining the search space, deciding start and goal states and then finding the path from start state to goal state through search space.
State space search is a process used in the field of computer science, including artificial intelligence(AI), in which successive configurations or states of an instance are considered, with the goal of finding a goal state with a desired property.
Production System in Artificial Intelligence (AI)
A production system in AI helps create AI-based computer programs. With the help of it, the automation of various types of machines has become an easy task. The types of machines can be a computer, mobile applications, manufacturing tools, or more. The set of rules in a production system in Artificial Intelligence defines the behavior of the machine. It helps the machine respond to the surroundings.
A production system in AI is a type of cognitive architecture that defines specific actions as per certain rules. The rules represent the declarative knowledge of a machine to respond according to different conditions. Today, many expert systems and automation methodologies rely on the rules of production systems.
Global Database
A global database consists of the architecture used as a central data structure. A database contains all the necessary data and information required for the successful completion of a task. It can be divided into two parts as permanent and temporary. The permanent part of the database consists of fixed actions, whereas the temporary part alters according to circumstances.
Learn more about Artificial Neural networks in this insightful Artificial Intelligence Training now!
Production Rules
Production rules in AI are the set of rules that operates on the data fetched from the global database. Also, these production rules are bound with precondition and postcondition that gets checked by the database. If a condition is passed through a production rule and gets satisfied by the global database, then the rule is successfully applied. The rules are of the form A®B, where the right-hand side represents an outcome corresponding to the problem state represented by the left-hand side.
Control System
The control system checks the applicability of a rule. It helps decide which rule should be applied and terminates the process when the system gives the correct output. It also resolves the conflict of multiple conditions arriving at the same time. The strategy of the control system specifies the sequence of rules that compares the condition from the global database to reach the correct result.
Simplicity
The production rule in AI is in the form of an ‘IF-THEN’ statement. Every rule in the production system has a unique structure. It helps represent knowledge and reasoning in the simplest way possible to solve real-world problems. Also, it helps improve the readability and understanding of the production rules.
Control Strategies
Control Strategy in Artificial Intelligence
scenario is a technique or strategy, tells us about which rule has to be applied next while searching for the solution of a problem within problem space.
It helps us to decide which rule has to apply next without getting stuck at any point.
Characteristics of Control Strategies
A good Control strategy has two main
characteristics:
Control Strategy should cause Motion
Control strategy should be Systematic
Co ntrol Strategy should cause Motion
Each rule or strategy applied should cause the motion because if there will be no motion than such control strategy will never lead to a solution. Motion states about the change of state and if a state will not change then there be no movement from an initial state and we would never solve the problem.
Co ntrol Strategy should be Systematic
Though the strategy applied should create the
motion but if do not follow some systematic
strategy than we are likely to reach the same state
number of times before reaching the solution
which increases the number of steps. Taking care of only first strategy we may go through particular useless sequences of operators several times. Control Strategy should be systematic implies a need for global motion as well as for local motion.
Informed search algorithms are commonly used in various AI applications, including pathfinding, puzzle solving, robotics, and game playing. They are particularly effective when the search space is large and the goal state is not immediately visible. By intelligently guiding the search based on heuristic estimates, informed search algorithms can significantly reduce the search effort and find solutions more efficiently than uninformed search algorithms like depth-first search or breadth-first search.
Artificial Intelligence is a way of making a computer, a computer-controlled robot, or a software think intelligently, in the similar manner the intelligent humans think.
Describe what is Artificial Intelligence. What are its goals and Approaches. Different Types of Artificial Intelligence Explain Machine learning and took one Algorithm "K-means Algorithm" and explained
Artificial intelligence Information and IntroductionDipen Vasoya
Artificial intelligence (AI) is the simulation of human intelligence processes by machines, especially computer systems. These processes include learning, self-correction. Particular applications of AI include expert systems, speech recognition and machine vision.Artificial Intelligence as a Service
This slide explains the conversion procedure from ER Diagram to Relational Schema.
1. Entity set to Relation
2. Relationship set to Relation
3. Attributes to Columns, Primary key, Foreign Keys
1. What is Entity Relationship Model
2. Entity and Entity Set
3. Relationship and Relationship Set
4. Attributes and it's kinds
5. Participation Constraints and Mapping Cardinality
6. Aggregation, Specialization, and Generalization
7. Some Sample ERD models
This note includes the followings:
- Database Create, Drop Operations
- Database Table Create, Drop Operations
- Database Table Alter Operation
- Data insertion
- Data deletion
- Existing data update
- Searching data from data table (showing all record, specific columns, specific rows, column aliasing, sorting data, limiting data, distinct data)
- Aggregate functions
- Group by clause
- Having clause
- Types of table joins
- Table aliasing, Inner Join, Left/Right Join, Self Join
- Subquery operation (scalar subquery, column subquery, row subquery, correlated subquery, derived table)
This note contains some sample MySQL query practices based on the HR Schema database. The practice sections are from the following categories:
- DDL statements
- Basic Select statements
- Aggregate operations
- Join operations
This lecture slide contains:
- Difference between FA, PDA and TM
- Formal definition of TM
- TM transition function and configuration
- Designing TM for different languages
- Simulating TM for different strings
This slide contains,
1) Some terminologies like yields, derives, word, derivation
2) Leftmost and Rightmost derivation
3) Ambiguity checking
4) Parse tree generation and ambiguity checking
Macroeconomics- Movie Location
This will be used as part of your Personal Professional Portfolio once graded.
Objective:
Prepare a presentation or a paper using research, basic comparative analysis, data organization and application of economic information. You will make an informed assessment of an economic climate outside of the United States to accomplish an entertainment industry objective.
Introduction to AI for Nonprofits with Tapp NetworkTechSoup
Dive into the world of AI! Experts Jon Hill and Tareq Monaur will guide you through AI's role in enhancing nonprofit websites and basic marketing strategies, making it easy to understand and apply.
2024.06.01 Introducing a competency framework for languag learning materials ...Sandy Millin
http://sandymillin.wordpress.com/iateflwebinar2024
Published classroom materials form the basis of syllabuses, drive teacher professional development, and have a potentially huge influence on learners, teachers and education systems. All teachers also create their own materials, whether a few sentences on a blackboard, a highly-structured fully-realised online course, or anything in between. Despite this, the knowledge and skills needed to create effective language learning materials are rarely part of teacher training, and are mostly learnt by trial and error.
Knowledge and skills frameworks, generally called competency frameworks, for ELT teachers, trainers and managers have existed for a few years now. However, until I created one for my MA dissertation, there wasn’t one drawing together what we need to know and do to be able to effectively produce language learning materials.
This webinar will introduce you to my framework, highlighting the key competencies I identified from my research. It will also show how anybody involved in language teaching (any language, not just English!), teacher training, managing schools or developing language learning materials can benefit from using the framework.
A Strategic Approach: GenAI in EducationPeter Windle
Artificial Intelligence (AI) technologies such as Generative AI, Image Generators and Large Language Models have had a dramatic impact on teaching, learning and assessment over the past 18 months. The most immediate threat AI posed was to Academic Integrity with Higher Education Institutes (HEIs) focusing their efforts on combating the use of GenAI in assessment. Guidelines were developed for staff and students, policies put in place too. Innovative educators have forged paths in the use of Generative AI for teaching, learning and assessments leading to pockets of transformation springing up across HEIs, often with little or no top-down guidance, support or direction.
This Gasta posits a strategic approach to integrating AI into HEIs to prepare staff, students and the curriculum for an evolving world and workplace. We will highlight the advantages of working with these technologies beyond the realm of teaching, learning and assessment by considering prompt engineering skills, industry impact, curriculum changes, and the need for staff upskilling. In contrast, not engaging strategically with Generative AI poses risks, including falling behind peers, missed opportunities and failing to ensure our graduates remain employable. The rapid evolution of AI technologies necessitates a proactive and strategic approach if we are to remain relevant.
Read| The latest issue of The Challenger is here! We are thrilled to announce that our school paper has qualified for the NATIONAL SCHOOLS PRESS CONFERENCE (NSPC) 2024. Thank you for your unwavering support and trust. Dive into the stories that made us stand out!
The French Revolution, which began in 1789, was a period of radical social and political upheaval in France. It marked the decline of absolute monarchies, the rise of secular and democratic republics, and the eventual rise of Napoleon Bonaparte. This revolutionary period is crucial in understanding the transition from feudalism to modernity in Europe.
For more information, visit-www.vavaclasses.com
2. AI >> Goals
Ambitious goals >>
- understand “intelligent” behavior
- build “intelligent” agents
What is Intelligence?
- capacity to learn and solve problems
- the ability to act rationally
2
Mohammad Imam Hossain | Lecturer, Dept. of CSE | UIU
3. What is AI?
Definitions of AI fall into 4 different perspectives.
▸Two dimensions:
i) Thinking vs Acting
ii) Human vs Rational
▸The top row is concerned with the thought process and reasoning
▸The bottom row addresses behavior.
▸Human centered approach is a part of empirical science, involving observations and hypotheses about human behavior,
measuring success in terms of fidelity to human behavior
▸The rationalist approach involves a combination of mathematics and engineering.
3
Mohammad Imam Hossain | Lecturer, Dept. of CSE | UIU
2. Thinking Humanly 3. Thinking Rationally
1. Acting Humanly 4. Acting Rationally
Thought
Behavior
Human-like Intelligence Pure Rationality
4. 1. Acting Humanly >> Turing Test approach
The art of creating machines that perform functions that require intelligence when performed by people.
Turing Test >>
▸Proposed by Alan Turing (1950), was designed to provide a satisfactory operational definition of intelligence.
▸A computer passes the test if a human interrogator, after posing some written questions, cannot tell whether the written
responses come from a person or from a computer.
4
Mohammad Imam Hossain | Lecturer, Dept. of CSE | UIU
5. 1. Acting Humanly >> Turing Test approach
▸To design such computers to pass the Turing Test need to possess the following capabilities:
▹Natural Language Processing – to enable it to communicate successfully in English.
▹Knowledge Representation – to store what it knows or hears.
▹Automated Reasoning – to use the stored information to answer questions and to draw new conclusions.
▹Machine Learning – to adapt to new circumstances and to detect and extrapolate patterns.
▸To pass the Total Turing Test computers will also need:
▹Computer vision – to perceive objects.
▹Robotics – to manipulate objects and move about.
▸AI researcher have devoted little effort to passing the Turing Test, believing that it is more important to study the underlying
principles of intelligence than to duplicate an exemplar.
5
Mohammad Imam Hossain | Lecturer, Dept. of CSE | UIU
6. 2. Thinking Humanly >> Cognitive Modeling approach
The automation of activities that we associate with human thinking, activities such as decision-making, problem solving,
learning etc.
If we want to say that a given program thinks like a human, then we must have some way of determining how human think.
There are 3 approaches:
▸through Introspection – trying to catch our own thoughts as they go by.
▸through Psychological experiments – observing a person in action.
▸through Brain imaging – observing the brain in action.
Once we have sufficiently precise theory of the mind it becomes possible to express the theory as a computer program.
>> If the program’s input-output behavior matches corresponding human behavior, that is evidence that some of the
program's mechanisms could also be operating in humans.
6
Mohammad Imam Hossain | Lecturer, Dept. of CSE | UIU
7. 2. Thinking Humanly >> Cognitive Modeling approach
The interdisciplinary field of cognitive science brings together computer models from AI and experimental techniques from
psychology to construct precise and testable theories of the human mind.
Cognitive Modeling Approach >>
▸General Problem Solver(GPS) developed by Allen Newell and Herbert Simon in 1961 is a computer program that is
designed to solve problem correctly.
▸The scientists were more concerned with comparing the trace of its reasoning steps to traces of human subjects solving
the same problems.
Real cognitive science, however is necessarily based on experimental investigation of actual humans or animals. So we will
not consider this field assuming that we have only computers available for experimentation.
7
Mohammad Imam Hossain | Lecturer, Dept. of CSE | UIU
8. 3. Thinking Rationally >> Laws of Thought approach
The study of the computations that make it possible to perceive, reason, and act.
▸Aristotle: one of the first to attempt to codify “right thinking”.
For example,
“Socrates is a man; all men are mortal; therefore, Socrates is mortal”
▸These laws of thought approach were supposed to govern the operation of the mind; their study initiated the field called
logic.
▸Logicians in the 19th century developed various forms of logic: notation and rules of derivation for thoughts;
▸Problems:
▹It is not easy to take informal knowledge and state it in the formal terms required by logical notation, particularly
when the knowledge is less than 100% certain.
▹There is a big difference between solving a problem “in principle” and solving it in practice.
8
Mohammad Imam Hossain | Lecturer, Dept. of CSE | UIU
9. 4. Acting Rationally >> Rational Agent appraoch
Agent >> An agent is just something that acts. All computer programs do something but computer agents are expected to do
more: operate autonomously, perceive their environment, persist over a prolonged time period, adapt to change, and create
and pursue goals.
Rational Agent >> It is one that acts so as to achieve the best outcome or, when there is uncertainty, the best expected
outcome.
Advantages over other approaches:
▹It is more general than the ‘laws of thought’ approach because correct inference is just one of several possible
mechanisms for achieving rationality.
▹It is more amenable to scientific development than are approaches based on human behavior or human thought
because the standard of rationality is mathematically well defined and completely general, and can be unpacked to
generate agent designs that provably achieve it.
9
Mohammad Imam Hossain | Lecturer, Dept. of CSE | UIU
11. State of the Art >> What can AI do today?
▸Robotic vehicles
▹STANLY : A driverless robotic car sped through the rough terrain of the Mojave dessert at 22mph, finishing the 132
mile course first to win the 2005 DARPA Grand Challenge.
▹CMU’s BOSS : It won the Urban challenge, safely driving in traffic through the streets of a closed air force base,
obeying traffic rules and avoiding pedestrians and other vehicles.
▸Speech recognition
▹calling United Airline’s to book flight can have the entire conversation guided by an automated speech recognition
and dialog management system.
▸Autonomous planning and scheduling
▹A hundred million miles from Earth, NASA’s Remote Agent program became the first on-board autonomous
planning program to control the scheduling of operations for a spacecraft.
▸Game playing
▹IBM’s DEEP BLUE became the first computer program to defeat the world champion in a chess match when it
bested Garry Kasparov by a score of 3.5 to 2.5 in an exhibition match.
11
Mohammad Imam Hossain | Lecturer, Dept. of CSE | UIU
12. State of the Art >> What can AI do today?
▸Spam fighting
▹Each day learning algorithms classify over a billion messages as spam, saving the recipient from having to waste
time for deleting.
▸Logistic planning
▹In 1991, US forces deployed a Dynamic Analysis and Re-planning Tool to do automated logistic planning and
scheduling for transportation.
▸Robotics
▹The iRobot Corporation has sold over two million Roomba robotic vacuum cleaners for home use.
▸Machine translation
▹A computer program automatically translates from Arabic to English
These are just a few examples of artificial intelligence systems … … …
12
Mohammad Imam Hossain | Lecturer, Dept. of CSE | UIU
13. Agents
An agent is anything that can be viewed as
- perceiving its environment through sensors and
- acting upon that environment through actuators
Human Agent >>
eyes, ears, and other organs for sensors;
hands, legs, mouth, and other body parts for actuators.
Robotic Agent >>
cameras and infrared range finders for sensors;
various motors for actuators.
Software Agent >>
keystrokes, file contents, and network packets as sensory inputs;
display the screen, writing files, and sending network packets as actions.
13
Mohammad Imam Hossain | Lecturer, Dept. of CSE | UIU
14. Agents
Percept >> agent’s perceptual inputs at any given instant.
Percept sequence >> complete history of everything the agent has ever perceived.
Agent function >> maps any given percept sequence to an action.
[f: P* A]
Agent program >> runs on the physical architecture to produce f.
Agent = Architecture + Program
14
Mohammad Imam Hossain | Lecturer, Dept. of CSE | UIU
15. Vacuum-cleaner World
15
Mohammad Imam Hossain | Lecturer, Dept. of CSE | UIU
Percepts >> location, status e.g. [A, Dirty]
Actions >> Left, Right, Suck, NoOp
16. Vacuum-cleaner World >> Tabular Agent Fn
16
Mohammad Imam Hossain | Lecturer, Dept. of CSE | UIU
Right way to fill out the table??
What makes an agent good or bad,
intelligent or stupid?
17. Rational Agents
Performance Measure >> An objective criterion for success of an agent’s behavior.
E.g. performance measure of a vacuum-cleaner agent could be amount of dirt cleaned up, amount of
time taken, amount of electricity consumed, amount of noise generated, etc.
Rational Agent >> For each possible percept sequence, a rational agent should select an action that is
expected to maximize its performance measure, given the evidence provided by the percept sequence
and whatever built-in knowledge the agent has.
17
Mohammad Imam Hossain | Lecturer, Dept. of CSE | UIU
18. Task Environment >> PEAS
In designing a rational agent, the first step must always be to specify the task environment as fully as
possible.
PEAS >> Performance measure, Environment, Actuators, Sensors
Example: agent for a self-driving car
18
Mohammad Imam Hossain | Lecturer, Dept. of CSE | UIU
19. Task Environment >> PEAS
19
Mohammad Imam Hossain | Lecturer, Dept. of CSE | UIU
20. Environment Types
Fully/Partially Observable >>
Is everything an agent requires to choose its actions available to it via its sensors?
- If so, the environment is fully accessible = Fully Observable
- If not, parts of the environment are inaccessible = Partially Observable
- Agent must make informed guesses about world
- If the agent has no sensors at all = Unobservable
20
Mohammad Imam Hossain | Lecturer, Dept. of CSE | UIU
Fully Observable Partially Observable
• Crossword puzzle
• Chess with a clock
• Backgammon
• Poker
• Taxi driving
• Part-picking robot
21. Environment Types
Single/Multi-agent >>
An agent operating by itself in an environment or there are many agents working together.
21
Mohammad Imam Hossain | Lecturer, Dept. of CSE | UIU
Single Agent Multi-agent
• Crossword puzzle
• Part-picking robot
• Chess with a clock
• Poker
• Backgammon
• Taxi driving
22. Environment Types
Deterministic/Stochastic >>
If the next state of the environment is completely determined by the current state and the action executed
by the agent, then we say the environment is deterministic; otherwise it is stochastic.
22
Mohammad Imam Hossain | Lecturer, Dept. of CSE | UIU
Deterministic Stochastic
• Crossword puzzle
• Chess with a clock
• Poker
• Backgammon
• Taxi driving
• Part-picking robot
23. Environment Types
Episodic/Sequential >>
Is the choice of current action dependent on previous actions?
- If not, then the environment is episodic
In non-episodic/sequential environments:
- Agent has to plan ahead cause current choice will affect future actions
23
Mohammad Imam Hossain | Lecturer, Dept. of CSE | UIU
Episodic Sequential
• Part-picking robot • Crossword puzzle
• Chess with a clock
• Poker
• Backgammon
• Taxi driving
24. Environment Types
Static/Dynamic/Semi-dynamic >>
- Static environments don’t change while the agent is deliberating over what to do.
- Dynamic environments do change while the agent is deciding on an action. So agent should/could
consult the world when choosing actions. Alternatively: anticipate the change during deliberation OR make
decision very fast.
- Semi-dynamic: If the environment itself does not change with the passage of time but the agent's
performance score does
24
Mohammad Imam Hossain | Lecturer, Dept. of CSE | UIU
Static Semi-dynamic Dynamic
• Crossword puzzle
• Poker
• Backgammon
• Chess with a clock • Taxi driving
• Part-picking robot
25. Environment Types
Discrete/Continuous >>
If the number of distinct percepts and actions is limited, the environment is discrete, otherwise it is
continuous.
25
Mohammad Imam Hossain | Lecturer, Dept. of CSE | UIU
Discrete Continuous
• Crossword puzzle
• Chess with a clock
• Poker
• Backgammon
• Taxi driving
• Part-picking robot