{"id":"47a6cb59-14c0-44fc-bb30-06010bf9d194","arxiv_id":"1908.05727","paper_version":1,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":6.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":1,"one_line_summary":"A patrolling schedule that partitions a rectangular environment into identical blocks, sends one UGV and several UAVs through a repeating cycle, and staggers m identical teams achieves a steady-state maximum revisit time of Tc/m.","lead":"This paper proposes a planning strategy for teams of one ground charging vehicle and several drones to patrol a rectangular area indefinitely by rotating through partitions and recharging while riding on the ground vehicle. The authors claim the resulting maximum time between visits is the cycle period divided by the number of teams, and they tune the partition size to minimize this period.","discovery_kind":"new_application","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Unsupported equivalence claim: the partition-size optimization is not shown to be equivalent to Problem 1, overstating optimality.","rationale":"The reader's weakest_assumption was the UGV simultaneous-charging assumption, which is a disclosed modeling idealization rather than an internal logical flaw; the age formula itself is correct under the stated model. I focus instead on the equivalence claim between the partition-size optimization and Problem 1, because it is an unproven mathematical assertion that underpins the paper's optimality claims. Proposition 3.3 appears sound: the existence of a node visited once per supercycle, combined with m identical teams time-shifted by Tc/m, yields a maximum revisit gap of Tc/m. The main risk is that the paper presents its restricted optimization as solving the original general problem, which it does not establish. This overstatement can be fixed by rewording to 'optimal within the proposed strategy class', so the reader's CONDITIONAL verdict remains appropriate. The reader's rationale also lists the equivalence claim as a main problem, hence partial agreement.","tokens_in":10274,"tokens_out":19567,"duration_ms":181670,"concrete_test":"Solve a small instance of Problem 1 to global optimality, e.g., a 4x4 grid with one UGV and one UAV under the energy constraint (18), using exhaustive search over discretized trajectories or a MILP. Compare the resulting optimal maximum age to the Tc obtained from the proposed supercycle method for the best (a1,a2). If any feasible trajectory yields a maximum age strictly less than Tc, the equivalence claim is refuted. Repeat for several m=1 and m=2 cases. If no counterexample is found, the claim gains empirical support but still requires a formal proof.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The paper asserts that minimizing Tc over partition dimensions (a1,a2) subject to (18) is 'equivalent to (11)', the general age-minimization problem (Section 3, after Prop. 3.1). This assertion is the basis for calling the partition dimensions 'optimal' and claiming a 'minimum long-term maximum age'. However, Problem 1 optimizes over all trajectories pA, pG and control inputs satisfying (1)-(8), whereas Algorithm 3 restricts to a narrow strategy class: identical rectangular partitions, a single-team supercycle on a Hamiltonian cycle of partition centers, and m time-shifted copies of that cycle. No argument shows that an optimal solution to (11) lies within this class. Non-uniform patrol patterns, non-rectangular partitions, or heterogeneous team assignments could plausibly yield a lower maximum age. Without a proof of containment or a lower bound, the optimization is at best 'optimal within the proposed strategy class', not equivalent to (11). This overclaim directly affects the paper's headline contribution of finding optimal partitions.","agreement_with_reader":"partial"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper addresses persistent surveillance of a rectangular grid by n energy-constrained UAVs whose energy is replenished by m UGVs acting as mobile charging stations. Age is defined as the time between consecutive visits to a node, and the objective in Problem 1 is to minimize the long-term maximum age over all vehicle trajectories and control inputs. The paper proposes a scalable strategy that partitions the grid into equal rectangles, forms m homogeneous teams (one UGV and n/m UAVs each), has each team follow a supercycle of partition visits defined by a Hamiltonian cycle on partition centers, and deploys the m teams with a uniform time shift of Tc/m. The main analytical results are Proposition 3.1 (single-team maximum age equals Tc), Proposition 3.2 (UAVs are energy-safe), and Proposition 3.3 (m-team maximum age equals Tc/m). The paper then optimizes the partition dimensions (a1,a2) by minimizing Tc subject to the energy constraint (18), claiming this optimization is equivalent to Problem 1. A numerical example with 3 UGVs and 15 UAVs yields (a1,a2)=(16,16), Tc=2306, and a reported minimum long-term maximum age of 768.6.","tokens_in":10446,"tokens_out":11403,"duration_ms":111528,"significance":"If the claims hold, the paper provides a constructive, scalable planning method for persistent surveillance with mobile charging stations, with explicit formulas for the supercycle period and the resulting age bound. The proof of the age bound for the constructed schedule is straightforward and correct under the stated assumptions, and the use of a Hamiltonian cycle over partitions plus time-shifted identical teams is a clean and implementable idea. The paper also makes a falsifiable prediction (maximum age equals Tc/m) and offers a finite-dimensional search over partition sizes. However, the claimed equivalence of the partition-size optimization to the general age-minimization problem (11) is not established; the strategy restricts to a narrow class of rectangular partitions and uniform teams, so the optimality claim is at best with respect to that class. With the equivalence claim corrected or proven, the paper would be a solid contribution to planning for energy-constrained persistent surveillance.","major_comments":[{"comment":"The assertion that minimizing Tc(a1,a2) subject to (18) is 'equivalent to (11)' is unsupported. Problem (11) optimizes over all initial positions pA(0), pG(0) and all control inputs uA, uG satisfying (1)-(8), whereas Algorithm 3 restricts to identical rectangular partitions, a single-team Hamiltonian supercycle, homogeneous teams, and uniformly time-shifted deployment of those teams. No argument shows that an optimal solution of (11) lies in this restricted class, and no lower bound is provided. Consequently, the 'minimum long-term maximum age' reported in Section 4 (Tc/m = 768.6) is only a minimum within the proposed strategy class. Please either prove the equivalence or a lower bound, or revise the claim to state that the optimization is over the class of strategies defined by Algorithms 1-4.","section":"Section 3, after Proposition 3.1"},{"comment":"Equation (5) imposes emergency landing by setting uA_i(t) = [0, 0, -uA_max] whenever zA_i(t) >= uA_max * e_i(t) / beta^-. This condition depends on altitude rather than on a critical energy threshold; as written, a UAV at low altitude with zero remaining energy does not satisfy the condition, so the constraint does not enforce emergency landing when energy is depleted. Please correct the inequality or state the intended critical-energy condition explicitly.","section":"Section 2.2, Eq. (5)"},{"comment":"The assumptions that UGVs have unlimited energy and can simultaneously charge any number of UAVs while moving are load-bearing for the main results: the supercycle period Tc in Eq. (14) and hence the age bound Tc/m in Proposition 3.3 depend on the charging interval max(||c_{i+1}-c_i||/uG_max, Delta_e/beta^+) in Eq. (13). These assumptions are stated but not justified, and no relaxation is discussed. The paper should explicitly delineate the scope of the age guarantee and comment on how the results would change if charging were serial, if charging required the UGV to be stationary, or if UGV energy were finite.","section":"Section 2.2, before Eq. (8)"}],"minor_comments":[{"comment":"The sentence 'The vector of zeros with the is denoted by 0' is incomplete; it should state that the zero vector is denoted by 0.","section":"Section 2.1"},{"comment":"The condition 't in union_i (t_out_{i,j}, t_in_{i+1,j})' uses the index j without quantifying it; please clarify the meaning, for example by writing the union over i for each fixed supercycle index j.","section":"Eq. (12)"},{"comment":"The input list of Algorithm 4 includes 'q(0)' while the rest of the algorithm and paper use pG(0); please make the notation consistent.","section":"Algorithm 4"},{"comment":"When a1 or a2 does not divide xbar or ybar, Algorithm 1 creates edge partitions with fewer than a1 x a2 cells; the paper should state explicitly whether Delta_e in (17) is computed for the full a1 x a2 partition as a conservative upper bound for all partitions.","section":"Section 4 and Algorithm 1"},{"comment":"The simulation text calls (16,16) 'the optimal partition dimensions' and the corresponding age 'a minimum long-term maximum age' without qualification; as noted in Major Comment 1, these should be qualified as optimal within the proposed rectangular-partition strategy unless the equivalence to Problem 1 is proven.","section":"Section 4"},{"comment":"The phrase 'We show some results related to the safety and performance of the proposed strategy' is vague; please state the specific results, e.g., energy safety (Proposition 3.2) and the maximum-age bound Tc/m (Proposition 3.3).","section":"Abstract"}],"recommendation":"major_revision","confidential_remarks":"The constructive schedule and the computation of its age bound are sound under the stated assumptions, but the claim of equivalence between the partition-size optimization and the general age-minimization problem overstates the contribution. This can be fixed by a clear statement of the strategy class or by a proof of a lower bound. The formal problem statement also contains a likely typo in the emergency-landing constraint (5) that should be corrected before publication."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"The paper gives a genuinely useful way to think about persistent surveillance with mobile charging: partition the rectangle, design a single-team supercycle where a UGV carries and charges UAVs, then time-shift m identical teams to divide the age by m. The age calculations in Prop. 3.1 and 3.3 are direct and, under the stated assumptions, correct. I checked the corner-node argument in Lemma 3.1 and it holds in the cases considered. The subpartitioning by quadrant angle is a reasonable load-balancing heuristic. As far as I know, the simultaneous planning of UAV trajectories, UGV routes, and charging schedules in this integrated cycle is not in prior work, so there is a real kernel of novelty here.\n\nThe main problem is the equivalence claim. After Prop. 3.1 the paper says minimizing Tc over (a1,a2) is 'equivalent to (11)' — but (11) is the general age-minimization problem over all trajectories and controls, while the proposed strategy restricts to identical rectangular partitions and time-shifted identical teams. No argument shows the general optimum lies in that class. Without that, the partition dimensions are optimal only within the proposed strategy class. The abstract and conclusion go further and say 'optimal partitions' and 'minimum long-term maximum age', which overstates what is proven. This should be straightforward to fix by rewording.\n\nThe modeling assumptions are also load-bearing: UGVs have unlimited energy, can charge any number of UAVs simultaneously, and can do so while moving. These are stated without justification. If charging is sequential or cannot happen in transit, Eq. (13) and the supercycle period Tc change, and the age guarantee Tc/m collapses. The paper should at least flag these as limitations or sketch how to extend the formulas. The simulation is a single scenario with no baseline comparison, so the 'minimum' is not empirically supported; a small sweep over (a1,a2) would be more convincing. The scalability claim also sits uneasily with the use of exact TSP solvers for the partition-level route.\n\nNone of this sinks the core strategy. The age bound is plausible and the construction is clean. But the paper needs revision: reframe the optimality claim, add a limitations paragraph, and ideally include one comparison. As is, I would send it to peer review with major-revision expectations; it is not a desk rejection, but it is also not ready as is. A reader working on multi-robot patrolling or mobile recharging would get value from the supercycle idea and the age decomposition.","headline":"A clean constructive strategy with a correct age bound under its assumptions, but the 'equivalence' to the general optimization problem is an overclaim that needs reframing.","tokens_in":10954,"tokens_out":4462,"would_cite":true,"duration_ms":47135,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":[],"pacs":[],"model":"deepseek-v4-flash","headline":"A partition-then-stagger strategy makes the maximum revisit time of a patrol exactly the cycle period divided by the number of teams.","keywords":["persistent surveillance","UAV-UGV teams","mobile charging stations","maximum age","partition planning","supercycle","energy constraints","Hamiltonian cycle"],"falsifier":"Simulate the proposed algorithm with two teams on a small grid where the optimal partition has a node that belongs to only one cell, and record arrival times at that node. If, after time $T_c$, the gaps between consecutive visits are not exactly $T_c/2$, or if any drone's energy reaches zero, the central claim is false. A second test: replace the unlimited simultaneous charging model with a single-drone charger and recompute (14); if the measured maximum age exceeds $T_c/m$, the assumption is load-bearing.","tokens_in":10089,"feed_emoji":"🚁","tokens_out":5052,"duration_ms":45436,"temperature":0.7,"pith_summary":"This paper proposes a scalable way to run persistent surveillance with battery-limited drones paired with ground vehicles that act as mobile charging pads. The central claim is that if the environment is cut into identical rectangular partitions and identical teams of one ground vehicle and several drones follow the same cyclic patrol route staggered in time, then after one full cycle the longest gap between consecutive visits to any point is exactly the cycle period divided by the number of teams. That converts a hard mixed trajectory-and-charging optimization into a search over partition side lengths. If true, it gives a concrete rule for sizing and scheduling mixed aerial-ground patrols with a guaranteed maximum revisit time.","feed_headline":"Max revisit gap becomes cycle period divided by team count","feed_subtitle":"Patrol a rectangle forever with battery-limited drones by partitioning it and spacing identical teams evenly in time.","key_machinery":"The supercycle: a closed sequence of partition visits in which a team's UGV carries its drones between partition centers while recharging them, and the drones cover each rectangle during one fuel cycle. The period is $T_c = |P| \\frac{\\Delta_e}{\\beta^-} + \\sum_i \\max\\left(\\frac{\\|c_{i+1} - c_i\\|}{u_G^{\\max}}, \\frac{\\Delta_e}{\\beta^+}\\right)$, and the load-bearing interval between consecutive partitions is $\\Delta t_i = \\frac{\\Delta_e}{\\beta^-} + \\max\\left(\\frac{\\|c_{i+1} - c_i\\|}{u_G^{\\max}}, \\frac{\\Delta_e}{\\beta^+}\\right)$. The deployment protocol Algorithm 4 staggers identical teams by $T_c/m$, and the Dantzig-Fulkerson-Johnson algorithm supplies both the shortest Hamiltonian cycle through partition centers and the minimum-distance visiting route within each subpartition.","core_discovery":"Proposition 3.3 states that given a supercycle of period $T_c$ over a partition set, $m$ UAV-UGV teams released $T_c/m$ apart achieve a maximum age $ar{T}(t) = T_c/m$ for all $t \\ge T_c$. The argument rests on Lemma 3.1, which ensures at least one node belongs to a single partition and is therefore visited only once per supercycle; each team visits that node once per cycle, so the staggered teams visit it every $T_c/m$. The paper also claims that minimizing $T_c$ over rectangle dimensions $(a_1, a_2)$ under the fuel constraint is equivalent to the original age-minimization problem (11), so the best rectangle size is found by enumerating partition dimensions and checking feasibility.","pith_inferences":["If UGV energy were finite or charging were limited to one drone at a time, the $T_c/m$ guarantee would degrade; a natural extension would modify the inter-partition interval to include a charging-queue term, leading to a larger effective $T_c$.","The rectangle-partition assumption could generalize to other convex cells; the same staggered-supercycle argument should transfer as long as each cell contains a node visited once per supercycle.","The claimed equivalence between minimizing $T_c$ and solving the original age-minimization problem holds only within the proposed strategy class; for non-rectangular partitions or heterogeneous teams, a different trajectory might yield a lower maximum age.","A direct empirical test is to run Algorithm 4 on a grid where charging time dominates travel time; the observed inter-visit gaps at the single-partition node should be exactly $T_c/m$ by construction, which would confirm the timing model."],"forward_implications":["Any rectangular convex environment can be patrolled indefinitely with a finite, computable maximum age, independent of environment size relative to drone range, as long as each partition rectangle fits within one fuel cycle.","Adding more teams (larger $m$) linearly reduces the guaranteed maximum age from $T_c$ to $T_c/m$, without changing the per-team partition size.","The planning problem reduces to enumerating rectangle dimensions $(a_1, a_2)$ and running a feasibility check, so the method scales to large grids in practice.","Identical teams are interchangeable: the same supercycle can be reused by any number of teams, with only the time offset changing.","The age guarantee holds exactly after one supercycle period $T_c$, providing a clear bound on the transient time before the steady-state maximum age is reached."],"supporting_citations":[{"why":"Supplies the DFJ algorithm used to compute the minimum-distance Hamiltonian cycle through partition centers and the shortest visiting route within each subpartition.","marker":"(Dantzig et al., 1954)"},{"why":"Prior work on recharging persistent-task robots with mobile chargers; the paper's problem formulation directly extends this line of work.","marker":"(Mathew et al., 2015)"},{"why":"Frames UAV routing with mobile recharging stations as a generalized TSP, providing a comparison point for the proposed partitioning-and-supercycle approach.","marker":"(Yu et al., 2018)"},{"why":"Establishes cyclic-path patrol with uniform visit frequency, the conceptual basis for the supercycle construction.","marker":"(Elmaliach et al., 2009)"},{"why":"Introduced maximum-age minimization for persistent surveillance, which is the objective Problem 1 restates.","marker":"(Nigam and Kroo, 2008)"},{"why":"Motivates the claim that optimal cooperative patrolling is computationally hard, justifying the scalable heuristic strategy.","marker":"(Pasqualetti et al., 2010)"}],"fun_headline_variants":["Patrol forever: age drops to T_c/m","Stagger m teams, age equals cycle over m","Max age becomes T_c/m with m teams","Divide the cycle, age shrinks to T_c/m","Supercycle split: age = T_c/m"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The ground vehicles are assumed to have unlimited energy and to be able to charge any number of drones at once, even while driving; if charging is single-drone or the UGV itself runs out of fuel, the cycle timing and the $T_c/m$ age guarantee break.","fun_headline_variants_meta":{"raw":{"variants":["Patrol forever: age drops to T_c/m","Stagger m teams, age equals cycle over m","Max age becomes T_c/m with m teams","Divide the cycle, age shrinks to T_c/m","Supercycle split: age = T_c/m"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.00022,"raw_usage":{"total_tokens":1406,"prompt_tokens":867,"completion_tokens":539,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":483,"completion_tokens_details":{"reasoning_tokens":464}},"tokens_in":483,"tokens_out":539,"duration_ms":5685,"temperature":1.0,"reasoning_tokens":464,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-14T13:06:37.201898+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Simulate the proposed algorithm with two teams on a small grid where the optimal partition has a node that belongs to only one cell, and record arrival times at that node. If, after time $T_c$, the gaps between consecutive visits are not exactly $T_c/2$, or if any drone's energy reaches zero, the central claim is false. A second test: replace the unlimited simultaneous charging model with a single-drone charger and recompute (14); if the measured maximum age exceeds $T_c/m$, the assumption is load-bearing.","supporting_citations":[{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Supplies the DFJ algorithm used to compute the minimum-distance Hamiltonian cycle through partition centers and the shortest visiting route within each subpartition."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Prior work on recharging persistent-task robots with mobile chargers; the paper's problem formulation directly extends this line of work."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Establishes cyclic-path patrol with uniform visit frequency, the conceptual basis for the supercycle construction."},{"cited_title":"and Kroo, I","cited_arxiv_id":null,"evidence_quote":"Introduced maximum-age minimization for persistent surveillance, which is the objective Problem 1 restates."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Motivates the claim that optimal cooperative patrolling is computationally hard, justifying the scalable heuristic strategy."}],"review_version":1}