Pith. sign in

REVIEW 5 major objections 7 minor 20 references

Multi-Objective Trajectory Planning for a Robotic Arm in Curtain Wall Installation

T0 review · 5 major / 7 minor · reviewed 2026-08-06 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read A focused screening operator helps NSGA-III converge faster to the Pareto front and produces practical curtain-wall installation trajectories.

desk verdict Plausible new NSGA-III variant and real hardware, but the central convergence claim rests on statistically indistinguishable IGD numbers. read the letter →

arxiv 2507.17140 v1 pith:JPHAVL7C submitted 2025-07-23 cs.RO

Xiao Liu , Yunxiao Cheng , Weijun Wang , Tianlun Huang , Zhiyong Wang , Wei Feng This is my paper · ORCID
classification cs.RO
keywords multi-objectivetrajectoryplanningNSGA-IIIfocusedoperatorcurtainwallinstallationrobotB-splineinterpolationParetofrontconvergenceconstructionroboticsoptimization
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

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.

What carries the argument

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.

What would settle it

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.

Watch

Extended reading notes

Core claim

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.

Load-bearing premise

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.

Editorial extensions

If this is right

  • 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.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • 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.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

5 major / 7 minor

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.

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 (5)
  1. [Section IV.B, Table I] 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.
  2. [Section IV.B, Table I] 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.
  3. [Section IV.A, step (2)] 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.
  4. [Section IV.B] 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.
  5. [Section VI.B] 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.
minor comments (7)
  1. [Abstract and Section IV.B] The phrase "significantly better convergence efficiency" should be qualified with the statistical evidence, since no significance tests are reported.
  2. [Equation (3)] The text says "as and ve" but the intent is clearly "as and ae" for the initial and final accelerations; this is a typo.
  3. [Equations (8) and (9)] 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.
  4. [Section IV.A] 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.
  5. [Table III] 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.
  6. [Figure 5] 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).
  7. [Throughout] 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.

Circularity Check

0 steps flagged · score 0.0 of 10

No circularity found: benchmark comparisons and robot experiments are externally grounded; no fitted parameter or self-citation chain.

full rationale

The paper's central claims are empirically tested against standard external benchmarks (DTLZ3, WFG3) with known Pareto fronts, and the robot-arm trajectory objectives (time, joint impact, energy) are defined independently of the algorithm's construction. The proposed NSGA-III-FO operator heuristically selects the individual closest to a reference plane and excludes the farthest, but this selection rule is a stated algorithmic premise, not a parameter fitted to the benchmark results, nor is it equivalent to the IGD or HV metrics used for evaluation. No self-citations form a load-bearing loop; the cited references are external prior work. The claim of 'better convergence and stability' is an empirical assertion that may be weakly supported by the reported statistics, but statistical weakness is a correctness/evidence concern, not circularity. The derivation chain does not reduce any predicted result to its own inputs by construction.

Assumptions & free parameters 3 free parameters · 4 assumptions · 0 invented entities

The central claim rests on a small set of algorithm hyperparameters that are not reported, and on a heuristic selection criterion (distance to the reference plane) that is introduced without independent justification. No new physical entities are postulated.

free parameters (3)
  • Population size N
    NSGA-III population size is never reported; it affects selection pressure and diversity, so the exact experimental configuration is unrecoverable.
  • Reference division p
    Eq. 7 defines the number of reference points H from p, but p is not reported, so the reference-point layout cannot be reproduced.
  • Crossover/mutation bounds (Pc,max/min, Pm,max/min)
    Used in Eqs. 8-9 to compute adaptive probabilities, but the numeric bounds are not given, so the adaptive schedule cannot be replicated.
assumptions (4)
  • ad hoc to paper Euclidean distance to the reference plane is a meaningful proxy for convergence and diversity in objective space.
    Introduced in Section IV.A step 2 to justify the focus operator; no evidence beyond the reported benchmarks.
  • standard math The sixth-order B-spline interpolation and inverse kinematics correctly map task-space waypoints to joint-space trajectories that pass through the key points.
    Assumed in Section III.A; the underlying mathematics is standard in robotic trajectory planning.
  • domain assumption The unspecified dynamic parameters and kinematic constraints of the foldable serial-parallel arm used in simulation match the physical prototype.
    Section V uses 'dynamic parameters' without listing them; hardware tracking errors in Task 1 show deviation in transition phases, so model fidelity is not established.
  • domain assumption DTLZ3 and WFG3 with known Pareto fronts are appropriate, sufficient benchmarks to evaluate convergence for trajectory planning problems.
    Section IV.B selects two unconstrained continuous benchmarks; their representativeness for constrained trajectory planning is assumed, not demonstrated.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Multi-Objective Trajectory Planning for a Robotic Arm in Curtain Wall Installation." pith.science (2026). https://pith.science/paper/JPHAVL7C

