Flatness-based trajectory planning for 3D overhead cranes with friction compensation and collision avoidance
Pith reviewed 2026-05-21 19:36 UTC · model grok-4.3
The pith
Modeling nonlinear friction is required to generate fast safe trajectories for 3D overhead cranes that avoid collisions and actuator saturation.
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
Core claim
By preserving differential flatness after the addition of nonlinear dry friction, the method recovers all states and inputs from chosen flat outputs and their derivatives, allowing an optimization problem to enforce friction dynamics, input limits, and geometric collision constraints without extra inversion steps; simulations confirm that omitting friction produces saturating torques and unsafe paths.
What carries the argument
Differential flatness of the crane model augmented with nonlinear dry friction, which expresses states and inputs algebraically from a small set of flat outputs so that path constraints become algebraic inequalities in the optimization.
If this is right
- Crane trajectories can be planned that respect actuator limits while respecting friction and collision geometry.
- Only terminal swing constraints are needed, enabling more aggressive intermediate motion than pointwise swing limits.
- Neglecting friction in the planner reliably produces infeasible commands that saturate the motors or violate safety margins.
- The same flatness-based optimizer can incorporate additional algebraic constraints such as rope length limits or obstacle geometries.
Where Pith is reading between the lines
- The method could be tested on other underactuated mechanical systems whose flatness is preserved under similar friction models.
- Parameter identification of the friction coefficients would become a prerequisite for reliable deployment.
- Real-time replanning could use the same flat-output parameterization if friction parameters drift or obstacles move.
Load-bearing premise
The crane system stays differentially flat once nonlinear dry friction is included, so states and inputs can still be recovered directly from the flat outputs.
What would settle it
A closed-loop experiment or high-fidelity simulation in which a friction-compensated trajectory is executed on a physical or modeled crane and still produces actuator saturation or a detected collision.
Figures
read the original abstract
This paper presents an optimal trajectory generation method for 3D overhead cranes by leveraging differential flatness. This framework enables the direct inclusion of complex physical and dynamic constraints, such as nonlinear friction and collision avoidance for both payload and rope. Our approach allows for aggressive movements by constraining payload swing only at the final point. A comparative simulation study validates our approach, demonstrating that neglecting dry friction leads to actuator saturation and collisions. The results show that friction modeling is a fundamental requirement for fast and safe crane trajectories.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The paper proposes an optimal trajectory generation method for 3D overhead cranes that leverages differential flatness to directly incorporate nonlinear dry friction compensation and collision avoidance constraints for both the payload and the rope. The framework permits aggressive motions by enforcing payload swing constraints only at the terminal point. A comparative simulation study is used to demonstrate that trajectories generated without friction modeling result in actuator saturation and collisions, supporting the conclusion that friction modeling is a fundamental requirement for fast and safe crane operation.
Significance. If the differential-flatness property is shown to survive the inclusion of discontinuous friction and the simulation results are quantitatively substantiated, the work would offer a practical advance in crane motion planning by enabling constraint-aware trajectory optimization without dynamic inversion. Explicit credit is due for attempting to embed both friction and geometric collision constraints inside a flatness-based planner rather than treating them as post-processing corrections.
major comments (1)
- [Dynamics and flatness property] No section or equation demonstrates the algebraic inversion formulas required to recover states and inputs from the flat outputs once nonlinear dry friction (e.g., a term proportional to sign(velocity)) is inserted into the dynamics. The sign discontinuity generally destroys the finite-order differentiability and algebraic invertibility presupposed by standard flatness-based constraint enforcement and collision-avoidance formulations.
minor comments (1)
- [Abstract] The abstract and provided material describe a comparative simulation study yet supply neither parameter values, quantitative performance metrics, nor any tabulated results, preventing independent assessment of the claimed improvements in saturation avoidance and collision-free behavior.
Simulated Author's Rebuttal
We thank the referee for the constructive review and for acknowledging the practical value of embedding friction and collision constraints directly within a flatness-based planner. We address the single major comment below and will revise the manuscript to provide the requested explicit derivations.
read point-by-point responses
-
Referee: [Dynamics and flatness property] No section or equation demonstrates the algebraic inversion formulas required to recover states and inputs from the flat outputs once nonlinear dry friction (e.g., a term proportional to sign(velocity)) is inserted into the dynamics. The sign discontinuity generally destroys the finite-order differentiability and algebraic invertibility presupposed by standard flatness-based constraint enforcement and collision-avoidance formulations.
Authors: We appreciate the referee highlighting the need for explicit algebraic inversion formulas. In the revised manuscript we will add a dedicated subsection that derives the state and input recovery expressions when the nonlinear dry-friction term (proportional to sign of trolley velocity) is included in the dynamics. The flat outputs remain the three-dimensional payload position together with the trolley horizontal coordinates; the required trolley force is recovered by direct algebraic rearrangement of the translational dynamics, subtracting the friction term evaluated at the current velocity sign. To preserve the required differentiability for constraint enforcement, trajectories are generated over intervals of constant velocity sign, with C^2 continuity imposed at the (finitely many) switching instants. Collision-avoidance inequalities, expressed solely in the flat outputs and their derivatives, are therefore unaffected. This explicit construction shows that the flatness property is retained in a piecewise sense and that the original optimization problem remains well-posed without post-hoc correction. revision: yes
Circularity Check
No circularity; derivation rests on established flatness property
full rationale
The paper applies the standard differential-flatness property of 3D overhead-crane dynamics to generate trajectories that embed nonlinear friction and collision constraints. No equation or section reduces a claimed result to a fitted parameter or to a self-citation that itself depends on the target claim. The comparison between friction-inclusive and friction-neglected planners is performed by direct simulation of the same flat-output parameterization, which is independent of the paper's own fitted values. The derivation chain therefore remains self-contained and externally falsifiable.
Axiom & Free-Parameter Ledger
Lean theorems connected to this paper
-
IndisputableMonolith/Foundation/RealityFromDistinction.leanreality_from_one_distinction unclear?
unclearRelation between the paper passage and the cited Recognition theorem.
The overhead crane is a flat system and the position of the payload, rp = [xp, yp, zp]⊺, is a flat output [15]. This implies that all system states... and control inputs... can be expressed analytically as functions of the flat output and a finite number of its time derivatives.
-
IndisputableMonolith/Cost/FunctionalEquation.leanwashburn_uniqueness_aczel unclear?
unclearRelation between the paper passage and the cited Recognition theorem.
dx(xt,ẋt) = Dx(ẋt) ẋt + Cx(xt,ẋt) ... Cx(xt,ẋt) = C(−)x(xt) if ẋt < 0 ... fourth-order polynomials
What do these tags mean?
- matches
- The paper's claim is directly supported by a theorem in the formal canon.
- supports
- The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
- extends
- The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
- uses
- The paper appears to rely on the theorem as machinery.
- contradicts
- The paper's claim conflicts with a theorem or certificate in the canon.
- unclear
- Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.
Reference graph
Works this paper leans on
-
[1]
M.-P. Ecker, B. Bischof, M. N. Vu, C. Fröhlich, T. Glück, and W. Kem- metmüller, “Global kinodynamic motion planning for an underactuated timber crane with stochastic trajectory optimization,”Mechatronics, vol. 108, p. 103319, Jun. 2025
work page 2025
-
[2]
Data-based error compensation for georeferenced payload path tracking of automated tower cranes,
M. Burkhardt, A. Gienger, L. Joachim, N. Haala, U. Sörgel, and O. Sawodny, “Data-based error compensation for georeferenced payload path tracking of automated tower cranes,”Mechatronics, vol. 94, p. 103028, Oct. 2023
work page 2023
-
[3]
Flatness based Control of a Gantry Crane,
B. Kolar and K. Schlacher, “Flatness based Control of a Gantry Crane,” IF AC Proc. V olumes, vol. 46, no. 23, pp. 487–492, 2013
work page 2013
-
[4]
Flatness-based nonlin- ear control of a three-dimensional gantry crane,
A. Lobe, A. Ettl, A. Steinboeck, and A. Kugi, “Flatness-based nonlin- ear control of a three-dimensional gantry crane,”IF AC-PapersOnLine, vol. 51, no. 22, pp. 331–336, 2018
work page 2018
-
[5]
S. Iftikhar, O. J. Faqir, and E. C. Kemgan, “Nonlinear model predictive control of an overhead laboratory-scale gantry crane with obstacle avoidance,” inProc. IEEE Conf. Control Technol. Appl.Hong Kong, China: IEEE, Aug. 2019, pp. 382–387
work page 2019
-
[6]
V . C. Nguyen, H. L. Thi, H. B. T. Khanh, H. N. Danh, D. P. Duc, and T. L. Nguyen, “An integrated solution for 3D overhead cranes: Time- optimal motion planning, obstacle avoidance, and anti-swing,”Eng. Sci. Technol. Int. J., vol. 59, p. 101852, Nov. 2024
work page 2024
-
[7]
K. Matsusawa, Y . Noda, and A. Kaneshige, “On-demand Trajectory Planning with Load Sway Suppression and Obstacles Avoidance in Automated Overhead Traveling Crane System,” inProc. IEEE Int. Conf. Autom. Sci. Eng.Vancouver, BC, Canada: IEEE, Aug. 2019, pp. 1321– 1326
work page 2019
-
[8]
A Path Planning Method For Overhead Crane Based on Spatial Stratification,
Z. Wang, X. Cao, X. Wang, D. Wang, and J. Chen, “A Path Planning Method For Overhead Crane Based on Spatial Stratification,” inProc. 8th Int. Conf. Control, Mech. Autom.Moscow, Russia: IEEE, Nov. 2020, pp. 47–51
work page 2020
-
[9]
A. Kaneshige, S. Nagai, S. Ueki, T. Miyoshi, and K. Terashima, “An algorithm for on-line path planning of autonomous mobile overhead traveling crane based on obstacle information,” inProc. IEEE Int. Conf. Autom. Sci. Eng.Seoul, Korea (South): IEEE, Aug. 2012, pp. 914–919
work page 2012
-
[10]
M. Vu, M. Schwegel, C. Hartl-Nesic, and A. Kugi, “Sampling-based trajectory (re)planning for differentially flat systems: Application to a 3D gantry crane,”IF AC-PapersOnLine, vol. 55, no. 38, pp. 33–40, 2022
work page 2022
-
[11]
X. Wang, J. Liu, X. Dong, H. Peng, and C. Li, “An energy-time optimal autonomous motion control framework for overhead cranes in the presence of obstacles,”Proc. Inst. Mech. Eng., Part C: J. Mech. Eng. Sci., vol. 235, no. 13, Jul. 2021
work page 2021
-
[12]
J. Zeng, P. Kotaru, M. W. Mueller, and K. Sreenath, “Differential Flatness Based Path Planning With Direct Collocation on Hybrid Modes for a Quadrotor With a Cable-Suspended Payload,”IEEE Robot. Autom. Lett., vol. 5, no. 2, pp. 3074–3081, Apr. 2020
work page 2020
-
[13]
Collision avoidance for quadrotor UA Vs transporting a payload via V oronoi tessellation,
T. Lee, “Collision avoidance for quadrotor UA Vs transporting a payload via V oronoi tessellation,” inProc. Amer . Control Conf.Chicago, IL, USA: IEEE, Jul. 2015, pp. 1842–1848
work page 2015
-
[14]
J. Vicente-Martinez and E. Ramirez-Laboreo, “A hybrid dynamic model and parameter estimation method for accurately simulating overhead cranes with friction,” 2025, arXiv preprint 2509.13330
work page internal anchor Pith review Pith/arXiv arXiv 2025
-
[15]
Flatness and defect of non-linear systems: introductory theory and examples,
M. Fliess, J. Lévine, P. Martin, and P. Rouchon, “Flatness and defect of non-linear systems: introductory theory and examples,”Int. J. Control, vol. 61, no. 6, pp. 1327–1361, Jun. 1995
work page 1995
-
[16]
M. Thomas, T. Werner, and O. Sawodny, “Online trajectory generation and feedforward control for manually-driven cranes with input con- straints,” inProc. IEEE Conf. Control Technol. Appl., Aug. 2021, pp. 654–659
work page 2021
-
[17]
Flatness-Based Motion Planning and Control Strategy of a 3D Overhead Crane,
V . Chung Nguyen, H. Luu Thi, H. Bui Thi Khanh, D. Huy Nguyen, M. N. Vu, and T. Lam Nguyen, “Flatness-Based Motion Planning and Control Strategy of a 3D Overhead Crane,”IEEE Access, vol. 13, pp. 7053–7070, 2025
work page 2025
-
[18]
Minimum snap trajectory generation and control for quadrotors,
D. Mellinger and V . Kumar, “Minimum snap trajectory generation and control for quadrotors,” inProc. IEEE Int. Conf. Robot. Autom. Shanghai, China: IEEE, May 2011, pp. 2520–2525
work page 2011
-
[19]
An Introduction to Trajectory Optimization: How to Do Your Own Direct Collocation,
M. Kelly, “An Introduction to Trajectory Optimization: How to Do Your Own Direct Collocation,”SIAM Review, vol. 59, no. 4, pp. 849–904, Jan. 2017
work page 2017
-
[20]
CasADi: a software framework for nonlinear optimization and optimal control,
J. A. E. Andersson, J. Gillis, G. Horn, J. B. Rawlings, and M. Diehl, “CasADi: a software framework for nonlinear optimization and optimal control,”Math. Program. Comput., vol. 11, no. 1, pp. 1–36, Mar. 2019
work page 2019
-
[21]
A. Wächter and L. T. Biegler, “On the implementation of an interior- point filter line-search algorithm for large-scale nonlinear programming,” Math. Program., vol. 106, no. 1, pp. 25–57, Mar. 2006
work page 2006
-
[22]
Polynomial Trajectory Planning for Aggressive Quadrotor Flight in Dense Indoor Environments,
C. Richter, A. Bry, and N. Roy, “Polynomial Trajectory Planning for Aggressive Quadrotor Flight in Dense Indoor Environments,” in Robotics Research, M. Inaba and P. Corke, Eds. Cham: Springer International Publishing, 2016, vol. 114, pp. 649–666
work page 2016
-
[23]
Sampling-based algorithms for optimal motion planning,
S. Karaman and E. Frazzoli, “Sampling-based algorithms for optimal motion planning,”Int. J. Robot. Res., vol. 30, no. 7, pp. 846–894, Jun. 2011
work page 2011
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.