Forces & Motion in Computer Science | 计算机科学中的力与运动

📚 Forces & Motion in Computer Science | 计算机科学中的力与运动

Computer science does not merely describe forces and motion; it simulates, measures, and controls them. From video game physics to robotic arms, algorithms transform Newton’s laws into digital reality. This article explores how IGCSE Computer Science topics such as algorithms, sensors, and programming intersect with the physical principles of force and motion.

计算机科学不仅仅描述力与运动，更模拟、测量并控制它们。从电子游戏物理到机械手臂，算法将牛顿定律转化为数字现实。本文探讨IGCSE计算机科学中的算法、传感器与编程主题，如何与力与运动的物理原理交汇。

1. What Are Force and Motion in Computing? | 计算中的力与运动是什么？

In physics, a force is any interaction that changes the motion of an object. Motion itself is described by displacement, velocity, and acceleration. In computer science, we encode these quantities as variables and use algorithms to update them over time. A digital simulation stores position as a coordinate pair (x, y) and velocity as a vector (vₓ, vᵧ).

在物理学中，力是改变物体运动状态的任何相互作用。运动本身由位移、速度和加速度描述。在计算机科学中，我们将这些量编码为变量，并使用算法随时间更新它们。数字模拟将位置存储为坐标对 (x, y)，将速度存储为向量 (vₓ, vᵧ)。

2. Newton’s Laws in Code | 牛顿定律的代码实现

Newton’s Second Law states that force equals mass times acceleration: F = m × a. In a program, this becomes a simple assignment statement: acceleration = force / mass. When multiple forces act on an object, the computer sums their vector components before applying the law.

牛顿第二定律指出，力等于质量乘以加速度：F = m × a。在程序中，这变为一条简单赋值语句：acceleration = force / mass。当多个力作用于物体时，计算机先对它们的向量分量求和，再应用该定律。

F = m × a → a = F ÷ m

The First Law appears as condition checking: if net force equals zero, then velocity remains constant. In code, this prevents an object from accelerating when no input is pressed.

第一定律以条件判断的形式出现：若合力为零，则速度保持不变。在代码中，这确保当没有输入按下时，物体不会加速。

3. Representing Motion: Velocity and Acceleration | 表示运动：速度与加速度

Velocity is the rate of change of displacement, and acceleration is the rate of change of velocity. In discrete computer simulations, we do not use continuous calculus. Instead, we use small time steps, Δt. Each frame, the position updates as: position = position + velocity × Δt.

速度是位移的变化率，加速度是速度的变化率。在离散的计算机模拟中，我们不使用连续微积分，而是使用小时间步长 Δt。每一帧，位置更新为：position = position + velocity × Δt。

sₙₑ𝓌 = sₒₗ𝒹 + v × Δt

A table of typical values helps illustrate this:

下表展示典型数值示例：

Quantity	Symbol	Unit
Displacement	s	m
Velocity	v	m/s
Acceleration	a	m/s²
Time step	Δt	s

4. Measuring Force and Motion: Sensors | 测量力与运动：传感器

Real computers capture motion using sensors. An accelerometer measures acceleration along three axes. A gyroscope measures angular velocity. A force sensor, such as a strain gauge, measures applied force. These sensors convert physical quantities into digital signals via an analogue-to-digital converter (ADC).

真实计算机使用传感器捕捉运动。加速度计测量三轴加速度，陀螺仪测量角速度，力传感器（如应变片）测量施加的力。这些传感器通过模数转换器（ADC）将物理量转换为数字信号。

In an IGCSE project, you might connect an accelerometer to a microcontroller. The program reads voltage values and scales them to m/s². This data can be stored in arrays and analysed to detect patterns, such as counting steps or detecting a fall.

在IGCSE项目中，你可能将加速度计连接到微控制器。程序读取电压值并将其缩放为 m/s²。这些数据可存储在数组中并分析以检测模式，例如计步或检测跌倒。

5. Numerical Simulation: The Euler Method | 数值模拟：欧拉法

The Euler method is the simplest algorithm for simulating motion. It updates velocity and position using the current acceleration:

欧拉法是模拟运动的最简单算法。它使用当前加速度更新速度和位置：

v ← v + a × Δt

s ← s + v × Δt

Because this is an approximation, smaller time steps give more accurate results but require more computations. Programmers balance accuracy and performance by choosing an appropriate Δt.

由于这是一种近似方法，较小的时间步长会得到更精确的结果，但需要更多计算。程序员通过选择适当的 Δt 来平衡准确性与性能。

For example, a bouncing ball with gravity g = 9.81 m/s² updates as:

例如，一个重力为 g = 9.81 m/s² 的弹跳球更新如下：

velocity = velocity + 9.81 × deltaTime
position = position + velocity × deltaTime

6. Collision Detection and Response | 碰撞检测与响应

Detecting collisions is a key part of simulating force and motion. A simple method uses bounding boxes: two rectangles overlap if their coordinates satisfy all four edge conditions. For circles, the program checks whether the distance between centres is less than the sum of radii.

碰撞检测是模拟力与运动的关键部分。一种简单方法使用包围盒：若两个矩形的坐标满足全部四个边界条件，则它们重叠。对于圆形，程序检查圆心距离是否小于半径之和。

d = √((x₂ − x₁)² + (y₂ − y₁)²)

When a collision is detected, the response applies the law of restitution. For an elastic collision, velocity reverses: v ← −v. For a realistic bounce, the coefficient of restitution e (0 ≤ e < 1) reduces speed: v ← −e × v.

