Energy-efficient receding horizon trajectory planning of high-speed trains using real-time traffic information

Optimal trajectory planning of high-speed trains (HSTs) aims to obtain such speed curves that guarantee safety, punctuality, comfort and energy-saving of the train. In this paper, a new shrinking horizon model predictive control (MPC) algorithm is proposed to plan the optimal trajectories of HSTs using real-time traffic information. The nonlinear longitudinal dynamics of HSTs are used to predict the future behaviors of the train and describe variable slopes and variable speed limitations based on real-time traffic information. Then optimal trajectory planning of HSTs is formulated as the shrinking horizon optimal control problem with the consideration of safety, punctuality, comfort and energy consumption. According to the real-time position and running time of the train, the shrinking horizon is updated to ensure the recursive feasibility of the optimization problem. The optimal speed curve of the train is computed by online solving the optimization problem with the Radau Pseudo-spectral method (RPM). Simulation results demonstrate that the proposed method can satisfy the requirements of energy efficiency and punctuality of the train.     

Novel integrated optimization algorithm for trajectory planning of robot manipulators based on integrated evolutionary programming

Optimal trajectory plarmmg for robot manipulators plays an important role in implementing the high productivity for robots. The performance indexes used in optimal trajectory planning are classified into two roam categories:optimum traveling time and optimum mechanical energy of the actuators. The current trajectory planning algorithms are designed based on one of the above two performance indexes. So far, there have been few planning algorithms designed to satisfy two performance indexes simultaneously. On the other hand, some deficiencies arise in the existing integrated optimization algorithms of trajectory planning.In order to overcome those deficiencies, the integrated optimization algorithms of trajectory planning are presented based on the complete analysis for trajectory planning of robot manipulators. In the algorithm, two object functiom are designed based on the specific weight coefficient method and “ideal point” strategy. Moreover, based on the features of optimization problem, the intensified evolutionary programming is proposed to solve the corresponding optimization model. Especially, for the Stanford Robot, the high-quality solutions are found at a lower cost.     

基于闭塞区间的高速列车运行时间与节能协同优化方法

提出了一种高速列车运行时间与节能协同优化方法.针对由动态调度层、优化控制层、跟踪控制层组成的列车运行控制与动态调度一体化结构,设计了面向动态调度层和优化控制层的列车运行时间调整策略和节能速度位置曲线.基于高速铁路闭塞区间,建立了列车区间模型和列车速度曲线节能优化模型.利用模型预测控制方法对列车区间运行时间进行调整,优化列车总延误时间;根据调整后的区间运行时间设计列车运行优化速度位置曲线,减少列车运行能耗.仿真算例验证了设计的运行时间与节能协同优化策略的有效性.     

Smooth and time‐optimal trajectory planning for industrial manipulators along specified paths

This article presents a method for determining smooth and time‐optimal path constrained trajectories for robotic manipulators and investigates the performance of these trajectories both through simulations and experiments. The desired smoothness of the trajectory is imposed through limits on the torque rates. The third derivative of the path parameter with respect to time, the pseudo‐jerk, is the controlled input. The limits on the actuator torques translate into state‐dependent limits on the pseudo‐acceleration. The time‐optimal control objective is cast as an optimization problem by using cubic splines to parametrize the state space trajectory. The optimization problem is solved using the flexible tolerance method. The experimental results presented show that the planned smooth trajectories provide superior feasible time‐optimal motion. © 2000 John Wiley & Sons, Inc.     

Multiobjective trajectory optimization for electric trains

This paper develops a method for generating Pareto efficient trajectories that provide optimal tradeoffs between two conflicting attributes-the total energy consumed and the total time taken to complete each trajectory. Straightforward formulations of the multiobjective optimization problem in these attributes are difficult to solve because of certain nonlinearities in train models and certain constraints on train trajectories. A discrete reformulation is developed to circumvent these difficulties and produce computationally feasible algorithms. The results from the algorithms can be used to develop operating strategies for existing systems and to compare hardware alternatives in planning new systems. An illustration is included.     

Globally Optimal Trajectory Planning for Redundant Manipulators using State Space Augmentation Method

