Miller Ross H, Gillette Jason C, Derrick Timothy R, Caldwell Graham E
Department of Kinesiology, University of Massachusetts, Amherst, MA, USA.
Comput Methods Biomech Biomed Engin. 2009 Apr;12(2):217-25. doi: 10.1080/10255840903093490.
Muscle forces during locomotion are often predicted using static optimisation and SQP. SQP has been criticised for over-estimating force magnitudes and under-estimating co-contraction. These problems may be related to SQP's difficulty in locating the global minimum to complex optimisation problems. Algorithms designed to locate the global minimum may be useful in addressing these problems. Muscle forces for 18 flexors and extensors of the lower extremity were predicted for 10 subjects during the stance phase of running. Static optimisation using SQP and two random search (RS) algorithms (a genetic algorithm and simulated annealing) estimated muscle forces by minimising the sum of cubed muscle stresses. The RS algorithms predicted smaller peak forces (42% smaller on average) and smaller muscle impulses (46% smaller on average) than SQP, and located solutions with smaller cost function scores. Results suggest that RS may be a more effective tool than SQP for minimising the sum of cubed muscle stresses in static optimisation.
在运动过程中的肌肉力量通常使用静态优化和序列二次规划(SQP)来预测。序列二次规划因高估力量大小和低估协同收缩而受到批评。这些问题可能与序列二次规划在定位复杂优化问题的全局最小值时的困难有关。旨在定位全局最小值的算法可能有助于解决这些问题。在跑步的站立阶段,对10名受试者下肢的18块屈肌和伸肌的肌肉力量进行了预测。使用序列二次规划和两种随机搜索(RS)算法(遗传算法和模拟退火)进行静态优化,通过最小化肌肉应力的立方和来估计肌肉力量。与序列二次规划相比,随机搜索算法预测的峰值力量更小(平均小42%),肌肉冲量更小(平均小46%),并且找到了成本函数得分更小的解决方案。结果表明,在静态优化中,随机搜索可能是比序列二次规划更有效的工具,用于最小化肌肉应力的立方和。