关于「非受控流形与最小干预原则:只管该管的」,《自由度问题与运动协同》给出的定量结论是什么?

结论:UCM 分析把关节空间的变异分为不影响任务(UCM)与影响任务(ORT)两部分,按每个自由度比较;原研究是 9 人的坐—站任务,质心被强烈稳定。协同指数 \(\Delta V\) 有上下界,常用的对数变换在 \(\Delta V = 0\) 时不一定为零;结论依赖坐标(同一组独立噪声在节段坐标下给出 −0.94),20 个试次的估计误差也不小。托多罗夫与乔丹的最优反馈控制给出了这种结构的一种解释:最小干预原则。在双效应器求和任务中,同等纠正努力下 OFC 的任务标准差为 1.14 毫米,伺服控制为 2.84 毫米;一个效应器被推开时,另一个反向补偿。这是特定模型中的演示,不是证明。下一章转向另一个经典问题:动作的速度与精度之间的权衡。

数据口径:本书不是运动医学、物理治疗或康复建议;有伤病或神经系统疾病者应咨询专业人员。 书中以标注框区分已发表的证据、可运行的 Python 计算(14 段程序,全部核对)、原典与作者的假说;书中所有数据都是虚构或模拟的。

English version

对照数据表

下表数字由本章 Python 程序原样打印,可重新运行复现。 程序只用 Python 标准库与结论吻合的打印值: 1.14, 2.84

controller task SD mean err diff SD ln ratio corr. effort
OFC (task sum only)1.14 mm -1.46 mm 11.87 mm +4.68 0.1534
servo, equal effort2.84 mm -10.17 mm 2.84 mm +0.00 0.1534 (w 0.275)
servo, weight 0.52.16 mm -5.71 mm 2.16 mm +0.00 0.1659
servo, weight 4.00.83 mm -0.73 mm 0.83 mm +0.00 0.2141
check by simulation (2,000 trials): task SD OFC 1.14 mm, servo 2.82 mm
perturbation: effector 1 displaced +10 mm at t0.15 s (noise-free run)
OFC final change: p1 +5.13 mm, p2 -4.87 mm, sum +0.25 mm
servo final change: p1 +1.59 mm, p2 +0.00 mm, sum +1.59 mm

核心公式

\[V_{\mathrm{UCM}} = \frac{\sum_i \|(I-P)\,\delta\mathbf{q}_i\|^2}{(N-1)(n-d)}, \qquad V_{\mathrm{ORT}} = \frac{\sum_i \|P\,\delta\mathbf{q}_i\|^2}{(N-1)\,d}.\]
查看完整验算程序
# Optimal feedback control (finite-horizon LQR with additive motor noise) for the
# redundant "sum" task of Todorov & Jordan: two 1-D effectors (mass 1 kg, first-order
# force filter, tau = 40 ms) must bring p1 + p2 to 0.20 m and stop at T = 0.5 s.
# OFC pays only for the task sum; a "servo" controller pays for each effector reaching
# its own planned position (0.10 m). dt = 10 ms. All parameters are illustrative.
import math, random
DT, TAU, N, TARGET = 0.01, 0.04, 50, 0.20
NOISE = 1.0                                  # SD of additive motor noise per step, N

def mm(A, B):
    return [[sum(a * b for a, b in zip(r, c)) for c in zip(*B)] for r in A]

def tr(A):
    return [list(c) for c in zip(*A)]

def inv(M):
    n = len(M)
    A = [row[:] + [float(i == j) for j in range(n)] for i, row in enumerate(M)]
    for c in range(n):
        p = max(range(c, n), key=lambda r: abs(A[r][c])); A[c], A[p] = A[p], A[c]
        A[c] = [v / A[c][c] for v in A[c]]
        for r in range(n):
            if r != c:
                A[r] = [a - A[r][c] * b for a, b in zip(A[r], A[c])]
    return [row[n:] for row in A]

