{"id":"a25ea3bd-3e76-4e3c-aee4-6a9cbd849af4","arxiv_id":"2507.08724","paper_version":1,"verdict":"REJECT","confidence":"MODERATE","novelty_score":6.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"For a drone and ground robot moving along parallel lines with a tether of bounded length, the minimum-turn, minimum-speed, and minimum-length paths for the ground robot can all be found in linear time.","lead":"This paper works out a fast geometric method for a ground robot to follow a tethered drone flying along a parallel line, using as few turns as possible. It also finds the minimum required speed and the shortest total path, and claims all three can be computed in linear time.","discovery_kind":"new_application","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Theorem 3's induction does not establish that the β* path is min-link; a feasible path with β>β* could cross several greedy levels in one segment with fewer links, and the proof's Case III misapplies the induction hypothesis.","rationale":"The reader identifies Lemma 2 as the weakest assumption. I agree that its proof is only a sketch, but the claim itself is plausible: any δ-segment can be subdivided into arbitrarily small pieces and each piece replaced by a two-link ±β zigzag, so monotonicity of feasible slopes is likely true. The more acute gap is Theorem 3, the proof of min-link optimality. The induction as written does not imply the desired inequality for paths that cross several greedy levels in one link, and the Case III argument misstates what the induction hypothesis gives. Since the Min-Link half of Theorem 5 is exactly Theorem 3, this is the most load-bearing unsupported step. The Min-Length argument is more solid—over a fixed time interval the Euclidean length of any β-path is sqrt(1+β^2)·T—but it depends on the min-slope theorem. I therefore keep the REJECT verdict: the geometric framework may be correct and salvageable, but the submitted text does not establish the central claims.","tokens_in":9529,"tokens_out":21714,"duration_ms":307701,"concrete_test":"For each small α-corridor instance (n ≤ 8 reflex vertices), compute β* by brute force over all overlapping pairs and construct the greedy β*-path B*. Then solve the Min-Link problem exactly by dynamic programming over all feasible β-paths with β in [β*, α], enumerating link counts and reflex-contact sequences. If any instance admits a feasible path with β > β* and fewer links than B*, Theorem 3 is false. As a targeted analytic check on the induction, test whether a single straight segment can cross the levels of a multi-link B* while remaining inside the corridor; if such a segment is feasible for any corridor, the claimed Case I inequality fails directly.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The central claim (Theorem 5) depends on Theorem 3, which asserts that the greedy β*-path B* is optimal for the Min-Link Problem. The proof in Section 5 is not a proof. It fixes levels as vertical lines through the vertices b*_1,...,b*_m of B* and compares an arbitrary feasible β-path B with β ≥ β* by the sign of B's segment at each level. The induction step assumes that if B reaches the next level it adds a link; but a single segment of B can cross several consecutive level lines without turning. The four cases do not rule this out. In Case III the text states 'by hypothesis, B has, at least, one more turn than B* before reaching level k', but the induction hypothesis is only |B*_k| ≤ |B_k| + 1, which does not say that. Moreover, if B skips level k, sign(B,k) is defined by the segment crossing that vertical line, so B may have no vertex there at all. Case IV is dismissed with 'similar arguments'. No argument shows that a feasible path with slope β > β* cannot use one long segment to traverse several greedy levels and thereby use fewer links. Lemma 4 only forces β*-paths through the critical pair (li,uj); it does not restrict β > β* paths. Consequently, the Min-Link half of Theorem 5 is unsupported. The Min-Length half is more plausible, since any β-path over a fixed time interval has length sqrt(1+β^2)·T, but it still inherits the unproved min-slope computation from Theorems 1–2.","agreement_with_reader":"partial"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper studies a 2D pursuit problem in which a drone follows a known back-and-forth path along one straight line at constant speed α and a ground robot moves on a parallel line with constant speed β, connected by a tether of length L. In the space-time plane the drone's path generates an α-corridor, and the authors define the Min-Slope, Min-Link, and Min-Length problems for a feasible β-path. The paper claims that the minimum feasible slope is the maximum slope over overlapping reflex pairs, that a greedy β*-path solves both the Min-Link and Min-Length problems, and that all three problems can be solved in Θ(n) time.","tokens_in":9831,"tokens_out":27802,"duration_ms":341785,"significance":"If the central claims were correct, the paper would provide an elegant geometric reduction of a constrained-velocity pursuit problem to minimum-link path problems, together with a linear-time algorithm. The formulation is self-contained and does not rely on fitted parameters or on the authors' prior results, which is a strength. However, the main theorems are not rigorously established: I identify a concrete counterexample to the Min-Slope theorem, and the optimality proof for the Min-Link problem is logically incomplete. The significance of the claimed contribution is therefore not supported in the present form.","major_comments":[{"comment":"The theorem that the minimum feasible slope is the maximum slope among all overlapping reflex pairs is false as stated. Consider α=1, L=1.1, and the drone path PA through the vertices (0,0), (2,-2), (5,1), (7,-1), (10,2), (12,0). For any pair of reflex vertices li, uj with i<j, the condition uj below li would require y_i - y_j > 2.2, but the largest such difference is 2, attained by adjacent peak-valley pairs; hence there are no overlapping reflex pairs. Nevertheless, no horizontal β=0 path traverses the corridor: at x=0 the corridor is [-1.1,1.1], at x=2 it is [-3.1,-0.9], and at x=10 it is [0.9,3.1], so no constant y lies in every vertical slice. Therefore the Min-Slope Problem is not solved by the maximum-over-overlapping-pairs formula, and the linear-time algorithm built on it does not solve the stated problem.","section":"Section 4, Theorem 1"},{"comment":"The induction in the proof of Theorem 3 does not establish that the greedy β*-path is minimum-link. The proof compares an arbitrary feasible β-path B with B* only at the vertical levels defined by B*'s vertices, but B may cross several consecutive levels in a single link without adding a turn. In Case I the claim that \"B must include at least one link to reach level k+1\" is false in that situation, so the inequality |B*_{k+1}| ≤ |B_{k+1}| does not follow. Case III asserts that \"B has, at least, one more turn than B* before reaching level k\", but the stated induction hypothesis is only |B*_k| ≤ |B_k| + 1, which does not imply that assertion. Case IV is dismissed with no argument. Thus the Min-Link half of Theorem 5 is unsupported.","section":"Section 5, Theorem 3"},{"comment":"The Θ(n) time bound for the Min-Slope Problem rests on the unproved statement that \"By construction of MCCs, the pair of overlapping reflex points with maximum slope must lie within some MCC[k]\". No proof is given that the maximum-slope pair is contained in a Maximum Convex Chain, nor that the forward and backward sweeps over the MCC sequence enumerate all candidates. Since the counterexample in my first comment shows that the set of overlapping reflex pairs does not even determine the true minimum slope, this containment claim would need to be re-examined even for the candidate set; as written, Theorem 2 is not established.","section":"Section 4.1.2 and Theorem 2"},{"comment":"Two load-bearing lemmas are justified only by reference to figures. Lemma 1(b), used in Theorem 1 to conclude that the maximum-slope overlapping pair is visible, is asserted with \"Figure 2 illustrates both parts of Lemma 1\"; a figure is not a proof. Lemma 2, the monotonicity of feasible slopes that converts section-wise feasibility into global feasibility, is justified by \"it is easy to construct\" and Figure 3. Both lemmas are central to the Min-Slope claim and require rigorous arguments.","section":"Section 4, Lemmas 1(b) and 2"}],"minor_comments":[{"comment":"The definition of M CC[i] is imprecise: it refers to \"the set of reflex points in Pl within section C[i,j]\" while j is itself defined through the MCC; the definition should be made self-contained before it is used in an algorithm.","section":"Section 4, Definition 2"},{"comment":"The proof of Theorem 4 consists of a figure reference and the sentence \"minimizing β is equivalent to minimizing the length\". The equivalence is plausible because an x-monotone β-path over a fixed time interval has length sqrt(1+β^2)·T, but this should be stated and proved with equations, and the endpoint conditions should be made explicit.","section":"Section 5, Theorem 4"},{"comment":"There are several typos and grammatical issues, e.g., \"trayectoria\" in the conclusion, \"maximazing\" in Section 2, and inconsistent spacing in \"U AV\"; the manuscript needs a careful proofreading pass.","section":"Section 6"},{"comment":"The statement that the greedy construction \"will only make a constant number of operations on each level\" needs a precise complexity argument with the data structures used to test collisions and select support reflex points; as written, the O(n) running time of the construction is not demonstrated.","section":"Section 5, Greedy Construction"}],"recommendation":"reject","confidential_remarks":"The counterexample in Section 4 is not a minor edge case: it shows that the paper's main geometric characterization of the minimum slope is incorrect for a natural class of back-and-forth drone paths with increasing peak heights. Fixing this would require reformulating the Min-Slope problem and likely the entire algorithmic approach. The Min-Link optimality proof is also incomplete in a way that does not seem locally patchable. If the authors can develop a correct characterization and a complete proof of the greedy optimality, a substantially revised manuscript could be reconsidered."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"The problem formulation is genuinely new: three optimization problems for an α-corridor (min-slope, min-link, min-length) and the insight that the minimum slope β* parameterizes both optimal link count and total length. The geometric reduction to a 2D space-time corridor is clean, and the intuition that the worst overlapping reflex pair determines feasibility is clearly stated. Min-length is on solid ground once β* is known, since length over a fixed time interval depends only on slope. This is a real contribution to a narrow but well-motivated special case of corridor traversal.\n\nThe soft spots are concentrated in the proofs, and they are load-bearing. Lemma 1(b) is justified by pointing at a figure, not by an argument; that is a gap in Theorem 1. Lemma 2, the monotonicity of feasible slopes, is the hinge that converts local worst cases into a globally feasible path, but the proof is a sketch saying \"it is easy to construct.\" The linear-time claim in Theorem 2 rests on unproved containment properties of the MCCs — what exactly guarantees that the maximum overlapping pair lies inside some MCC, and that the sweep over candidates covers all cases? That may be true, but it is not shown.\n\nThe stress-test concern about Theorem 3 is valid. The induction fixes levels at B*'s vertices and argues by sign changes at each level. A feasible path with β > β* can cross several levels in one long segment without turning; the proof does not rule this out. Case III claims that B has at least one more turn than B* before level k, which is not what the induction hypothesis says — it says |B*_k| ≤ |B_k| + 1, which permits B to have fewer turns. Case IV is dismissed with \"similar arguments\" without spelling them out. So the Min-Link half of Theorem 5 is not established by the text. The Min-Length half is more plausible, but it inherits the incomplete min-slope computation.\n\nThis paper is worth a serious referee because the problem is new and the algorithms are likely correct in spirit. But as submitted, the central theorems are not rigorously proven. A careful revision with complete proofs for Lemmas 1–2, a full specification and correctness argument for the MCC-based linear-time algorithm, and a repaired induction for Theorem 3 would make it a solid contribution. If this lands on my desk, I would send it to review but with a clear note that the proofs need major work before acceptance.","headline":"Clean new problem and a plausible linear-time algorithm, but the proof of the min-link claim is not there yet.","tokens_in":10402,"tokens_out":1742,"would_cite":false,"duration_ms":21785,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["68U05"],"pacs":[],"model":"deepseek-v4-flash","headline":"For a ground robot tethered to a drone moving along a parallel line, the minimum-link and minimum-length shadowing paths are both determined by one optimal slope and can be computed in linear time.","keywords":["geometric optimization","min-link paths","tethered marsupial robotics","pursuit-evasion","α-corridor","maximum convex chain","linear-time algorithm","target tracking"],"falsifier":"Construct an $\\alpha$-corridor with a narrow pinch formed by an overlapping lower/upper reflex pair and check by exhaustive ray shooting whether every $\\beta$-slope path with $|\\delta| < |\\beta| < |\\alpha|$ can pass the pinch whenever a $\\delta$-slope path can. A computer search over random corridors that finds one failure would refute Lemma 2 and, with it, Theorems 1 and 5.","tokens_in":9275,"feed_emoji":"🤖","tokens_out":9810,"duration_ms":100535,"temperature":0.7,"pith_summary":"This paper introduces a trajectory-planning problem for a marsupial robot pair: a ground vehicle and a drone connected by a taut tether of maximum length $L$, both moving along parallel lines in a vertical plane. Given the drone's known back-and-forth trajectory and constant speed, the ground vehicle must pick a constant speed and its own back-and-forth path so that the separation never exceeds $L$. The central claim is that the optimal speed, the minimum-link path, and the minimum-length path are all governed by a single quantity, the steepest slope among overlapping pairs of reflex points in a transformed $\\alpha$-corridor, and can be computed in $\\Theta(n)$ time. A greedy path built at that slope is simultaneously optimal for both the number of turns and the total path length.","feed_headline":"Optimal tethered pursuit is solvable in linear time","feed_subtitle":"The steepest overlapping reflex-pair slope gives both the fewest turns and the shortest path.","key_machinery":"The key object is the $\\alpha$-corridor: in the space-time plane, the drone's path is a polygonal chain with slopes $+\\alpha$ and $-\\alpha$, and the corridor is the region of points whose vertical distance from that chain is at most $L$. Inside it, the load-bearing structure is the set of lower and upper reflex points. An overlapping pair $\\langle l_i, u_j \\rangle$ with $u_j$ below $l_i$ forces any feasible path to climb, and the largest slope among all visible overlapping pairs is the minimum feasible slope $\\beta^*$. The sequence of Maximum Convex Chains (MCCs), computed by a variant of Graham's scan, locates that pair in linear time. A greedy construction using slopes $\\pm\\beta^*$ then names the optimal path, with reflex points acting as the only places where turns can occur.","core_discovery":"The paper claims that the Min-Link and Min-Length problems for a tethered pursuer reduce to one slope computation. Modeling position against time, the drone's motion becomes an $\\alpha$-path whose segments have slopes $+\\alpha$ and $-\\alpha$; the set of points within vertical distance $L$ of that path is an $\\alpha$-corridor bounded above and below by translated copies of the path. A feasible ground path is a $\\beta$-path with $|\\beta| \\le |\\alpha|$ that stays inside the corridor. The minimum such $|\\beta|$ is the maximum slope among all visible overlapping pairs of reflex vertices of the corridor (Theorem 1), and the $\\beta^*$-path built greedily from those reflex points has the fewest links (Theorem 3) and the minimum length (Theorem 4). Since the slope, link-count, and length objectives coincide, all three problems are solved in $\\Theta(n)$ time (Theorem 5).","pith_inferences":["The paper does not pursue it, but the same corridor machinery should extend to any corridor whose boundary is a pair of parallel translated chains, so the linear-time result may survive irregular drone speeds as long as the space-time path keeps alternating slopes $\\pm\\alpha$.","Reading the tether as a sensor range or communication radius turns the result into a linear-time planner for continuous visibility tracking along parallel lines, with $\\beta^*$ interpreted as the observer's minimum speed.","The coincidence of min-slope, min-link, and min-length here suggests a broader design principle: for one-parameter families of feasible paths, minimizing the parameter can automatically optimize both combinatorial and metric objectives, a hypothesis worth testing on kinodynamic models such as Dubins vehicles.","The 3D extension the paper leaves open inherits NP-hardness from min-link paths on terrains, so the tractability of this 2D case likely depends on the parallel-line geometry rather than on the tether constraint itself."],"forward_implications":["A ground robot can compute its entire optimal shadowing path in $\\Theta(n)$ time, where $n$ is the number of turns in the drone's known trajectory.","The ground robot's optimal speed is exactly the steepest slope among overlapping reflex pairs; no separate speed optimization is needed.","The same $\\beta^*$-path solves both the Min-Link and Min-Length problems, so minimizing turns does not force a longer path.","If no reflex pairs overlap, a horizontal path is optimal, giving the ground robot zero turns and minimum length.","The greedy construction uses only corridor reflex points as turn candidates, so the algorithm needs no numerical optimization beyond slope comparisons."],"supporting_citations":[{"why":"Supplies the linear-time convex-hull-of-a-simple-polygon method that the MCC computation adapts to build collision-free convex chains.","marker":"[12]"},{"why":"Supplies the space-efficient linear-time variant cited for the MCC scan when an online computation is required.","marker":"[3]"},{"why":"Defines the general minimum-link path problem among obstacles, the hard setting that the structured corridor avoids.","marker":"[16]"},{"why":"Gives the linear-time minimum-link algorithm for simple polygons whose time bound Theorem 5 matches and extends to the corridor setting.","marker":"[21]"},{"why":"Provides the NP-hardness result for minimum-link paths on terrains that frames the 3D extension as open.","marker":"[10]"}],"fun_headline_variants":["Tethered pursuit: linear-time optimal path for ground robot","Fewest turns and shortest path: one slope solves it","Ground robot vs. drone: optimal tether paths in linear time","Min-link and min-length tethered paths solved in O(n)","One slope solves tethered pursuit: min-link and min-length"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The argument leans on Lemma 2: if a path with slope $\\delta$ fits inside the corridor, then any steeper slope $\\beta$ with $|\\delta| \\le |\\beta| \\le |\\alpha|$ also fits, because the same reflex-point projections can be reconnected; the paper supplies only a sketch for this step. If that monotonicity ever fails, the maximum-slope pair no longer guarantees a feasible global path, and the linear-time algorithm collapses.","fun_headline_variants_meta":{"raw":{"variants":["Tethered pursuit: linear-time optimal path for ground robot","Fewest turns and shortest path: one slope solves it","Ground robot vs. drone: optimal tether paths in linear time","Min-link and min-length tethered paths solved in O(n)","One slope solves tethered pursuit: min-link and min-length"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000631,"raw_usage":{"total_tokens":2849,"prompt_tokens":816,"completion_tokens":2033,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":432,"completion_tokens_details":{"reasoning_tokens":1948}},"tokens_in":432,"tokens_out":2033,"duration_ms":14622,"temperature":1.0,"reasoning_tokens":1948,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-06T18:11:03.234401+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Construct an $\\alpha$-corridor with a narrow pinch formed by an overlapping lower/upper reflex pair and check by exhaustive ray shooting whether every $\\beta$-slope path with $|\\delta| < |\\beta| < |\\alpha|$ can pass the pinch whenever a $\\delta$-slope path can. A computer search over random corridors that finds one failure would refute Lemma 2 and, with it, Theorems 1 and 5.","supporting_citations":[{"cited_title":"On finding the convex hull of a simple polygon","cited_arxiv_id":null,"evidence_quote":"Supplies the linear-time convex-hull-of-a-simple-polygon method that the MCC computation adapts to build collision-free convex chains."},{"cited_title":"Space-efficient algorithms for computing the convex hull of a simple polygonal line in linear time","cited_arxiv_id":null,"evidence_quote":"Supplies the space-efficient linear-time variant cited for the MCC scan when an online computation is required."},{"cited_title":"Minimum-link paths among obsta- cles in the plane","cited_arxiv_id":null,"evidence_quote":"Defines the general minimum-link path problem among obstacles, the hard setting that the structured corridor avoids."},{"cited_title":"A linear time algorithm with minimum link paths inside a simple polygon","cited_arxiv_id":null,"evidence_quote":"Gives the linear-time minimum-link algorithm for simple polygons whose time bound Theorem 5 matches and extends to the corridor setting."},{"cited_title":"On the complexity of minimum-link path problems","cited_arxiv_id":null,"evidence_quote":"Provides the NP-hardness result for minimum-link paths on terrains that frames the 3D extension as open."}],"review_version":1}