关于「费茨定律与速度—精度权衡:信息论类比的边界」,《自由度问题与运动协同》给出的定量结论是什么?
结论:费茨 1954 年的敲击实验(16 人,幅度 2—16 英寸,宽度 0.25—2 英寸)给出了 \(MT = a + b\log_2(2A/W)\),最好条件下的表现指数约为 10.3—11.5 比特/秒。香农式 \(\log_2(A/W + 1)\) 是麦肯齐推广的另一种指数,难度低时与原式差别很大。对数形式不是唯一的可能:在迈耶式最优子运动模型中,运动时间几乎完全与 \(\sqrt{A/W}\) 成线性关系(\(R2 = 0.99996\)),对数式仍可拟合出 \(R2 = 0.908\)。最小急动度与最小方差是两种不同的理论:前者是运动学的平滑性代价,后者由信号依赖噪声推出,其速度曲线随肢体刚度改变;在本书的开环简化模型中,最小方差给出的速度—精度关系更接近幂函数。下一章讨论另一个限制:感觉反馈的延迟,以及神经系统怎样用内部模型绕过它。
数据口径:本书不是运动医学、物理治疗或康复建议;有伤病或神经系统疾病者应咨询专业人员。 书中以标注框区分已发表的证据、可运行的 Python 计算(14 段程序,全部核对)、原典与作者的假说;书中所有数据都是虚构或模拟的。
对照数据表
下表数字由本章 Python 程序原样打印,可重新运行复现。 程序只用 Python 标准库与结论吻合的打印值: 0.25, 0.99996, 16
| A | W | Fitts ID | Shannon ID | Welford ID | model MT | T1 | T2 |
| 2 | 0.25 | 4.00 | 3.17 | 3.09 | 0.419 s | 0.245 | 0.248 |
| 2 | 2.00 | 1.00 | 1.00 | 0.58 | 0.110 s | 0.079 | 0.095 |
| 4 | 1.00 | 3.00 | 2.32 | 2.17 | 0.276 s | 0.171 | 0.178 |
| 8 | 0.50 | 5.00 | 4.09 | 4.04 | 0.623 s | 0.348 | 0.350 |
| 16 | 0.25 | 7.00 | 6.02 | 6.01 | 1.319 s | 0.697 | 0.698 |
| 16 | 2.00 | 4.00 | 3.17 | 3.09 | 0.419 s | 0.245 | 0.248 |
| MT on Fitts log2(2A/W) | : a = -0.261 s, b = 0.190, R^2 = 0.90814, max |res| 250.5 ms | ||||||
| MT on Shannon log2(A/W+1) | : a = -0.239 s, b = 0.226, R^2 = 0.94570, max |res| 196.6 ms | ||||||
| MT on square root sqrt(A/W): a = -0.069 s, b = 0.173, R^2 = 0.99996, max |res| | 5.7 ms | ||||||
| 16 conditions; A/W ranges from 1 to 64; MT depends on A/W only in this model |
核心公式
查看完整验算程序
# Part 1: index of difficulty in Fitts's (1954) tapping design (amplitudes 2-16 in,
# widths 0.25-2 in): Fitts's log2(2A/W), MacKenzie's Shannon form log2(A/W + 1) and
# Welford's log2(A/W + 0.5). Part 2: a stochastic optimised-submovement model in the
# spirit of Meyer et al. (1988): a primary submovement of duration T1 lands with SD
# k*A/T1; if it misses, a corrective submovement of duration T2 starts from the miss
# with SD k*|e|/T2. T1 and T2 minimise mean time subject to 96 % hits overall
# (k = 0.04 s, illustrative). Do log or square-root laws describe the optimised times?
import math
K, HIT = 0.04, 0.96
A_SET, W_SET = (2, 4, 8, 16), (0.25, 0.5, 1, 2)
def p_in(half, sd):
return math.erf(half / (math.sqrt(2) * sd)) if sd > 0 else 1.0
def p_total(A, W, T1, T2, m=120):
s1 = K * A / T1; h = W / 2; p1 = p_in(h, s1)
if T2 <= 0:
return p1
top = h + 8 * s1; step = (top - h) / m; acc = 0.0
for i in range(m + 1): # Simpson over the miss distance e > W/2
e = h + i * step; wgt = 1 if i in (0, m) else (4 if i % 2 else 2)
dens = math.exp(-0.5 * (e / s1) ** 2) / (s1 * math.sqrt(2 * math.pi))
acc += wgt * dens * p_in(h, K * e / T2)
return p1 + 2 * acc * step / 3
def best(A, W):
def mean_time(T1):
s1 = K * A / T1; p1 = p_in(W / 2, s1)
if p1 >= HIT:
return T1, 0.0
if p_total(A, W, T1, 50.0) < HIT:
return math.inf, 0.0
lo, hi = 0.0, 50.0
for _ in range(40):
mid = (lo + hi) / 2
lo, hi = (lo, mid) if p_total(A, W, T1, mid) >= HIT else (mid, hi)
return T1 + (1 - p1) * hi, hi
grid = [0.02 * i for i in range(2, 200)]
t1 = min(grid, key=lambda t: mean_time(t)[0])
a, b = max(0.02, t1 - 0.02), t1 + 0.02 # golden-section refinement
g = (math.sqrt(5) - 1) / 2
for _ in range(30):
c, d = b - g * (b - a), a + g * (b - a)
a, b = (a, d) if mean_time(c)[0] < mean_time(d)[0] else (c, b)
t1 = (a + b) / 2; mt, t2 = mean_time(t1)
return mt, t1, t2
def fit(x, y):
n = len(x); mx, my = sum(x) / n, sum(y) / n
b = sum((u - mx) * (v - my) for u, v in zip(x, y)) / sum((u - mx) ** 2 for u in x)
a = my - b * mx; ss = sum((v - a - b * u) ** 2 for u, v in zip(x, y))
return a, b, 1 - ss / sum((v - my) ** 2 for v in y)
if __name__ == "__main__":
print(" A W Fitts ID Shannon ID Welford ID model MT T1 T2")
rows = []
for A in A_SET:
for W in W_SET:
mt, t1, t2 = best(A, W); rows.append((A, W, mt))
if (A, W) in ((2, 2), (2, 0.25), (4, 1), (8, 0.5), (16, 2), (16, 0.25)):
print(f"{A:4d} {W:5.2f} {math.log2(2 * A / W):6.2f} "
f"{math.log2(A / W + 1):6.2f} {math.log2(A / W + 0.5):6.2f}"
f" {mt:6.3f} s {t1:5.3f} {t2:5.3f}")
mt = [r[2] for r in rows]
for name, f in (("Fitts log2(2A/W)", lambda A, W: math.log2(2 * A / W)),
("Shannon log2(A/W+1)", lambda A, W: math.log2(A / W + 1)),
("square root sqrt(A/W)", lambda A, W: math.sqrt(A / W))):
x = [f(A, W) for A, W, _ in rows]; a, b, r2 = fit(x, mt)
res = max(abs(m - a - b * u) for u, m in zip(x, mt))
print(f"MT on {name:21s}: a = {a:+.3f} s, b = {b:.3f}, R^2 = {r2:.5f},"
f" max |res| {1000 * res:4.1f} ms")
print("16 conditions; A/W ranges from 1 to 64; MT depends on A/W only in this model")唯一数据源与引用
范雅福(Fan, Y.). (2026). 《具身认知、伯恩斯坦自由度问题与运动协同的控制理论》第 3 章「费茨定律与速度—精度权衡:信息论类比的边界」(版本 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}
}