@misc{pith2026250717140,
  author       = {Pith},
  title        = {Pith review of: Multi-Objective Trajectory Planning for a Robotic Arm in Curtain Wall Installation},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/JPHAVL7C}},
  note         = {Machine review of arXiv:2507.17140}
}
read the original abstract

In the context of labor shortages and rising costs, construction robots are regarded as the key to revolutionizing traditional construction methods and improving efficiency and quality in the construction industry. In order to ensure that construction robots can perform tasks efficiently and accurately in complex construction environments, traditional single-objective trajectory optimization methods are difficult to meet the complex requirements of the changing construction environment. Therefore, we propose a multi-objective trajectory optimization for the robotic arm used in the curtain wall installation. First, we design a robotic arm for curtain wall installation, integrating serial, parallel, and folding arm elements, while considering its physical properties and motion characteristics. In addition, this paper proposes an NSGA-III-FO algorithm (NSGA-III with Focused Operator, NSGA-III-FO) that incorporates a focus operator screening mechanism to accelerate the convergence of the algorithm towards the Pareto front, thereby effectively balancing the multi-objective constraints of construction robots. The proposed algorithm is tested against NSGA-III, MOEA/D, and MSOPS-II in ten consecutive trials on the DTLZ3 and WFG3 test functions, showing significantly better convergence efficiency than the other algorithms. Finally, we conduct two sets of experiments on the designed robotic arm platform, which confirm the efficiency and practicality of the NSGA-III-FO algorithm in solving multi-objective trajectory planning problems for curtain wall installation tasks.

Figures

Figures reproduced from arXiv: 2507.17140 by the authors.

