Answers are grounded in this paper and cite their sources.
This paper presents a hybrid search algorithm for Zermelo’s navigation problem in complex vector fields. The method combines local analytical navigation with A*-based graph search to compute high-quality trajectories in scenarios with multiple local optima. Its key idea is to use the optimal navigation law for uniform vector fields as a local propagation rule to generate new nodes. By defining multiple target points and linking them through locally optimal analytical trajectories, the algorithm encourages structured global exploration beyond purely local methods. The resulting framework integrates analytical local navigation with the robustness of heuristic search to integrate global exploration properties. It also adapts automatically to different spatial scales, making it suitable for both local and large-domain problems. Numerical validation under execution-time constraints demonstrates its effectiveness in time-limited settings, with experiments showing strong global exploration and high-quality trajectories under strict computational budgets.
No takes yet. Share an insight, caveat, or question.
José Antonio González (2026) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: