Networked pointing system: Bearing-only target localization and pointing control

Baoqing Yang; Bo Zhu; Fenghua He; Jie Ma; Shiyao Li; Yining Zhou

REVIEW 3 major objections 4 minor 12 references

Networked pointing system: Bearing-only target localization and pointing control

T0 review · 3 major / 4 minor · reviewed 2026-08-15 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read This paper claims that two non-collinear bearing sensors let a distributed network localize a stationary target and asymptotically point all agent headings at it.

desk verdict The localization half of this paper is solid and new, but the pointing half is a citation with an unqualified statement that is literally false in an anti-aligned initial condition. read the letter →

arxiv 2506.18460 v1 pith:PANE2SMW submitted 2025-06-23 eess.SY cs.SY

Shiyao Li , Bo Zhu , Yining Zhou , Jie Ma , Baoqing Yang , Fenghua He This is my paper · ORCID

classification eess.SYcs.SY

keywords target-pointingconsensusbearing-onlylocalizationdistributedestimationcooperativevirtualfusionnodemulti-agentsystemsprojectionmatrixnetworkedcontrol

verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

This paper takes on the problem of making every agent in a distributed network point its heading at a common stationary target when only two agents can measure the target's direction (its bearing). It proposes a two-step strategy: a distributed bearing-only estimator through which every agent reconstructs the target position, followed by a pointing controller that turns each heading toward the estimate. The central claim is that two sensing agents whose lines of sight to the target are not collinear are enough for localizability, replacing the stronger persistent-excitation and collinearity assumptions of earlier pointing and localization schemes. If the claim holds, networks of platforms such as optical transceivers or observation instruments could acquire and track a target cooperatively without a prescribed formation.

What carries the argument

The central object is the orthogonal projection matrix $M_{z_i}=I_2-z_i z_i^T$ formed from a sensing agent's unit bearing vector $z_i$; it cancels the line-of-sight component of the estimation error and drives the estimate along the perpendicular direction. Coupled through $k_{12}$ and $k_{21}$, the two sensing agents' errors become an LTI system whose stability is decided by the Hurwitz criterion, and the constant term of its characteristic polynomial ties stability exactly to the non-collinearity condition $\sin(\theta_1-\theta_2)\neq 0$. The second key device is the virtual fusion node: in the non-sensing layer the two sensing estimates are merged into a single leader node, converting the estimation law (7b) into a consensus-tracking system that is input-to-state stable when the fused graph has a spanning tree. The pointing control $M_{h_i}(\hat q_i-p_i)$ applies the same projection idea to rotate each heading toward the estimated target.

What would settle it

Simulate the closed loop (7a)-(9) with two non-collinear sensing agents and a non-sensing layer satisfying Assumption 2, using very slow estimator gains; if the headings fail to approach the true target direction even after the estimation error has essentially vanished, the pointing claim is false as stated. Conversely, to refute the localization claim, run (7a)-(7b) with arbitrarily small initial errors and check whether $\|\tilde q_i(t)\|$ decays exponentially; any persistent residual at arbitrarily small initial error would contradict Theorem 1.

Watch

Extended reading notes

Core claim

On the paper's own terms, the discovery is a bearing-only distributed localizability result: with two stationary sensing agents whose lines of sight to a stationary target are not collinear, the target position can be recovered exponentially by every agent in the network. The coupled error dynamics of the two sensing agents form a linear time-invariant system whose characteristic polynomial has constant term $k_{12}k_{21}\sin^2(\theta_1-\theta_2)$, so exponential convergence is equivalent to $\sin(\theta_1-\theta_2)\neq 0$. Non-sensing agents then track the sensing agents' estimates through a consensus law, and the virtual fusion node merges the two sensors into one leader so that the non-sensing error system is input-to-state stable under Assumption 2. The paper further claims that the pointing control law (9) makes every agent's heading asymptotically point at the true target.

Load-bearing premise

The load-bearing premise is that the external theorem cited for heading convergence still applies when each agent's target estimate is time-varying and only asymptotically converging; the paper does not verify the theorem's hypotheses, so if the theorem assumes a fixed target point the pointing claim is not established.

Editorial extensions

If this is right

With only two non-collinear sensing agents, no persistent-excitation condition or special formation is required for the network to localize a stationary target.
Agents without any bearing measurement can still obtain exponentially converging target estimates, as long as the communication graph lets them be reached from the sensing layer.
The two-step design decouples localization from pointing: once the estimate converges, the heading control (9) can steer all agents toward the same target.
The only localizability obstruction in the two-sensor case is exact collinearity, $\theta_2=\theta_1$ or $\theta_2=\theta_1+\pi$; any other pair of lines of sight works.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

The virtual fusion node construction is not obviously limited to two sensing agents; fusing any set of sensing agents into one effective leader would likely give the same leader-following analysis, provided no two lines of sight are collinear.
For a slowly moving or drifting target, the LTI error argument no longer applies, but a time-scale separation between fast estimation and slow target motion would be a natural route to ultimately bounded or practical convergence.
The pointing claim (Theorem 2) is inherited from an external theorem cited in one sentence; a self-contained direct proof for the full coupled estimator-controller system would settle whether the moving-estimate cascade preserves the theorem's hypotheses, or reveal a condition under which only practical pointing holds.

Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Desk Editor's Note

read the letter

Short version: read this for the two-agent bearing-only estimator and the virtual fusion node argument; do not rely on Theorem 2 as written.

What is actually new: the paper gives a distributed bearing-only localization scheme that needs only two non-collinear sensing agents and removes the persistent-excitation and collinearity assumptions used in earlier work. Lemma 1 is sound; I checked the error dynamics and the Hurwitz condition. The characteristic polynomial is correct and the non-collinearity condition is the necessary and sufficient condition for exponential convergence. The virtual fusion node is a genuinely nice device: it turns the non-sensing-agent estimation problem into a consensus-tracking problem with an exponentially decaying input. Theorem 1 is plausible under Assumption 2, given an ISS argument that is sketched but not fully detailed. The contribution relative to Deghat et al., Chen et al., and Wu et al. is real.

The soft spots are concentrated in the pointing stage. Theorem 2 is proved by the sentence "See Theorem 3.4 in Trinh et al. (2020)", with no restatement of that theorem's hypotheses and no demonstration that it covers a time-varying, asymptotically converging reference. The controller (9) is driven by the estimate, not by the true q0, and a cascade argument is needed. Without it, the pointing convergence is asserted, not derived. Worse, the statement as written is false: if an agent's initial heading is exactly opposite to q0 - p_i, then M_{h_i}(q0 - p_i) = 0, so that heading never changes and the agent never points at the target. Theorem 2 needs a generic-initial-condition qualifier and a self-contained proof. This is not fatal to the localization idea, but it means the headline claim of "pointing consensus" is not established as stated.

There are a few smaller issues. The abstract omits the graph-connectivity assumption, so "only two agents not collinear" sounds stronger than it is. The description of Eq. (7b) mentions an orthogonal projection term that is not present in that equation. The simulation is a single six-agent scenario with no gains and no baseline; it illustrates the behavior but does not validate the theorem. The citation pattern is otherwise fine; the problem is the weight placed on one external theorem.

Bottom line: I largely agree with the reader. The paper deserves a serious referee because the localization idea is clean and likely correct, but the authors should either supply a real proof of Theorem 2 with the anti-aligned qualifier or soften the claim to a conjecture supported by simulation. I would not desk-reject this; I would send it to review and ask for a major revision.

Referee Report

3 major / 4 minor

Summary. The paper studies a network of n stationary agents in the plane, each with a unit heading vector. Two sensing agents measure the bearing to a stationary target; the remaining agents communicate over a directed graph. The authors propose a distributed bearing-only estimator (7) for the target position and a pointing controller (9) that steers each heading toward the agent's current estimate. Lemma 1 and Theorem 1 claim exponential convergence of all estimation errors under Assumptions 1–2; Theorem 2 claims that all headings asymptotically point at the target. The localization half is supported by a linear analysis and a virtual-fusion-node graph argument; the pointing half is delegated to a citation.

Significance. The localization result is a clean analytic contribution: with two non-collinear bearing sensors and a rooted communication graph, the linear estimator (7) avoids persistent-excitation conditions and requires no data fitting. The virtual fusion node is a reasonable way to convert the two-leader problem into a standard consensus-tracking form, and the paper provides a UE4 demonstration. However, the central two-step claim is incomplete: Theorem 2 is not proved in the manuscript and is false as stated for anti-aligned initial headings. The contribution is potentially useful but currently conditional on a substantiated pointing-convergence proof.

major comments (3)