Figure 1
Figure 1. Structural Design of a Robotic Arm for Curtain Wall Installation [PITH_FULL_IMAGE:figures/full_fig_p001_1.png] view at source ↗
Figure 2
Figure 2. Flowchart of NSGA-III-FO for Multi-objective Optimization) [PITH_FULL_IMAGE:figures/full_fig_p003_2.png] view at source ↗
Figure 3
Figure 3. The HV Convergence Curves of Each Algorithm (Shaded Areas [PITH_FULL_IMAGE:figures/full_fig_p004_3.png] view at source ↗
Figures from the paper (7 more)
Figure 4
Figure 4. Figure 4: Pareto Solution Set of Multi-objective Optimized Trajectories Based [PITH_FULL_IMAGE:figures/full_fig_p004_4.png]
Figure 6
Figure 6. Figure 6: Robotic Arm Experimental Platform for Curtain Wall Installation [PITH_FULL_IMAGE:figures/full_fig_p005_6.png]
Figure 5
Figure 5. Figure 5: HV Indicator of Multi-objective Trajectory Planning Solutions for [PITH_FULL_IMAGE:figures/full_fig_p005_5.png]
Figure 7
Figure 7. Figure 7: Robotic arm poses at key points during Task 1. [PITH_FULL_IMAGE:figures/full_fig_p006_7.png]
Figure 9
Figure 9. Figure 9: Robotic arm poses at key points during Task 2 [PITH_FULL_IMAGE:figures/full_fig_p006_9.png]
Figure 8
Figure 8. Figure 8: Joint Angle Variations of Robotic Arm for Task 1 [PITH_FULL_IMAGE:figures/full_fig_p006_8.png]
Figure 10
Figure 10. Figure 10: Joint Angle Variations of Robotic Arm for Task 2 [PITH_FULL_IMAGE:figures/full_fig_p007_10.png]

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

20 extracted references · 19 canonical work pages

  1. [1]

    On-site autonomous construction robots: Towards unsupervised building,

    N. Melenbrink, J. Werfel, and A. Menges, “On-site autonomous construction robots: Towards unsupervised building,” Automation in Construction, vol. 119, p. 103312, 2020

    2020

  2. [2]

    Robotic technologies for on-site building construction: A systematic review,

    M. Gharbia, A. Chang-Richards, and Y . Lu, “Robotic technologies for on-site building construction: A systematic review,” Journal of Building Engineering, vol. 32, p. 101584, 2020

    work page 2020

  3. [3]

    Development of BIM-integrated construction robot task planning and simulation system,

    S. Kim, M. Peavy, and P. C. Huang, “Development of BIM-integrated construction robot task planning and simulation system,” Automation in Construction, vol. 127, p. 103720, 2021

    work page 2021

  4. [4]

    Ant colony optimization-based method for energy-efficient cutting trajectory planning in axial robotic roadheader,

    Z. Dong, X. Zhang, and W. Yang, “Ant colony optimization-based method for energy-efficient cutting trajectory planning in axial robotic roadheader,” Applied Soft Computing, vol. 163, p. 111965, 2024

    work page 2024

  5. [5]

    Robot time-optimal trajectory planning based on improved cuckoo search algorithm,

    W. Wang, Q. Tao, and Y . Cao, “Robot time-optimal trajectory planning based on improved cuckoo search algorithm,” IEEE Access, vol. 8, pp. 86923–86933, 2020

    work page 2020

  6. [6]

    Optimal time-jerk trajectory planning for industrial robots,

    J. Huang, P. Hu, and K. Wu, “Optimal time-jerk trajectory planning for industrial robots,” Mechanism and Machine Theory, vol. 121, pp. 530–544, 2018

    work page 2018

  7. [7]

    Robot time optimal trajectory planning based on improved simplified particle swarm optimization algorithm,

    X. Hu, H. Wu, and Q. Sun, “Robot time optimal trajectory planning based on improved simplified particle swarm optimization algorithm,” IEEE Access, vol. 11, pp. 44496–44508, 2023

    work page 2023

  8. [8]

    Genetic algorithm-based trajectory optimization for digital twin robots,

    X. Liu, D. Jiang, and B. Tao, “Genetic algorithm-based trajectory optimization for digital twin robots,” Frontiers in Bioengineering and Biotechnology, vol. 9, p. 793782, 2022

    work page 2022

Show all 20 references
  1. [9]

    Multimodal trajectory optimization for motion planning,

    T. Osa, “Multimodal trajectory optimization for motion planning,” The International Journal of Robotics Research, vol. 39, no. 8, pp. 983–1001, 2020

    2020

  2. [10]

    Trajectory planning and optimization for robotic machining based on measured point cloud,

    G. Wang, W. Li, and C. Jiang, “Trajectory planning and optimization for robotic machining based on measured point cloud,” IEEE Transactions on Robotics, vol. 38, no. 3, pp. 1621–1637, 2021

    2021

  3. [11]

    Sampling of pareto-optimal trajectories using progressive objective evaluation in multi-objective motion planning,

    J. Lee, D. Yi, and S. S. Srinivasa, “Sampling of pareto-optimal trajectories using progressive objective evaluation in multi-objective motion planning,” in 2018 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS), pp. 1–9, Oct. 2018

    2018

  4. [12]

    Anticipatory human-robot collaboration via multi- objective trajectory optimization,

    A. Jain et al., “Anticipatory human-robot collaboration via multi- objective trajectory optimization,” in 2020 IEEE/RSJ International Con- ference on Intelligent Robots and Systems (IROS), pp. 11052–11057, Oct. 2020

    2020

  5. [13]

    Multi-controller multi- objective locomotion planning for legged robots,

    M. Brandao, M. Fallon, and I. Havoutis, “Multi-controller multi- objective locomotion planning for legged robots,” in 2019 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS), pp. 4714–4721, Nov. 2019

    2019

  6. [14]

    Trajectory planning in joint space for a pointing mechanism based on a novel hybrid interpolation algorithm and NSGA-II algorithm,

    J. Sun, X. Han, and Y . Zuo, “Trajectory planning in joint space for a pointing mechanism based on a novel hybrid interpolation algorithm and NSGA-II algorithm,” IEEE Access, vol. 8, pp. 228628–228638, 2020

    2020

  7. [15]

    Trajectory optimization of wall-building robots using response surface and non-dominated sorting genetic algorithm III,

    Q. Shi, Z. Wang, and X. Ke, “Trajectory optimization of wall-building robots using response surface and non-dominated sorting genetic algorithm III,” Automation in Construction, vol. 155, p. 105035, 2023

    2023

  8. [16]

    An improved multi-objective trajectory planning algorithm for kiwifruit harvesting manipulator,

    X. Li, H. Lv, D. Zeng et al., “An improved multi-objective trajectory planning algorithm for kiwifruit harvesting manipulator,” IEEE Access, vol. 11, pp. 65689–65699, 2023

    2023

  9. [17]

    Multi-objective trajectory planning method based on the improved elitist non-dominated sorting genetic algorithm,

    Z. Wang, Y . Li, K. Shuai et al., “Multi-objective trajectory planning method based on the improved elitist non-dominated sorting genetic algorithm,” Chinese Journal of Mechanical Engineering, vol. 35, no. 1, p. 7, 2022

    2022

  10. [18]

    Self-tuning time-energy optimization for the trajectory planning of a wheeled mobile robot,

    W. Serralheiro, N. Maruyama, and F. Saggin, “Self-tuning time-energy optimization for the trajectory planning of a wheeled mobile robot,” Journal of Intelligent & Robotic Systems, vol. 95, pp. 987–997, 2019

    2019

  11. [19]

    On the trajectory planning for energy efficiency in industrial robotic systems,

    G. Carabin and L. Scalera, “On the trajectory planning for energy efficiency in industrial robotic systems,” Robotics, vol. 9, no. 4, p. 89, 2020

    2020

  12. [20]

    Identifying Pareto Fronts Reliably Using a Multistage Reference-Vector-Based Framework,

    K. Deb, C. L. do Val Lopes, F. V . C. Martins et al., “Identifying Pareto Fronts Reliably Using a Multistage Reference-Vector-Based Framework,” IEEE Transactions on Evolutionary Computation, vol. 28, no. 1, pp. 252–266, 2023

    2023

Pith tools

Reviewed August 6, 2026 · model on record in the stance chip above.