Discussion on the Physics Problem of a Boat Crossing a River
Pith reviewed 2026-06-28 04:18 UTC · model grok-4.3
The pith
Analytical solutions for boat trajectories and optimal headings are derived for river crossing under three non-uniform flow models.
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
Core claim
By using vector addition combined with calculus and differential equations, the analytical expression of the ship's spatial trajectory under a fixed heading angle relative to the water flow is derived for each model. The Lagrange multiplier method constructs a constrained optimization model whose solution yields the analytical optimal heading angle satisfying the boundary condition of reaching the direct opposite bank.
What carries the argument
Lagrange multiplier method applied to a constrained optimization model for minimal crossing time under the direct-opposite-bank boundary condition.
If this is right
- Closed-form trajectory equations exist for any fixed heading in the constant, linear, and even-power flow distributions.
- An analytical expression for the optimal heading angle is available that minimizes time while enforcing direct crossing.
- The multi-model setup can be used to simulate a range of flow-velocity scenarios encountered in inland rivers.
- The derived results supply theoretical formulas for path planning in intelligent ship navigation systems.
Where Pith is reading between the lines
- If flow profiles can be measured in advance, the closed-form solutions could be coded directly into onboard controllers for real-time heading commands.
- The adjustable parameter n in the third model offers a route to calibrate the equations against velocity data collected from a particular river.
- Allowing the heading to change continuously during the crossing would require a different optimization approach but might yield still shorter times.
Load-bearing premise
That a constant heading angle relative to the water remains a realistic strategy and that the three chosen mathematical forms for flow velocity adequately represent real river conditions.
What would settle it
Record the actual path and crossing time of a boat in a river whose velocity profile has been measured at many points across the width, then compare the data directly to the derived analytical trajectory and optimal heading; systematic mismatch would falsify the expressions.
Figures
read the original abstract
This study addresses the boat river-crossing problem under non-uniform flow velocities by constructing three models: constant flow (Model 1), linear distribution (Model 2), and even-power function distribution (Model 3, adjustable via parameter n ). By using the vector addition, combined with the solutions of calculus and differential equations, the analytical expression of the ship's spatial trajectory under a fixed heading angle relative to the water flow is derived. For the shortest-time control problem, the Lagrange multiplier method is introduced to construct a constrained optimization model, and the analytical solution of the optimal heading angle that satisfies the boundary condition of reaching the direct opposite bank is solved. The research results provide theoretical support for the path planning of inland ship intelligent navigation systems, and the proposed multi-model analysis framework can effectively simulate the complex flow velocity distribution scenarios of real rivers.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The paper constructs three models for river flow velocity (constant, linear, and even-power with parameter n) and derives analytical expressions for boat trajectories under a fixed heading angle relative to the flow, using vector addition and solutions to differential equations. For the shortest-time problem with the boundary condition of reaching the point directly opposite the starting bank, it applies the Lagrange multiplier method to a constrained optimization over the (constant) heading angle and obtains an analytical expression for the optimal angle.
Significance. If the derivations hold, the work supplies closed-form trajectory formulas for three specific velocity profiles and an explicit optimal constant heading for the direct-crossing constraint. These could serve as benchmarks or initial guesses for numerical path planners in inland navigation. However, the restriction to constant heading means the reported optimum is only the best within that family, not necessarily the global minimum-time trajectory.
major comments (1)
- [Abstract / shortest-time control problem] The shortest-time claim relies on optimizing only over a constant heading angle (see abstract: 'the analytical solution of the optimal heading angle'). This is a strict subset of admissible controls; the true minimum-time problem is an optimal-control task with free θ(t). No comparison to the variable-heading case or proof that the constant optimum is globally minimal is provided, so the reported solution does not solve the stated shortest-time control problem.
minor comments (2)
- [Abstract] The abstract states that the three flow distributions are used but supplies no verification (numerical integration, limiting cases, or error bounds) that the derived trajectory expressions are free of algebraic or integration errors.
- [Model 3] Parameter n in Model 3 is introduced as free; the paper should state whether results are reported for specific n values or kept symbolic throughout.
Simulated Author's Rebuttal
We thank the referee for the careful reading and for highlighting the distinction between constant-heading optimization and the full time-optimal control problem. We address the major comment below.
read point-by-point responses
-
Referee: [Abstract / shortest-time control problem] The shortest-time claim relies on optimizing only over a constant heading angle (see abstract: 'the analytical solution of the optimal heading angle'). This is a strict subset of admissible controls; the true minimum-time problem is an optimal-control task with free θ(t). No comparison to the variable-heading case or proof that the constant optimum is globally minimal is provided, so the reported solution does not solve the stated shortest-time control problem.
Authors: We agree that the optimization in the manuscript is performed exclusively over a constant heading angle θ. The derivations begin with fixed-heading trajectories obtained via vector addition and differential equations, after which the Lagrange multiplier method is applied to minimize crossing time subject to the direct-opposite boundary condition while keeping θ fixed. The abstract and text therefore refer to the optimal heading angle within this constant-heading family. We will revise the abstract, introduction, and conclusions to replace 'optimal heading angle' with 'optimal constant heading angle' and add an explicit statement that the reported solution is the minimum-time trajectory only among constant-heading controls. We will also note that the global time-optimal problem with free θ(t) constitutes a standard optimal-control problem whose solution generally requires Pontryagin’s maximum principle or numerical methods and lies beyond the analytical scope of the present work. These changes will accurately delimit the claims without altering the derived closed-form expressions. revision: yes
Circularity Check
No circularity; derivations are independent first-principles constructions
full rationale
The paper states three explicit velocity-field models, then derives trajectory expressions from vector addition plus integration of the resulting ODEs under constant heading; the shortest-time step applies Lagrange multipliers to that same fixed-heading family subject to the opposite-bank boundary condition. None of these steps defines a quantity in terms of itself, renames a fitted parameter as a prediction, or relies on a self-citation whose content is the target result. The constant-heading restriction is an explicit modeling choice, not a hidden tautology, so the reported analytic expressions remain logically downstream of the stated inputs.
Axiom & Free-Parameter Ledger
free parameters (1)
- n
axioms (3)
- standard math Velocities combine by vector addition
- standard math Differential equations yield spatial trajectories from velocity components
- standard math Lagrange multipliers solve constrained optimization problems
Reference graph
Works this paper leans on
-
[1]
Markova, I., Khanh, P. K., & V okhidov, O. (2023). Current velocity field in section of Sai Gon river during operation of flood control structures. E3S Web of Conferences, 401, 01050. https://doi.org/10.1051/e3sconf/202340101050
-
[2]
Li, M. (2019). Generalized Lagrange multiplier method and KKT conditions with an application to distributed optimization. IEEE Transactions on Circuits and Systems II: Express Briefs. https://doi.org/10.1109/TCSII.2018.2842085
-
[3]
Kou, Y . K. Kyle. (2025). Crossing the river in the shortest possible time (pp. 1-20) [Internal assessment]. Unpublished work, DP1-4, Mathematics HL, Wuhan Britain-China School
2025
-
[4]
Riley, K. (2019). Q42: Dynamics problem & S42: Solution. In Physics problems for aspiring physical scientists and engineers: With hints and full solutions (pp. 140-142). Cambridge University Press. https://doi.org/10.1017/9781108592123
-
[5]
Marini, G., Fontana, N., & Singh, V . P. (2017). Derivation of 2D velocity distribution in watercourses using entropy. Journal of Hydrologic Engineering, 22(6), 04017003.1– 04017003.6. https://ui.adsabs.harvard.edu/abs/2013Entrp..15.1221S/abstract
2017
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.