Fluid Concept Architectures An experimentation platform.

Slides:



Advertisements
Similar presentations
Heuristic Search techniques
Advertisements

Cognitive Systems, ICANN panel, Q1 What is machine intelligence, as beyond pattern matching, classification and prediction. What is machine intelligence,
Inpainting Assigment – Tips and Hints Outline how to design a good test plan selection of dimensions to test along selection of values for each dimension.
Linkage Editors Difference between a linkage editor and a linking loader: Linking loader performs all linking and relocation operations, including automatic.
Presented by: Thabet Kacem Spring Outline Contributions Introduction Proposed Approach Related Work Reconception of ADLs XTEAM Tool Chain Discussion.
My Group’s Current Research on Image Understanding.
Generated Waypoint Efficiency: The efficiency considered here is defined as follows: As can be seen from the graph, for the obstruction radius values (200,
Problem Solving and Search in AI Part I Search and Intelligence Search is one of the most powerful approaches to problem solving in AI Search is a universal.
Yiannis Demiris and Anthony Dearden By James Gilbert.
S EMINAL : Searching for ML Type-Error Messages Benjamin Lerner, Dan Grossman, Craig Chambers University of Washington.
Locality Aware Dynamic Load Management for Massively Multiplayer Games Jin Chen, Baohua Wu, Margaret Delap, Bjorn Knutson, Honghui Lu and Cristina Amza.
I1-[OntoSpace] Ontologies for Spatial Communication John Bateman, Kerstin Fischer, Reinhard Moratz Scott Farrar, Thora Tenbrink.
Petacat: Applying ideas from Copycat to image understanding.
Analyzing the tradeoffs between breakup and cloning in the context of organizational self-design By Sachin Kamboj.
A Summary of the Article “Intelligence Without Representation” by Rodney A. Brooks (1987) Presented by Dain Finn.
CSE351/ IT351 Modeling And Simulation Choosing a Mesh Model Dr. Jim Holten.
An Approach for Configuring Ontology- based Application Context Model Chung-Seong Hong, Hyun Kim, Hyoung-Sun Kim Electronics and Telecommunication Research.
Intelligent User Interfaces Research Group Directed by: Frank Shipman.
Knowledge Acquisition CIS 479/579 Bruce R. Maxim UM-Dearborn.
Marakas: Decision Support Systems, 2nd Edition © 2003, Prentice-Hall Chapter Chapter 7: Expert Systems and Artificial Intelligence Decision Support.
© P. Pongcharoen ISA/1 Applying Designed Experiments to Optimise the Performance of Genetic Algorithms for Scheduling Capital Products P. Pongcharoen,
Workspace-based Connectivity Oracle An Adaptive Sampling Strategy for PRM Planning Hanna Kurniawati and David Hsu Presented by Nicolas Lee and Stephen.
Software Issues Derived from Dr. Fawcett’s Slides Phil Pratt-Szeliga Fall 2009.
Concept Mapping. What is Concept Mapping ? Concept mapping is a technique for representing knowledge in graphs. This technique was developed by Professor.
1 Combinatorial Problems in Cooperative Control: Complexity and Scalability Carla Gomes and Bart Selman Cornell University Muri Meeting March 2002.
Heuristic Search Heuristic - a “rule of thumb” used to help guide search often, something learned experientially and recalled when needed Heuristic Function.
Genetic Algorithms Overview Genetic Algorithms: a gentle introduction –What are GAs –How do they work/ Why? –Critical issues Use in Data Mining –GAs.
CASE Tools And Their Effect On Software Quality Peter Geddis – pxg07u.
Creational Patterns Making Objects The Smart Way Brent Ramerth Abstract Factory, Builder.
A Randomized Approach to Robot Path Planning Based on Lazy Evaluation Robert Bohlin, Lydia E. Kavraki (2001) Presented by: Robbie Paolini.
Constraints-based Motion Planning for an Automatic, Flexible Laser Scanning Robotized Platform Th. Borangiu, A. Dogar, A. Dumitrache University Politehnica.
Chapter 14: Artificial Intelligence Invitation to Computer Science, C++ Version, Third Edition.
COMP 410 & Sky.NET May 2 nd, What is COMP 410? Forming an independent company The customer The planning Learning teamwork.
Stochastic Algorithms Some of the fastest known algorithms for certain tasks rely on chance Stochastic/Randomized Algorithms Two common variations – Monte.
Implementing and Integrating AI Systems. What Is Implementation? Implementation can be defined as getting a newly developed or significantly changed system.
Learning Science and Mathematics Concepts, Models, Representations and Talk Colleen Megowan.
ANTs PI Meeting, Nov. 29, 2000W. Zhang, Washington University1 Flexible Methods for Multi-agent distributed resource Allocation by Exploiting Phase Transitions.
Genetic Algorithms Michael J. Watts
Knowledge Representation CPTR 314. The need of a Good Representation  The representation that is used to represent a problem is very important  The.
1 CO Games Development 1 Week 11 Search Methods Gareth Bellaby.
110/19/2015CS360 AI & Robotics AI Application Areas  Neural Networks and Genetic Algorithms  These model the structure of neurons in the brain  Humans.
MURI: Integrated Fusion, Performance Prediction, and Sensor Management for Automatic Target Exploitation 1 Dynamic Sensor Resource Management for ATE MURI.
Issues Autonomic operation (fault tolerance) Minimize interference to applications Hardware support for new operating systems Resource management (global.
Digital Intuition Cluster, Smart Geometry 2013, Stylianos Dritsas, Mirco Becker, David Kosdruy, Juan Subercaseaux Welcome Notes Overview 1. Perspective.
Chapter 6 – Architectural Design Lecture 1 1Chapter 6 Architectural design.
MROrder: Flexible Job Ordering Optimization for Online MapReduce Workloads School of Computer Engineering Nanyang Technological University 30 th Aug 2013.
Introduction to Artificial Intelligence CS 438 Spring 2008 Today –AIMA, Ch. 25 –Robotics Thursday –Robotics continued Home Work due next Tuesday –Ch. 13:
1 Hypermedia Design Models & Methodologies Dr Gary Wills IAM Research Group © University of Southampton.
AI Lecture 17 Planning Noémie Elhadad (substituting for Prof. McKeown)
KNOWLEDGE BASED SYSTEMS
Chapter 10. The Explorer System in Cognitive Systems, Christensen et al. Course: Robots Learning from Humans On, Kyoung-Woon Biointelligence Laboratory.
Rational Agency CSMC Introduction to Artificial Intelligence January 8, 2007.
Over-Trained Network Node Removal and Neurotransmitter-Inspired Artificial Neural Networks By: Kyle Wray.
Partitioning using Mesh Adjacencies  Graph-based dynamic balancing Parallel construction and balancing of standard partition graph with small cuts takes.
OPERATING SYSTEMS CS 3530 Summer 2014 Systems and Models Chapter 03.
Winter 2011SEG Chapter 11 Chapter 1 (Part 1) Review from previous courses Subject 1: The Software Development Process.
Rational Agency CSMC Introduction to Artificial Intelligence January 8, 2004.
Chapter Ten The Bridge Pattern Ku-Yaw Chang Assistant Professor, Department of Computer Science and Information Engineering Da-Yeh.
Update on Modeling Activities Gun Simulation Optimization Using Genetic Algorithms.
Hierarchical Modeling.  Explain the 3 different types of model for which computer graphics is used for.  Differentiate the 2 different types of entity.
Systems Analysis and Design in a Changing World, Fourth Edition
The Emergent Structure of Development Tasks
DRAWING APPRENTICE BY ANAMIKA SHARAF.
Behavioral Design Patterns
The Tree-String Problem
Artificial Intelligence
CIS 488/588 Bruce R. Maxim UM-Dearborn
M. Kezunovic (P.I.) S. S. Luo D. Ristanovic Texas A&M University
Search.
Search.
Presentation transcript:

Fluid Concept Architectures An experimentation platform

2/21 Overview Rationale Common problems in AI Running example Strategies Fluid Concepts High-level Perception Parallel Terraced Scan Architecture Conclusion Benefits & shortcomings An experimentation platform

3/21 Common problems in AI Bird’s nest problem (Minsky) Complex construction Parts are well designed (to the robot) and available Simple construction Debris on floor not designed to build nests

4/21 Common problems in AI Bird’s nest problem (Minsky) Likewise: 9x9 chess? “inability to handle the variation in real life” Can we represent the fluidity of concepts? overlapping and associative nature blurry and shifting boundaries adaptability to context

5/21 Common problems in AI Frame problem How to identify effectively which data are relevant in solving a problem (without first solving the problem)? Is relevant in the solution?  find a solution with No time to try all data! Make educated guesses (e.g. heuristics) Abstract data (how?)

6/21 Common problems in AI Frame problem Can we let relevance emerge through interplay between problem concepts and specific data? relevant concepts shapes the abstraction of data specific data adapts relevance of concepts French flag blue, white, red circle, trapezoid rectangle

7/21 Common problems in AI Combinatorial explosion Can we use relevance to focus search? avoid brute-force search

8/21 Overview Rationale Common problems in AI Running example Strategies Fluid Concepts High-level Perception Parallel Terraced Scan Architecture Conclusion Benefits & shortcomings An experimentation platform

9/21 Running example Letter recognition

10/21 Overview Rationale Common problems in AI Running example Strategies Fluid Concepts High-level Perception Parallel Terraced Scan Architecture Conclusion Benefits & shortcomings An experimentation platform

11/21 Strategies Fluid Concepts (Slipnet) Concepts Associations Conceptual distance (resistance) Relations (labels) Relevance (activation) Activation decay Conceptual depth Sparking Activation spreading Label nodes Conceptual shifting part of right to below left deep concepts decay slower.4.9

12/21 Strategies High-level Perception (Workspace) Percepts Mapping Abstracting Sparking Focus on: “salient” percepts  Relevant mappings  Active mappings  Low happiness height: short.8 width: wide curvature: slight-left shape: cupped height: tall tip1:NW tip1: east shape: cupped curvature: right Contextually relevant concepts are activated Percepts bound to relevance of these concepts Relevance?

13/21 Strategies Parallel Terraced Scan “A parallel investigation of many possibilities to different levels of depth, quickly throwing out bad ones and homing in accurately and rapidly on good ones.” (D.R.Hofstadter) Build percepts in phases: Measure promise with a quick test If okay, examine closer If okay, build it Work in (simulated) parallel How?

14/21 Strategies Parallel Terraced Scan Codelets (~ ant systems) Each performs tiny part of algorithm:  Scouts, examiners, builders Called with specific urgency:  Scouts are continuously added (low urgency)  Follow-up codelets (urgency = promise of percept)  Active concepts (high urgency) Scheduler picks next codelet (stochasticly) Strongest pressures commingle

15/21 Overview Rationale Common problems in AI Running example Strategies Fluid Concepts High-level Perception Parallel Terraced Scan Architecture Conclusion Benefits & shortcomings An experimentation platform

16/21 Architecture Slipnet Node activation spreads through conceptual links Activation is sparked with every mapping Workspace Coderack Highly activated nodes spawn top- down codelets Codelets call in follow-up codelets Bottom-up codelets continuously added Codelets enter workspace

17/21 Overview Rationale Common problems in AI Running example Strategies Fluid Concepts High-level Perception Parallel Terraced Scan Architecture Conclusion Benefits & shortcomings An experimentation platform

18/21 Benefits Handles concepts fluently Flexible representations, flexible actions “Searches” through interpretation space Not trying all possible combinations Does its own representation building Sensitive to pressures from actual situation Much more independent Can generate original viewpoints Remains symbolical Representations easily referenced and manipulated

19/21 Shortcomings Hard to set up good domain Requires thorough study Doesn’t learn (yet) Behavior depends on many parameters Hard to see how change affects behavior Hard to experiment with No flexible code base available Start from scratch

20/21 An experimentation platform Component based approach E.g. replace semantic network User writes objects, dynamically loaded Codelets, percepts are very dynamic entities Uniform communication between components

21/21 Generalizations Allow multiple workspaces (and schedulers) Different “parts” in problem Delegate different levels of perception (≠ codelets,…) Allow different approaches Information in codelets vs. network vs. percepts