The off-line global trajectory planning for kinematically redundant manipulators is formulated as an optimization problem whose solution is obtained by applying the Pontryagins Maximum Principle. The state space augmentation method is developed to obtain a set of optimal joint trajectories corresponding to a singularity-free Cartesian path which avoids joint limits and conserves joint configuration in cyclic motion. Results of computer simulation conducted on a three-degree-of-freedom planar manipulator are presented and discussed.     

快速连续反应-避障作业环境下的七自由度灵巧臂轨迹规划

人类经长期学习训练后能对高速物体 (如棒球、乒乓球等)具有快速连续反应作业的运动技能, 从深层次上揭示是由于人体在其训练过程中不断学习优选了相应手臂的动作轨迹, 并储存了丰富的经验和知识. 受人体手臂动作此行为机制启发, 本文提出一种 7-DOF灵巧臂快速连续反应-避障作业的轨迹规划方法. 该方法将灵巧臂对高速物体目标作业的轨迹规划问题转化为动作轨迹参数化优选问题, 考虑作业过程中灵巧臂的机构物理约束和障碍约束条件, 以灵巧臂目标可作业度指标构建适应度函数, 采用粒子群优化 (Particle swarm optimization, PSO)方法优选作业轨迹中的冗余参数; 在此基础上 利用灵巧臂动作轨迹参数化优选方法构建相应作业环境下的知识数据库, 实现灵巧臂对高速物体目标的快速连续反应作业. 以仿人机器人乒乓球对弈作业为例, 将该方法应用于 7-DOF灵巧臂乒乓球作业的轨迹规划中. 数值实验及实际对弈试验结果表明, 该方法不仅能使灵巧臂所规划的轨迹 满足灵巧臂机构物理约束与障碍约束条件, 同时能实现灵巧臂对乒乓球体的快速连续反应作业, 验证了该方法的有效性.     

Drive Train Optimization for Industrial Robots

This paper presents an optimization strategy for finding the trade-offs between cost, lifetime, and performance when designing the drive train, i.e., gearboxes and electric motors, for new robot concepts. The method is illustrated with an example in which the drive trains of two principal axes on a six-axis serial manipulator are designed. Drive train design for industrial robots is a complex task that requires a concurrent design approach. For instance, the mass properties of one motor affect the torque requirements for another, and the method needs to consider several drive trains simultaneously. Since the trajectory has a large impact on the load on the actuators when running a robot, the method also includes the trajectory generation itself in the design loop. It is shown how the design problem can be formalized as an optimization problem. A non-gradient-based optimization algorithm that can handle mixed variable problems is used to solve the highly nonlinear problem. The outcome from an industrial point of view is minimization of cost and the simulataneous balancing of the trade-off between lifetime and performance.      

Receding-Horizon Trajectory Planning for Under-Actuated Autonomous Vehicles Based on Collaborative Neurodynamic Optimization

This paper addresses a major issue in planning the trajectories of under-actuated autonomous vehicles based on neurodynamic optimization. A receding-horizon vehicle trajectory planning task is formulated as a sequential global optimization problem with weighted quadratic navigation functions and obstacle avoidance constraints based on given vehicle goal configurations. The feasibility of the formulated optimization problem is guaranteed under derived conditions. The optimization problem is sequentially solved via collaborative neurodynamic optimization in a neurodynamics-driven trajectory planning method/procedure. Simulation results with under-actuated unmanned wheeled vehicles and autonomous surface vehicles are elaborated to substantiate the efficacy of the neurodynamics-driven trajectory planning method.      

On optimal constrained trajectory planning in 3D environments

A novel approach to generating acceleration-based optimal smooth piecewise trajectories is proposed. Given two configurations (position and orientation) in 3D, we search for the minimal energy trajectory that minimizes the integral of the squared acceleration, opposed to curvature, which is widely investigated. The variation in both components of acceleration: tangential (forces on gas pedal or brakes) and normal (forces that tend to drive a car on the road while making a turn) controls the smoothness of generated trajectories. In the optimization process, our objective is to search for the trajectory along which a free moving robot is able to accelerate (decelerate) to a safe speed in an optimal way. A numerical iterative procedure is devised for computing the optimal piecewise trajectory as a solution of a constrained boundary value problem. The resulting trajectories are not only smooth but also safe with optimal velocity (acceleration) profiles and therefore suitable for robot motion planning applications. Experimental results demonstrate this fact.     

