Due to nonholonomic dynamics, the motion planning of nonholonomic robots is always a difficult problem. This letter presents a Discrete States-based Trajectory Planning(DSTP) algorithm for autonomous nonholonomic robots. The proposed algorithm represents the trajectory as x and y positions, orientation angle, longitude velocity and acceleration, angular velocity, and time intervals. More variables make the expression of optimization and constraints simpler, reduce the error caused by too many approximations, and also handle the gear shifting situation. L-BFGS-B is used to deal with the optimization of many variables and box constraints, thus speeding up the problem solving. Various simulation experiments compared with prior works have validated that our algorithm has an order-of-magnitude efficiency advantage and can generate a smoother trajectory with a high speed and low control effort. Besides, real-world experiments are also conducted to verify the feasibility of our algorithm in real scenes. We will release our codes as ros packages.
翻译:由于非蛋白质学动态,非蛋白质学机器人的动作规划总是一个困难的问题。 这封信为自主的非蛋白质学机器人提供了一个基于国家的分解轨迹规划算法。 提议的算法代表了x和y位置、 方向角度、 经度速度和加速度、 角速度和时间间隔的轨迹。 更多的变量使优化和制约的表达更加简单, 减少过多近似造成的错误, 并处理齿轮变化情况 。 L- BFGS- B 被用来处理许多变量和框限制的优化, 从而加速解决问题。 与先前的工程相比, 各种模拟实验证实我们的算法具有一定的磁力效率优势, 并能够产生高速和低控制努力的更顺畅的轨迹。 此外, 还进行了现实世界实验, 以验证我们算法在真实场中的可行性 。 我们将发布我们的代码作为罗斯包 。