This paper proposes a reusable minimum-timepath algorithm for the solution to a special time-dependent network, directed acyclic network.
本文提出一种特殊最短路径算法，即在有向无环网络中最小时间路径算法的一种实现。
2
This paper presents a twice planning approach to solving minimum-time trajectory planning problem for robotic manipulators. Pre-planning is performed on the specified path.
本文针对机器人最小时间轨迹规划问题提出了一种二次规划的优化方法。
3
Then a cooperative planning model was established, which could plan a feasible path for each UAV, which meeted both the requirements of time-coordination and the minimum cost.