Newshot

RoboDx: Repair and Diagnosis of Faults in Robot Software

Summary

arXiv:2611.23816v1 Announce Type: new Abstract: A patch to a robot's navigation software can pass every unit test and still drive the robot off its path. Checking how the repaired robot drives catches such patches. It does not show that the agent found everything that was wrong. We introduce RoboDx, a generator of repair tasks for simulated robot navigation software with known injected faults. A hidden verifier marks a repair as verified only if the robot then drives correctly in hidden scenarios, which the agent never sees. A second track hides the code and asks the agent to pick the cause from a list of hypotheses. A task with two faults can contain a quiet fault, a fault that makes no hidden scenario fail unless the other fault is also present. On our set of 100 tasks, RoboDx-Hard-100, almost every repair by Claude Opus 5.5 with standard coding tools is verified. We analyse 94 of the tasks, 44 with one fault and 50 with two. On the 50 two-fault tasks, only 17 of Opus's 49 verified r…

Original text(via arXiv cs.RO)

Computer Science > Robotics

Title:RoboDx: Repair and Diagnosis of Faults in Robot Software

Abstract:A patch to a robot's navigation software can pass every unit test and still drive the robot off its path. Checking how the repaired robot drives catches such patches. It does not show that the agent found everything that was wrong. We introduce RoboDx, a generator of repair tasks for simulated robot navigation software with known injected faults. A hidden verifier marks a repair as verified only if the robot then drives correctly in hidden scenarios, which the agent never sees. A second track hides the code and asks the agent to pick the cause from a list of hypotheses. A task with two faults can contain a quiet fault, a fault that makes no hidden scenario fail unless the other fault is also present. On our set of 100 tasks, RoboDx-Hard-100, almost every repair by Claude Opus 5.5 with standard coding tools is verified. We analyse 94 of the tasks, 44 with one fault and 50 with two. On the 50 two-fault tasks, only 17 of Opus's 49 verified repairs remove both injected edits. Most faults left behind are configuration constants whose correct value the task's documentation does not state. Opus names both faults on 10/50 of these tasks when it cannot see the code. We then give four current models the same measurements of each faulty robot, picked so that, in the simulator, only the true cause produces all of them. The models name the cause on at most 38 of 94 tasks. They are right on almost all when they also get the simulator's output for every hypothesis. Their own predictions of that output give no detectable gain. On 97 tasks from real bug-fix pull requests, Claude Haiku 5.5, the weakest model on the generated tasks, scores lowest, and the other three models are not ordered.
Subjects:Robotics (cs.RO) ; Software Engineering (cs.SE)
Cite as:arXiv:2611.23816 [cs.RO]
(or arXiv:2611.23816v1 [cs.RO] for this version)
https://doi.org/10.48550/arXiv.2611.23816 arXiv-issued DOI via DataCite (pending registration)

Submission history

Access Paper:

  • HTML (experimental)

Additional Features

  • Audio Summary

Current browse context:

References & Citations

  • Google Scholar
  • Semantic Scholar

BibTeX formatted citation

Bookmark

Bibliographic and Citation Tools

Code, Data and Media Associated with this Article

Demos

Recommenders and Search Tools

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

The text above was extracted automatically from the source page and may miss images, tables or code blocks. The original is authoritative.

Published by arXiv cs.RO
This site only summarises and aggregates; copyright stays with the original author. Headlines and summaries follow the source — where they differ, the original wins.
Read the original ↗