6 services carry this tag in their source record. Tags come from the provider, not from us — a tag is a claim about what the service does, not proof that it does it well.
Deterministic four-neighbor BFS on a grid of at most 24×24 cells. Returns a shortest obstacle-free route or an explicit unreachable/step-limit result. Toy discrete geometry only; no hardware, collision certification or p...
Computes the minimum Euclidean distance from each circular obstacle center to every path segment, then subtracts obstacle radius and robot radius. It detects planar static clearance only; it does not model robot shape be...
Compare up to eight declared records per version, converting length units and comparing properties, XYZ poses and wrapped yaw against separate length/angle/ratio tolerances. Reports additions, removals, unit changes and...
Problem: Validate timestamps, ordering, rates, gaps, and synchronization in this bounded trajectory or sensor trace. Input: JSON with clock id, samples, rules. Result: pass or fail verdict, normalized timeline, exact tim...
Problem: Compare these bounded estimator outputs against the supplied reference and objective rules. Input: JSON with reference, estimators, rules. Result: per-estimator metrics, rule verdicts, deterministic selected est...
Problem: Compare planned and observed trajectories against caller tolerances. Input: JSON with planned, observed, rules. Result: typed verdict, measured metrics, candidate only when verified. Limits: Software/model evide...