Robotics you can drag around
Interactive tools for kinematics, control, planning, and design.
Kinematics
Where it is, and where it can reach.
- Quadcopter kinematicsFour propellers, all pointing the same way, and six degrees of freedom to cover with them. Fly one in 3D and watch the mixer decide what each motor gets.
- Differential drive and its relativesTwo wheels, two motors, and the one equation underneath skid steer, Ackermann steering and every trailer that ever jackknifed.
- Mecanum driveDrive a mecanum chassis, watch the four motor powers, and find out why mounting the rollers wrong costs a whole degree of freedom.
- Denavit-Hartenberg parametersFour numbers per joint describe an entire arm. Type a table in and watch it appear.
- Inverse kinematicsEvery reachable point has two arm configurations, and choosing between them is a real decision.
Sensing
Getting a usable number out of a sensor.
- The particle filterA robot woken up somewhere in a building it has the map of. Belief as two thousand guesses rather than a mean and a covariance, so it can hold two places at once until the map tells them apart.
- The Kalman filterA sensor that reports position only, fed into a filter that reports velocity too. Add a second, slower sensor and the same update fuses it in: precision adds, whichever one arrives first.
- Filtering a noisy sensorNoise, drift, and mains hum are three different problems wearing the same disguise. Four filters, and which corruption each one is actually for.
Control
Getting it there, and holding it.
Motion planning
Working out where to go.
- Behaviour treesA robot patrols, breaks off to approach, breaks off that to recharge. No state machine is coded anywhere.
- Rapidly-exploring random treesThrow a random point at the space, step toward it from the nearest thing you have already reached, and never enumerate the free space at all.
- Configuration spaceGrow every obstacle by the robot's own shape and the robot becomes a point. Every planner after that is simpler.
- A* searchDijkstra plus an estimate of the distance remaining, and far less of the map examined.
- Breadth-first searchEvery cell one step away, then every cell two steps away. The first route it finds is the shortest.
- Depth-first searchChange the queue to a stack and every guarantee disappears.
Learning
Working it out from experience.
Design
Picking the hardware.