mhtirogla
Home
Systems
API
Pricing
About
Log in
← Back
Home
›
Systems
›
Transport, logistics and mobility
drone-delivery
drone delivery
Zipline
System
Techniques · 11
Primitives · 42
drone-delivery
Battery state estimation
embedded · medium: State of charge / health / power from coulomb counting, OCV curves and model-based observers
Fault detection isolation recovery
embedded · medium: Monitor/response tables, fault isolation and safe-mode recovery hierarchies for autonomous systems
Assignment problem (Hungarian / Jon…
graphs · medium: Optimal one-to-one matching of rows to columns in O(n³) by growing a matching along shortest augmenting paths over dual potentials.
›
Multi-object tracking
machine-learning · medium: Turn per-frame detections (camera boxes or radar plots) into persistent IDs by predicting each track, gating, assigning and managing track births and deaths.
›
Object detection
machine-learning · medium: A network turns an image into scored, classified boxes in one pass; anchor-based, anchor-free and set-prediction heads differ in how they assign labels and remove duplicates.
›
Conflict detection and resolution
robotics · medium: Predict trajectories, detect loss of separation and compute resolution maneuvers for aircraft/drones
Motion planning
robotics · medium: Planning collision-free trajectories (hybrid A*, RRT*, lattice planners, trajectory optimization)
Extended Kalman filter
robotics · low: Kalman filter for nonlinear motion and measurement models: linearize f and h with Jacobians at the current estimate each step. The default estimator in robot navigation.
›
Hierarchical state machine
systems · low: Nest states so a substate inherits its parent's reactions and only overrides what differs, with ordered entry and exit actions along the path.
›
Geodesic distance (haversine, Vince…
geometry · low: Shortest-path distance between two lat/lon points on the Earth: haversine on a sphere (about 0.5% error), Vincenty or Karney on the WGS84 ellipsoid (sub-millimetre).
›
Rigid-body transforms (SE(3) poses)
robotics · low: Represent, compose, invert, integrate and interpolate 3D poses as unit quaternion plus translation, with exp/log maps for small motions and uncertainty.
›
Reliable UDP
game-networking · low: Transport over UDP: each packet carries a sequence number, an ack and a 32-bit ack history; only chosen messages are made reliable.
›
Point in polygon
geometry · low: Ray-casting/winding tests and indexed polygon lookup for reverse geocoding
PID controller
robotics · low: Drive a measured value to a setpoint with three terms on the error: proportional, integral, derivative. The default feedback loop for motors, heaters, drones and gimbals.
›
Pure pursuit path tracking
robotics · low: Geometric path following by steering to a look-ahead point (pure pursuit, L1, Stanley)
AEAD (AES-GCM, ChaCha20-Poly1305)
security · low: Authenticated encryption that encrypts and detects tampering in one call; the only kind of symmetric encryption you should use.
›
Spline interpolation
numerics · low: Linear, bilinear/trilinear and cubic spline interpolation on grids and tables
Redundancy voting
embedded · low: N-modular redundancy and MooN voting (2oo3, TMR) with discrepancy detection
Watchdog timer
embedded · low: A hardware down-counter that resets the chip unless software proves, in time and in a plausible pattern, that it is still healthy.
›
d-ary heap
data-structures · low: Array heap with d children per node (d = 4 typical): half the binary heap's depth, siblings in one cache line, faster priority queues.
›
Dijkstra's algorithm
graphs · low: Single-source shortest paths with non-negative edge weights by settling vertices in order of distance with a priority queue.
›
Non-maximum suppression
machine-learning · low: Keep the best-scoring candidate in each neighbourhood and drop the rest; greedy NMS, Soft-NMS and 1-D peak picking share one loop.
›
Kalman filter
robotics · low: Optimal recursive estimator for a linear system with Gaussian noise: fuses a motion model with noisy measurements into a state estimate plus its covariance.
›
+ 4 more techniques
+ 26 more primitives
System
Techniques · 11
Primitives · 42
drone-delivery
Battery state estimation
embedded · medium: State of charge / health / power from coulomb counting, OCV curves and model-based observers
Fault detection isolation recovery
embedded · medium: Monitor/response tables, fault isolation and safe-mode recovery hierarchies for autonomous systems
Assignment problem (Hungarian / Jon…
graphs · medium: Optimal one-to-one matching of rows to columns in O(n³) by growing a matching along shortest augmenting paths over dual potentials.
›
Multi-object tracking
machine-learning · medium: Turn per-frame detections (camera boxes or radar plots) into persistent IDs by predicting each track, gating, assigning and managing track births and deaths.
›
Object detection
machine-learning · medium: A network turns an image into scored, classified boxes in one pass; anchor-based, anchor-free and set-prediction heads differ in how they assign labels and remove duplicates.
›
Conflict detection and resolution
robotics · medium: Predict trajectories, detect loss of separation and compute resolution maneuvers for aircraft/drones
Motion planning
robotics · medium: Planning collision-free trajectories (hybrid A*, RRT*, lattice planners, trajectory optimization)
Sensor fusion
robotics · medium: Combining IMU, GNSS, camera, lidar and radar estimates with Kalman-type filters and time alignment
Equivalent circuit battery model
embedded · medium: Thevenin RC-network battery models with OCV-SoC curves and parameter identification
Transform tree
robotics · medium: Time-indexed tree of coordinate frames with interpolated lookups between any two frames
Levenberg marquardt
numerics · medium: Damped Gauss-Newton nonlinear least squares for model calibration
Extended Kalman filter
robotics · low: Kalman filter for nonlinear motion and measurement models: linearize f and h with Jacobians at the current estimate each step. The default estimator in robot navigation.
›
Hierarchical state machine
systems · low: Nest states so a substate inherits its parent's reactions and only overrides what differs, with ordered entry and exit actions along the path.
›
Geodesic distance (haversine, Vince…
geometry · low: Shortest-path distance between two lat/lon points on the Earth: haversine on a sphere (about 0.5% error), Vincenty or Karney on the WGS84 ellipsoid (sub-millimetre).
›
Rigid-body transforms (SE(3) poses)
robotics · low: Represent, compose, invert, integrate and interpolate 3D poses as unit quaternion plus translation, with exp/log maps for small motions and uncertainty.
›
Reliable UDP
game-networking · low: Transport over UDP: each packet carries a sequence number, an ack and a 32-bit ack history; only chosen messages are made reliable.
›
Point in polygon
geometry · low: Ray-casting/winding tests and indexed polygon lookup for reverse geocoding
PID controller
robotics · low: Drive a measured value to a setpoint with three terms on the error: proportional, integral, derivative. The default feedback loop for motors, heaters, drones and gimbals.
›
Pure pursuit path tracking
robotics · low: Geometric path following by steering to a look-ahead point (pure pursuit, L1, Stanley)
AEAD (AES-GCM, ChaCha20-Poly1305)
security · low: Authenticated encryption that encrypts and detects tampering in one call; the only kind of symmetric encryption you should use.
›
Spline interpolation
numerics · low: Linear, bilinear/trilinear and cubic spline interpolation on grids and tables
Redundancy voting
embedded · low: N-modular redundancy and MooN voting (2oo3, TMR) with discrepancy detection
Watchdog timer
embedded · low: A hardware down-counter that resets the chip unless software proves, in time and in a plausible pattern, that it is still healthy.
›
d-ary heap
data-structures · low: Array heap with d children per node (d = 4 typical): half the binary heap's depth, siblings in one cache line, faster priority queues.
›
Dijkstra's algorithm
graphs · low: Single-source shortest paths with non-negative edge weights by settling vertices in order of distance with a priority queue.
›
Non-maximum suppression
machine-learning · low: Keep the best-scoring candidate in each neighbourhood and drop the rest; greedy NMS, Soft-NMS and 1-D peak picking share one loop.
›
Kalman filter
robotics · low: Optimal recursive estimator for a linear system with Gaussian noise: fuses a motion model with noisy measurements into a state estimate plus its covariance.
›
Data augmentation
machine-learning · low: Generate label-preserving variants of each training example on the fly to enlarge the effective dataset and bake in invariances.
›
Loss functions
machine-learning · low: The scalar a model minimizes: cross-entropy for classes and tokens, MSE or Huber for values, each with a stable form and simple gradient.
›
Convolutional networks
ml-training · low: Layers that slide a small shared kernel over a grid, giving translation equivariance and few parameters; still the most compute-efficient choice for many vision tasks.
›
R-tree
geometry · low: A balanced tree of nested bounding boxes that indexes rectangles and points, answering window and nearest-neighbour queries by pruning whole subtrees.
›
k-d tree
geometry · low: A binary tree that splits k-dimensional points by one coordinate per level, giving fast nearest-neighbour and box queries on static low-dimensional data.
›
A* search
graphs · low: Dijkstra ordered by cost-so-far plus an admissible estimate of the remaining cost; optimal paths while exploring far fewer nodes toward the goal.
›
PRNGs (PCG, xoshiro)
numerics · low: Small, fast, statistically strong non-cryptographic generators: PCG32 and xoshiro256**, with seeding, parallel streams and unbiased ranges.
›
GJK and EPA
physics · low: GJK decides whether (and how far apart) two convex shapes are from their support functions alone; EPA expands its simplex into penetration depth and normal.
›
Occupancy grid
robotics · low: Probabilistic grid map updated with log-odds from range sensors
SPSC ring buffer
data-structures · low: Bounded wait-free queue for exactly one producer and one consumer thread, built from an array and two indices with acquire/release ordering.
›
Complementary filter
robotics · low: Blend high-passed gyro integration with low-passed accelerometer/magnetometer attitude (Mahony/Madgwick)
Explicit Euler
numerics · low: Step an ODE forward by its current slope, y += h·f(t, y); first-order, one evaluation per step, the baseline every other integrator is measured against.
›
Quaternion rotations
geometry · low: Unit quaternions as 3D rotations: 4 floats, cheap composition, no gimbal lock, plus the conversions, interpolation choices and numerical care needed in practice.
›
Lowest common ancestor
graphs · low: LCA/merge-base computation in trees and DAGs
Finite differences
numerics · low: Replace derivatives with weighted differences of grid values; simple stencils plus a stability condition (CFL) turn PDEs like heat, advection and waves into array loops.
›
LU and Cholesky factorization
numerics · low: Factor A = PLU (any square matrix, partial pivoting) or A = LLᵀ (SPD) once in O(n³), then solve each right-hand side in O(n²).
›
False sharing
concurrency · low: Independent variables written by different cores on one cache line force the line to bounce between cores; pad or regroup hot data to fix it.
›
Memory ordering
concurrency · low: What Relaxed, Acquire, Release and SeqCst atomics actually guarantee, what they cost on x86 and ARM, and which one each pattern needs.
›
Message sequence numbers
distributed · low: A per-stream counter on every message lets the receiver detect loss, duplicates and reordering, ack cheaply and resume after reconnect with "send from N".
›
Bitstream serialization
game-networking · low: A bit writer and reader over a byte buffer that stores each field in exactly the bits its range needs: booleans in 1 bit, bounded integers in ceil(log2(span+1)) bits.
›
Homogeneous transforms
geometry · low: 4x4 affine and projective matrices, homogeneous coordinates, view and projection, normal matrices
CPU caches and the memory hierarchy
hardware-os · low: Sizes, line widths and latencies of L1/L2/L3/DRAM on modern x86 and Apple M-series, and the data-layout rules that follow from them.
›
Newton root finding
numerics · low: Linearize at the guess and jump to the tangent root; quadratic convergence near a simple root, made robust by brackets (1D) or line search.
›
Thomas tridiagonal solver
numerics · low: O(n) tridiagonal linear solve used in implicit finite-difference and spline schemes
Constant time code
security · low: Writing secret-dependent code without branches or memory lookups on secrets; constant-time compare and select
Csprng
security · low: OS-backed cryptographically secure random numbers (getrandom), and when a fast PRNG is not enough
Copy for AI
Similar systems
Share the most building blocks with this one.
integrated-bridge-system
31 %
air-traffic-control
23 %
c2-battle-management
22 %
flight-controller
21 %
precision-agriculture
19 %