论文标题
最佳访问问题的混合控制框架
A hybrid control framework for an optimal visiting problem
论文作者
论文摘要
最佳访问问题是优化必须触摸或通过尽可能接近目标点的轨迹的轨迹。该问题无法验证动态编程原则，并且需要特定的公式来跟踪访问的目标点。在本文中，我们通过在与目标相关的一组离散状态之间添加轨迹切换的不连续部分来介绍一种混合方法。然后，我们通过将最佳访问量重新提出为时期的最佳停止问题来表明相关的汉密尔顿 - 雅各比问题的良好性。
The optimal visiting problem is the optimization of a trajectory that has to touch or pass as close as possible to a collection of target points. The problem does not verify the dynamic programming principle, and it needs a specific formulation to keep track of the visited target points. In this paper, we introduce a hybrid approach by adding a discontinuous part of the trajectory switching between a group of discrete states related to the targets. Then, we show the well-posedness of the related Hamilton-Jacobi problem, by reformulating the optimal visiting as a collection of time-dependent optimal stopping problems.
