Working of Hierarchical Planning

Duration: 4 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/hierarchical-planning-techniques/asset-working-of-hierarchical-planning 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 segment focuses on methods for refining plans in artificial intelligence, specifically detailing Precondition-elimination abstraction and Hierarchical task-network planning (HTN). The instructor explains how these techniques insert details into a plan, moving from abstract goals to concrete actions. The session concludes with a handwritten comparison table contrasting various planning algorithms such as Goal Stack, STRIPS, and Partial Order planning based on their structural properties and capabilities.

Chapters

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

    The instructor introduces two primary methods for inserting details into a plan: Precondition-elimination abstraction and Hierarchical task-network planning (HTN). She highlights the text on the PDF, explaining that precondition-elimination mimics human intuition by solving subgoals in order of importance. She then defines HTN, writing 'HTN' and 'problem -> A task -> Subtask' on the screen to illustrate how high-level tasks are reduced to ordered lower-level tasks. The text notes that a planning problem and operators are organized into a set of tasks.

  2. 2:00 – 4:27 02:00-04:27

    The lecture continues by explaining reduction functions as mappings from tasks to subtasks, defining knowledge for obtaining detailed plans. The instructor draws a diagram showing levels from 'Abstract Level' to 'Concrete Level' with corresponding plans. She then switches to a blank PDF page to create a comparison table. She writes headers for 'Goal stack', 'State based', and 'Sussman Ana' (Sussman Anomaly), followed by rows for 'STRIPS', 'Action centric', 'Nonlinear plan', 'PO' (Partial Order), and 'Hier' (Hierarchical), noting characteristics like 'Least commitment' and 'Abstraction based'.

The video progresses from defining specific planning refinement techniques to a broader comparative analysis of planning systems. Initially, the focus is on the mechanics of HTN and precondition-elimination, emphasizing how abstract tasks are broken down. The instructor uses visual aids like diagrams and handwritten notes to clarify the hierarchy of plans. The lesson culminates in a structured comparison of different planning paradigms, highlighting their distinct features such as state-based versus action-centric approaches and their handling of planning anomalies, providing a comprehensive overview of planning algorithm classifications.

Loading lesson…