P1 If we have a curve c, from a point p0 to a point p1 then the line integral for work depends only on the end points and not on the actual path we chose.
如果曲线c，起点为P0，终点为1，那么计算所做功的线积分，只与端点位置有关，而与我们选择的路径无关。
OK, so the claim is if I have a line integral to compute, that it doesn't matter which path I take b as long as it goes from point a to point b.
也就是，如果我需要计算一个线积分，无论我取怎样的路径,只要路径是从点a到点。
Supports a wide range of motion modes, including point-to-point, jog, segmented, master-slave, and arbitrary path with PVT cubic interpolation.
支持多种运动模式，包括点到点，慢跑，分割，主从，并任意路径的PVT三次插值。
Therefore, most people's career paths wind up looking more like a forest path or the course of a river than a straight flight path from point a to point B.
因此，大多数人们的职业生涯的结果看起来更像一个森林的小路或者一条小河的航线而不是一条从点a直接到点b的直线。
This paper start with the basic point to point planning in the right angle space and gradually go deep into the path planning problem of curve planning and arbitrary path point.
本文从直角坐标空间中基本的点到点的规划方法人手，逐步深入到曲线的规划问题和过任意路径点的轨迹规划问题。
First of all, the paper USES work Load Point assessment system, work breakdown structure and critical path method to build the control and monitor system based on the work Load Point system.
首先，本文运用工作负荷点系统的评估系统、项目分解结构以及关键路线法构建了基于工作负荷点系统的进度度量监控体系。
Secondly, for each searching path, adaptive searching schemes are designed to extract the true contour point, and to discard false contour point.
然后，利用设计的自适应搜索算法，对于每一条搜索路径提取出真正的轮廓点；
The network can converge to this equivalence-point from arbitrary initial point and this equivalence-point corresponds exactly all the shortest path pairs of the graph.
并证明，该方法构造的神经网络只有一个稳定点，且从任意初始点均可收敛到该稳定点，该稳定点恰好对应图的所有最短路径。
Path-Finding algorithms mainly solve how to find a path from the start point to the finish point on the map.
寻径算法主要解决如何从图中寻找一条从起点到目标点的路径问题。
If it was non-reversible, I would be allowed to put an initial point and a final point, but I wouldn't be allowed to put a path between them like this, connecting them together.
如果是不可逆过程，我可以画出过程的初态点，和末态点，但是我不能再像这样，画出连接这两个点的，路径曲线来。
To determine the interiors of closed figures in the alternate mode, draw a line from any arbitrary start point in the path to some point obviously outside the path.
为在交替模式中确定闭合图形的内部，绘制一条从路径中的任意起始点到明显位于路径外的某一点的直线。
Path planning is to find a trajectory from the initial point to the target point which satisfies a certain performance optimal index under some constraints.
路径规划问题一般是指在一定约束条件下，寻找从给定起始点到给定目标点之前满足某种性能指标最优的路径轨迹。
Path planning is to find a trajectory from the initial point to the target point which satisfies a certain performance optimal index under some constraints.
路径规划问题一般是指在一定约束条件下，寻找从给定起始点到给定目标点之前满足某种性能指标最优的路径轨迹。
应用推荐