- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper introduces safe task completion for LLM-enabled robots: rather than accepting or rejecting a mixed-intent instruction as a whole, the robot should refuse harmful sub-tasks while completing legitimate ones. The proposed RuleGraph framework uses five logical agents to ground and decompose the instruction, instantiate world-specific safety rules, classify sub-tasks in full-instruction context, synthesize a safe goal, and plan toward that goal. Planning is organized as a hierarchical graph in which each leaf node handles one rule and higher-level nodes progressively aggregate their parents’ rule sets. Candidate plans undergo feasibility checks, rule-specific generate-judge-refine loops, and a final gate for goal completion and residual malicious intent. The method is evaluated on 70 pure-attack instructions from the RoboGuard benchmark and a new Compound set of 97 mostly mixed-intent instructions. With GPT-4o, RuleGraph reports 0% ASR and 98.57% TSR on RoboGuard, and 0% ASR and 84.54% TSR on Compound, outperforming an undefended planner, a single-plan judge, RoboGuard, and SafePlan. Additional validation includes an adaptive white-box attack, a Gemini-based experiment on RoboGuard, 40 purely safe instructions, and a single-node graph ablation.
Critical strengths
The paper identifies an important limitation of binary guardrails and formulates a practically meaningful alternative. RuleGraph provides a coherent defense-in-depth architecture and shows strong results on the setting it targets.
Critical weaknesses
The central Compound evaluation is small and insufficiently transparent. The paper’s main contribution—safe completion of mixed-intent instructions—is evaluated primarily on an author-constructed dataset of only 97 instructions. The paper provides insufficient detail about dataset generation, category coverage, annotation and adjudication procedures, inter-annotator agreement, or whether the method and its prompts were refined after inspecting benchmark failures.
RuleGraph appears to use substantially more inference-time computation than the baselines, but the comparison is not compute-matched. RuleGraph creates a separate generate-judge-refine loop for every relevant rule, allows up to seven iterations per node, hierarchically aggregates the resulting nodes, and adds several instruction, goal-synthesis, verification, and final-checking stages. It may also revise the goal and rebuild the graph. However, the paper reports no LLM-call counts, token usage, latency, or monetary cost, and does not compare against baselines given a similar inference budget. Consequently, the reported gains cannot be confidently attributed to the graph-of-rules structure rather than simply to substantially greater test-time computation and repeated self-verification. The omission also leaves the practicality of the approach for latency-sensitive robotic systems unclear.
Questions for authors
- Please provide full details of the Compound dataset construction and evaluation procedure, including instruction sources and category distribution, annotation and adjudication protocols, annotator agreement, who labeled generated plans as ASR/TSR/neither, and whether any method prompts were modified after inspecting benchmark examples or failures.
- Please report the number of LLM calls, input/output tokens, latency, and estimated cost for each method. Do RuleGraph’s advantages remain when the single-plan baseline or other baselines are given a comparable inference-time compute budget?