{"id":"13075ca5-cef7-436d-b4a9-395af414a7ab","arxiv_id":"2507.17140","paper_version":1,"verdict":"REJECT","confidence":"MODERATE","novelty_score":4.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":3,"one_line_summary":"A reference-plane focus operator modifies NSGA-III to accelerate Pareto-front convergence, with benchmark comparisons and two hardware experiments for curtain-wall installation.","lead":"This paper adds a focus-operator heuristic to the NSGA-III evolutionary algorithm and applies it to multi-objective trajectory planning for a curtain-wall installation robot arm. It reports faster convergence on two benchmark functions and demonstrates the planned trajectories on a physical six-joint hydraulic arm.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Table I's IGD means and standard deviations are statistically indistinguishable between NSGA-III-FO and NSGA-III, so the claimed 'significantly better convergence and stability' in Section IV.B is not established by the paper's own data.","rationale":"Read in good faith: the paper proposes an interesting mechanical design and a plausible modification of NSGA-III, and the physical experiments show feasible trajectories. The decisive issue is not the mechanism's motivation but the evidence for the paper's headline advantage. Section IV.B's conclusion follows from Table I and Figure 3, yet Table I's numbers overlap heavily: the DTLZ3 means differ by 2.6 units against a standard deviation of about 25, and WFG3 means differ by 0.0035 against a standard deviation of about 0.03. With ten runs, the standard errors are roughly 8 and 0.012 respectively, so the observed differences are not close to significant. The text calls this 'significantly better' without reporting a significance test. The HV curves are unquantified; shading indicates standard deviation, but no curve separation measure is given. The hardware experiments are valuable for feasibility, but because no baseline was run on the robot, they do not substantiate convergence superiority. This is load-bearing because if the true IGD difference is zero, the focused operator has no demonstrated benefit on the benchmarks and the paper's main contribution reduces to an untested heuristic. The reader's identified weakest assumption (Euclidean distance to the reference plane is a good convergence proxy) is real and could be tested by ablations on diverse problems; however, the more immediate blocker is that even on the two reported benchmarks, the evidence cannot support the conclusion. Keeping the REJECT verdict is appropriate unless the authors supply statistically valid comparisons, raw data, and parameter settings.","tokens_in":8842,"tokens_out":4124,"duration_ms":43583,"concrete_test":"Obtain the per-run IGD values behind Table I (or rerun all four algorithms for 30 independent runs with matched seeds and identical termination criteria) and apply a paired Wilcoxon signed-rank test for NSGA-III-FO versus NSGA-III on each test problem, with a p<0.05 threshold. Also report 95% bootstrap confidence intervals for the IGD difference. If the difference is not significant (likely, given the reported overlaps), Section IV.B's 'significantly better convergence and stability' claim must be withdrawn or softened.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The paper's central claim is that NSGA-III-FO 'exhibits better convergence and stability' than NSGA-III, MOEA/D, and MSOPS-II (Section IV.B). This claim rests almost entirely on Table I, which reports IGD over ten trials. On DTLZ3, the mean IGD for NSGA-III-FO is 341.3 ± 25.3 versus 343.9 ± 24.9 for NSGA-III; on WFG3 it is 0.6087 ± 0.028 versus 0.6122 ± 0.038. With n=10 and these standard deviations, the mean differences are far smaller than the sampling noise; no statistical test, confidence interval, or effect size is reported anywhere in the paper, and the phrase 'significant' is used without a p-value. The HV convergence curves in Figure 3 are similarly descriptive only. The hardware experiments in Section VI show that the proposed arm can execute trajectories, but they compare NSGA-III-FO to no baseline on the real robot, so they cannot validate the claimed convergence advantage. Thus the strongest claim is unsupported by the evidence as reported; the advertised advantage may be within run-to-run noise. This is not a disagreement with the field's consensus; it is a gap between the assertion and the measurements in the manuscript.","agreement_with_reader":"partial"},"referee_report":{"model":"deepseek-v4-flash","summary":"The manuscript presents a six-degree-of-freedom hydraulic robotic arm for curtain wall installation and a multi-objective trajectory planner that minimizes time, joint impact, and energy consumption using sixth-order B-spline interpolation. The core algorithmic contribution is NSGA-III-FO, which adds a \"focused operator\" that selects the individual closest to a reference plane and discards the farthest individual at each generation. The algorithm is benchmarked against NSGA-III, MOEA/D, and MSOPS-II on DTLZ3 and WFG3 using IGD and HV, and two physical experiments on the robotic arm are reported.","tokens_in":9110,"tokens_out":5215,"duration_ms":50177,"significance":"If the claimed convergence improvement were real, the algorithm could be a useful addition to the multi-objective optimization toolbox for construction robotics, and the hardware experiments would demonstrate an end-to-end system. The paper's strength is the integration of mechanism design, trajectory planning, and physical validation on a real platform, including two realistic installation tasks. However, the central claim of significantly better convergence efficiency is not established: the reported IGD values are statistically indistinguishable between NSGA-III-FO and NSGA-III, the benchmark setup lacks essential details, and the focus operator is an ad hoc heuristic with no theoretical justification. The physical experiments are feasibility demonstrations with no algorithmic baseline, so they cannot validate the claimed advantage. The manuscript does not provide reproducible code, machine-checked proofs, or parameter-free derivations; the empirical evidence as reported is insufficient to support the main claim.","major_comments":[{"comment":"The reported IGD means for NSGA-III-FO and NSGA-III overlap substantially on both benchmarks (DTLZ3: 341.3±25.3 vs 343.9±24.9; WFG3: 0.6087±0.028 vs 0.6122±0.038). With only ten trials, these differences are within sampling noise; no significance test, confidence interval, or effect size is provided, so the claim in Section IV.B of \"significantly better convergence and stability\" is not supported by the paper's own data.","section":"Section IV.B, Table I"},{"comment":"The absolute IGD value on DTLZ3 (≈341) is implausibly large for a benchmark whose Pareto front is commonly normalized to the unit simplex, where converged algorithms typically report IGD values of order 10^{-2} to 10^{-1}. This suggests either that the objective values are not normalized or that all compared algorithms fail to converge; the comparison then does not establish any advantage for NSGA-III-FO.","section":"Section IV.B, Table I"},{"comment":"The focus operator retains the individual with the smallest Euclidean distance to the reference plane and discards the one with the largest distance. The paper provides no argument or analysis for why this proxy correlates with convergence to the Pareto front, and the benchmark evidence is too weak to validate it; on problems with non-convex or disconnected fronts, Euclidean distance to a fixed plane is not a reliable measure of Pareto proximity.","section":"Section IV.A, step (2)"},{"comment":"The benchmark setup is under-specified: the number of objectives, population size, crossover/mutation parameter values, and the total number of function evaluations for DTLZ3 and WFG3 are not stated, making the reported IGD and HV results impossible to reproduce or interpret.","section":"Section IV.B"},{"comment":"The hardware experiments compare NSGA-III-FO to no alternative method on the real robot; they only demonstrate that the planned trajectories are executable. The conclusion in Section VI.B (and echoed in Section VII) that the experiments \"verify the effectiveness and practicality\" of the algorithm is not supported, because feasibility alone does not differentiate NSGA-III-FO from any other feasible trajectory planner.","section":"Section VI.B"}],"minor_comments":[{"comment":"The phrase \"significantly better convergence efficiency\" should be qualified with the statistical evidence, since no significance tests are reported.","section":"Abstract and Section IV.B"},{"comment":"The text says \"as and ve\" but the intent is clearly \"as and ae\" for the initial and final accelerations; this is a typo.","section":"Equation (3)"},{"comment":"The condition `fmax ≤ ¯f` is suspicious because the average fitness is never greater than the maximum; the adaptive probability formulas likely contain a typo in the inequality or in the arguments of the cosine function.","section":"Equations (8) and (9)"},{"comment":"Reference [20] is cited as the source for NSGA-III, but the cited article is about a multistage reference-vector framework, not the original NSGA-III (Deb and Jain, 2014); the original reference should be cited.","section":"Section IV.A"},{"comment":"The table lists the units of f2 as \"N\" and f3 as \"J\", but f2 is defined as an integral of squared jerk in Eq. (5), which is not a force; the units should be made consistent with the definitions.","section":"Table III"},{"comment":"The figure is referenced but the caption is missing, and the text does not clearly state which baselines are included (NSGA-III, MOEA/D, and NSGA-II are mentioned but the figure is not described).","section":"Figure 5"},{"comment":"There are numerous typesetting issues, including mangled indices in Eq. (4), inconsistent notation for B-spline basis functions, and missing spaces; a thorough editorial pass is needed.","section":"Throughout"}],"recommendation":"reject","confidential_remarks":"The paper has a polished hardware demonstration, but the core algorithmic claim is unsupported by the reported statistics. The authors should consider submitting a revised version with a properly specified benchmark setup, significance tests, and a stronger algorithmic analysis, but as it stands the central contribution cannot be evaluated."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"The paper is an engineering contribution with a real new heuristic: the focus operator in NSGA-III-FO that keeps the individual closest to the reference plane and drops the farthest. That operator is not in the cited prior work, and the paper includes actual hardware experiments on a curtain-wall installation arm with two realistic tasks. Credit where due: the robot work appears genuine, the B-spline trajectory formulation is standard, and the authors are honest about transition errors at the joints.\n\nThe soft spot is the load-bearing claim. The abstract says “significantly better convergence efficiency,” but Table I shows IGD means and standard deviations that overlap heavily: on DTLZ3, NSGA-III-FO is 341.3±25.3 versus NSGA-III’s 343.9±24.9; on WFG3, 0.6087±0.028 versus 0.6122±0.038. With ten trials and no statistical test, confidence interval, or effect size reported, the word “significant” is doing work the data cannot support. The HV convergence curves in Figure 3 are descriptive only. The hardware experiments compare NSGA-III-FO to no baseline on the real robot, so they demonstrate feasibility, not the claimed convergence advantage. Missing parameter settings for the benchmarks (population size, reference divisions, crossover and mutation bounds) also make the comparison hard to reproduce.\n\nThe focus-operator heuristic has no theoretical justification; Euclidean distance to the reference plane is a plausible but unproven proxy. That said, the concern is not fundamental incoherence. This is a reasonable extension of NSGA-III with an evidentiary gap, not a load-bearing flaw in the algorithm itself. The stress-test note lands: the paper’s own data does not establish the central claim as written.\n\nWho this is for: construction robotics researchers and anyone working on multi-objective trajectory planning will find the hardware demonstration and the operator idea worth a look. The benchmark section needs a serious rework before the convergence claim is credible.\n\nRecommendation: send it to peer review. The idea is legitimate, the experiments are real, and the flaws are fixable. A referee should require statistical validation, full experimental parameters, and a baseline comparison on the robot. I would not cite it as it stands, but I would want to see the revised version.","headline":"Plausible new NSGA-III variant and real hardware, but the central convergence claim rests on statistically indistinguishable IGD numbers.","tokens_in":9675,"tokens_out":1573,"would_cite":false,"duration_ms":17073,"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 focused screening operator helps NSGA-III converge faster to the Pareto front and produces practical curtain-wall installation trajectories.","keywords":["multi-objective trajectory planning","NSGA-III","focused operator","curtain wall installation robot","B-spline interpolation","Pareto front convergence","construction robotics","trajectory optimization"],"falsifier":"Run NSGA-III-FO and NSGA-III for equal iteration and wall-clock budgets on benchmark problems with disconnected or irregular Pareto fronts, such as DTLZ1 or WFG4, and compare IGD and hypervolume; if the focus operator's convergence advantage narrows or disappears on those fronts, the distance-to-reference-plane heuristic is not a general mechanism.","tokens_in":8597,"feed_emoji":"🤖","tokens_out":7271,"duration_ms":72102,"temperature":0.7,"pith_summary":"The paper is trying to establish that a small modification to NSGA-III—keeping the individual closest to the reference plane and discarding the farthest before nondominated sorting—makes the optimizer reach the Pareto front faster, and that this speed-up makes multi-objective trajectory planning practical for a curtain-wall installation robot. The authors build a six-degree-of-freedom arm that combines serial, parallel, and folding elements, formulate trajectory planning as three simultaneous objectives (time, joint impact, energy), and optimize sixth-order B-spline trajectories with NSGA-III-FO. If the claim is right, construction robots can get usable time/energy/impact trade-offs in fewer optimization iterations, and the same screening idea could be dropped into other reference-point-based optimizers. The paper supports the claim with ten-run comparisons on DTLZ3 and WFG3 and with two physical experiments on the arm, where the computed trajectories pass through all key points with smooth joint motion.","feed_headline":"A focus operator makes NSGA-III converge faster on robot trajectories","feed_subtitle":"Nearest-to-plane solutions are kept, farthest dropped, yielding faster Pareto fronts and real arm trajectories.","key_machinery":"The central object is the Focused Operator: before nondominated sorting, the algorithm measures each individual's Euclidean distance to the reference plane built from boundary crossover, keeps the closest individual as a focused operator that enters the offspring population directly, and removes the farthest as a non-focused operator. This screening step is what pulls the population toward the Pareto front faster than standard NSGA-III. The surrounding machinery is standard reference-vector NSGA-III—uniformly generated reference points on the normalized hyperplane, adaptive cosine-based crossover and mutation probabilities, and fast nondominated sorting—while trajectories are sixth-order B-spline curves constrained in velocity, acceleration, and jerk, with objective functions for time, joint impact, and energy consumption.","core_discovery":"The central claim is that adding a focused-operator screening step to NSGA-III—keeping the individual closest to the reference plane and directly removing the farthest—accelerates convergence toward the Pareto front without hurting solution quality. On DTLZ3 the mean IGD drops from 343.9 for NSGA-III to 341.3 for NSGA-III-FO (with MOEA/D at 387.1), and on WFG3 it drops from 0.6122 to 0.6087 with the smallest standard deviation of the four algorithms tested; the hypervolume convergence curves show NSGA-III-FO reaching converged values earlier. Applied to trajectory planning for the curtain-wall arm, the optimizer produces a uniformly distributed Pareto solution set trading off time, joint impact, and energy, and two physical experiments confirm that the resulting trajectories respect joint constraints, pass through the prescribed key points, and run smoothly on the real platform.","pith_inferences":["The paper leaves implicit that the same nearest-to-plane screening could be transplanted into other reference-vector multi-objective optimizers; a direct test on DTLZ1, WFG4, or real construction trajectories with irregular Pareto fronts would reveal whether the convergence gain is general or specific to DTLZ3 and WFG3.","The paper measures efficiency by iteration count, so an extension would compare wall-clock runtime and final hypervolume after equal time; such a comparison would show whether the focused operator saves computation or merely relocates it within each iteration.","A testable extension is to replace the hard keep/delete rule with a soft weighting by distance to the reference plane, which would preserve focus while softening the loss of diversity on concave or disconnected fronts.","The authors also leave implicit that the focused operator could be run in parallel over multiple reference planes, one per objective region, which might spread the convergence gain across different parts of the Pareto front simultaneously."],"forward_implications":["On the DTLZ3 and WFG3 benchmarks, NSGA-III-FO reaches converged Pareto fronts with lower mean IGD than NSGA-III, MOEA/D, and MSOPS-II, so trajectory optimization can stop after fewer generations for comparable solution quality.","The optimizer yields a spread of Pareto-optimal trajectories trading off time, joint impact, and energy, letting a user pick a solution by reweighting the three objectives—for example, the fastest plan at 10.48 s has high impact, while the most energy-efficient plan at 23.27 s uses only 6.40 J.","In the two physical tasks, the planned trajectories satisfy joint torque, velocity, and jerk constraints, pass through all prescribed key points, and produce smooth joint-angle curves with no visible oscillation.","Because the convergence metric is iteration count rather than runtime, the reported speed advantage transfers to any hardware: the same number of generations is saved regardless of how fast each generation executes.","The six-degree-of-freedom arm design, with its folding and serial-parallel structure, is itself validated as capable of executing multi-objective planned trajectories for vertical-surface and overhead panel installation."],"supporting_citations":[{"why":"Supplies the immediate prior method this paper extends: response-surface plus NSGA-III trajectory optimization for wall-building robots.","marker":"[15]"},{"why":"Shows NSGA-III being applied to multi-objective trajectory planning for a harvesting manipulator, the kind of application the focused operator is designed to improve.","marker":"[16]"},{"why":"Provides an operator-level improvement of NSGA-II for traveling time and torque fluctuation, a precedent for modifying the optimizer's operators to boost performance.","marker":"[17]"},{"why":"Defines the reference-vector-based NSGA-III framework whose population-screening step the focused operator modifies.","marker":"[20]"},{"why":"Offers a time-optimal trajectory planning baseline with velocity constraints, relevant to the time objective in the proposed B-spline formulation.","marker":"[5]"}],"fun_headline_variants":["Focus operator speeds NSGA-III to faster Pareto fronts","Focused NSGA-III trims Pareto front time for robot arm paths","Curtain wall robot gets faster Pareto convergence via focus","NSGA-III focus operator cuts robot trajectory optimization time"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The load-bearing premise is a geometric proxy: the individual closest to the reference plane is always a good solution to keep and the farthest is always a bad one to discard, a rule justified by intuition and tested on only two benchmark functions.","fun_headline_variants_meta":{"raw":{"variants":["Focus operator speeds NSGA-III to faster Pareto fronts","Focused NSGA-III trims Pareto front time for robot arm paths","Curtain wall robot gets faster Pareto convergence via focus","NSGA-III focus operator cuts robot trajectory optimization time"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000628,"raw_usage":{"total_tokens":2915,"prompt_tokens":971,"completion_tokens":1944,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":587,"completion_tokens_details":{"reasoning_tokens":1877}},"tokens_in":587,"tokens_out":1944,"duration_ms":13936,"temperature":1.0,"reasoning_tokens":1877,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-06T14:56:02.528020+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Run NSGA-III-FO and NSGA-III for equal iteration and wall-clock budgets on benchmark problems with disconnected or irregular Pareto fronts, such as DTLZ1 or WFG4, and compare IGD and hypervolume; if the focus operator's convergence advantage narrows or disappears on those fronts, the distance-to-reference-plane heuristic is not a general mechanism.","supporting_citations":[{"cited_title":"Trajectory optimization of wall-building robots using response surface and non-dominated sorting genetic algorithm III,","cited_arxiv_id":null,"evidence_quote":"Supplies the immediate prior method this paper extends: response-surface plus NSGA-III trajectory optimization for wall-building robots."},{"cited_title":"An improved multi-objective trajectory planning algorithm for kiwifruit harvesting manipulator,","cited_arxiv_id":null,"evidence_quote":"Shows NSGA-III being applied to multi-objective trajectory planning for a harvesting manipulator, the kind of application the focused operator is designed to improve."},{"cited_title":"Multi-objective trajectory planning method based on the improved elitist non-dominated sorting genetic algorithm,","cited_arxiv_id":null,"evidence_quote":"Provides an operator-level improvement of NSGA-II for traveling time and torque fluctuation, a precedent for modifying the optimizer's operators to boost performance."},{"cited_title":"Identifying Pareto Fronts Reliably Using a Multistage Reference-Vector-Based Framework,","cited_arxiv_id":null,"evidence_quote":"Defines the reference-vector-based NSGA-III framework whose population-screening step the focused operator modifies."},{"cited_title":"Robot time-optimal trajectory planning based on improved cuckoo search algorithm,","cited_arxiv_id":null,"evidence_quote":"Offers a time-optimal trajectory planning baseline with velocity constraints, relevant to the time objective in the proposed B-spline formulation."}],"review_version":1}