基于滚动时域优化的无人飞行器轨迹规划

给出了寻求无人飞行器的最优轨迹的一种方法,其问题描述为使飞行器从初始状态飞行到目标状态,同时避免撞到障碍物。基于混合整数规划的滚动时域优化方法用来求解飞行器的轨迹规划问题。给出的仿真结果显示此方法的有效性以及在复杂环境下的可实时计算性。     

轮手一体机器人能量次优重构规划方法

模块化机器人的重构规划中,由于各模块的目标分配与其轨迹规划之间的耦合关系导致组合爆炸问题.本文提出一种基于简化模型的能量次优规划方法,将重构规划问题转化为最优控制问题,实现目标分配与轨迹规划的解耦.通过求解由Hamilton-Jacobi-Bellman（HJB）方程描述的最优控制问题,得到简化模型的值函数和最优轨迹.各模块的运动目标由值函数的吸引域决定.通过在最优轨迹附近的次优区域内搜索得到实际运动轨迹,提高了搜索效率.仿真实验结果表明,该方法能够选择合适的模块组合,并能在障碍物环境中生成满足机器人动力学约束的运动轨迹.     

A real-time optimal energy-saving walking pattern generator based on gradient descent method and linear quadratic control

Many recent approaches have successfully generated a stable walking pattern for biped robots, but discussions about its optimization are relatively few. In this paper, a Center of Gravity (COG) trajectory optimization method is proposed to minimize the cost function of joint torque, joint limit, and joint speed limit. The linear quadratic control-based inverted pendulum controller optimizes the COG trajectories in sagittal and lateral directions with the COG height trajectory. The COG height trajectory is optimized by finding the derivative of the cost function with respect to the COG height offline. Then the proposed walking pattern generator builds the COG height trajectory database of different walking steps for online connection of a walking pattern. The walking pattern generator is verified by experiments and simulations of different step cycles with our humanoid robot, NINO, and it can clearly reduce the required joint torque of the robot while walking. In addition, compared with the fixed COG height trajectory, the energy consumption is reduced by 14% from the experimental results. Thus, the method succeeds in generating a more energy-saving walking pattern.     

Minimum-Energy Trajectory Generation for Cornering with a Fixed Heading for Three-Wheeled Omni-Directional Mobile Robots

The minimum-energy trajectory generation problem of cornering with a fixed heading is solved for three-wheeled omni-directional mobile robots (TOMRs). To maximize the total operation time of a mobile robot with carried batteries having finite energy, we have chosen a practical cost function to be the total energy drawn from the batteries. Then, we formulate the minimum-energy trajectory generation problem of executing a cornering motion with a fixed heading for TOMRs with given dynamics including actuator motors. The optimal control theory using a Hamiltonian function and a numerical method are used to obtain the minimum-energy trajectory, which gives the velocity profile in analytic form. Performance analyses are conducted with various simulations and the consumed energy using obtained minimum-energy trajectory is compared with a typical conventional trajectory with a trapezoidal velocity profile, which reveals that an energy savings of up to 18.7 % is achieved. To validate the actual performance of our trajectory, we implemented and tested an accurate trajectory following system which utilizes a resolved acceleration controller.     

工业机器人时间最优轨迹规划及轨迹控制的理论与实验研究

提出了一种用于工业机器人时间最优轨迹规划及轨迹控制的新方法, 它可以确保在关节位移、速度、加速度以及二阶加速度边界值的约束下, 机器人手部沿笛卡尔空间中规定路径运动的时间最短. 在这种方法中, 所规划的关节轨迹都采用二次多项式加余弦函数的形式, 不仅可以保证各关节运动的位移、速度、加速度连续而且还可以保证各关节运动的二阶加速度连续. 采用这种方法, 既可以提高机器人的工作效率又可以延长机器人的工作寿命. 以PUMA 5 6 0机器人为对象进行了计算机仿真和机器人实验, 结果表明这种方法是正确和有效的. 它为工业机器人在非线性运动学约束条件下的时间最优轨迹规划及控制问题提供了一种较好的解决方案.     

