{"id":"f5578321-ce51-41d2-8cb0-f612fae93ae7","arxiv_id":"2606.04515","paper_version":1,"verdict":"UNVERDICTED","confidence":"LOW","novelty_score":3.0,"correctness_risk":"unknown","formal_verification":"none","parameter_count":1,"one_line_summary":"Derives analytical expressions for boat trajectories under fixed heading and optimal heading angles for shortest-time crossing in rivers with non-uniform flows using three velocity distribution models.","lead":"The paper builds three models for boat crossing a river with constant, linear, and power-law flow velocities, then derives analytical trajectory expressions and optimal heading angles via vectors, calculus, and Lagrange multipliers. A smart generalist might read it to see how math supports path planning for navigation in variable currents.","discovery_kind":"extension","skeptic_critique":{"model":"grok-4.3","headline":"Optimization performed only over constant heading; true min-time may require variable heading","rationale":"The identified concern matches the reader's weakest assumption on constant heading being realistic for shortest time. The trajectory derivations under fixed heading appear standard and are not the primary issue; the control restriction is what prevents the central claim from being fully supported without additional verification.","tokens_in":1687,"tokens_out":315,"duration_ms":31503,"concrete_test":"For Model 1 (constant flow), formulate the time-optimal control problem with velocity field v_b + v_flow(y), apply Pontryagin's maximum principle to obtain the candidate \theta*(t), integrate the resulting two-point BVP, and compare the achieved crossing time against the constant-\theta optimum from the paper; a strictly smaller time falsifies the claim that the Lagrange solution solves the shortest-time problem.","verdict_should_be":"CONDITIONAL","load_bearing_attack":"The strongest claim states that the Lagrange multiplier method yields the analytical solution for the optimal heading angle in the shortest-time problem under the boundary condition of reaching the direct opposite bank. The derivations for trajectories explicitly assume a fixed heading angle relative to the flow (used in all three velocity models). This restriction is load-bearing because the underlying problem is an optimal-control task in which heading \theta(t) is a free control; the constant-\theta family is a strict subset. No comparison to the variable-heading case is indicated in the abstract or described approach, so the reported optimum is not guaranteed to be the global minimum time.","agreement_with_reader":"agree"},"referee_report":{"model":"grok-4.3","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.","tokens_in":1809,"tokens_out":419,"duration_ms":11142,"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":[{"comment":"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.","section":"Abstract / shortest-time control problem"}],"minor_comments":[{"comment":"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.","section":"Abstract"},{"comment":"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.","section":"Model 3"}],"recommendation":"major_revision","confidential_remarks":null},"author_rebuttal":{"model":"grok-4.3","summary":"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.","responses":[{"response":"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_made":"yes","referee_comment":"[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."}],"tokens_in":1233,"tokens_out":348,"duration_ms":24629,"standing_objections":[]},"desk_editor":{"model":"grok-4.3","letter":"The paper derives closed-form trajectories for three river flow models under constant heading and optimizes that heading with Lagrange multipliers, but the shortest-time claim is restricted to the constant-heading subset and the problem itself is textbook material.\n\nThe concrete work is the integration of the vector addition into differential equations for constant, linear, and even-power flow profiles, followed by the Lagrange setup that enforces the straight-across boundary condition. The tunable n in the power-law model gives a simple way to vary the flow shape.\n\nThose analytical expressions are the part that could actually be used. If the algebra is free of gaps, someone building a basic simulator might prefer them over setting up a numerical solver from scratch.\n\nThe main weakness is the fixed-heading restriction. The underlying shortest-time problem lets heading change with time, so the reported optimum is only best inside the constant-heading family. The abstract gives no comparison or justification for why that family is sufficient.\n\nThere is also no numerical check against integration, no error bounds, and no discussion of how these three models relate to measured river data. The boat-river setup is a standard example in classical mechanics, so the modeling exercise does not open new ground.\n\nThis is mainly for an engineer who needs explicit formulas for these specific profiles or a lecturer who wants parameterized homework. A serious editor would not send it to referees.","headline":"The paper derives closed-form trajectories for three river flow models under constant heading and optimizes that heading with Lagrange multipliers, but the shortest-time claim is restricted to the constant-heading subset and the problem itself is textbook material.","tokens_in":2286,"tokens_out":362,"would_cite":false,"duration_ms":36814,"reading_group":"no","serious_thinker":"yes","would_accept_peer_review":false},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":[],"pacs":[],"model":"grok-4.3","headline":"Analytical solutions for boat trajectories and optimal headings are derived for river crossing under three non-uniform flow models.","keywords":["boat river crossing","flow velocity distribution","trajectory analysis","optimal heading angle","Lagrange multipliers","differential equations","shortest time path"],"falsifier":"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.","tokens_in":2587,"feed_emoji":"🚤","tokens_out":658,"duration_ms":27029,"temperature":0.7,"pith_summary":"The paper builds three models of river flow velocity across the width: constant, linear, and an even-power function with adjustable parameter n. It combines vector addition of velocities with differential equations to obtain closed-form expressions for the boat's path when heading angle relative to the water is held fixed. For the shortest-time problem with the requirement to land directly opposite the start, it applies the Lagrange multiplier method to a constrained optimization setup and solves for the best heading angle. The results supply exact formulas rather than numerical approximations for use in navigation planning. A reader would care because these expressions can guide automated systems that must cross rivers with realistic, varying currents.","feed_headline":"Exact boat trajectories and optimal headings derived for three river flows","feed_subtitle":"Closed-form path equations and Lagrange solutions give the heading that reaches the opposite bank fastest under constant, linear, or power-l","key_machinery":"Lagrange multiplier method applied to a constrained optimization model for minimal crossing time under the direct-opposite-bank boundary condition.","core_discovery":"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.","pith_inferences":["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."],"forward_implications":["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."],"fun_headline_variants":["Boat paths calculated for three river flow distributions","Lagrange method yields optimal boat heading for opposite bank","Vector addition gives ship trajectories under nonuniform flows","Fixed heading boat routes solved via differential equations"],"cache_read_input_tokens":64,"weakest_assumption_plain":"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.","fun_headline_variants_meta":{"raw":{"variants":["Boat paths calculated for three river flow distributions","Lagrange method yields optimal boat heading for opposite bank","Vector addition gives ship trajectories under nonuniform flows","Fixed heading boat routes solved via differential equations"]},"model":"grok-4.3","cost_usd":0.008125,"raw_usage":{"total_tokens":3646,"prompt_tokens":577,"num_sources_used":0,"completion_tokens":56,"cost_in_usd_ticks":81249500,"prompt_tokens_details":{"text_tokens":577,"audio_tokens":0,"image_tokens":0,"cached_tokens":256},"completion_tokens_details":{"audio_tokens":0,"reasoning_tokens":3013,"accepted_prediction_tokens":0,"rejected_prediction_tokens":0}},"tokens_in":577,"tokens_out":56,"duration_ms":25046,"temperature":1.0,"reasoning_tokens":3013,"cache_read_input_tokens":256,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-06-28T04:18:42.580334+00:00","model_set":{"reader":"grok-4.3"},"falsifier":"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.","supporting_citations":[],"review_version":1}