[Section 3.2, Theorem 2] The proof of Theorem 2 consists of the single sentence 'See Theorem 3.4 in Trinh et al. (2020).' The hypotheses of that theorem are not restated and are not verified for the closed loop (7a)–(9). In particular, the controller (9) is driven by \hat q_i(t), a time-varying signal that converges to q_0 only asymptotically; a pointing-convergence theorem for a fixed target position does not automatically extend to this cascade without an explicit robustness or two-time-scale argument. Because Theorem 2 is the sole support for the pointing half of the central claim, this gap is load-bearing. Please give a self-contained proof, or state the external theorem and verify all its conditions, including the time-varying reference.
[Section 3.2, Theorem 2 statement] As stated, Theorem 2 is not correct without a generic-initial-condition qualifier. If all estimates are initialized at q_0 and one agent has h_i(0)=-(q_0-p_i)/||q_0-p_i||, then \dot h_i = M_{h_i}(q_0-p_i)=0 for that agent; because the estimator has zero initial error in this configuration, \hat q_i remains at q_0 and the anti-aligned heading never converges to the target direction. The theorem should be qualified as holding for almost all initial headings, or the anti-aligned equilibrium should be explicitly excluded and its instability analyzed.
[Section 3.2, Theorem 1 proof] The proof of Theorem 1 states that (L+\bar B_f)\otimes I_2 is positive definite by Theorem 3.6 of Ren and Beard (2005). For the directed NSA graph, L+\bar B_f is generally not symmetric, and the cited theorem is a consensus result rather than the matrix fact used here. The needed statement is that L+\bar B_f is a nonsingular M-matrix, hence positive stable, under Assumption 2, which then makes the linear system (20) exponentially stable. Please correct the matrix-theoretic claim and the citation.

minor comments (4)

[Lemma 1, Eq. (15)] The proof says the Hurwitz condition is 'easy to verify' but does not show the verification. Please include the Routh array or the explicit inequalities that, together with sin^2(\theta_1-\theta_2) \neq 0, imply all roots have negative real parts.
[Eq. (20)] The symbol B_f is used both as a vector and, through \bar B_f = diag(B_f), as a diagonal matrix; please make the notation consistent and state the dimensions of the Kronecker products.
[Theorem 1 proof] The step from ISS plus an exponentially decaying input to exponential convergence of \tilde q^* is asserted rather than shown; for the linear system at hand the implication is true, but it should be stated explicitly.
[Section 4] The text contains 'Fig. Fig. 6'; the duplicate word should be removed.

Circularity Check

0 steps flagged · score 0.0 of 10

No circularity: the localization derivation is self-contained, and the pointing claim is delegated to an external theorem rather than to a fitted input or self-citation chain.

full rationale

The paper's derivation is self-contained for the localization half. Lemma 1 writes the two sensing-agent error dynamics as the LTI system (14), computes the characteristic polynomial (15), and invokes the Hurwitz criterion with the condition sin(theta1-theta2) != 0, which is exactly Assumption 1; no quantity is fitted and the result is not assumed. Theorem 1 expresses the non-sensing-agent errors as the ISS system (20), where Assumption 2 and a standard externally published result of Ren and Beard supply positive definiteness of the state matrix, and Lemma 1 supplies exponentially decaying exogenous signals. The virtual fusion node is an algebraic bookkeeping device that merges beta weights; it does not smuggle in the conclusion. The pointing claim in Theorem 2 is supported by a one-line citation to Theorem 3.4 of Trinh et al. (2020), a work with no author overlap with the present paper. This is an omitted-proof or hypothesis-verification gap if the cited theorem does not cover a time-varying estimate, and the unqualified statement also admits an anti-aligned fixed point unless a generic-initial-condition qualifier is added; however, neither issue makes the derivation circular, because the target result is not an input to its own proof. No fitted parameter is renamed as a prediction, and no load-bearing argument reduces by construction to its assumptions.

Assumptions & free parameters 1 free parameters · 5 assumptions · 1 invented entities

The central claim rests on standard theorems (Hurwitz, Ren-Beard, Trinh) and on domain assumptions of stationarity, noise-free bearings, and graph connectivity. The only design parameters are the SA gains k12 and k21, which are free but only required to be positive. No entity is physically invented; the virtual fusion node is an analytic construct.

free parameters (1)

k12, k21 (SA estimator gains) = unspecified (any >0)
Design gains in Eq. (7a); the stability proof in Lemma 1 requires only positivity, so the convergence conclusion is independent of their values.

assumptions (5)

