Differences

This shows you the differences between two versions of the page.

--- public:t_720_atai:atai-18:lecture_notes_w3 [2018/08/30 19:27] – thorisson
+++ public:t_720_atai:atai-18:lecture_notes_w3 [2024/04/29 13:33] (current) – external edit 127.0.0.1
@@ Line 11: / Line 11: @@
 \\
+====Task-Environments: Key Concepts====
+|  Task  | A Problem that can be assigned. Typically comes with Instructions (guide to Solutions).  |
+|  Problem  | A Goal with (all) relevant constraints (≈ requirements).  |
+|  Problem Family |  A set of problems that are similar in some (important) ways; a Problem plus variations of that Problem.  |
+|  Goal  | A (future) State to be attained, plus optional constraints on the Goal.  |
+|  State  | A set of values (with error bounds) for a set of variables relevant to a Goal.  |
+|  Environment  | A set of constraints relevant to a Task but not counted as part of a Task proper.   |
+|  World  | A set of constraints that a set of Environments have in common.  |
+|  Constraint  | A set of factors that limit the flexibility of that which it constrains.  |
+|  Solution  | The set of (atomic) actions that can achieve a Goal.  |
+|  Action  | The changes an Agent can make to variables relevant to a Task-Environment.  |
+|  Plan  | A partial way to accomplish a Task.   |
+|  Instructions  | Partial Plan for accomplishing a Task, typically given to an Agent along with a Task by a Teacher.  |
+|  Teacher  | The Agent assigning a Task to another Agent (student), optionally in charge of Instructions.  |
+\\
+\\
+====Task-Environment Constraints====
+|  Solution Constraint  | Reduces the flexibility for producing a Solution.   |
+|  Task Constraint  | Limits the allowed Solution Space for a Problem. Can help or hinder a Task to be achieved.   |
+|  Solution Space  | The amount of variation allowed on a State while still counting as a Solution to a Problem.  |
+|  Task Space  | The size of variations on a Task that would have be explored with no up-front knowledge or information about the Solution Space of a Problem.  |
+\\
+\\
+====Limited Time & Energy====
+| Task | All tasks have a limited time & energy: No Task exists that can be performed with infinite energy, or for for which infinite time is available for achieving.  |
+|  LTE  | Limited Time & Energy.  |
+\\
+\\
+====Problems in Task-Environments====
+|  Closed Problem  | May be assigned as a Task with known Time & Energy for achieving a solution.  |
+|  Example  | Doing the dishes.  |
+|  Plans for Closed problems | Can be reliably produced for closed problems, e.g. in the form of Instructions.  |
+|  Open Problem  | A Problem whose solution is unknown and cannot be obviously assumed from analogy with similar problems whose solution is known. Cannot be guaranteed a solution with LTE.  |
+|  Example  | Any research problem for which no known solution exists.  |
+|  Plans for Open problems | Cannot be reliably produced.   |
+\\
+\\
 ====What Kind of Worlds?====
 |  Balance  | The Worlds we are interested in strike a balance between completely dynamic and completely static. \\ They also strike a balance between completely deterministic and completely random; some regularity must exist at a level that is observable initially by a learning agent.  |
@@ Line 18: / Line 65: @@
 |  Limited time  | No Task, no matter how small, takes zero time. \\ "Any task worth doing takes time." \\ All implemented intelligences will be subject to the laws of physics.   |
 |  Limited energy  | "Any task worth doing takes energy." \\ All implemented intelligences will be subject to the laws of physics.   |
-|  No task takes no time or energy  | If <m>te</m> is a function that returns time and energy, an act of perception \\ <m>te(p in P) > 0</m> \\ a decision <m>d</m> in \\ <m>{te({d in D}) > 0}</m>, \\ and an action \\ <m>te(a in A) > 0</m>. \\ It follows deductively that since any Task requires at the very least one of each of these, in the minimum case to decide whether the Goal of a Task <m>T</m> is achieved, then \\ <m>te(T) > 0</m>. \\ Anything that takes zero time or zero energy is by definition not a Task.     |
+|  No task takes zero time or energy  | If <m>te</m> is a function that returns time and energy, an act of perception \\ <m>te(p in P) > 0</m> \\ a decision <m>d</m> in \\ <m>{te({d in D}) > 0}</m>, \\ and an action \\ <m>te(a in A) > 0</m>. \\ It follows deductively that since any Task requires at the very least one of each of these, in the minimum case to decide whether the Goal of a Task <m>T</m> is achieved, then \\ <m>te(T) > 0</m>. \\ Anything that takes zero time or zero energy is by definition not a Task.     |
 \\
@@ Line 31: / Line 78: @@
-====Characterizing a World====
+====How it Hangs Together: Worlds, Environments, Tasks, Goals====
 |  World  | A set of variables with constraints and relationships. \\ <m>W = {lbrace V,F rbrace}</m> \\ where <m>V</m> is a set of variables and <m>F</m> is a set of transition functions / rules describing how the variables can change.  ||
 |  :::    | Static World   | Changes State only through Agent Action. |
@@ Line 43: / Line 90: @@
 |  Task-Environment  | An Environment in which one or more Tasks may be assigned.   ||
 |  Problem  | A Goal with (all) relevant constraints imposed by a Task-Environment.  ||
-|  Goal  | A (future) (sub-) State to be attained, plus //optional// constraints on the Goal.  ||
+|  Goal  | A (future) (sub-) State to be attained during period //t//, plus other //optional// constraints on the Goal.  ||
 |     | "Goal" definition   | <m>G subset S  </m> \\ \\ attached to a Problem.   |
@@ Line 57: / Line 104: @@
 |  Action  | The changes an Agent can make to variables relevant to a Task-Environment.  ||
 |  Plan  | A partial way to accomplish a Task.   ||
-|  |  Instructions  | Partial Plan for accomplishing a Task, typically given to an Agent along with a Task by a Teacher.  |
+|  |  Instructions  | Partial Plan for accomplishing a Task typically given to an Agent by a Teacher, along with a Task.  |
 |  Teacher  | The Agent assigning a Task to another Agent (student).  ||