MEGN 536 – Computational Biomechanics Prof. Anthony J. Petrella.

Slides:



Advertisements
Similar presentations
Linear Programming. Introduction: Linear Programming deals with the optimization (max. or min.) of a function of variables, known as ‘objective function’,
Advertisements

ON TARGET 4NW OBJECTIVES. ON TARGET Which equation is true for ALL values? This is a calculator problem. One at a time, key each equation into the Y=
Linear Programming Simplex Method
Analysis of Multifingered Hands Kerr and Roth 1986.
Kinetics (continued) Dr. Moran EXS 587 April 12, 2006.
MEGN 537 – Probabilistic Biomechanics Ch.7 – First Order Reliability Methods Anthony J Petrella, PhD.
Optimization to solve Inverted Pendulum problem Zhili Chen.
Ch 2. 6 – Solving Systems of Linear Inequalities & Ch 2
Linear Programming?!?! Sec Linear Programming In management science, it is often required to maximize or minimize a linear function called an objective.
COMP 116: Introduction to Scientific Programming Lecture 11: Linear Regression.
Optimality conditions for constrained local optima, Lagrange multipliers and their use for sensitivity of optimal solutions Today’s lecture is on optimality.
Prof. Anthony Petrella Musculoskeletal Modeling & Inverse Dynamics MEGN 536 – Computational Biomechanics.
Motion Editing and Retargetting Jinxiang Chai. Outline Motion editing [video, click here]here Motion retargeting [video, click here]here.
Musculoskeletal Modeling Colin Smith. A method for Studying Movement Things we can measure in movement: – Kinematics (using motion capture) – Output Forces.
Optimization using Calculus
3D Geometry for Computer Graphics. 2 The plan today Least squares approach  General / Polynomial fitting  Linear systems of equations  Local polynomial.
Constrained Maximization
Advanced Computer Graphics (Fall 2010) CS 283, Lecture 20: Inverse Kinematics Ravi Ramamoorthi Most slides courtesy.
CSC5160 Topics in Algorithms Tutorial 1 Jan Jerry Le
Lecture 11: Structure from motion CS6670: Computer Vision Noah Snavely.
Mech300 Numerical Methods, Hong Kong University of Science and Technology. 1 Part Four Optimization.
Chapter 5: Path Planning Hadi Moradi. Motivation Need to choose a path for the end effector that avoids collisions and singularities Collisions are easy.
Lecture 12: Structure from motion CS6670: Computer Vision Noah Snavely.
Solving Inequalities with Absolute Value Standards M8A2. Student will understand and graph inequalities in one variable. b. Use the properties of inequality.
Solve an absolute value equation EXAMPLE 2 SOLUTION Rewrite the absolute value equation as two equations. Then solve each equation separately. x – 3 =
CS 8751 ML & KDDSupport Vector Machines1 Support Vector Machines (SVMs) Learning mechanism based on linear programming Chooses a separating plane based.
Inverse Kinematics.
1 Chapter 7 Linear Programming. 2 Linear Programming (LP) Problems Both objective function and constraints are linear. Solutions are highly structured.
Linear Programming: Data Fitting Steve Gu Mar 21, 2008.
Systems of Inequalities in Two Variables Sec. 7.5a.
Simplex Method Adapting to Other Forms.  Until now, we have dealt with the standard form of the Simplex method  What if the model has a non-standard.
 Advanced Math Project Done by: Yousef Mohammad Ali, Mahmood Ghanim, and Mohammad Shizawi, Ishaq Abdullah. Class: G Directed to: Mr. Yahiya Jamal.
