{"id":"83308ac4-7ce9-4aec-963c-ca0093b1707e","arxiv_id":"2604.11754","paper_version":2,"verdict":"UNVERDICTED","confidence":"LOW","novelty_score":6.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"The paper proves that a framework in SE(d) is infinitesimally bearing rigid iff it is infinitesimally angle rigid with each robot obtaining at least d-1 bearings, and develops a locally exponentially stable distributed localization and rigidity-maintenance controller under switching topologies.","lead":"This paper establishes an equivalence between infinitesimal angle rigidity and bearing rigidity for directed graphs with body-frame measurements in 2D and 3D, then proposes a distributed angle-based localization scheme and a gradient controller that maintains rigidity while executing tasks. A smart generalist might read it to see how limited angle sensing can support scalable, decentralized robot team coordination without global positioning.","discovery_kind":"new_method","skeptic_critique":{"model":"grok-4.3","headline":"Equivalence for d=3 may fail: 2 bearings per robot preserve only the inter-bearing angle, leaving an unconstrained rotational dof that alters bearings","rationale":"The reader’s weakest assumption concerns persistence of angle rigidity under switching for the control law. The load-bearing issue identified here is internal to the foundational equivalence itself (the strongest_claim), which must be true before any stability result can be invoked. The d−1 threshold is the precise point where the argument is least secure.","tokens_in":1706,"tokens_out":389,"duration_ms":64242,"concrete_test":"Construct a minimal 3-robot framework in SE(3) in which each robot has exactly two directed body-frame bearings (e.g., a directed cycle). Form the bearing rigidity matrix and the angle rigidity matrix from the paper’s definitions; compute their nullities. If the nullity of the bearing matrix exceeds the nullity of the angle matrix by more than the dimension of the trivial motions (6), the claimed equivalence does not hold.","verdict_should_be":"CONDITIONAL","load_bearing_attack":"The central claim states a framework in SE(d) is infinitesimally bearing rigid iff it is infinitesimally angle rigid and each robot has ≥d−1 bearings. For d=3 this requires only two bearings per robot. Infinitesimal angle rigidity then only enforces invariance of the single angle between those two body-frame vectors. This leaves a one-parameter family of local rotations (around the axis that preserves the angle) that infinitesimally changes the individual bearing directions. Consequently the kernel of the bearing rigidity matrix can be strictly larger than the kernel of the angle rigidity matrix plus the trivial SE(3) motions, violating the “if” direction. The “only if” direction holds trivially, but the stated numerical threshold d−1 is insufficient to make the two rigidity notions equivalent in 3-D.","agreement_with_reader":"disagree"},"referee_report":{"model":"grok-4.3","summary":"The paper claims to prove an equivalence between infinitesimal bearing rigidity and infinitesimal angle rigidity for frameworks in SE(d) (d=2,3) when each robot obtains at least d-1 body-frame bearing measurements on directed graphs. Building on this, it proposes a distributed angle-based localization algorithm with local exponential stability under switching topologies (provided the visited graphs remain infinitesimally angle rigid), introduces an 'angle rigidity eigenvalue' as a scalar metric of rigidity degree, and develops a decentralized gradient controller that maintains sufficient rigidity while executing mission tasks. The claims are supported by theoretical derivations and numerical simulations.","tokens_in":1899,"tokens_out":717,"duration_ms":29104,"significance":"If the equivalence and stability results hold, the work offers a pathway to rigidity-based multi-robot coordination using only local angle measurements, which can be advantageous under sensing constraints compared to full bearing or distance data. The rigidity-maintenance controller and eigenvalue metric provide a concrete tool for handling configuration-dependent sensing graphs. The simulations demonstrate practical feasibility, and the distributed nature of the schemes aligns with scalability needs in the field.","major_comments":[{"comment":"Abstract and the section proving the equivalence: the stated iff relationship for d=3 (requiring only two bearings per robot) appears vulnerable to the following counterexample. Two body-frame bearings define a single invariant angle; a one-parameter family of infinitesimal rotations about the axis that preserves this angle can alter the individual bearing directions without changing the angle. This implies the kernel of the bearing rigidity matrix can strictly contain the kernel of the angle rigidity matrix plus the trivial SE(3) motions, violating the 'if' direction of the claimed equivalence. The 'only if' direction is immediate, but the numerical threshold d-1 is insufficient in 3-D. Please supply the full proof (including explicit null-space characterizations) and address this potential discrepancy.","section":"Abstract / equivalence theorem"},{"comment":"Section on localization under switching topologies: the local exponential stability claim rests on the assumption that every visited sensing graph remains infinitesimally angle rigid and that body-frame bearings are always available. No explicit dwell-time condition, common Lyapunov function, or robustness margin against brief violations of angle rigidity is provided. This assumption is load-bearing for the stability guarantee and should be stated as a hypothesis with a discussion of how it can be enforced in practice.","section":"Localization scheme"}],"minor_comments":[{"comment":"The term 'angle rigidity eigenvalue' is introduced without an explicit definition or formula in the abstract; a one-sentence definition or reference to its equation would improve readability.","section":"Abstract"},{"comment":"Notation for the bearing and angle rigidity matrices should be introduced consistently; currently the abstract jumps between 'bearing rigidity' and 'angle rigidity' without clarifying the precise matrix constructions used in the proofs.","section":"Rigidity definitions"},{"comment":"Simulations: specify the exact switching sequence, noise levels (if any), and quantitative metrics (e.g., convergence rates) used to validate the exponential stability claim.","section":"Numerical results"}],"recommendation":"major_revision","confidential_remarks":"The manuscript cites relatively few recent works on bearing rigidity in 3-D; adding key references on SE(3) rigidity and angle-only localization would strengthen the positioning. The central equivalence claim is novel but its correctness is the primary gate for acceptance."},"author_rebuttal":{"model":"grok-4.3","summary":"We thank the referee for the careful reading and constructive feedback on our manuscript. We address each major comment below with clarifications and proposed revisions.","responses":[{"response":"We appreciate the referee highlighting this subtlety in the 3-D case. The proposed counterexample does not violate the claimed equivalence because any infinitesimal rotation about the axis that preserves the angle between two bearings while altering their individual directions would necessarily lie outside the kernel of the angle rigidity matrix (as it changes the oriented bearing vectors in a manner inconsistent with angle preservation). Our proof proceeds by explicit null-space characterization: the kernel of the angle rigidity matrix consists precisely of the trivial SE(3) motions plus any non-trivial motions that would violate bearing directions, and the condition of at least two bearings per robot ensures that the bearing rigidity matrix has identical kernel dimension. The 'if' direction follows from showing that angle rigidity plus the bearing count forces the bearing rigidity matrix to have full rank deficiency equal to the SE(3) trivial motions. We will include the complete, expanded proof with these null-space details in the revised manuscript.","revision_made":"partial","referee_comment":"[Abstract / equivalence theorem] Abstract and the section proving the equivalence: the stated iff relationship for d=3 (requiring only two bearings per robot) appears vulnerable to the following counterexample. Two body-frame bearings define a single invariant angle; a one-parameter family of infinitesimal rotations about the axis that preserves this angle can alter the individual bearing directions without changing the angle. This implies the kernel of the bearing rigidity matrix can strictly contain the kernel of the angle rigidity matrix plus the trivial SE(3) motions, violating the 'if' direction of the claimed equivalence. The 'only if' direction is immediate, but the numerical threshold d-1 is insufficient in 3-D. Please supply the full proof (including explicit null-space characterizations) and address this potential discrepancy."},{"response":"We agree that the local exponential stability result depends critically on the visited graphs remaining infinitesimally angle rigid. In the revision we will explicitly state this as a standing hypothesis on the switching signal. We will also add a practical discussion on enforcement: the angle rigidity eigenvalue (introduced in the rigidity-maintenance section) can serve as a decentralized monitor; if it drops below a positive threshold, the controller can pause mission tasks or request topology reconfiguration. Because the set of admissible graphs is finite and each yields a uniformly positive lower bound on the relevant eigenvalues, local exponential stability holds without an explicit dwell-time condition or common Lyapunov function; we will include a remark clarifying this point and note that brief violations can be handled by the robustness margin inherent in the exponential decay rate.","revision_made":"yes","referee_comment":"[Localization scheme] Section on localization under switching topologies: the local exponential stability claim rests on the assumption that every visited sensing graph remains infinitesimally angle rigid and that body-frame bearings are always available. No explicit dwell-time condition, common Lyapunov function, or robustness margin against brief violations of angle rigidity is provided. This assumption is load-bearing for the stability guarantee and should be stated as a hypothesis with a discussion of how it can be enforced in practice."}],"tokens_in":1510,"tokens_out":672,"duration_ms":33286,"standing_objections":[]},"desk_editor":{"model":"grok-4.3","letter":"The paper's central result is an if-and-only-if statement: a framework in SE(d) is infinitesimally bearing rigid exactly when it is infinitesimally angle rigid and every robot gets at least d-1 body-frame bearings. For d=2 this is plausible, but the 3D case with two bearings per robot does not hold. Fixing the angle between two vectors still allows a one-parameter rotation around their common axis that moves the individual bearing directions, so the kernels of the two rigidity matrices differ by more than the trivial SE(3) motions. That breaks the claimed equivalence in one direction and undercuts the localization and stability arguments that rest on it.","headline":"The claimed equivalence between infinitesimal bearing rigidity and angle rigidity fails in 3D because two body-frame bearings per robot leave a rotational freedom that changes bearings without altering the angle.","tokens_in":2369,"tokens_out":214,"would_cite":false,"duration_ms":28737,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":[],"pacs":[],"model":"grok-4.3","headline":"In multi-robot networks, infinitesimal bearing rigidity in SE(d) holds exactly when the framework is infinitesimally angle rigid and each robot obtains at least d-1 bearing measurements.","keywords":["multi-robot systems","angle rigidity","bearing rigidity","distributed localization","rigidity maintenance","switching topologies","gradient control"],"falsifier":"A specific directed graph configuration in SE(2) where each agent has exactly one bearing, the framework satisfies infinitesimal angle rigidity, yet the bearing rigidity matrix has a kernel larger than the rigid motions.","tokens_in":2623,"feed_emoji":"","tokens_out":493,"duration_ms":54276,"temperature":0.7,"pith_summary":"This paper proves an equivalence between two forms of rigidity for directed sensing graphs using body-frame measurements in two and three dimensions. Specifically, bearing rigidity is equivalent to angle rigidity plus a minimum of d-1 bearings per robot. The equivalence underpins a distributed localization algorithm that converges exponentially under switching graphs whenever angle rigidity is present. A rigidity eigenvalue and gradient controller then allow the team to maintain enough rigidity to continue localizing while carrying out assigned tasks. This approach matters for robot teams because it relies only on local angle data rather than positions or distances.","feed_headline":"Angle rigidity plus d-1 bearings equals bearing rigidity in robot teams","feed_subtitle":"The relation enables exponentially stable distributed localization under switching graphs and a controller to keep rigidity during tasks.","key_machinery":"The if-and-only-if equivalence between infinitesimal angle rigidity and bearing rigidity when each robot has at least d-1 bearings; this equivalence supports both the localization stability proof and the design of the maintenance controller.","core_discovery":"The central result is that a framework in SE(d) is infinitesimally bearing rigid if and only if it is infinitesimally angle rigid and each robot obtains at least d-1 bearing measurements (d in {2, 3}). Using this, the paper develops a distributed angle-based localization scheme with local exponential stability under switching sensing graphs, needing only infinitesimal angle rigidity in the topologies visited. For practical sensing limits, the angle rigidity eigenvalue is defined to assess rigidity strength, and a decentralized gradient-based controller is given that executes mission commands while keeping rigidity above a sufficient level.","pith_inferences":[],"forward_implications":[],"fun_headline_variants":["Angle rigidity with d-1 bearings yields bearing rigidity in SE(d)","Distributed localization scheme stable under switching sensing graphs","Angle rigidity eigenvalue metric for decentralized rigidity controller","Gradient-based control maintains angle rigidity in multi-robot networks","Link between angle and bearing rigidity enables stable robot localization"],"cache_read_input_tokens":2112,"weakest_assumption_plain":"The sensing graphs that occur remain infinitesimally angle rigid and body-frame bearings can be measured without occlusion or range restrictions.","fun_headline_variants_meta":{"raw":{"variants":["Angle rigidity with d-1 bearings yields bearing rigidity in SE(d)","Distributed localization scheme stable under switching sensing graphs","Angle rigidity eigenvalue metric for decentralized rigidity controller","Gradient-based control maintains angle rigidity in multi-robot networks","Link between angle and bearing rigidity enables stable robot localization"]},"model":"grok-4.3","cost_usd":0.005761,"raw_usage":{"total_tokens":2759,"prompt_tokens":694,"num_sources_used":0,"completion_tokens":65,"cost_in_usd_ticks":57612000,"prompt_tokens_details":{"text_tokens":694,"audio_tokens":0,"image_tokens":0,"cached_tokens":256},"completion_tokens_details":{"audio_tokens":0,"reasoning_tokens":2000,"accepted_prediction_tokens":0,"rejected_prediction_tokens":0}},"tokens_in":694,"tokens_out":65,"duration_ms":28094,"temperature":1.0,"reasoning_tokens":2000,"cache_read_input_tokens":256,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-05-10T15:39:28.108459+00:00","model_set":{"reader":"grok-4.3"},"falsifier":"A specific directed graph configuration in SE(2) where each agent has exactly one bearing, the framework satisfies infinitesimal angle rigidity, yet the bearing rigidity matrix has a kernel larger than the rigid motions.","supporting_citations":[],"review_version":1}