I'm a first-year undergrad building a vision system for a campus robot competition run by our university's RoboMaster team. The robot tracks a planar visual marker (80×80 mm) with OpenCV's solvePnPGeneric + SOLVEPNP_IPPE , and the position feeds a 6D constant-velocity Kalman filter that drives the robot toward the marker.
Planar PnP has a well-known problem: it returns two valid pose solutions. The standard practice is to hard-pick the one with the lower reprojection error, or discard the measurement when the two are close. I tried something less binary — and I'm sharing it here because I couldn't find anyone doing exactly this, and I want to know if it holds up.
Marker image: https://imgur.com/a/oyeXVuP
The method
IPPE returns two solutions, each with a reprojection error (e0 for the nominal/min-error solution, e1 for the other) and a translation (t0, t1).…