Jean-François Collard Paul Fisette 24 May 2006 Optimization of Multibody Systems.
Computer Animation Rick Parent Computer Animation Algorithms and Techniques Optimization & Constraints Add mention of global techiques Add mention of calculus.
Copyright 2013, 2009, 2005, 2002 Pearson, Education, Inc.
Parameter estimation. 2D homography Given a set of (x i,x i ’), compute H (x i ’=Hx i ) 3D to 2D camera projection Given a set of (X i,x i ), compute.
Motor Control. Beyond babbling Three problems with motor babbling: –Random exploration is slow –Error-based learning algorithms are faster but error signals.
Joint Reaction Forces Muscle Moments Joint Power
Solving Absolute Value Inequalities October 8, 2015 SWBAT: Solve Absolute Value Inequalities.
MEGN 536 Computational Biomechanics Rotations for Rigid Body Kinematics Prof. Anthony Petrella.
Copyright © 2012, 2008, 2004 Pearson Education, Inc. 1 Objectives Absolute Value Equations and Inequalities Use the distance definition of absolute.
Chapter 7. Learning through Imitation and Exploration: Towards Humanoid Robots that Learn from Humans in Creating Brain-like Intelligence. Course: Robots.
Linear Programming Optimal Solutions and Models Without Unique Optimal Solutions.
Optimization Optimization is the methodology for obtaining the best alternative from all possible ones. Unconstrained optimization has only an objective.
Optimization Problems
1 Chapter 20 Model Predictive Control Model Predictive Control (MPC) – regulatory controls that use an explicit dynamic model of the response of process.
Optimization Problems Section 4-4. Example  What is the maximum area of a rectangle with a fixed perimeter of 880 cm? In this instance we want to optimize.
Progress Report - Solving optimal control problem Yoonsang Lee, Movement Research Lab., Seoul National University.
Prof. Anthony Petrella Musculoskeletal Modeling & Inverse Dynamics MEGN 536 – Computational Biomechanics.
Sullivan Algebra and Trigonometry: Section 12.9 Objectives of this Section Set Up a Linear Programming Problem Solve a Linear Programming Problem.
Copyright © 2012 Pearson Education, Inc. Publishing as Addison Wesley CHAPTER 6: Systems of Equations and Matrices 6.1 Systems of Equations in Two Variables.
Section 5.3 “Solving Eq. And Ineq. w/ Absolute Value”
ME451 Kinematics and Dynamics of Machine Systems Dynamics of Planar Systems December 9, 2010 Solving Index 3 DAEs using Newmark Method © Dan Negrut, 2010.
CSE 554 Lecture 8: Alignment
Date of download: 9/29/2017 Copyright © ASME. All rights reserved.
Date of download: 10/17/2017 Copyright © ASME. All rights reserved.
Systems of Equations and Inequalities
Date of download: 11/8/2017 Copyright © ASME. All rights reserved.
12 Examination 1. Which of the below commands can be used to make decision in program based on a condition? a. If…else b. Set c. Switch d. Assignment e. Wait.
Date of download: 1/15/2018 Copyright © ASME. All rights reserved.
Luciano Luporini Menegaldo Agenor de Toledo Fleury
MEGN 537 – Probabilistic Biomechanics Using OpenSim for Probabilistic Musculoskeletal Analysis with NESSUS Anthony J Petrella, PhD.
Globally Optimal Generalized Maximum Multi Clique Problem (GMMCP) using Python code for Pedestrian Object Tracking By Beni Mulyana.
3-3 Optimization with Linear Programming
MEGN 537 – Probabilistic Biomechanics Running NESSUS with “Big Models”… that have many support files Anthony J Petrella, PhD.
Synthesis of Motion from Simple Animations
EEE 244-8: Optimization.
Notes Over 1.7 Solving Inequalities
Notes Over 1.7 Solving Inequalities
Chapter 4 . Trajectory planning and Inverse kinematics
Presentation transcript:

MEGN 536 – Computational Biomechanics Prof. Anthony J. Petrella

Inverse Kinematics in Musculoskeletal Analysis  Need to know joint angles that define model configuration at each increment in the motion  Markers used to track motion and match model to individual  We can then do dynamics calcs to find joint reactions / torques  Muscle forces and joint contact forces can also be estimated Ali, et al., CMBBE, 2013

Inverse Kinematics in Musculoskeletal Analysis Problems…  Model markers don’t perfectly match subject  Multiple sources of exp. error  Segments may have multiple markers  over-determined  Cannot solve for model config exactly (closed form)  Have to use alternate method, such as optimization Ali, et al., CMBBE, 2013

Optimization in Inverse Kinematics

Optimization Problem Statement  Find x that minimizes f(x), subject to A*x ≤ b and A eq *x = b eq x =design vector f(x) objective function A*x ≤ b inequality constraints  A eq *x = b eq equality constraints x1:xnx1:xn e.g. -F quad ≤ 0 e.g.  F x = 0 

Optimization Problem Statement  Note that the goal is to minimize the objective function in an absolute sense – not to make it small, but to make it as negative as possible  If you are solving a problem in which you wish to maximize a value (e.g., find the maximum volume of a box using a fixed amount of material for the sides of the box), then you simply minimize the negative of the objective function… f(x) = -f vol (x) = -(L * W * H)

Optimization Example  Given: the planex 1 + 2x 2 + 4x 3 = 7  Problem: find point on the plane closest to the origin design vector x = obj. function f(x)= dist = sqrt(x x 2 2 +x 3 2 ) ineq. constraints A*x ≤ b - none - eq. constraints x 1 + 2x 2 + 4x 3 = 7 (A eq = [1 2 4]; b eq = [7]) x1x2x3x1x2x3

Optimization Example - Solution

Optimization in MATLAB  Type ‘ doc fmincon ’ at the MATLAB command line  All of the inputs and outputs of fmincon are explained in the MATLAB documentation  To use fmincon you will need to write a MATLAB function and use function handles