# state: p1 v1 f1 p2 v2 f2 1   (the constant 1 carries the target)
A = [[0.0] * 7 for _ in range(7)]; B = [[0.0] * 2 for _ in range(7)]
for k in (0, 3):
    A[k][k] = 1; A[k][k + 1] = DT; A[k + 1][k + 1] = 1; A[k + 1][k + 2] = DT
    A[k + 2][k + 2] = 1 - DT / TAU; B[k + 2][k // 3] = DT / TAU
A[6][6] = 1

def outer(c, w):
    return [[w * a * b for b in c] for a in c]

def add(*Ms):
    return [[sum(v) for v in zip(*rows)] for rows in zip(*Ms)]

def final_cost(kind, w):
    stop = add(*[outer([float(i == j) for j in range(7)], wt)
                 for i, wt in ((1, 0.05), (4, 0.05), (2, 1e-4), (5, 1e-4))])
    if kind == "ofc":                         # (p1 + p2 - target)^2
        return add(stop, outer([1, 0, 0, 1, 0, 0, -TARGET], w))
    return add(stop, outer([1, 0, 0, 0, 0, 0, -TARGET / 2], w),
               outer([0, 0, 0, 1, 0, 0, -TARGET / 2], w))

def gains(Q, r=1e-6):
    S, L = Q, []
    for _ in range(N):
        K = mm(inv(add(mm(mm(tr(B), S), B), [[r, 0], [0, r]])), mm(mm(tr(B), S), A))
        S = mm(mm(tr(A), S), add(A, [[-v for v in row] for row in mm(B, K)]))
        L.append(K)
    return L[::-1]

def run(L, rng, kick=None):
    x = [0.0] * 6 + [1.0]; effort = 0.0
    for t in range(N):
        if kick and t == kick[0]:
            x[0] += kick[1]
        u = [-sum(k * v for k, v in zip(row, x)) for row in L[t]]
        effort += sum(v * v for v in u) * DT
        if rng:
            u = [v + rng.gauss(0, NOISE) for v in u]
        x = [sum(a * v for a, v in zip(row, x)) + sum(b * w for b, w in zip(brow, u))
             for row, brow in zip(A, B)]
    return x[0], x[3], effort

def exact(L):
    """Propagate the state covariance exactly: task SD, UCM SD, ln ratio, effort."""
    S = [[0.0] * 7 for _ in range(7)]; effort = 0.0
    for t in range(N):
        effort += sum(sum(a * b for a, b in zip(r, c)) for r, c in
                      zip(mm(L[t], S), L[t])) * DT              # E[u'u] about the mean
        M = add(A, [[-v for v in r] for r in mm(B, L[t])])
        S = add(mm(mm(M, S), tr(M)), [[NOISE ** 2 * sum(b1 * b2 for b1, b2 in
                zip(B[i], B[j])) for j in range(7)] for i in range(7)])
    vo = (S[0][0] + S[3][3] + 2 * S[0][3]) / 2; vu = (S[0][0] + S[3][3] - 2 * S[0][3]) / 2
    p1, p2, _ = run(L, None)                       # mean end point (noise-free run)
    return (math.sqrt(2 * vo) * 1000, math.sqrt(2 * vu) * 1000, math.log(vu / vo),
            effort, 1000 * (p1 + p2 - TARGET))

def monte_carlo(L, seed, trials=2000):
    rng = random.Random(seed); s = [run(L, rng) for _ in range(trials)]
    m = sum(a + b for a, b, _ in s) / trials
    return 1000 * math.sqrt(sum((a + b - m) ** 2 for a, b, _ in s) / (trials - 1))

def row(name, r, extra=""):
    print(f"{name:20s} {r[0]:5.2f} mm {r[4]:+5.2f} mm {r[1]:6.2f} mm  {r[2]:+5.2f}"
          f"    {r[3]:.4f}{extra}")

if __name__ == "__main__":
    ofc = gains(final_cost("ofc", 1.0)); so = exact(ofc)
    print("controller          task SD  mean err  diff SD  ln ratio  corr. effort")
    row("OFC (task sum only)", so)
    lo, hi = 0.05, 50.0                       # servo weight with equal correction effort
    for _ in range(40):
        mid = math.sqrt(lo * hi)
        lo, hi = (mid, hi) if exact(gains(final_cost("servo", mid)))[3] < so[3] \
            else (lo, mid)
    ss = exact(gains(final_cost("servo", lo)))
    row("servo, equal effort", ss, f" (w {lo:.3f})")
    for w in (0.5, 4.0):
        row(f"servo, weight {w:3.1f}", exact(gains(final_cost("servo", w))))
    mc = (monte_carlo(ofc, 2002), monte_carlo(gains(final_cost("servo", lo)), 2002))
    print(f"check by simulation (2,000 trials): task SD OFC {mc[0]:.2f} mm,"
          f" servo {mc[1]:.2f} mm")
    print("perturbation: effector 1 displaced +10 mm at t = 0.15 s (noise-free run)")
    for name, Lg in (("OFC", ofc), ("servo", gains(final_cost("servo", lo)))):
        p1, p2, _ = run(Lg, None, (15, 0.01)); q1, q2, _ = run(Lg, None)
        print(f"  {name:5s} final change: p1 {1000 * (p1 - q1):+5.2f} mm, p2"
              f" {1000 * (p2 - q2):+5.2f} mm, sum {1000 * (p1 + p2 - q1 - q2):+5.2f} mm")

唯一数据源与引用

范雅福(Fan, Y.). (2026). 《具身认知、伯恩斯坦自由度问题与运动协同的控制理论》第 2 章「非受控流形与最小干预原则:只管该管的」(版本 1.0.0). 5D Library. https://doi.org/10.5281/zenodo.23828057

DOI: 10.5281/zenodo.23828057 · 阅读本章所在专著 · 5DL-B-043 · v1.0.0 · CC-BY-NC-ND-4.0

BibTeX
@book{fan2026043,
  author    = {Fan, Yafu},
  title     = {Embodied Cognition, Bernstein's Degrees-of-Freedom Problem and the Control Theory of Motor Synergies},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  doi       = {10.5281/zenodo.23828057},
  url       = {https://doi.org/10.5281/zenodo.23828057}
}

本书其他章节结论