Sussman Anomaly

Duration: 8 min

This video lesson is available to enrolled students.

Return to /learn/MPPSC-ASSISTANT-PROFESSOR-COMPUTER-SCIENCE-PAPER-2/current-trends-technologies/artificial-intelligence-planning/planning-challenges-and-anomalies/asset-sussman-anomaly after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. Paper 1 | General Studies: State Wise GK
  3. Paper 1 | Information and Communication Technology: Role of Internet and Web Services, Security in Mobile and Wireless Computing
  4. Paper 1 | Current Affairs: GK- Current Affairs
  5. 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
  6. 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
  7. Paper 2 | C Programming: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  8. Paper 2 | Programming Languages & Object-Oriented Programming Concepts: Java, OOPS with C++, Java Fundamentals, Array, String, IO & References
  9. 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
  10. 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
  11. 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
  12. 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
  13. 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
  14. 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
  15. 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
  16. 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
  17. 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
  18. Paper 2 | Full Length Mock Tests:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This lecture covers the representation of goals and actions in STRIPS, using the Blocks World problem as a primary example. It introduces the Closed World Assumption and details the Sussman Anomaly, a classic planning problem where noninterleaved planners fail to achieve stacked goals. The session concludes by introducing Plan Space Planning (Non-Linear Planning) as a solution and begins defining actions using PDDL notation.

Chapters

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

    The lecture begins by defining goals in STRIPS as a set of facts. Using the Blocks World, it illustrates that `on(A, B)` is a goal state if present in the current state. State 1 is not a goal state because A is held, whereas State 2 is a goal state because A is on B. The instructor then transitions to 'Representing Actions', explaining that actions are defined by a set of preconditions, add effects, and delete effects. Handwritten notes label 'Robot', 'Action', and 'Hand' to contextualize the components.

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

    The instructor details the Blocks World representation, stating that states are sets of facts or propositions. For State 1, the facts listed are `on(C, Table)`, `on(B, C)`, `clear(B)`, and `holding(A)`. The concept of 'Closed World Assumption (CWA)' is introduced, noting that facts not listed are assumed false. The lecture then introduces the 'Sussman Anomaly' slide, showing an initial state with C on A and B on the table, and a final state with A on B on C.

  3. 5:00 – 7:47 05:00-07:47

    The Sussman Anomaly is explained: noninterleaved planners separate goals like 'A atop B' and 'B atop C'. Achieving one goal often undoes the other, creating a conflict. The solution proposed is 'Plan Space Planning' or 'Non-Linear Planning', which allows modifying any part of the plan and shifting attention midway. Finally, the instructor introduces PDDL, defining the `Move(b, x, y)` action with preconditions like `Clear(b)` and effects like `On(b, y)`.

The video progresses from fundamental STRIPS concepts to complex planning challenges. It starts by establishing how goals and actions are formally represented using sets of facts and logical conditions. This foundation leads to the Blocks World problem, where the instructor highlights the Closed World Assumption. The core difficulty, the Sussman Anomaly, is then presented as a failure of linear planners to handle interdependent subgoals. The lecture resolves this by introducing Plan Space Planning, which allows for non-linear execution, and begins the technical specification of actions using PDDL syntax.

Loading lesson…