A Technique to Analytically Formulate and to Solve the 2-Dimensional Constrained Trajectory Planning Problem for a Mobile Robot

A new technique for trajectory planning of a mobile robot in a two-dimensional space is presented in this paper. The main concept is to use a special representation of the robot trajectory, namely a parametric curve consisting in a sum of harmonics (sine and cosine functions), and to apply an optimization method to solve the trajectory planning problem for the parameters (i.e., the coefficients) appearing in the sum of harmonics. This type of curve has very nice features with respect to smoothness and continuity of derivatives, of whatever order. Moreover, its analytical expression is available in closed form and is very suitable for both symbolic and numerical computation. This enables one to easily take into account kinematic and dynamic constraints set on the robot motion. Namely, non-holonomic constraints on the robot kinematics as well as requirements on the trajectory curvature can be expressed in closed form, and act as input data for the trajectory planning algorithm. Moreover, obstacle avoidance can be performed by expressing the obstacle boundaries by means of parametric curves as well. Once the expressions of the trajectory and of the constraints have been set, the trajectory planning problem can be formulated as a standard mathematical problem of constrained optimization, which can be solved by any adequate numerical method. The results of several simulations are also reported in the paper to show the effectiveness of the proposed technique to generate trajectories which meet all requirements relative to kinematic and dynamic constraints, as well as to obstacle avoidance.     

一类非线性时变系统的迭代学习控制

针对一类具有任意初态的不确定非线性时变系统,应用校正期望轨迹方法把任意初态问题转换为零初始误差的变期望轨迹的迭代学习控制问题,提出了求解校正期望轨迹的过渡轨迹的计算方法.然后,针对变期望轨迹问题提出了一种新的迭代学习控制算法,在算法中引入了期望轨迹的高阶导数来克服期望轨迹的变化,并通过设计稳定的跟踪误差滑动面来处理系统中非线性时变不确定性.论文给出了相关定理,并应用类Lyapunov方法给出了详细证明.仿真结果表明所提出的算法是有效的,该算法不需要系统的模型结构信息,比自适应迭代学习控制算法具有更宽的适用范围.     

A hybrid strategy for the time- and energy-efficient trajectory planning of parallel platform manipulators

In planning the trajectories of motor-driven parallel platform manipulators, the objective is to identify the trajectory which accomplishes the assigned motion with the minimal travel time and energy expenditure subject to the constraints imposed by the kinematics and dynamics of the manipulator structure. In this study, the possible trajectories of the manipulator are modeled using a parametric path representation, and the optimal trajectory is then obtained using a hybrid scheme comprising the particle swarm optimization method and the local conjugate gradient method. The numerical results confirm the feasibility of the optimized trajectories and show that the hybrid scheme is not only more computationally efficient than the standalone particle swarm optimization method, but also yields solutions of a higher quality.     

Indirect robot model learning for tracking control

Learning task-space tracking control on redundant robot manipulators is an important but difficult problem. A main difficulty is the non-uniqueness of the solution: a task-space trajectory has multiple joint-space trajectories associated, therefore averaging over non-convex solution space needs to be done if treated as a regression problem. A second class of difficulties arise for those robots when the physical model is either too complex or even not available. In this situation machine learning methods may be a suitable alternative to classical approaches. We propose a learning framework for tracking control that is applicable for underactuated or non-rigid robots where an analytical physical model of the robot is unavailable. The proposed framework builds on the insight that tracking problems are well defined in the joint task- and joint-space coordinates and consequently predictions can be obtained via local optimization. Physical experiments show that state-of-the art accuracy can be achieved in both online and offline tracking control learning. Furthermore, we show that the presented method is capable of controlling underactuated robot architectures as well.     

Energy Saving Testing of Circuits

A question is considered as to the development of a procedure of testing combinational circuits with due regard for the power consumed during tests. It is shown that in the general case, the optimization problem of the consumable energy reduces to the known problem of discrete mathematics—the traveling salesman problem.