检测到碰撞后，响应应用恢复系数定律。对于弹性碰撞，速度反向：v ← −v。对于真实弹跳，恢复系数 e（0 ≤ e < 1）会降低速度：v ← −e × v。

7. Forces in Robotics: PID Control | 机器人中的力：PID控制

Robots use algorithms to apply precise forces. A proportional-integral-derivative (PID) controller calculates an error value e(t), which is the difference between desired position and measured position. The output force is:

机器人使用算法施加精确的力。比例-积分-微分（PID）控制器计算误差值 e(t)，即期望位置与测量位置之差。输出力为：

F = Kₚ × e + Kᵢ × ∫e dt + K𝒹 × de/dt

This formula is implemented in microcontrollers to balance robots, control drone throttle, or move a robotic arm smoothly. The constants Kₚ, Kᵢ, and K𝒹 must be tuned carefully; a large Kₚ causes oscillation, while a small one gives a sluggish response.

该公式在微控制器中实现，用于平衡机器人、控制无人机油门或平稳移动机械臂。常数 Kₚ、Kᵢ 和 K𝒹 必须仔细调整；Kₚ 过大会引起振荡，过小则响应迟缓。

8. Game Physics Engines | 游戏物理引擎

Modern video games rely on physics engines such as Box2D and Unity Physics. These engines handle force integration, collision detection, and constraint solving in real time. Game developers rarely write Newton’s equations themselves; they call engine functions while specifying masses, forces, and materials.

现代电子游戏依赖物理引擎，如 Box2D 和 Unity Physics。这些引擎实时处理力积分、碰撞检测和约束求解。游戏开发者很少自己编写牛顿方程，而是调用引擎函数，同时指定质量、力和材质。

Consider a car in a racing game. The engine applies torque to wheels, friction acts on tyres, air resistance opposes motion, and gravity pulls the car down. Each frame, the physics engine calculates the net force vector:

以赛车游戏中的汽车为例。发动机对车轮施加扭矩，摩擦力作用在轮胎上，空气阻力阻碍运动，重力向下拉汽车。每一帧，物理引擎计算合力向量：

Fₙₑ𝓉 = Fₑₙ𝓰ᵢₙₑ + F𝒻ᵣᵢ𝒸ₜᵢₒₙ + F𝒹ᵣₐ𝓰 + F𝑔𝓇𝒶𝓋ᵢₜ𝓎

9. Pseudocode for a Ball Bounce Program | 小球弹跳程序伪代码

The following pseudocode combines force, motion, and collision response. It is typical of IGCSE algorithmic thinking:

以下伪代码结合了力、运动与碰撞响应，是IGCSE算法思维的典型示例：

SET position = 0
SET velocity = 0
SET gravity = 9.81
SET e = 0.8
SET dt = 0.01

REPEAT 1000 TIMES
    velocity = velocity + gravity * dt
    position = position + velocity * dt
    IF position < 0 THEN
        position = 0
        velocity = -e * velocity
    END IF
END REPEAT

The IF statement checks if the ball touches the ground. The velocity is reversed and scaled by e. This simple algorithm demonstrates how control flow implements physical laws.

IF 语句检查小球是否接触地面。速度被反向并按 e 缩放。这一简单算法演示了控制流如何实现物理定律。

10. Limitations and Accuracy | 局限性与准确性

Digital simulation is never perfect. Floating-point errors accumulate over many time steps. The Euler method can become unstable if Δt is too large. Additionally, real forces such as air resistance are nonlinear, requiring more complex models.

数字模拟永远不完美。浮点误差会随许多时间步长累积。若 Δt 过大，欧拉法可能变得不稳定。此外，空气阻力等真实力是非线性的，需要更复杂的模型。

To improve accuracy, programmers use the Verlet integration method, which uses the previous position to compute the next one. This reduces energy drift in oscillating systems such as springs. Understanding these limitations is part of computational thinking.

为提高准确性，程序员使用 Verlet 积分法，该方法利用前一个位置计算下一个位置。这减少了弹簧等振荡系统中的能量漂移。理解这些局限性是计算思维的一部分。

11. Summary and Exam Tips | 总结与考试提示

In the IGCSE Computer Science exam, questions about force and motion may appear in the context of sensors, control systems, or simulation algorithms. Remember these key points:

在IGCSE计算机科学考试中，关于力与运动的问题可能出现在传感器、控制系统或模拟算法的背景中。记住以下关键点：

F = m × a is the core equation; know how to rearrange it.
F = m × a 是核心方程；知道如何变形。
Sensors convert physical motion into digital data using an ADC.
传感器使用ADC将物理运动转换为数字数据。
The Euler method updates velocity first, then position.
欧拉法先更新速度，再更新位置。
Collision algorithms must detect overlap before applying force changes.
碰撞算法必须在施加力的变化之前检测重叠。
Smaller Δt gives more accurate simulation but costs more CPU time.
较小的 Δt 给出更精确的模拟，但消耗更多CPU时间。

Practice writing trace tables for the bounce pseudocode. Examiners value clear variable names and correct use of loops and conditional statements.

练习为弹跳伪代码编写跟踪表。考官重视清晰的变量名称以及循环和条件语句的正确使用。

Published by TutorHao | Computer Science Revision Series | aleveler.com

更多咨询请联系16621398022（同微信）

Forces & Motion in Computer Science | 计算机科学中的力与运动