홈 › Papers

Belief-Space Perception Routing under Coupled Sensor Faults and Compute Contention

A robot that has to see and react on a fixed clock runs into two problems at once. Its cameras degrade in rain, mud, fog, and darkness. And the single onboard processor it runs on is shared with planning and control, so the compute left over for perception moves around from second to second. Most systems model the two separately. We present a perception router that tracks probabilistic estimates of sensor-fault state and compute- contention state, couples them with a noisy-OR term, and uses the coupled estimate to pick one of four detector configurations (YOLO11x/n at 1280 or 640 px) so that the frame finishes before its deadline. Where the two stressors co-occur, the coupled policy cuts the deadline-miss rate by 1.1 to 9.4 percentage points against a policy that treats them independently. The interval excludes zero in five of six conditions, the pooled effect over 10 sequences and 6 conditions has sign-test p = 0.001, and every uncoupled control and the fault-free trajectory sit at exactly 0.0 pp. Routing costs tens of microseconds per frame. We then asked whether the coupling the method exploits arises on its own. Across eight real RADIATE adverse-weather sequences and three workload proxies independent of the fault signal, after Benjamini-Hochberg correction and a replication run, none of 24 tests found it. We report that null and scope the routing result as a proof of mechanism. Whether such coupling occurs in the field is still open, and the released evaluation pipeline lets a deployment settle it on its own traces.

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반