Addmissible hueristic

Duration: 7 min

This video lesson is available to enrolled students.

Return to /learn/ISRO/ai-machine-learning-big-data-cloud/search-algorithms/fundamentals-of-heuristic-search/asset-addmissible-hueristic after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. General Aptitude & Reasoning: Number System, Percentage, Ratio and Proportion (Ratios), Average, Profit and Loss, Simple Interest and Compound Interest, Time and Work, Speed Time and Distance, Mixture and Alligation, Data Interpretation, Algebra, Probability, Permutation and Combination, Venn Diagram, HCF LCM, Divisibility Rules, Age Problems, Pipe and Cistern, Partnership, Linear Algebra, Sequence and Series (Series), Statistics, Powers and Exponents (Surds and Indices), Arithmetic, Mensuration and Geometry, Calculus, Trigonometry, Vectors, Speed Mathematics and Basic Mathematics, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Analogy, Series (Number and Letter Series) (Numerical Relations and Reasoning), Puzzle Solving (Puzzles), Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Calendar, Seating Arrangements, Coding Decoding, Blood Relations, Directions (Direction Test), Clock, Analytical Reasoning (Counting Figures Reasoning), Ranking, Order and Sequence, Logical Sequence Of Words, Inequality, Data Sufficiency, Cubes & Dices
  3. Computer Networks & Cybersecurity: Introduction to CN, Data Communication, DLL: Access Control, DLL: Flow Control, DLL: Error Control, DLL: Framing, Data Link Layer - Ethernet, Net Layer: IPv4 & Proto, Net Layer: IP Addressing, Net Layer:Routing Protocol, Transport Layer Services, TL: Congestion & UDP, Application Layer, Hardware Basics, Network Security
  4. Programming, Data Structures & Algorithms: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling, OOPS with C++, Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Advanced Algorithms
  5. AI, Machine Learning, Big Data & Cloud: Emerging Tech Trends, Artificial Intelligence, Big Data Systems, Approaches to AI, Search Algorithms, Knowledge Representation, Cloud Computing
  6. Digital Logic & Computer Organization: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Register Transfer and Microoperations, Control Unit Design, Programming the Basic Computer
  7. TOC & Compiler: Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Grammar, Regular Language Properties, Moore & Mealy Machines, Pushdown Automata & CFG, Turing Machines, Complexity Theory, Intro to Compilers, Lexical Analysis, Grammar & CFG, Syntax Analysis: Top-Down, Syntax Analysis: Bottom-Up, Semantic Analysis & SDT, Intermediate Code Gen, Code Optimization, Run Time Environment
  8. Discrete Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic
  9. Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management, Unix OS, Linux OS, Distributed Systems
  10. Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management, Object Oriented Technology, HTML Basics, JavaScript-Basics, Java, XML
  11. Database Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, File Organization & Indexing, Relational Algebra, SQL, Relational Calculus, Transaction Management, Concurrency Control, Database Recovery, Data Warehousing & Mining, Enhanced Data Models, NoSQL
  12. Other Recurring CS Topics: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing, Multimedia
  13. Live Classes: ISRO Live classes
  14. Full Mock Test:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This lecture segment focuses on heuristic search strategies in Artificial Intelligence, specifically detailing the concept of admissible heuristics. The instructor begins by defining heuristics as a balance between exploring new possibilities and utilizing domain-specific knowledge. She then transitions to a practical example involving car prices to illustrate how admissible heuristics function as optimistic estimates that never overestimate the true cost. The lesson culminates in a formal definition of admissibility, presenting the mathematical condition required for optimality in search algorithms.

Chapters

  1. 0:00 – 2:00 00:00-02:00

    The instructor introduces the concept of heuristic search strategies, highlighting that they strike a balance between exploring new possibilities and using domain-specific knowledge. On the slide, she writes "Heuristic -> accurate information" and "Estimation [Domain knowledge]", circling the terms "Estimate" and "Domain Knowledge" to emphasize their importance. She introduces the term "Admissible heuristics" and writes "3/4/5", likely referencing a specific problem set or example values that will be used to explain the concept further.

  2. 2:00 – 5:00 02:00-05:00

    The lecture addresses a multiple-choice question regarding pattern matching before pivoting to a detailed explanation of admissible heuristics. The instructor creates a "Car Purchase" scenario, drawing a table with names (Shinang, Mahak, Preeti) and estimated prices (10 Lacs, 10.20 Lakh, 9 Lakh) against an "Actual cost" of 10.10 Lacs. She labels these estimates as h1, h2, and h3. She identifies h1 and h3 as admissible because their values are less than the actual cost, whereas h2 is not. She writes "Estimates < Actual cost" and "Admissible", circling h1 and h3. Finally, she writes "max(h1, h3)" to show how to combine admissible heuristics for a dominant estimate, emphasizing that the best heuristic is the one that provides the highest estimate without overestimating.

  3. 5:00 – 6:34 05:00-06:34

    The final section formalizes the concept with a slide titled "Conditions for optimality: Admissibility and consistency". The text defines an admissible heuristic as one that "never overestimates the cost to reach the goal" and notes they are "optimistic". The instructor writes the inequality h(n) <= h*(n) on the screen to mathematically represent this condition. She explains that straight-line distance is a classic example of an admissible heuristic because the shortest path between two points is a straight line, ensuring it cannot be an overestimate.

The video provides a comprehensive overview of admissible heuristics, moving from a theoretical definition to a practical application and finally to a formal mathematical condition. The instructor effectively uses a car pricing example to demonstrate that admissible heuristics must always be less than or equal to the actual cost, ensuring they are optimistic. By showing how to select the maximum of available admissible heuristics, she illustrates a method for creating a more informed search strategy. The lesson concludes by solidifying these concepts with the standard notation h(n) <= h*(n), which is crucial for understanding the optimality conditions in A* search algorithms. This progression helps students grasp not just the definition, but the practical implications of choosing the right heuristic for problem-solving.

Loading lesson…