Planning Methods (Non- Hierarchical Planning)
Duration: 7 min
This video lesson is available to enrolled students.
Inside: a video lesson and guided study material.
Module outline
- About Course: About the Course
- Paper 1 | General Studies: State Wise GK
- Paper 1 | Information and Communication Technology: Role of Internet and Web Services, Security in Mobile and Wireless Computing
- Paper 1 | Current Affairs: GK- Current Affairs
- Paper 2 | Discrete Mathematical Structure: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic, Probability
- Paper 2 | Digital Computer Organization And Architecture: Number System, Number Representation, Sequential Circuits, Combinational Circuit, 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
- Paper 2 | C Programming: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
- Paper 2 | Programming Languages & Object-Oriented Programming Concepts: Java, OOPS with C++, Java Fundamentals, Array, String, IO & References
- Paper 2 | Python: Introduction to Python, Tokens, Variables, Data Types, I/O, Operators & Expressions, Control Flow & Looping, Collections & Strings, Functions & Modules, File Handling & Data Analysis
- Paper 2 | Data Structure And Algorithms: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Minimum Spanning Trees, Advanced Algorithms
- Paper 2 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Unix OS
- Paper 2 | Theory Of Computation: 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
- Paper 2 | Compiler Design: 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
- Paper 2 | Database Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, Relational Algebra, SQL, Transaction Management, Concurrency Control, Database Recovery, Database Security & Authorization, Enhanced Data Models
- Paper 2 | Computer Network And Information Security: Introduction to CN, Data Communication, Application Layer, Hardware basics, Cyber Threats and Malware Attacks, Network Security, 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
- Paper 2 | Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
- Paper 2 | Current Trends & Technologies: Emerging Tech Trends, Approaches to AI, Search Algorithms, Game Playing, Knowledge Representation, Planning, Multi Agent Systems, Fuzzy Sets, Natural Language Processing, Artificial Neural Networks, Genetic Algorithms, Artificial Intelligence, Data Warehousing & Mining, Electronic Data Interchange and E-Commerce, Terms & Abbreviations
- Paper 2 | Full Length Mock Tests:
AI summary & chapters
AI Summary
An AI-generated summary of this video lecture.
The lecture introduces Non-Hierarchical Planners, focusing on STRIPS (Stanford Research Institute Problem Solver). It covers the history of STRIPS, its development by Fikes and Nilsson in 1971 for the Shakey robot, and its mathematical formulation as a quadruple <P, O, I, G>. The session concludes by defining the components of a STRIPS action (Pre_Cond, ADD, DELETE lists) and introducing the Block World problem as an example.
Chapters
0:00 – 2:00 00:00-02:00
The instructor introduces "Non Hierarchical Planners," explaining that early methods lacked structure, leading to poor performance. The slide text states, "The earliest methods of planning made no distinction between more or less important plan elements." The instructor underlines key phrases like "made no distinction" and "poor performance" while writing "actions & goal -> plan" on the screen to illustrate the basic input-output relationship of these planners. The slide also mentions that STRIPS was one of the earliest non-hierarchical planners. The instructor emphasizes that the lack of structure was a significant issue. The slide text "Thus the lack of structure led to poor performance" is underlined. The instructor writes "actions & goal -> plan" to show the flow. The slide also mentions "One of the earliest non hierarchical planners was STRIPS."
2:00 – 5:00 02:00-05:00
The focus shifts to "STRIPS (Stanford Research Institute Problem Solver)." The slide details that STRIPS is an automated planner developed by Richard Fikes and Nils Nilsson in 1971 at SRI International. The instructor highlights that STRIPS was used in "Shakey," one of the first AI robots. Handwritten notes link "Shakey" to "First" and "STRIP" to "non hierarchi," emphasizing its historical significance and classification. The slide describes STRIPS as an "action-centric representation" where each action specifies its effect. The instructor underlines "action-centric representation" and "specifies the effect of an action." The slide also mentions that for each action, it specifies the effect of an action. The instructor writes "Shakey -> First" and "STRIP -> non hierarchi" on the screen. The slide text "The Stanford Research Institute Problem Solver, known by its acronym STRIPS, is an automated planner developed by Richard Fikes and Nils Nilsson in 1971 at SRI International" is fully visible. The instructor underlines "Richard Fikes and Nils Nilsson" and "1971".
5:00 – 7:16 05:00-07:16
The lecture defines the mathematical structure of a STRIPS problem as a quadruple <P, O, I, G>. The instructor underlines each component: P (conditions), O (operators/actions), I (initial state), and G (goal state). The presentation then moves to the representation of an action, listing three specific lists: "Pre_Cond list," "ADD list," and "DELETE list." Finally, the "Block World Problem" is introduced with diagrams showing State 1 and State 2 to demonstrate how states are represented as sets of facts or propositions. The slide explicitly lists "Pre_Cond list contains predicates which have to be true before operation" and "ADD list contains those predicates which will be true after operation." The instructor also writes "Precond -> Actions ->" on the screen. The slide also mentions "Mathematically, a STRIPS instance is a quadruple <P,O,I,G>". The slide also lists "P is a set of conditions (i.e., propositional variables)" and "O is a set of operators (i.e., actions)". The instructor underlines "quadruple <P,O,I,G>". The slide also lists "I is the initial state, given as the set of conditions that are initially true (all others are assumed false)" and "G is the specification of the goal state".
The video provides a comprehensive overview of STRIPS, starting from the limitations of early non-hierarchical planning methods. It establishes the historical context of STRIPS through its creators and the Shakey robot. The core of the lecture is the formal definition of a STRIPS problem using the quadruple <P, O, I, G> and the breakdown of action representation into Pre_Cond, ADD, and DELETE lists. This progression moves from general concepts to specific mathematical definitions and practical examples like the Block World problem. The instructor uses handwritten notes to reinforce key concepts like "actions & goal -> plan" and "Shakey -> First". The lecture effectively bridges the gap between theoretical planning concepts and their implementation in early AI systems. The detailed breakdown of the quadruple <P, O, I, G> provides a clear mathematical framework for understanding STRIPS problems. The instructor also highlights the importance of preconditions and postconditions in defining actions.