首页> 外文学位 >On the minimal time vessel routing problem.
【24h】

On the minimal time vessel routing problem.

机译:关于最小时间的船只路由问题。

获取原文
获取原文并翻译 | 示例

摘要

During the last two decades there has been a growing interest in methods for calculating the optimal trajectory of a ship. The purpose of this dissertation is the derivation of solution techniques for the minimal time vessel routing problem. Methodologies derived are relatively general and after minor modifications could be utilized for optimal planning of an autonomous vehicle traveling in a variable routing terrain.;The minimal time routing for a vessel traveling in deterministic stationary seas is first examined. Variational calculus has been used to treat the general version of the problem. A discretization of the feasible sailing terrain into a finite number of subregions within which the ship possesses similar dynamics has been used. Local variational considerations combined with global boundary conditions result in efficient solution procedures. Finally, the presense of constraints and their effect on the calculation of the optimal trajectory is discussed.;The minimal time trajectory for a vessel traveling from one origin to several ordered destination points sailing in deterministic time dependent sea states is analyzed next. General properties of the extremal trajectories and the associated optimal controls have been derived. A discretization, similar to that used for the stationary problem but with time dependent geometry, has been used. Within the framework of this discretization, appropriate first variation considerations lead to local optimality conditions which, combined with global boundary conditions form the basis of the algorithmic schemes developed. Predefined or free departure times in addition to constrained versions of the problem are also considered.;Finally, the stochastic minimal time problem is considered. A procedure to calculate an isochrone line is described. This line is considered as the first stage in a Dynamic Programming (DP) network. The rest of the routing space is characterized by stochastic sea states. The probabilistic properties of the sea state characteristics are analyzed using Bayesian statistical methods. This estimation takes place at the beginning of the trip and utilizes past observation and current sea state forecast as well as seasonal statistical properties. Bounds on the optimal state evolution, resulting in a serious reduction of the problem dimensionality, are also derived. (Abstract shortened with permission of author.)
机译:在过去的二十年中,人们对计算船舶最佳航迹的方法越来越感兴趣。本文的目的是推导最小时间船只路径问题的求解技术。得出的方法是相对通用的,经过细微修改后可用于在可变航路地形中行驶的自动驾驶车辆的最佳计划。变分演算已用于处理问题的一般版本。已经将可行航行地形离散化为有限数量的子区域,在该子区域中船舶具有相似的动力学特性。局部变化考虑因素与整体边界条件相结合,可以产生有效的求解程序。最后,讨论了约束的存在及其对最优轨迹计算的影响。接下来,分析了在确定的时间相关的海况下,从一个起点航行到多个有序目的地点的船只的最小时间轨迹。得出了极轨的一般性质和相关的最优控制。已经使用了离散化,类似于用于固定问题的离散化,但是具有随时间变化的几何形状。在这种离散化的框架内,适当的第一个变化考虑会导致局部最优条件,该条件与全局边界条件相结合,构成了开发的算法方案的基础。除了问题的受约束版本之外,还考虑了预定义或自由离开时间。最后,考虑了随机最小时间问题。描述了计算等时线的过程。这条线被认为是动态编程(DP)网络的第一步。路由空间的其余部分的特征是随机海况。使用贝叶斯统计方法分析海态特征的概率性质。该估计在行程开始时进行,并利用过去的观察和当前的海况预测以及季节性统计属性。还得出了导致状态维数严重降低的最佳状态演化的界线。 (摘要经作者许可缩短。)

著录项

  • 作者单位

    University of Michigan.;

  • 授予单位 University of Michigan.;
  • 学科 Engineering Marine and Ocean.
  • 学位 Ph.D.
  • 年度 1988
  • 页码 153 p.
  • 总页数 153
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类
  • 关键词

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号