Planning Methods (Non- Hierarchical Planning) Part 2

Duration: 11 min

This video lesson is available to enrolled students.

Return to /learn/UPPSC-POLYTECHNIC-LECTURER-2025-CS/paper-2-artificial-intelligence/artificial-intelligence-planning/non-linear-and-plan-space-planning/asset-planning-methods-non-hierarchical-planning-part-2 after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: UPPSC Course Overview
  2. Interview Preparation & Guidance: Interview Preparation
  3. Paper 1 | General Hindi: भाषा, लिपि, ध्वनि, वर्ण, अक्षर, स्वर, व्यंजन, मात्रा और संयुक्ताक्षर, वर्तनी, वर्ण-विन्यास, अनुस्वार, अनुनासिक, चंद्रबिंदु और ‘र’ के रूप, शब्द, पद और शब्द-भेद, संज्ञा और सर्वनाम, विशेषण और क्रिया, लिंग, वचन, पुरुष और कारक, काल, वाच्य, वाक्य और वाक्य-भेद, वर्णमाला, समास, संधि, विलोम शब्द, पर्यायवाची शब्द, सामान्य अशुद्धियाँ, अनेक शब्दों के लिए एक शब्द, मुहावरे और लोकोक्तियाँ, अपठित गद्यांश और अपठित पद्यांश, Multi-Topic Content (Cross-Concept Material), शब्द-भंडार, वर्ण-विचार, हिन्दी की ध्वनि और स्वनिम व्यवस्था, प्राचीन और मध्यकालीन भारतीय आर्यभाषाएँ, काव्य के लक्षण, हेतु और प्रयोजन, अशुद्धि-शोधन, शब्द-रचना, शब्द-भेद, हिन्दी की रूप रचना, रूप-रचना, हिन्दी शब्द रचना, हिन्दी साहित्येतिहास दर्शन, भक्तिकालीन काव्यधाराएँ, भारतीय काव्यशास्त्र की परंपरा, भारतीय नवजागरण और स्वाधीनता आंदोलन, अन्य गद्य विधाएँ एवं प्रवासी साहित्य, निर्धारित उपन्यासों का तुलनात्मक अध्ययन, गोदान, हिन्दी कहानी का विकास, स्वातंत्र्योत्तर और नयी कहानी, हिन्दी निबंध का विकास, शुक्लोत्तर निबंध, द्विवेदी और शुक्ल युग के निबंध, हिन्दी की संवैधानिक स्थिति, आधुनिक भारतीय आर्यभाषाएँ और हिन्दी का उद्भव, हिन्दी भाषा प्रयोग के विविध रूप, रीतिकाल, जीवनी, द्विवेदी युग और छायावाद, रीति, वक्रोक्ति और औचित्य सिद्धान्त, शब्दशक्ति और ध्वनि सिद्धान्त, रस सिद्धान्त और साधारणीकरण, उत्तर आधुनिकतावाद, लोहिया दर्शन, हिन्दी उपन्यास का विकास, हिन्दी नवजागरण, अंबेडकर दर्शन, आदिकाल, प्रयोगवाद और नयी कविता, छायावादी काव्य: प्रसाद और निराला, प्रगतिवाद से समकालीन कविता, निर्गुण भक्ति काव्य, द्विवेदीयुगीन काव्य, रीतिकालीन काव्य, आरंभिक हिन्दी उपन्यास, स्वातंत्र्योत्तर उपन्यास, आत्मकथा, स्वाधीनता-पूर्व प्रेमचंदोत्तर उपन्यास, निर्धारित कहानियों का तुलनात्मक अध्ययन, साठोत्तरी नाटक, प्रसाद और प्रसादोत्तर युग के नाटक, भारतेन्दु युगीन नाटक, स्वातंत्र्योत्तर नाटक, भारतेन्दु युगीन निबंध, संस्मरण और रेखाचित्र, व्यंग्य, एक साहित्यिक की डायरी, संस्कृति के चार अध्याय, सगुण भक्ति काव्य, हिन्दी नाटक, एकांकी और रंगमंच, आधुनिक गद्य और हिन्दी नवजागरण, अलंकार सिद्धान्त, हिन्दी आलोचना का विकास, भक्ति आंदोलन, कल्पना, बिम्ब, प्रतीक, मिथक और फंतासी, नयी कविता का विस्तार और साठोत्तरी कविता, उत्तर-छायावादी और प्रगतिवादी काव्य, काव्यगुण और काव्यदोष, प्लेटो, अरस्तू और पाश्चात्य परंपरा, मार्क्सवाद, स्वच्छन्दतावादी काव्यशास्त्र, आधुनिक पाश्चात्य आलोचना, भाषा और भाषा परिवार, देवनागरी लिपि
  4. Paper 2 | General Studies: State Wise GK, Polity, Geography, History, GK- Current Affairs
  5. Paper 1 | Programming Language: Language Design, C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling, OOPS with C++
  6. Paper 1 | Database Management Systems: 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, ORDBMS, NoSQL
  7. Paper 1 | Cyber Security: Society, Law & Ethics, Cyber Threats and Malware Attacks, Role of Internet and Web Services, Security in Mobile and Wireless Computing, Electronic Data Interchange and E-Commerce, Physical Security and Cryptography Basics, Intrusion Detection Systems (IDS), Cyber Safety and Security, Ethical Hacking
  8. Paper 1 | Computer Organization and Architecture: Basics of COA, Programming the Basic Computer, Cache Memory Organization, Input Output Organisation, Instr Formats & Modes, Register Transfer and Microoperations, Control Unit Design
  9. Paper 1 | Computer Networks: 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
  10. Paper 1 | Design and Analysis of Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Advanced Algorithms
  11. Paper 1 | Data Structures: Introduction to DS, Array, Linked List, Stack, Queue, Tree, Graphs, Hashing
  12. Paper 1 | Discrete Structures and Theory of Logic: Permutation and Combination, Set Theory, Relations, Functions, Propositional and Predicate Logic, Graph Theory, Group Theory
  13. Paper 1 | Software Project Management: Software Project Management
  14. Paper 2 | Operating Systems: 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, Security
  15. 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, Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Pushdown Automata & CFG, Complexity Theory
  16. Paper 2 | Artificial Intelligence & High Performance Computing: Approaches to AI, Search Algorithms, Game Playing, Knowledge Representation, Planning, Multi Agent Systems, Natural Language Processing, Emerging Tech Trends
  17. Paper 2 | Image Processing: Digital Image Fundamentals, Image Enhancement, Image Restoration, Color Image Processing, Image Compression
  18. 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
  19. Paper 2 | Computer Graphics: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing, 3-D Object Representation, Geometric Transformations and Viewing
  20. Paper 2 | Web Technologies: Website, Browser & Services, Internet Fundamentals, Web Design & Development, Protocols & Services, Web Publishing & Hosting, Server Side & Security, Emerging Technologies, HTML Basics, JavaScript-Basics, Java
  21. Paper 2 | Soft Computing: Fuzzy Sets, Artificial Neural Networks, Genetic Algorithms
  22. Paper 2 | Distributed System: Distributed Systems
  23. UPPSC Live Class Recordings: UPPSC Polytechnic Lecturer 2025 (CS)
  24. Previous Year Papers:
  25. Mock Test:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

The lecture provides a comprehensive introduction to the STRIPS (Stanford Research Institute Problem Solver) representation used in artificial intelligence planning. Using the classic Block World problem as a running example, the instructor explains how states are represented as sets of facts or propositions. The session details the mathematical structure of a STRIPS problem, defined as a quadruple <P, O, I, G>, where P represents conditions, O represents operators, I is the initial state, and G is the goal state. A significant portion is dedicated to defining actions, which are structured into three lists: Pre_Cond (preconditions), ADD (effects that become true), and DELETE (effects that become false). The instructor also clarifies the Closed World Assumption (CWA), explaining that any fact not explicitly listed in a state is assumed to be false, implying full observability for the agent. The lesson culminates in a detailed breakdown of the `Stack(A, B)` action, showing how it transforms one state into another by modifying the set of facts.

Chapters

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

    The video begins by introducing the Block World problem to illustrate STRIPS representation. The slide displays two distinct scenarios labeled "State 1" and "State 2". In State 1, block B is on block C, and the robot is holding block A. The text explicitly lists the facts for this state: `holding(A)`, `clear(B)`, `on(B,C)`, and `onTable(C)`. State 2 shows a different configuration where block A is now on top of block B, which remains on C. The instructor notes that states are represented as a set of facts, which are also referred to as propositions. The visual setup establishes the context for understanding how changes in the physical world are translated into logical representations. The slide text emphasizes that State 1 is represented by specific facts like "C is on the table, B is on C, there is nothing on top of B, so clear B and the robot is holding A." This sets the stage for defining how actions modify these states.

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

    The presentation shifts to the formal definition of STRIPS actions. The slide lists three specific components: the Pre_Cond list, which contains predicates that must be true before an operation; the ADD list, containing predicates that will be true after the operation; and the DELETE list, containing predicates that are no longer true. The instructor then defines a STRIPS Problem as being composed of an initial state, a specification of goal states, and a set of actions. Mathematically, this is presented as a quadruple <P, O, I, G>. The instructor writes "Close World Assumption" on the screen and draws a box labeled "State" with "True" inside and "Not Valid" outside to illustrate that unlisted facts are false. This section establishes the theoretical framework, defining P as a set of conditions (propositional variables), O as a set of operators (actions), I as the initial state, and G as the goal state specification.

  3. 5:00 – 10:00 05:00-10:00

    Returning to the Block World example, the instructor elaborates on the Closed World Assumption (CWA), highlighting the text "that is the facts that are not listed in a state are assumed to be false." This implies the agent has full observability. The lecture then discusses goals in STRIPS, represented as a set of facts. It compares State 1 and State 2 regarding the goal `on(A, B)`, noting that State 1 is not a goal state while State 2 is. The focus then moves to "Representing Actions," defining them by preconditions, add effects, and delete effects. The action `Stack(A, B)` is shown transforming State 1 to State 2. The specific sets are listed: Precondition set `{holding(A), Clear(B)}`, ADD Set `{on(A,B), handEmpty, Clear(A)}`, and DEL Set `{holding(A), Clear(B)}`. This concrete example bridges the gap between abstract definitions and practical application.

  4. 10:00 – 10:50 10:00-10:50

    In the final segment, the instructor reinforces the structure of the `Stack(A, B)` action. She writes "Action precondition set", "ADD SET", and "DEL SET" on the slide, underlining the key terms. She circles the action name "Stack(A,B)" and writes "Condition" next to the facts in State 2. The instructor also draws a "State Space" diagram, sketching a box with arrows indicating transitions between states, visually representing the search space the planner navigates. She writes "Block World" and "Action" to categorize the content. This section serves as a summary of the action definition, ensuring students understand how the three lists (Pre_Cond, ADD, DELETE) work together to define the mechanics of an action within the STRIPS framework.

The lecture systematically builds the understanding of STRIPS representation, starting from concrete examples in the Block World domain and moving to abstract mathematical definitions. It emphasizes the importance of state representation as sets of facts and the role of the Closed World Assumption in simplifying the problem space. By breaking down actions into preconditions, add lists, and delete lists, the instructor provides a clear mechanism for how planners modify states to reach goals. The use of the `Stack(A, B)` action as a running example effectively demonstrates the transition from an initial state to a goal state, reinforcing the theoretical concepts with practical application.

Loading lesson…