1. Near-Optimal Decision-Making in Dynamic Environments Manu Chhabra 1 Robert Jacobs 2 1 Department of Computer Science 2 Department of Brain & Cognitive Sciences University of Rochester

2. Dynamic Decision-Making Decision-making in environments with complex temporal dynamics –Decision-making at many moments in time –Temporal dependencies among decisions Examples: –Flying an airplane –Piloting a boat –Controlling an industrial process –Coordinating firefighters to fight a fire

3. Outline Experimental project: –Is human adaptive control optimal across different noise environments? Computational project: –Can optimal movements be planned as linear combinations of optimal motor primitives?

4. Dynamics and Noise Adaptive control requires learning about both the dynamics and the noise of a complex system Dynamics: relationship between control signals and the expected responses to these signals Noise: relationship between control signals and the variances of the responses to these signals

6. Dynamics and Noise Dynamics: 2 nd –order linear system –Object position, velocity, acceleration: –Mass: m –Force: f –Viscous resistance: b Noise: corrupts force f

7. Three Noise Conditions No-Noise (NN) Proportional Noise (PN) –Small forces are corrupted by small amounts of noise –Large forces are corrupted by large amounts of noise Inversely-Proportional Noise (IPN) –Small forces are corrupted by large amounts of noise –Large forces are corrupted by small amounts of noise

8. Ideal Actors Optimal control laws computed via dynamic programming –Optimal control law depends on the noise characteristics of the environment –Different ideal actors were created for different noise conditions Efficiency: –Ratio of subject’s performance to expected performance of ideal actor

9. Experimental Results

12. Proportional NoiseInversely-Proportional Noise Ideal Actor Average over subjects

13. Conclusions Subjects learned control strategies tailored to the specific noise characteristics of their conditions –Allowed them to achieve levels of performance near the information-theoretic upper bounds Conclude: Subjects learned to efficiently use all available information to plan and execute control policies that maximized performances on their tasks

14. Conclusions Q: Is human adaptive control optimal across different noise environments? A: Yes (under the conditions studied here)

15. Computational Complexity of Motor Control Task: Apply torques to a two-joint arm so that its endpoint moves from location A to location B in 100 time steps Assume: At each moment in time, torque is either on or off at each joint Q: How many torque sequences are possible solutions? A: 2 200 “Curse of dimensionality”

16. Motor Synergies Motor synergies: dependencies among degrees of freedom Motor synergies = motor primitives –Basic units of behavior that can be linearly combined to form complex units of behavior –To form complex behavior: only need to specify linear coefficients Behavioral and physiological evidence

17. Approach Hypothesis: Optimal motor control can be achieved by combining a small number of scaled and time-shifted optimal synergies If so, motor control is easy –Only need to specify scaling coefficients and time-shifts Q: How do we find optimal synergies?

18. Strategy First, find optimal solutions to tasks in training set –Optimal solution is an optimal sequence of torques that moves a motor system from an initial state to a goal state Next, perform dimensionality reduction on space of possible solutions –Optimal solutions lie on a low-dimensional manifold –Important directions = motor synergies –Technique: non-negative matrix factorization

19. Strategy Lastly, find solutions to novel tasks in test set using synergies –Linear coefficients –Time-shifts

20. Motor Tasks Reaching task: move the endpoint of a simulated two-joint robot arm from one location to another in a specified time period Via-point task: move from one location to another while passing through an intermediate location

21. Simulations Example: Reaching task 256 tasks in training set –Find (approximate) optimal solutions to each task –Find optimal motor synergies via dimensionality reduction 64 tasks in test set –Find solution to each task by combining motor synergies Linear coefficients Time-shifts

22. How Many Synergies Are Needed? Reaching taskVia-Point task

23. Task-Dependent vs. Task-Independent Synergies

24. Synergies from Reaching Task

25. Synergies from Via-Point Task

26. Fast Learning with Synergies

27. Summary Optimal solutions lie on a low-dimensional manifold – Dimensionality reduction for discovering optimal synergies Near-optimal motor control by combining scaled and time- shifted synergies A small number of synergies are sufficient Task-dependent and task-independent synergies Learning with synergies is fast Additional research: two-joint arm with muscle model

28. Future Directions ??? Normative Ideal Actor : –unlimited computational power –unlimited memory –Provides information-theoretic upper bound on performance Human Ideal Actor: –limited computational power –limited working and long-term memory –Provides upper bound on performance if one has human cognitive limitations

29. Experimental Results

30. Dimensionality Reduction