standard math Hurwitz stability criterion applied to the characteristic polynomial in Eq. (15); the paper states 'it is easy to verify' without performing the verification
Lemma 1 relies on the Hurwitz condition sin(θ1−θ2)≠0 being necessary and sufficient; we independently verified the determinant conditions, but the paper does not show them.
standard math Ren and Beard (2005), Theorem 3.6: (L + diag(Bf)) is positive stable when Assumption 2 holds
Used in Theorem 1 to conclude ISS of the NSA error dynamics in Eq. (20).
standard math Trinh et al. (2020), Theorem 3.4: convergence of the pointing controller for a known/bearing-based reference
The entire proof of Theorem 2 is this citation; its assumptions are not restated or verified for the coupled time-varying estimator-controller system.
domain assumption Stationary target, stationary agents with known positions, noise-free bearing measurements
Required for Eq. (14) to be LTI with constant θ1, θ2 and for the projection geometry to be exact; stated in Section 2.
domain assumption Communication graph satisfies Assumption 2 (directed spanning tree rooted at the virtual fusion node)
Necessary for the NSA consensus to propagate the SA estimates; stated in Section 3.2.

invented entities (1)

Virtual fusion node 0
purpose: Analytical device that merges the two sensing agents into a single leader node when analyzing NSA estimation convergence (Eq. (19)-(20))
It is a mathematical abstraction in the convergence proof, not a physical system element, and it makes no falsifiable predictions on its own.

how reviews work

0 comments

Cite this review

Pith. "Pith review of Networked pointing system: Bearing-only target localization and pointing control." pith.science (2026). https://pith.science/paper/PANE2SMW

@misc{pith2026250618460,
  author       = {Pith},
  title        = {Pith review of: Networked pointing system: Bearing-only target localization and pointing control},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/PANE2SMW}},
  note         = {Machine review of arXiv:2506.18460}
}

read the original abstract

In the paper, we formulate the target-pointing consensus problem where the headings of agents are required to point at a common target. Only a few agents in the network can measure the bearing information of the target. A two-step solution consisting of a bearing-only estimator for target localization and a control law for target pointing is constructed to address this problem. Compared to the strong assumptions of existing works, we only require two agents not collinear with the target to ensure localizability. By introducing the concept of virtual fusion node, we prove that both the estimation error and the tracking error converge asymptotically to the origin. The video demonstration of the verification can be found at https://youtu.be/S9- eyofk1DY.

Figures

Figures reproduced from arXiv: 2506.18460 by the authors.

**Figure 2.** The connection between target, SAs and NSAs. [PITH_FULL_IMAGE:figures/full_fig_p002_2.png] view at source ↗

**Figure 3.** The scenarios of target-pointing consensus. [PITH_FULL_IMAGE:figures/full_fig_p002_3.png] view at source ↗

Figures from the paper (3 more)

**Figure 4.** Figure 4: The graph using virtual fusion node 0. Next, we give the localization analysis of the NSAs. In this section, the concept of virtual fusion node is introduced to analyze the convergence of NSAs’ estimates. The actual connectivity is transformed into the a new topology g…

**Figure 6.** Figure 6: The convergence procedure of 6 agents in UE4. [PITH_FULL_IMAGE:figures/full_fig_p004_6.png]

**Figure 5.** Figure 5: The trajectories of estimation and pointing errors. [PITH_FULL_IMAGE:figures/full_fig_p004_5.png]

Review history (2 revisions) →

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

12 extracted references · 9 canonical work pages

[1]

, " * write output.state after.block = add.period write newline

ENTRY address author booktitle chapter doi edition editor eid howpublished institution journal key month note number organization pages publisher school series title type url volume year label extra.label sort.label short.list INTEGERS output.state before.all mid.sentence after.sentence after.block FUNCTION init.state.consts #0 'before.all := #1 'mid.sent...
[2]

write newline

" write newline "" before.all 'output.state := FUNCTION n.dashify 't := "" t empty not t #1 #1 substring "-" = t #1 #2 substring "--" = not "--" * t #2 global.max substring 't := t #1 #1 substring "-" = "-" * t #2 global.max substring 't := while if t #1 #1 substring * t #2 global.max substring 't := if while FUNCTION word.in bbl.in capitalize " " * FUNCT...
[3]

J. Yin, Y. Li, S. Liao, M. Yang, Y. Cao, L. Zhang, J. Ren, W. Cai, W. Liu, S. Li, et al. . Entanglement-based secure quantum cryptography over 1,120 kilometres. Nature, vol. 582, no. 7813, pp. 501--505, 2020

work page 2020
[4]

Dubus, J

G. Dubus, J. L. Contreras, S. Funk, Y. Gallant, T. Hassan, J. Hinton, Y. Inoue, J. Knodlseder, P. Martin, N. Mirabal, et al. . Surveys with the Cherenkov telescope array. Astroparticle Physics, vol. 43, pp. 317--330, 2013

work page 2013
[5]

J. Wu, S. Yuan, Q. Dang, F. Zhang, and W. Yu. Cooperative pointing control of collinear double-integrators without angular velocity. Journal of the Franklin Institute, vol. 360, no. 12, pp. 9050--9064, 2023

