{"id":"294b0107-8f18-415b-aa2b-10521d350ff3","arxiv_id":"2501.09198","paper_version":1,"verdict":"CONDITIONAL","confidence":"HIGH","novelty_score":4.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":5,"one_line_summary":"A modular DMP framework mixes discrete and rhythmic movement primitives in parallel or sequence, preserving independent scaling and rotation of each movement.","lead":"This paper combines discrete and rhythmic movement primitives for robot motion planning by adding their signals together and using contraction theory to argue the combined system stays stable. It lets a programmer mix separate motions, like a point-to-point poke and a periodic polish, and scale each one independently.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Sequential combination (Eq. 23) is asserted stable by citing II-B.3, but that theorem does not cover a time-varying weighted sum of different primitive inputs; the central stability proof for sequences is missing.","rationale":"The reader's weakest_assumption identifies exactly the sequential-combination stability proof. My read agrees: Eq. (23) is the least-secure step in the central claim, and the citation to II-B.3 is inapplicable. The concern is not that the method is necessarily wrong—the transformation system is a stable linear filter, so bounded inputs give bounded outputs—but that the paper's stated proof does not establish the advertised stability for sequences, and the time-varying weights introduce switching transients that are neither bounded nor analyzed. This is repairable, e.g., by proving the parallel theorem applies with normalized weights or by providing a dedicated contraction analysis, so a conditional acceptance remains appropriate. I would not reject the paper; the simulations and reproducible parameters give some support, but the proof gap should be closed before publication.","tokens_in":12999,"tokens_out":13191,"duration_ms":147555,"concrete_test":"Formally test whether Eq. (23) satisfies the hypotheses of either modular theorem in Section II-B.1 or II-B.3 by writing the closed-loop system with a common state x and metric M, requiring Σ_i α_i(t)=1. Because the discrete and rhythmic canonical systems have different state dimensions (Eq. (9) vs. Eq. (10)), no such common-state reduction exists; if the authors cannot exhibit one, the cited contraction proof does not cover the sequential combination. As a numerical cross-check, simulate the Figure 3 sequences with the provided code and with normalized weights Σ α_i=1; if the outputs differ materially, the missing sum-to-one condition is a genuine correctness issue.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The paper's central claim includes a stable sequential combination of discrete and rhythmic DMPs. The only support offered is Eq. (23) together with a citation to Section II-B.3. However, Eq. (8) (II-B.3) is a partial-contraction result for two identical systems coupled one-way through u(x1)-u(x2), requiring f-u to be contracting; it is not a theorem about a single transformation system driven by Σ α_i(t) p_i(x_i(t-t_{i,off})). Equation (23) is actually a parallel combination with time-varying weights, and the parallel theorem in Eq. (6) needs identical dimensions, a common contraction metric, and (in Remark 1) Σ α_i=1. The paper does not state or verify any of these for Eq. (23); the discrete and rhythmic canonical systems (Eq. (9) vs. Eq. (10)) have different dimensions, and the smoothstep weights in Eq. (24) are not guaranteed to sum to 1 during overlaps. Moreover, because Eq. (21) is linear, the output is not equal to Σ α_i(t)y_i(t-t_{i,off}): switching transients proportional to α_i' y_i' and α_i'' y_i appear. No bound on these transients or convergence-to-the-intended-primitive proof is supplied. Abstract and contributions explicitly promise stability for the sequential method, so this unproven step is load-bearing.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper presents a modular motion-planning framework that combines discrete and rhythmic Dynamic Movement Primitives (DMPs) using contraction theory. The authors define a movement primitive input, show how parallel combinations can be formed by weighted sums of primitive inputs, and propose sequential combinations via time-varying weights with smoothstep activations. They claim stability for both combination modes by invoking contraction-theoretic results, and they illustrate the approach with simulations of letter-like and circular trajectories. The central contribution is the claimed ability to compose discrete and rhythmic primitives while preserving independent spatial, temporal, and rotational modulation, with stability guarantees.","tokens_in":13299,"tokens_out":4202,"duration_ms":45761,"significance":"If the stability claims were fully established, the framework would be a useful practical contribution: it offers a modular, divide-and-conquer approach to motion planning, preserves the invariance properties of DMPs, and includes simulation code on GitHub. The parallel-combination analysis is consistent with a linear-filter view of the transformation system, and the examples are illustrative. However, the sequential-combination stability proof is currently missing or mis-cited, and that gap is load-bearing for the abstract's promise that 'Stability is proven by Contraction Theory.' The contribution is therefore significant but conditional on a rigorous proof or a suitably weakened claim.","major_comments":[{"comment":"The stability of the sequential combination is asserted by referring to Section II-B.3, but the theorem in Eq. (8) is a partial-contraction result for two identical systems coupled one-way through u(x1)-u(x2), and it requires f-u to be contracting. Equation (23), by contrast, is a single transformation system driven by a time-varying weighted sum of different primitive inputs, which is structurally a parallel combination with time-dependent weights rather than a one-way coupling. The paper does not verify the hypotheses needed for the parallel theorem (a common contraction metric, and in Remark 1 the condition that the weights sum to one), nor does it provide a separate proof for Eq. (23). Since the smoothstep activation in Eq. (24) does not guarantee that the weights sum to one during overlaps, the cited theorem does not cover the sequential method as stated.","section":"Section IV-B.2, Eq. (23)"},{"comment":"Because the transformation system in Eq. (21) is linear, its output is a filtered version of the input; it is not equal to the weighted sum of the individual primitive outputs, y(t) = sum_i alpha_i(t) y_i(t - t_off), even when each primitive individually tracks its demonstration. Switching between primitives with time-varying weights introduces transients that depend on derivatives of alpha_i, and the paper supplies no bound on these transients and no proof that the trajectory converges to the intended primitive during each active interval. The simulations in Figure 3 demonstrate particular parameter choices, but they do not establish the general stability or convergence property promised in the abstract and contributions.","section":"Section IV-B.2 and Eq. (21)"},{"comment":"The parallel-combination theorem in Section II-B.1 (Remark 1) requires the weights to satisfy alpha_i(t) >= 0 and sum_i alpha_i(t) = 1. Equation (22) is written for arbitrary nonnegative alpha_1, alpha_2, and the examples use the specific choice alpha_2 = 1 - alpha_1 without stating that this sum-to-one condition is part of the method. If arbitrary weights are allowed, the stability guarantee does not follow from the cited theorem; if the weights must sum to one, that constraint should be stated explicitly because it has implications for the claimed independent modulation of each primitive.","section":"Section IV-B.1, Eq. (22)"}],"minor_comments":[{"comment":"The orthogonality condition is written as 'delta x^T M_T(x) f(x)' without the required equality to zero; it should be 'delta x^T M_T(x) f(x) = 0'.","section":"Section II-A.2, Eq. (3)"},{"comment":"There is an inconsistency in the definition of the phase variable: the text defines s_r(t) = arctan(x_2/x_1), while Remark 3 states theta = arctan(x_1/x_2). Please correct the typo in Remark 3.","section":"Section III-A.2 and Remark 3"},{"comment":"The notation s_r^(d)(t) is used for the demonstration phase, but s_r is also the canonical phase variable of the rhythmic system; please distinguish these or add a clarifying sentence.","section":"Section III-D.2, Eq. (18)"},{"comment":"The activation function alpha_i(t) in Eq. (24) uses the same parameters t_1, t_2, t_3, t_4 for every primitive i, but Eq. (23) gives each primitive its own time offset; please clarify that these parameters are per-primitive and chosen by the user, and state the constraints needed to ensure the intended smooth transition.","section":"Section IV-B.2, Eq. (24)"}],"recommendation":"major_revision","confidential_remarks":"The paper's parallel-combination results and simulations are plausible, but the missing proof for the sequential combination is a central gap. I would encourage the authors to either provide a rigorous stability proof for Eq. (23) under explicit conditions on the weights and overlap durations, or revise the contribution claims to reflect only the parallel combination guarantee. The manuscript is otherwise clearly written and the code availability is a plus."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Colleague,\n\nHere's the short version: this paper gives a clean way to combine discrete and rhythmic DMPs by linearly combining their primitive inputs, with independent spatial/temporal scaling and rotation. The parallel combination is sound and the simulations support the claim. The sequential combination has a proof gap: the cited partial-contraction theorem (II-B.3) is about synchronization of two identical systems, not a time-varying weighted sum of different primitives. The gap looks fixable — the transformation system is linear contracting, and the canonical systems are contracting/transverse contracting, so a hierarchical-contraction argument should work — but as written the paper doesn't supply that proof.\n\nWhat's new: the definition of a movement primitive input p(x) = F(s) + α_z β_z g_d, which lets you add primitives at the input level. Prior combined systems learn a single dynamical system and don't allow independent modulation. This paper's recursive parallel combination is a natural but useful contribution, and the examples show the flexibility.\n\nWhat the paper does well: it's clearly written, the contraction machinery is used properly for the parallel case, the code is available, and the authors are honest about the common-metric restriction and the linear superposition nature. The simulation figures are adequate for a methods paper, though there's no quantitative evaluation — that's not a fatal omission at this stage.\n\nSoft spots: the sequential combination proof is the main one. The stress-test note is right: Eq. (23) is not covered by Section II-B.3. The authors need to either recast it as a hierarchical combination (which should work) or prove the weighted-superposition case directly. Also, the weights in Eq. (24) don't necessarily sum to 1, and the paper doesn't discuss the effect of that on the contraction argument. Minor point: the claim in the abstract that 'stability is proven' overreaches the actual proof for the sequential case.\n\nWho this is for: researchers working on DMPs or modular movement primitives, especially those who want to mix discrete and rhythmic primitives in one framework. It deserves a serious referee; the proof gap is fixable and the core idea is likely correct.\n\nRecommendation: engage with it, but ask for the sequential stability proof to be repaired before acceptance.","headline":"A clean modular extension of DMPs with a sound parallel combination; the sequential combination proof cites the wrong theorem but looks fixable.","tokens_in":13811,"tokens_out":3594,"would_cite":true,"duration_ms":33067,"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":"This paper establishes that discrete and rhythmic movement primitives can be combined in parallel and in sequence with stability guaranteed by contraction theory, while each movement remains independently scalable in space and time.","keywords":["movement primitives","dynamic movement primitives","contraction theory","transverse contraction","limit cycle","robot motion planning","modular stability","discrete and rhythmic movement"],"falsifier":"Run the sequential combination of two discrete DMPs with different goal positions, using the smooth activation function of Eq. (24) with a fast switch (e.g., transition time much shorter than the transformation system's time constant); if the output trajectory overshoots, fails to converge to the second goal, or leaves a bounded region, then the claimed stability of Eq. (23) is refuted. A simpler falsifier: check whether the conditions of the one-way coupling theorem (Section II-B.3) are satisfied by Eq. (23); they are not, since the systems are not identical and the coupling is not $u(x_1)-u(x_2)$.","tokens_in":12801,"feed_emoji":"🤖","tokens_out":6395,"duration_ms":58578,"temperature":0.7,"pith_summary":"The paper sets out to make movement primitives—modular dynamical-system building blocks for robot trajectories—combinable in the same way functions are composed, so that a programmer can mix discrete point-to-point motions with rhythmic cyclic motions without re-learning a trajectory from scratch. Its central claim is that contraction theory supplies the stability guarantee that Lyapunov-based DMP methods cannot, because those forbid limit cycles. If the claim holds, complex robot tasks such as polishing or peg-in-hole assembly can be built as parallel or sequential combinations of simpler primitives, with each primitive scaled, rotated, or timed independently. The authors prove the parallel combination by closure of contraction under convex weighting, and the rhythmic case by treating limit-cycle attractors as transverse-contracting systems.","feed_headline":"Blend and sequence robot movements with proven stability","feed_subtitle":"A modular DMP approach mixes discrete and rhythmic primitives while preserving independent scaling and rotation.","key_machinery":"Contraction theory, a differential stability analysis: a nonlinear system is contracting if all neighboring trajectories converge exponentially in a suitable metric, and this property is preserved under parallel (convex-weighted) combination, hierarchical coupling, and one-way coupling. Rhythmic primitives are modeled as transverse-contracting systems around a stable limit cycle, so the Andronov–Hopf oscillator's phase serves as a canonical 'clock' while its amplitude is exponentially forgotten. The load-bearing identity is the parallel-combination closure: if each primitive makes the same transformation system contract with the same metric, then the weighted sum of primitive inputs contracts with a rate that is the same convex combination of the individual rates.","core_discovery":"The paper's contribution is a definition of a movement primitive input $p(x) = F(s(t)) + \\alpha_z \\beta_z g^{(d)}$ that, when fed into a contracting second-order transformation system, reproduces a demonstrated trajectory. Because the transformation system is contracting and the forcing terms for discrete and rhythmic movements are, respectively, contracting and transverse-contracting, any parallel combination of primitive inputs—a convex combination $\\alpha_1 p_1(x_1) + \\alpha_2 p_2(x_2)$—remains contracting under the same metric, giving an exponential convergence guarantee for the blended trajectory. The paper further claims that sequential combination, achieved by time-varying weights with time offsets, is stable by reference to a one-way coupling theorem for contracting systems. This extends dynamic movement primitives to rhythmic movements with stability guarantees, preserving spatial scaling, temporal scaling, and rotation of each component.","pith_inferences":["Beyond the paper: the sequential-combination stability proof is the fragile link—Eq. (23) uses time-varying weights over different primitives, whereas the cited theorem concerns one-way coupling of two identical systems; verifying, or repairing, this step is a natural next problem.","Beyond the paper: the same convex-weighting closure should extend to other primitive families (e.g., orientation DMPs on SO(3)) as long as they share a contraction metric, which would generalize the framework to manifolds.","Beyond the paper: the framework's reactive obstacle-avoidance claim suggests a concrete test: add a repulsive coupling term to a rhythmic parallel combination in simulation and measure whether the limit cycle's transverse contraction rate is preserved.","Beyond the paper: because the weights $\\alpha_i(t)$ are user-defined, one could adapt them online via sensory feedback (e.g., switching rhythmic gaits) and still retain stability if the switching is slow relative to the contraction rate—a testable extension not stated in the paper."],"forward_implications":["A programmer can independently scale, rotate, or time-shift each primitive in a combination without destabilizing the overall motion.","Rhythmic movements (limit cycles) can now be included in DMP-based planning with exponential stability guarantees, which Lyapunov-based DMP methods exclude.","Sequential combination of discrete and rhythmic primitives enables composed tasks such as reach-then-polish or peg-in-hole sequences with smooth transitions.","Obstacle-avoidance coupling terms and temporal coupling to the canonical system can be added reactively while preserving contraction-based stability.","The divide-and-conquer programming strategy lets a complex motion be built by reusing and refining existing primitives rather than re-learning from demonstration."],"supporting_citations":[{"why":"Supplies the contraction-theory definitions and the parallel-combination closure theorem used to prove stability of blended primitives.","marker":"[31]"},{"why":"States the parallel combination of movement primitives under a shared contraction metric, the key modularity property the paper exploits.","marker":"[32]"},{"why":"The one-way coupling theorem invoked to justify the sequential combination in Eq. (23).","marker":"[40]"},{"why":"Gives the transverse contraction criterion that justifies treating the rhythmic (Andronov–Hopf) oscillator as transverse contracting.","marker":"[39]"},{"why":"The dynamic movement primitive formulation that the paper extends to rhythmic and combined movements.","marker":"[7]"},{"why":"Earlier contraction-based treatment of dynamic movement primitives that motivates the sparse, modular combination approach.","marker":"[34]"}],"fun_headline_variants":["Contracting motion primitives guarantee stable robot blends","Mix and sequence robot movements with provable stability","Stable motion blending via contraction-theoretic primitives","Discrete and rhythmic robot moves, stably combined"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The stability of the sequential combination (Eq. 23) is asserted rather than proven: the cited one-way-coupling theorem applies to a different architecture, so the claim that time-varying weighted sums of different primitives remain stable is an assumption that, if false, would break the sequential method.","fun_headline_variants_meta":{"raw":{"variants":["Contracting motion primitives guarantee stable robot blends","Mix and sequence robot movements with provable stability","Stable motion blending via contraction-theoretic primitives","Discrete and rhythmic robot moves, stably combined"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000465,"raw_usage":{"total_tokens":2242,"prompt_tokens":787,"completion_tokens":1455,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":403,"completion_tokens_details":{"reasoning_tokens":1394}},"tokens_in":403,"tokens_out":1455,"duration_ms":12265,"temperature":1.0,"reasoning_tokens":1394,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-10T20:10:48.042097+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Run the sequential combination of two discrete DMPs with different goal positions, using the smooth activation function of Eq. (24) with a fast switch (e.g., transition time much shorter than the transformation system's time constant); if the output trajectory overshoots, fails to converge to the second goal, or leaves a bounded region, then the claimed stability of Eq. (23) is refuted. A simpler falsifier: check whether the conditions of the one-way coupling theorem (Section II-B.3) are satisfied by Eq. (23); they are not, since the systems are not identical and the coupling is not $u(x_1)-u(x_2)$.","supporting_citations":[{"cited_title":"Modular stability tools for distributed computation and control,","cited_arxiv_id":null,"evidence_quote":"States the parallel combination of movement primitives under a shared contraction metric, the key modularity property the paper exploits."},{"cited_title":"On partial contraction analysis for coupled nonlinear oscillators,","cited_arxiv_id":null,"evidence_quote":"The one-way coupling theorem invoked to justify the sequential combination in Eq. (23)."},{"cited_title":"Transverse contraction criteria for existence, stability, and robustness of a limit cycle,","cited_arxiv_id":null,"evidence_quote":"Gives the transverse contraction criterion that justifies treating the rhythmic (Andronov–Hopf) oscillator as transverse contracting."},{"cited_title":"Dynamical movement primitives: learning attractor models for motor behaviors,","cited_arxiv_id":null,"evidence_quote":"The dynamic movement primitive formulation that the paper extends to rhythmic and combined movements."},{"cited_title":"Sparse control for dynamic move- ment primitives,","cited_arxiv_id":null,"evidence_quote":"Earlier contraction-based treatment of dynamic movement primitives that motivates the sparse, modular combination approach."}],"review_version":1}