Research
Variance-Reduction Infill Sampling Can Leave the Variogram Unidentifiable: A Per-Batch Diagnostic and Guard for Automated Drilling
When software chooses where to drill to reduce uncertainty, it spreads the holes out and can stop collecting the close pairs it needs to learn how quickly ore grade changes with distance. In simulations starting from four widely spaced holes, about half of first batches left that distance scale undetermined, and the usual prediction scores didn’t flag it. A cheap check after each batch, and a guard that adds close pairs only when they’re missing, fixes this early without the accuracy cost of published alternatives.
Of 2,939 Western Australian campaigns, about 97% of those where the range could be estimated already started with a close pair, so the risk lies mainly in automated planning.
Fig. 3 — Holes everywhere, and at first none close enough to compare. Performance Bounds and the Cost of Continuation under State Constraints
When you push a system for performance while keeping it organised, holding that organisation until a deadline can be free. Requiring it to hold afterwards can still cost real performance, because momentum carried past the deadline makes a later breakdown unavoidable. The paper proves general results for this and certifies the effect in three very different systems: a bird flock, a superconductor and a power-grid generator.
In a model of a superconducting film, for example, a short current pulse can keep the gap above a safe floor while the pulse lasts, yet the gap’s own inertia (its Higgs, or amplitude, mode) carries it below that floor shortly afterwards, so staying safe after the pulse has a provable cost.
A toy model. Two copies of a four-agent formation are pushed by the same source, which can only push. The top one only has to keep its shape until a deadline; the bottom one has to keep it afterwards too. Below them, a timeline shows each formation's squeeze against the tolerance and how hard the source pushes. The deadline and the distance of the source can be moved.
Until the deadline
And after
DeadlineFig. 4 — It was fine at the deadline.Toy model When Does Flock Prediction Help UAV Herding? Shape, Speed, and Execution Limits
A herding drone can plan from the flock’s centre, from its current shape, or from a forecast of every bird. In simulation, knowing the current shape gave most of the benefit. Forecasting every bird only paid off with one fast drone, and a simple reactive controller did as well or better with slow drones or several of them. The practical lesson is to measure your drone’s response time and command delay before choosing. The simulation study is written; flight trials with a herding drone come next.
Centre the flock’s middle and size
0.0 s of 12 in the crop
Footprint the flock’s shape
0.0 s of 12 in the crop
Individual a forecast of every bird
0.0 s of 12 in the crop
Reactive no forecast at all
0.0 s of 12 in the crop
No drone 8.4 s of 12 in the crop
Fig. 5 — Four ways to keep a flock off a crop. The Value of Information in ML-Based Mine Geology Modelling
Not public under the Rio Tinto IP agreement; its central results are developed in the T-ASE paper above.
Safety guarantees for tethered drone swarms
When several drones are tethered to one collar, can you prove they'll never tangle? I'm building a safety certificate on the braid group, the maths of how strands wind around each other, using control barrier functions to keep the swarm inside a set of safe states. So far I have working proofs for when two cables would touch, which one passes over the other, and how to track the braid as the drones move. They haven't been independently checked, and the hardest step, showing the controller can always find a safe move, is still open.
To keep the proof physically honest, I tested one of its key assumptions in simulation: what you need to know about a cable crossing to predict how it behaves. Once the cables have slid, knowing where their ends are isn't enough, but for slow motions in the simulator the position of the crossing point was. Along the way I submitted three fixes to DisMech, the rod simulator I used, and one has been merged.
The certificate also needs friction values I can trust, so I built my own frictional-contact solver. As a check, it reproduces the published capstan law for thick cables to within half a percent. With MuJoCo's default soft-contact settings and its elliptic friction cone, a block that should stay stuck creeps 13 to 26 mm over ten seconds, and a rope wrapped round a drum slips when one end pulls just 1 to 14% harder than the other, where the thick-cable law says it should hold about 5.9 times the tension. MuJoCo's no-slip option stops the creep, but its answer for the rope depends on an artificial tuning setting. Next I'm porting the solver to the GPU: the double-precision CPU version is the reference, and a batched CUDA version will be benchmarked against MuJoCo.
Fig. 6 — Two tethers, one crossing. Fly a drone out and back. Translation loss, and whether slop is load-bearing
Models now carry out instructions almost perfectly, so most failures come from getting the intent across, and whatever gets lost drifts back toward the model's own defaults. A position paper sets out that theory. The second paper asks whether the habits people call slop exist for a reason: strip out the hedges, the caveats and the flat sentence rhythm, and does the model become less honest or less safe? A first pilot ran in October.
Do coding agents understand, or recall?
Tally tests whether coding agents understand software engineering or lean on memorised patterns. It's a made-up language that looks exactly like Python but works differently in nine places. An agent gets a realistic billing codebase written in it and three tickets to close, and the grader traces each Python-style mistake back to the rule it broke. Frontier agents got through, even when they couldn't run the code; an open-weight model run locally fell back on Python habits in all three of its runs.
It's the same question as the papers above: when do models fall back on their defaults? Next I want to see whether agents keep to the spec over long tasks that get passed between sessions.
Designing a camera to spot a drone a kilometre away
How far away a camera can spot a small drone depends on how many pixels the drone covers and how faint it looks against the sky. This project asks whether a physics model, calibrated once per detector, can predict when that detector will find it on a camera it was never tuned on, so the camera can be designed on paper first. Nothing is final yet, and I rebuilt the simulator after finding errors in the first version. Along the way, on one camera none of the detectors had seen, detectors trained on simulated images found far more of the larger drones than detectors trained on real footage from a different camera.
- Pixels across
- –
- Peak contrast
- –
- Pixel noise
- –
Fig. 7 — A drone, a kilometre away. It's the smudge. Devices that chirp at each other
Can a group of devices that chirp at each other work out where they are, and how the air between them is moving, without sharing a clock? Timing each chirp both ways, the trick behind two-way radio and phone ranging, cancels the clock offsets, so the layout comes out cleanly. A steady breeze looks almost exactly like the clocks being out of step, but air swirling around a loop of devices still shows, the same loop measurement ocean acousticians use for currents.
Three microphones in a triangle on one device can in principle make a steady breeze measurable too, though synchronising a few clocks does it better. So far it's theory and simulation; a bench prototype is designed but not built.
Last exchange
Sums
Differences
Assumes 0.12 µs timing per mic, a design target not yet shown on hardware.
Around the loop
Fig. 8 — Five clocks, all wrong. The breeze gets blamed on them. How wind feeds waves
When wind blows over the sea, how much of its energy goes into the waves? Operational wave models answer with formulas whose coefficients are tuned against observations. I'm deriving the wind input from first principles instead, with no constants fitted to wave data, and it matches the growth rates from 25 published wind-over-wave simulation cases to within a median factor of 1.2.
A simpler model that assumes the turbulence is in equilibrium matches those simulations about as well, so they can't yet tell the two apart. On blind data from a wind-wave tank, my model predicts about 0.4 of the measured growth, and the cause of that gap is still open. Now I'm running GPU spectral-element simulations in NekRS, first reproducing a published simulation as a check, then testing at higher Reynolds numbers, where the two models' predictions differ by 20 to 55%.
Fig. 9 — Pushed on the way down, pulled on the way up. That’s how a wave grows. Inertial depairing: superconductors that fail after the pulse
Send a very short current pulse through a disordered superconductor, and the natural safety check is its state when the pulse ends. For pulses of about a picosecond or less in aluminium, that check comes too early. It was already known that the superconducting gap can keep falling after a fast pulse; I show that its lowest point, not the end-of-pulse state, sets how hard the pulse can safely drive, an effect I call inertial depairing. In a simplified model, a computer-checked bound puts the safe limit for a 1 ps pulse at least 20% below the end-of-pulse estimate, and numerical calculations give larger reductions. To my knowledge this correction to the threshold hasn't been calculated before. The paper proposes an aluminium experiment to test it.
Two more superconductivity studies start in early 2027: why superconductivity vanishes in overdoped cuprates, where an evidence map of about 430 published measurements is done, and whether predicted hydride superconductors survive once the pressure comes off.