work page 2023
[6]

M. H. Trinh, D. Zelazo, Q. Van Tran, and H.-S. Ahn. Pointing consensus for rooted out-branching graphs. 2018 Annual American Control Conference (ACC), pp. 3648--3653, 2018

work page 2018
[7]

J. Li, Z. Ning, S. He, C. Lee, and S. Zhao. Three-Dimensional Bearing-Only Target Following via Observability-Enhanced Helical Guidance. IEEE Transactions on Robotics, vol. 39, no. 2, pp. 1509--1526, 2022

work page 2022
[8]

J. A. Luo, X. H. Shao, D. L. Peng, and X. P. Zhang. A novel subspace approach for bearing-only target localization. IEEE Sensors Journal, vol. 19, no. 18, pp. 8174--8182, 2019

work page 2019

Show all 12 references

[9]

Deghat, I

M. Deghat, I. Shames, B. D. O. Anderson, and C. Yu. Localization and circumnavigation of a slowly moving target using bearing measurements. IEEE Transactions on Automatic Control, vol. 59, no. 8, pp. 2182--2188, 2014

2014
[10]

K. Chen, G. Qi, Y. Li, and A. Sheng. Cooperative localization and circumnavigation of multiple targets with bearing-only measurements. Journal of the Franklin Institute, vol. 360, no. 12, pp. 9159--9179, 2023

2023
[11]

Ren and R

W. Ren and R. W. Beard. Consensus seeking in multiagent systems under dynamically changing interaction topologies. IEEE Transactions on Automatica Control, vol. 50, no. 5, pp. 655--661, 2005

2005
[12]

M. H. Trinh, D. Zelazo, and H.-S. Ahn. Pointing Consensus and Bearing-Based Solutions to the Fermat–Weber Location Problem. IEEE Transactions on Automatic Control, vol. 65, no. 6, pp. 2339--2354, 2020. doi:10.1109/TAC.2019.2927932

2020

Pith tools

Reviewed August 15, 2026 · model on record in the stance chip above.

[1] [1]

, " * write output.state after.block = add.period write newline

ENTRY address author booktitle chapter doi edition editor eid howpublished institution journal key month note number organization pages publisher school series title type url volume year label extra.label sort.label short.list INTEGERS output.state before.all mid.sentence after.sentence after.block FUNCTION init.state.consts #0 'before.all := #1 'mid.sent...

[2] [2]

write newline

" write newline "" before.all 'output.state := FUNCTION n.dashify 't := "" t empty not t #1 #1 substring "-" = t #1 #2 substring "--" = not "--" * t #2 global.max substring 't := t #1 #1 substring "-" = "-" * t #2 global.max substring 't := while if t #1 #1 substring * t #2 global.max substring 't := if while FUNCTION word.in bbl.in capitalize " " * FUNCT...

[3] [3]

J. Yin, Y. Li, S. Liao, M. Yang, Y. Cao, L. Zhang, J. Ren, W. Cai, W. Liu, S. Li, et al. . Entanglement-based secure quantum cryptography over 1,120 kilometres. Nature, vol. 582, no. 7813, pp. 501--505, 2020

work page 2020

[4] [4]

Dubus, J

G. Dubus, J. L. Contreras, S. Funk, Y. Gallant, T. Hassan, J. Hinton, Y. Inoue, J. Knodlseder, P. Martin, N. Mirabal, et al. . Surveys with the Cherenkov telescope array. Astroparticle Physics, vol. 43, pp. 317--330, 2013

work page 2013

[5] [5]

J. Wu, S. Yuan, Q. Dang, F. Zhang, and W. Yu. Cooperative pointing control of collinear double-integrators without angular velocity. Journal of the Franklin Institute, vol. 360, no. 12, pp. 9050--9064, 2023

work page 2023

[6] [6]

M. H. Trinh, D. Zelazo, Q. Van Tran, and H.-S. Ahn. Pointing consensus for rooted out-branching graphs. 2018 Annual American Control Conference (ACC), pp. 3648--3653, 2018

work page 2018

[7] [7]

J. Li, Z. Ning, S. He, C. Lee, and S. Zhao. Three-Dimensional Bearing-Only Target Following via Observability-Enhanced Helical Guidance. IEEE Transactions on Robotics, vol. 39, no. 2, pp. 1509--1526, 2022

work page 2022

[8] [8]

J. A. Luo, X. H. Shao, D. L. Peng, and X. P. Zhang. A novel subspace approach for bearing-only target localization. IEEE Sensors Journal, vol. 19, no. 18, pp. 8174--8182, 2019

work page 2019