Humans optimally anticipate and compensate for an uneven step during walking
Bibliographic record
Abstract
The simple task of walking up a sidewalk curb is actually a dynamic prediction task. The curb is a disturbance that could cause a loss of momentum if not anticipated and compensated for. It might be possible to adjust momentum sufficiently to ensure undisturbed time of arrival, but there are infinite possible ways to do so. Much of steady, level gait is determined by energy economy, which should be at least as important with terrain disturbances. It is, however, unknown whether economy also governs walking up a curb, and whether anticipation helps. Here, we show that humans compensate with an anticipatory pattern of forward speed adjustments, predicted by a criterion of minimizing mechanical energy input. The strategy is mechanistically predicted by optimal control for a simple model of bipedal walking dynamics, with each leg's push-off work as input. Optimization predicts a triphasic trajectory of speed (and thus momentum) adjustments, including an anticipatory phase. In experiment, human subjects ascend an artificial curb with the predicted triphasic trajectory, which approximately conserves overall walking speed relative to undisturbed flat ground. The trajectory involves speeding up in a few steps before the curb, losing considerable momentum from ascending it, and then regaining speed in a few steps thereafter. Descending the curb entails a nearly opposite, but still anticipatory, speed fluctuation trajectory, in agreement with model predictions that speed fluctuation amplitudes should scale linearly with curb height. The fluctuation amplitudes also decrease slightly with faster average speeds, also as predicted by model. Humans can reason about the dynamics of walking to plan anticipatory and economical control, even with a sidewalk curb in the way.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.001 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.001 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".