Technology to Support Individuals with Cognitive Impairment Martha E. Pollack Computer Science & Engineering University of Michigan.

Slides:



Advertisements
Similar presentations
Technology to Support Individuals with Cognitive Impairment Martha E. Pollack Computer Science & Engineering University of Michigan.
Advertisements

Modelling with expert systems. Expert systems Modelling with expert systems Coaching modelling with expert systems Advantages and limitations of modelling.
Foundations of Constraint Processing Temporal Constraints Networks 1Topic Foundations of Constraint Processing CSCE421/821, Spring
Bayesian Network and Influence Diagram A Guide to Construction And Analysis.
Online Filtering, Smoothing & Probabilistic Modeling of Streaming Data In short, Applying probabilistic models to Streams Bhargav Kanagal & Amol Deshpande.
Recursion vs. Iteration The original Lisp language was truly a functional language: –Everything was expressed as functions –No local variables –No iteration.
Artificial Intelligence Lecture 11. Computer Science Robotics & AI.
Supporting Business Decisions Expert Systems. Expert system definition Possible working definition of an expert system: –“A computer system with a knowledge.
FixtureFinder: Discovering the Existence of Electrical and Water Fixtures Vijay Srinivasan*, John Stankovic, Kamin Whitehouse University of Virginia *(Currently.
Background Reinforcement Learning (RL) agents learn to do tasks by iteratively performing actions in the world and using resulting experiences to decide.
Dynamic Bayesian Networks (DBNs)
CSE 5522: Survey of Artificial Intelligence II: Advanced Techniques Instructor: Alan Ritter TA: Fan Yang.
High-level robot behavior control using POMDPs Joelle Pineau and Sebastian Thrun Carnegie Mellon University.
1 Sensor Relocation in Mobile Sensor Networks Guiling Wang, Guohong Cao, Tom La Porta, and Wensheng Zhang Department of Computer Science & Engineering.
PlanSIG, Dec, Temporal Plans and Resource Management Pieter Buzing & Cees Witteveen Delft University of Technology.
An Approximation of Generalized Arc-Consistency for Temporal CSPs Lin Xu and Berthe Y. Choueiry Constraint Systems Laboratory Department of Computer Science.
Improving Backtrack Search For Solving the TCSP Lin Xu and Berthe Y. Choueiry Constraint Systems Laboratory Department of Computer Science and Engineering.
Efficient Techniques for Searching the Temporal CSP Lin Xu and Berthe Y. Choueiry Constraint Systems Laboratory Department of Computer Science and Engineering.
A New Efficient Algorithm for Solving the Simple Temporal Problem Lin Xu & Berthe Y. Choueiry Constraint Systems Laboratory University of Nebraska-Lincoln.
1RADAR – Scheduling Task © 2003 Carnegie Mellon University RADAR – Scheduling Task May 20, 2003 Manuela Veloso, Stephen Smith, Jaime Carbonell, Brett Browning,
BNAIC, Oct, Temporal Plans and Resource Management Pieter Buzing & Cees Witteveen TU Delft.
Consistency Methods for Temporal Reasoning Lin XU Constraint Systems Laboratory Advisor: Dr. B.Y. Choueiry April, 2003 Supported by a grant from NASA-Nebraska,
By Katharine Morton SOFTWARE AND EQUIPMENT FOR REHAB PLACES.
Home Health Care and Assisted Living John Stankovic, Sang Son, Kamin Whitehouse A.Wood, Z. He, Y. Wu, T. Hnat, S. Lin, V. Srinivasan AlarmNet is a wireless.
Personalized Medicine Research at the University of Rochester Henry Kautz Department of Computer Science.
Learning Micro-Behaviors In Support of Cognitive Assistance AlarmNet is a wireless sensor network (WSN) system for smart health-care that opens up new.
Wirelessly Accessible Sensor Populations (WASP) for Elderly Care Monitoring Presented by Student Name: Ashraf Youssef Mostafa.
Katanosh Morovat.   This concept is a formal approach for identifying the rules that encapsulate the structure, constraint, and control of the operation.
1 AI and Agents CS 171/271 (Chapters 1 and 2) Some text and images in these slides were drawn from Russel & Norvig’s published material.
Chapter 11: Artificial Intelligence
Chapter 14: Artificial Intelligence Invitation to Computer Science, C++ Version, Third Edition.
An approach to Intelligent Information Fusion in Sensor Saturated Urban Environments Charalampos Doulaverakis Centre for Research and Technology Hellas.
Mobile search engine for a smart phone / navigation system can be used to search and compare hundreds of stores and their products in seconds. © 2001 –
Ahsanul Haque *, Swarup Chandra *, Latifur Khan * and Charu Aggarwal + * Department of Computer Science, University of Texas at Dallas + IBM T. J. Watson.
Bayesian Learning By Porchelvi Vijayakumar. Cognitive Science Current Problem: How do children learn and how do they get it right?
© 2007 Tom Beckman Features:  Are autonomous software entities that act as a user’s assistant to perform discrete tasks, simplifying or completely automating.
Artificial Intelligence
Ahsanul Haque *, Swarup Chandra *, Latifur Khan * and Michael Baron + * Department of Computer Science, University of Texas at Dallas + Department of Mathematical.
© Martha E. Pollack Planning and Execution Martha E. Pollack University of Michigan PLANET International Summer School On.
Efficient Interaction Strategies for Adaptive Reminding Julie S. Weber & Martha E. Pollack Adaptive Reminder Generation SignalingIntended Approach Learning.
Inferring High-Level Behavior from Low-Level Sensors Don Peterson, Lin Liao, Dieter Fox, Henry Kautz Published in UBICOMP 2003 ICS 280.
January Smart Environments: Artificial Intelligence in the Home and Beyond Diane J. Cook
Ontology Summit 2015 Track C Report-back Summit Synthesis Session 1, 19 Feb 2015.
Vikramaditya Jakkula & Diane J. Cook Artificial Intelligence Lab Washington State University 2 nd International Conference on Technology and Aging (ICTA)
Improved Human-Robot Team performance using Chaski Proceeding: HRI '11HRI '11 Proceedings of the 6th international conference on Human-robot interaction.
I Robot.
Last Words DM 1. Mining Data Steams / Incremental Data Mining / Mining sensor data (e.g. modify a decision tree assuming that new examples arrive continuously,
Networked Embedded and Control Systems WP ICT Call 2 Objective ICT ICT National Contact Points Mercè Griera i Fisa Brussels, 23 May 2007.
Network Computing Laboratory A programming framework for Stream Synthesizing Service.
AI ● Dr. Ahmad aljaafreh. What is AI? “AI” can be defined as the simulation of human intelligence on a machine, so as to make the machine efficient to.
4 Proposed Research Projects SmartHome – Encouraging patients with mild cognitive disabilities to use digital memory notebook for activities of daily living.
SNU OOPSLA Lab. 1 Great Ideas of CS with Java Part 1 WWW & Computer programming in the language Java Ch 1: The World Wide Web Ch 2: Watch out: Here comes.
Chapter 2) CSP solving-An overview Overview of CSP solving techniques: problem reduction, search and solution synthesis Analyses of the characteristics.
Reasoning about the Behavior of Semantic Web Services with Concurrent Transaction Logic Presented By Dumitru Roman, Michael Kifer University of Innsbruk,
Rational Agency CSMC Introduction to Artificial Intelligence January 8, 2004.
CPSC 422, Lecture 17Slide 1 Intelligent Systems (AI-2) Computer Science cpsc422, Lecture 17 Oct, 19, 2015 Slide Sources D. Koller, Stanford CS - Probabilistic.
1 An infrastructure for context-awareness based on first order logic 송지수 ISI LAB.
Time Management.  Time management is concerned with OS facilities and services which measure real time.  These services include:  Keeping track of.
1 Dynamic Speed and Sensor Rate Adjustment for Mobile Robotic Systems Ala’ Qadi, Steve Goddard University of Nebraska-Lincoln Computer Science and Engineering.
CSE 473 Uncertainty. © UW CSE AI Faculty 2 Many Techniques Developed Fuzzy Logic Certainty Factors Non-monotonic logic Probability Only one has stood.
Virtual Machine Abstractions for Nomadic Pervasive Computing (NPC) Environment Presented by: Hen-I Yang, Nov. 29, 2006.
Network Management Lecture 13. MACHINE LEARNING TECHNIQUES 2 Dr. Atiq Ahmed Université de Balouchistan.
Brief Intro to Machine Learning CS539
More kinds of FSM ENGR 110 #
Chapter 11: Artificial Intelligence
Chapter 11: Artificial Intelligence
Consistency Methods for Temporal Reasoning
Basic Intro Tutorial on Machine Learning and Data Mining
Presentation transcript:

Technology to Support Individuals with Cognitive Impairment Martha E. Pollack Computer Science & Engineering University of Michigan

Autominder Model, update, and maintain the client’s plan –Including complex temporal and causal constraints Monitor the client’s performance –Updating the plan as execution proceeds Reason about what reminders to issue, and when –To most effectively ensure compliance, without sacrificing client independence

Client Modeler Plan Manager IntelligentReminderGenerator Client Plan Activity Info Inferred Activity Sensor Data Reminders Client Model Info Activity Info Preferences Plan Updates Client Model Autominder Architecture What should the client do? Technologies: Automated Planning, Constraint-Based Temporal Reasoning What is the client doing? Technologies: Dynamic Bayesian Inference Is a reminder needed? Technologies: Iterative Refinement Planning, Reinforcement Learning

Autominder Example Req/OptActivityAllowedExpectedObserved Rtoilet use10:45- 11:05 Rlunch12:00- 12:45 OTV14:00- 14:30 10:55 Rtoilet use 13:55- 14:15 REMIND 12:25 REMIND 13:55 12:28

Robot Platform Nomadic Technologies Scout II w/custom-designed head –Multiple sensors: lasers, sonars, microphone, touchscreen, camera vision, wireless ethernet – Effectors: motion, speakers, display screen, facial expression “Pearl” [courtesy Carnegie Mellon Univ. Robotics Institute]

“Ubicomp” Platform Handheld or wearable device –Currently: HP iPaq Deployed in a “smart” environment with multiple sensors (ubiquitous computing environment)

The Plan Manager Maintains up-to-date record of client’s planned activities and their execution status –Eating –Hydrating –Toileting –Medicine-taking –Exercise –Social activities –Doctors’ appointments –etc.

How Does it Work? Models constraints on future actions –Lunch takes between 25 and 35 minutes –Take meds within one hour of finishing lunch –Watch the news at either 6pm or at 11pm Performs efficient constraint processing when key events occur: –New planned activity added. –Existing activity modified or deleted. –Planned activity performed. –Critical time bounds passed.

Small Example Client Plan 1.New Activity 2.Mod/Deletion 3.Activity Execution 4.Passed Time Bound PLAN MANAGER :0  M S – L E  :60 “Take meds within 1 hour of lunch” L E = 12:15 “Lunch ended at 12:15” :15  M S  13:15 “Take meds by 1:15”

Temporal Reasoning in AI An important task & exciting research topic, otherwise we would not be here Temporal Logic Temporal Networks –Qualitative relations: Before, after, during, etc. interval algebra, point algebra –Quantitative/metric relations: 10 min before, during 15 min, etc. Simple TP (STP), Temporal CSP (TCSP), Disjunctive TP (DTP)

Temporal Network: example Tom has class at 8:00 a.m. Today, he gets up between 7:30 and 7:40 a.m. He prepares his breakfast (10-15 min). After breakfast (5-10 min), he goes to school by car (20-30 min). Will he be on time for class?

Simple Temporal Network (STP) Variable: Time point for an event Domain: A set of real numbers (time instants) Constraint: An edge between time points ([5, 10]  5  P b -P a  10) Algorithm: Floyd-Warshall, polynomial time

Example A B C [10 15] [5 10] ?

Example A B C

Example A B C

Example A B C

Example A B C [10 15] [5 10] [0 10]

Other Temporal Problems Temporal CSP: Each edge is a disjunction of intervals STP  TCSP Disjunctive Temporal Problem: Each constraint is a disjunction of edges STP  TCSP  DTP

Search to solve the TCSP/DTP TCSP [Dechter] and DTP [Stergiou & Koubarakis] are NP-hard They are solved with backtrack search Every node in the search tree is an STP to be solved An exponential number of STPs to be solved 

CM: Client Modeler Given what can be observed Sensor input: client moved to kitchen Clock time: at 7:23 a.m. Client plan: breakfast should be eaten between 7 and 8 Model of previous actions: client has not yet eaten breakfast Learned patterns: 82% of the time, client starts breakfast between 7:10 and 7:25 Reminder information: we issued a reminder at 7:21 Infers what has been done Client Activity: probability that client has begun breakfast

How Does it Work? Models probabilistic relations among observations and actions Performs Bayesian update, extended to handle temporal relations Asks for confirmation when needed! started breakfast reminder issued went to kitchen reminderkitchenstart-breakfast Y Y.95 Y N.10 N Y.8 N N.03

Intelligent Reminders Decides whether and when to issue reminders Given a client’s plan and its execution status: –Easy to generate reminders Remind at earliest possible time of each action –Harder to “remind well” Maximize likelihood of appropriate performance of ADLs and other key activities Facilitate efficient performance Avoid annoying client Avoid making client overly reliant

How Does it Work? LBD TV Midnight 8:0016:0012:00 LBD TV Midnight 8:0016:0012:00 LBD TV Midnight 8:3016:0012:00 8:30 12:32 Initially: schedule reminders for earliest possible time Apply “rewrite rules” to improve remders: Used preferred times for reminders Combine “near” reminders that are compatible e.g.: “drink water” and “take pills” Reschedule reminders for conflicting activities

Current Status of Autominder V.0 (Autominder + Pearl) field-tested for client acceptability on Pearl at Longwood Elderly Care Facility in Oakmont, PA, summer, 2001 V.1 of Autominder implemented –Java, Lisp on Wintel machines Data collection with three Oakmont residents completed summer 2002; with Ann Arbor TBI patient summer 2003

Key Challenges for Cognitive Orthotics Technological –Advanced AI Techniques –HCI –Sensor Networks for Inference of Daily Activities –Mechanisms to Ensure Privacy and Security Policy –Mechanisms to Ensure Privacy –Reimbursement Policies