{"id":"e34b8dc6-8aeb-4e0d-8053-7b5c51faee4b","arxiv_id":"2411.16608","paper_version":2,"verdict":"REJECT","confidence":"LOW","novelty_score":4.0,"correctness_risk":"high","formal_verification":"none","parameter_count":5,"one_line_summary":"An edge-based hybrid control architecture using time-varying control barrier functions is proposed for safe coordination of aerial-ground robot teams, including drone landing on moving ground robots.","lead":"This paper proposes a control architecture for teams of drones and ground robots, where drones can land on moving ground robots while avoiding collisions. A central edge computer selects which safety rules each robot must follow, aiming to reduce onboard computing and communication.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"UGV safety is enforced on a NID offset point while AGO constraints are defined on the UGV origin; the paper gives no bound on o_i and no proof that offset-space CBFs imply origin-space safety, and the QP gradient for AGO cannot be computed from the offset state alone.","rationale":"The reader's weakest assumption correctly identifies the NID offset as a source of unproven safety guarantees. My stress-test sharpens this into a concrete internal inconsistency: the paper switches between two different representations of the UGV, using the offset point for GG and box constraints but the origin for AGO constraints. Since the QP (15) is explicitly a first-order filter with A=∂h/∂x, the AGO constraint cannot be encoded unless the full state (ρ_o,θ) is used, but the paper never does this. This is not merely a missing proof or a missing o_i bound; it is a mismatch between the model used for control synthesis and the model in which safety constraints are stated. The paper itself also declares in Section V that validation and theoretical evaluation are deferred to an extended version, which is an explicit admission that the central claims are currently unsupported. My concern reinforces the REJECT verdict without moving it, so the recommended outcome is unchanged. Credit is given for the clear problem formulation and the plausible edge-computing architecture, but the safety-critical control core is not established. The concrete test above would settle whether the QP formulation is internally valid and whether offset-space forward invariance can be translated to physical-body safety; until then, the architecture cannot be considered safe as claimed.","tokens_in":8759,"tokens_out":8254,"duration_ms":78251,"concrete_test":"Redo the UGV CBF derivation in §IV from the full unicycle state x=(ρ_g,θ), with input (v,ω), using Eq. (8) to express ρ_o. Check whether h_ag = |p_a - ρ_g|^2 - s_ag^2 and h_gg = |ρ_oi - ρ_oj|^2 - s_g^2 satisfy Definition 1 with the velocity bounds in Assumption 2, and compute the resulting A,b in Eq. (15). If h_ag's derivative contains θ̇ = ω, no first-order A,b of the form ∂h/∂ρ_o exists, and the implementation in §IV-D is invalid. Independently, simulate two UGVs with o_j = 0.1 m, s_g = 0.5 m, v=1 m/s, ω=2 rad/s in a head-on pass and record min |ρ_gi - ρ_gj|; if it is below s_g while |ρ_oi - ρ_oj| stays above s_g, the offset CBF does not enforce Eq. (5).","verdict_should_be":"UNCHANGED","load_bearing_attack":"Section III-B replaces the unicycle with an offset point ρ_oi = ρ_gi + o_i(cosθ_i, sinθ_i)^T (Eq. 8) and filters a single-integrator input u_gi = dot ρ_oi through the QP (15). However, the ground-ground and box CBFs in Eq. (11)/(14) are defined on ρ_oi, while the aerial-ground (AGO) constraint in Eq. (4)/(11) is defined on the actual origin ρ_gj. For UGV j, enforcing h_agj = |p_ai - ρ_gj|^2 - s_ag^2 requires ∂h/∂ρ_oj, which depends on θ_j through ρ_gj = ρ_oj - o_j(cosθ_j, sinθ_j)^T and on the relation between dot ρ_oj and dot ρ_gj, dot θ_j. The paper's first-order QP uses f=0, g=I and A=∂h/∂x, but x for the UGV is never defined; if x=ρ_oi, the AGO h is not a function of x alone, so the constraint matrix cannot be formed as stated. Moreover, even for the GG/box constraints that are functions of ρ_oi, forward invariance of the offset-point safe set does not imply the physical UGV body (a set around ρ_gi) avoids collisions; the text merely says 'choosing a sufficiently small o_i' without a bound. Assumption 2 bounds velocities but not the resulting curvature, so the origin can swing outside the offset-safe set. The safety claim for ground and aerial-ground interactions is therefore not established by the given equations.","agreement_with_reader":"partial"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper proposes a hybrid centralized-distributed control architecture for safe coordination of UAV-UGV pairs in a confined space. Safety is enforced through time-varying Control Barrier Functions (CBFs) for aerial-aerial, ground-ground, aerial-ground obstacle, and landing constraints, while a centralized edge-based \"Watcher\" node selects the relevant constraints for each agent to reduce communication and onboard computation. The paper provides the problem formulation, the CBF candidate functions, the quadratic-program safety filter, and a discussion of the edge architecture, but it does not include simulations, experiments, or proofs of the main safety claims.","tokens_in":9104,"tokens_out":3947,"duration_ms":39057,"significance":"If the safety and scalability claims were fully established, the architecture could be a useful step toward practical multi-agent aerial-ground coordination: the use of first-order CBF filters with an edge-based constraint-selection layer is a reasonable way to balance onboard and centralized computation, and the near-identity diffeomorphism approach for unicycle UGVs is a known technique with practical appeal. However, the current manuscript does not validate the central claims. There are no experimental or simulation results, no explicit proofs that the proposed functions are valid time-varying CBFs, and no quantitative analysis of the scalability benefits. The paper is best viewed as a preliminary architecture description rather than a complete journal contribution in its present form.","major_comments":[{"comment":"The paper explicitly states: \"The validation of the proposed controller and theoretical evaluation will be included in the extended version.\" This is a load-bearing omission: the primary claims of safe and scalable deployment are not supported by any simulation, experiment, or proof in the submitted manuscript. The paper must either include the validation and theoretical evaluation, or be reframed as a preliminary architecture paper with correspondingly reduced claims.","section":"Section V"},{"comment":"The UGV safety filter is implemented in the offset space rho_oi, but the aerial-ground obstacle (AGO) constraint in Eq. (4) and Eq. (11) is defined on the actual UGV origin rho_gj. For a UGV j, h_agj depends on rho_gj = rho_oj - o_j(cos(theta_j), sin(theta_j))^T, which is not a function of the offset state x = rho_oi alone. The QP in Eq. (15) is stated with A = dh/dx and f=0, g=I, but the state x for the UGV is never defined. If x = rho_oi, the AGO constraint matrix cannot be formed as written; if x includes theta_j, the first-order dynamics are more complex than the stated single-integrator form. The paper needs to redefine the AGO constraint consistently in offset coordinates and prove equivalence, or derive the correct augmented-state gradients for the QP.","section":"Section III-B and Eq. (8)-(9)"},{"comment":"The claim that \"choosing a sufficiently small o_i\" lets the same constraints be used in the offset space is not quantified. Forward invariance of a safe set for the offset point rho_oi does not imply that the physical UGV body (which contains the origin rho_gi) avoids collisions, because the origin can swing around the offset point during rotation. Assumption 2 bounds velocities but not the resulting curvature or heading rate, so the origin can leave a neighborhood of the offset point. To support the ground-ground and aerial-ground safety claims, the paper must provide an explicit bound on o_i and a proof that the original non-holonomic dynamics preserve the safe set for the physical UGV body.","section":"Section III-B"},{"comment":"The paper repeatedly states that candidate functions \"can be shown\" to be valid time-varying CBFs (e.g., Eq. (11), Eq. (12), and the box constraints in Eq. (14)), but no class-K_infinity function xi is provided and no verification of condition (10) is carried out for any constraint. This is especially important for the landing CBF h_lii with the moving target (Eq. (12)), whose partial derivative dh/dt in Eq. (13) depends on the UGV velocity; the paper does not show that the resulting inequality is satisfiable for all admissible control magnitudes. Additionally, the QP (15) may have multiple simultaneously active constraints, and the paper does not address feasibility of the bounded control set when several constraints are active. These gaps directly affect the safety guarantee.","section":"Section IV-A, IV-B, IV-D"}],"minor_comments":[{"comment":"The time interval in Definition 1 is written as [0, infinity], but it should be [0, infinity) since infinity is not an element of the time domain.","section":"Definition 1"},{"comment":"The notation for safety radii in Assumption 1 (s_g > s_ag > s_a) is clear, but the physical rationale is stated only in Remark 1. It would help to state the rationale directly in Assumption 1 or immediately after Eq. (5).","section":"Section II-C"},{"comment":"The lower altitude bound for the UAV is said to be redundant because the AGC constraint (12) keeps the UAV above the landing platform, but this is only active during landing. If the UAV is not in a landing phase, the lower altitude limit may still be needed; the paper should clarify when AGC is active.","section":"Section IV-C"},{"comment":"The phrase \"Provided the UAVs and UGVs initiate with a distance between them larger than their respective safety radii, they do not get closer...\" is an assertion, not a proof. Since forward invariance is the central safety mechanism, this statement should be backed by the explicit CBF verification requested in the major comments.","section":"Section IV-A"}],"recommendation":"major_revision","confidential_remarks":"The manuscript reads as a preliminary draft; the explicit deferral of all validation and theoretical evaluation to an \"extended version\" is unusual for a journal submission and may indicate that the authors intend a longer archival paper later. If the journal does not accept preliminary reports, a reject decision may be more appropriate than major revision. The NID/AGO inconsistency in Section III-B is a substantive technical issue that will require careful reworking, not just added text."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Colleague,\n\nThe paper is a genuinely preliminary draft. What's new: a Watcher-based edge architecture that selects relevant CBF constraints per agent, and a time-varying landing CBF for UAVs landing on moving UGVs. The landing CBF in Eq. (12) extends the authors' earlier static-target work in a real way, and the star-topology scalability argument is sensible. Those pieces are worth reading.\n\nThe soft spots are large. The paper explicitly states in Section V that validation and theoretical evaluation will be in the extended version, so the central claims of safety and scalability are asserted, not shown. There are no proofs for CBF validity, no feasibility analysis of the QP, no simulations, no experiments. That alone is enough to reject at most venues.\n\nThe stress-test note lands. The NID diffeomorphism maps the unicycle to a single integrator on an offset point, and the GG and box constraints are defined on that offset state. But the AGO constraint in Eq. (4)/(11) is defined on the actual UGV origin. The QP in Eq. (15) uses x as the offset state, so the AGO gradient cannot be formed without heading information that isn't part of that state. Even for the constraints that are defined on the offset point, forward invariance of the offset safe set does not imply the physical UGV body is safe. The text says \"choosing a sufficiently small o_i\" but gives no bound, and Assumption 2 doesn't bound curvature, so the origin can swing outside the offset-safe set. This is a load-bearing gap for the UGV safety claims.\n\nThe architecture idea is plausible, but the paper as submitted doesn't support its contributions. I'd treat this as a workshop-level extended abstract. The authors need to add the deferred theory with a proper bound on o_i, clarify the AGO state definition, and run at least a simulation. If an editor is strict, desk reject; if the venue allows resubmission after major revision, that's the path.\n\nI would not send this to full peer review in its current form. The idea is worth following, but the manuscript is not ready.","headline":"A plausible edge-computing CBF architecture with a real gap in the NID-based UGV safety argument, and no validation yet; not ready for peer review.","tokens_in":9693,"tokens_out":2014,"would_cite":false,"duration_ms":18865,"reading_group":"yes","serious_thinker":"yes","would_accept_peer_review":false},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":[],"pacs":[],"model":"deepseek-v4-flash","headline":"This paper proposes an edge-computing architecture that uses time-varying control barrier functions to keep UAV-UGV teams safe, including landings on moving ground robots.","keywords":["control barrier functions","multi-agent coordination","aerial-ground robots","edge computing","safe landing","quadratic programming","nonholonomic robots","scalable control"],"falsifier":"Run two UGVs under the proposed controller for a chosen offset $o_i$ and record the minimum distance between their actual bodies; if it ever falls below the safety radius $s_g$ while all offset-point CBF constraints are satisfied, the near-identity equivalence claim would be refuted.","tokens_in":46,"feed_emoji":"🛸","tokens_out":7505,"duration_ms":122333,"temperature":0.7,"pith_summary":"The paper proposes a control architecture that lets teams of aerial and ground robots operate together safely, including the hard case where each UAV lands on its own ground robot while the ground robot keeps moving. The safety constraints—collision avoidance between any two agents, landing clearance above the moving platform, and staying inside a task-space box—are encoded as time-varying Control Barrier Functions (CBFs) and enforced by a small quadratic program running onboard each robot. To keep coordination scalable, a centralized edge node called the Watcher picks out only the constraints that matter for each agent at each moment, so the number of communication links grows linearly with fleet size rather than quadratically. The paper presents the architecture and the CBF constructions; it states explicitly that experimental validation and a full theoretical evaluation are deferred to an extended version.","feed_headline":"Scaling safe UAV-UGV landings with an edge-side CBF watcher","feed_subtitle":"A Watcher on the edge sends each robot only the safety constraints it needs, keeping filters light.","key_machinery":"The load-bearing object is the time-varying Control Barrier Function (CBF), a function $h(x,t)$ whose superlevel set is kept forward invariant by the control input. Three families are used: spherical and circular CBFs such as $h_{aij} = r_{aij}^2 - s_a^2$ for collision avoidance, the landing CBF $h_{lii}$ of Eq. (12), which is time-varying because the UGV position moves, and box CBFs for the workspace boundary. The paper also relies on a near-identity diffeomorphism (Eq. (8)) that turns the nonholonomic unicycle model into a single-integrator on an offset point $\\rho_{oi}$, so the same first-order CBF machinery applies to ground robots. All constraints are assembled by the Watcher node into matrices $(A_{ki}, b_{ki})$ and solved as a quadratic program (15) onboard each agent.","core_discovery":"The central claim is that safe, scalable coupled aerial-ground multi-robot operation can be achieved by pairing time-varying CBFs with a hybrid edge-computing topology. For landing, the paper introduces the time-varying landing CBF $h_{lii} = r_{zi} - \\beta \\alpha l_i \\exp(-\\alpha l_i) - \\gamma$, where $l_i$ is the squared horizontal distance between a UAV and its UGV; this creates a downward funnel above the moving landing platform so the UAV is kept above the platform while descending, and forward invariance of the safe set guarantees it never violates the clearance constraint. Collision avoidance between UAVs, between UGVs, and between UAVs and other UGVs is handled by spherical or circular CBFs in relative-distance variables, while box CBFs keep every agent inside the task space. Scalability comes from the centralized Watcher node on an edge cluster, which computes the set of proximal agents for each robot and transmits only the relevant constraint matrices; each robot then runs its own CBF quadratic-program filter locally, so the per-agent computation and the number of communication links remain modest. The paper claims the star topology uses $2N$ links instead of $2N(2N-1)$ for fully connected designs.","pith_inferences":["The paper does not derive a bound on the offset distance $o_i$ in the near-identity diffeomorphism; a natural next step is to find how small $o_i$ must be for the original unicycle body to inherit the same safety radius, closing the gap between the offset-point guarantee and the actual robot.","The Watcher node is still a single point of failure for constraint selection; one could test whether redundant Watcher replicas or a gossip protocol among agents preserve the safety guarantees under node loss.","The landing CBF could be extended to platforms with uncertain or nonzero vertical motion, or to multi-UAV landings on a shared platform, by adding a disturbance term to the time-derivative condition.","Since the paper states that experimental validation is deferred, a concrete falsifiable check is to run the proposed controller with the Watcher on a small physical fleet and record whether pairwise distances between UAVs, UGVs, and UAV-UGV pairs stay above their respective safety radii throughout landing."],"forward_implications":["If the architecture works as claimed, a fleet of $N$ UAV-UGV pairs needs only $2N$ communication links instead of $2N(2N-1)$, so adding agents does not blow up connectivity.","The time-varying landing CBF gives a forward-invariance guarantee that a UAV remains in a safe funnel above its moving landing platform throughout descent, provided the system starts inside the safe set.","Distributed local QP filters mean each robot only needs its own state, its goal setpoint, and the constraint matrices from the Watcher, so onboard processing stays low even as fleet size grows.","Because constraints are selected by proximity, agents far apart do not impose constraints on each other, which reduces both computation and conservatism in the CBF filter."],"supporting_citations":[{"why":"Supplies the definition of control barrier functions and the forward-invariance condition that the safety filter enforces.","marker":"[3]"},{"why":"Surveys practical challenges in CBF-based safe control and justifies using CBF filters for robotic systems.","marker":"[4]"},{"why":"Provides the original descending clearance constraint that Eq. (6) generalizes to a moving landing target.","marker":"[18]"},{"why":"One of the two sources for the near-identity diffeomorphism that converts the unicycle UGV into a single-integrator at an offset point.","marker":"[20]"},{"why":"Gives the near-identity diffeomorphism equations used to recover the UGV's wheel and angular velocities from the filtered single-integrator input.","marker":"[21]"},{"why":"Makes the case for edge computing architectures in robotics, motivating offloading localization and constraint selection to an edge cluster.","marker":"[17]"},{"why":"Provides a prior centralized-on-edge model predictive control architecture that the proposed hybrid design extends.","marker":"[15]"}],"fun_headline_variants":["Edge watcher hands out only the safety rules each robot needs","Star-shaped edge topology slashes communication links for safe drone-UGV teams","Hybrid edge CBFs keep UAV-UGV landing safe and scalable","Watcher on the edge trims CBF constraints for safe multi-robot ops","Edge-chosen safety constraints enable larger UAV-UGV teams"],"cache_read_input_tokens":11648,"weakest_assumption_plain":"The ground-robot safety guarantees rest on the assumption that steering an offset point on the unicycle through the CBF constraints keeps the actual nonholonomic body safe, but the paper gives no bound on how small the offset must be.","fun_headline_variants_meta":{"raw":{"variants":["Edge watcher hands out only the safety rules each robot needs","Star-shaped edge topology slashes communication links for safe drone-UGV teams","Hybrid edge CBFs keep UAV-UGV landing safe and scalable","Watcher on the edge trims CBF constraints for safe multi-robot ops","Edge-chosen safety constraints enable larger UAV-UGV teams"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000787,"raw_usage":{"total_tokens":3511,"prompt_tokens":1023,"completion_tokens":2488,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":639,"completion_tokens_details":{"reasoning_tokens":2392}},"tokens_in":639,"tokens_out":2488,"duration_ms":18694,"temperature":1.0,"reasoning_tokens":2392,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-12T12:55:19.101395+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Run two UGVs under the proposed controller for a chosen offset $o_i$ and record the minimum distance between their actual bodies; if it ever falls below the safety radius $s_g$ while all offset-point CBF constraints are satisfied, the near-identity equivalence claim would be refuted.","supporting_citations":[{"cited_title":"Advances in the theory of control barrier functions: Addressing practical challenges in safe control synthesis for autonomous and robotic systems,","cited_arxiv_id":null,"evidence_quote":"Surveys practical challenges in CBF-based safe control and justifies using CBF filters for robotic systems."},{"cited_title":"A cbf-adaptive control architecture for visual navigation for uav in the presence of uncertainties,","cited_arxiv_id":null,"evidence_quote":"Provides the original descending clearance constraint that Eq. (6) generalizes to a moving landing target."},{"cited_title":"The robotarium: Globally impactful opportunities, challenges, and lessons learned in remote-access, distributed control of multirobot systems,","cited_arxiv_id":null,"evidence_quote":"One of the two sources for the near-identity diffeomorphism that converts the unicycle UGV into a single-integrator at an offset point."},{"cited_title":"Near-identity diffeomorphisms and exponential/spl epsi/-tracking and/spl epsi/-stabilization of first-order nonholonomic se (2) vehicles,","cited_arxiv_id":null,"evidence_quote":"Gives the near-identity diffeomorphism equations used to recover the UGV's wheel and angular velocities from the filtered single-integrator input."},{"cited_title":"E-cnmpc: Edge-based centralized nonlinear model predictive control for multiagent robotic systems,","cited_arxiv_id":null,"evidence_quote":"Provides a prior centralized-on-edge model predictive control architecture that the proposed hybrid design extends."}],"review_version":1}