During the use of robotics in applications such as antiterrorism or combat,a motion-constrained pursuer vehicle,such as a Dubins unmanned surface vehicle(USV),must get close enough(within a prescribed zero or positive...During the use of robotics in applications such as antiterrorism or combat,a motion-constrained pursuer vehicle,such as a Dubins unmanned surface vehicle(USV),must get close enough(within a prescribed zero or positive distance)to a moving target as quickly as possible,resulting in the extended minimum-time intercept problem(EMTIP).Existing research has primarily focused on the zero-distance intercept problem,MTIP,establishing the necessary or sufficient conditions for MTIP optimality,and utilizing analytic algorithms,such as root-finding algorithms,to calculate the optimal solutions.However,these approaches depend heavily on the properties of the analytic algorithm,making them inapplicable when problem settings change,such as in the case of a positive effective range or complicated target motions outside uniform rectilinear motion.In this study,an approach employing a high-accuracy and quality-guaranteed mixed-integer piecewise-linear program(QG-PWL)is proposed for the EMTIP.This program can accommodate different effective interception ranges and complicated target motions(variable velocity or complicated trajectories).The high accuracy and quality guarantees of QG-PWL originate from elegant strategies such as piecewise linearization and other developed operation strategies.The approximate error in the intercept path length is proved to be bounded to h^(2)/(4√2),where h is the piecewise length.展开更多
By using a phase-plane analysis method,the minimum-time trajectory plan-ning problem of a manipulator moving along a given geometric path subject to the con-straints of joint velocities and accelerations is solved in ...By using a phase-plane analysis method,the minimum-time trajectory plan-ning problem of a manipulator moving along a given geometric path subject to the con-straints of joint velocities and accelerations is solved in this paper.The simulation resultfor the first three joints of PUMA-560 is given.展开更多
The time-optimal trajectory planning is proposed under kinematic and dynamic constraints for a 2-DOF wheeled robot. In order to make full use of the motor’s capacity, we calculate the maximum torque and the minimum t...The time-optimal trajectory planning is proposed under kinematic and dynamic constraints for a 2-DOF wheeled robot. In order to make full use of the motor’s capacity, we calculate the maximum torque and the minimum torque by considering the maximum heat-converted power generated by the DC motor. The shortest path is planned by using the geometric method under kinematic constraints. Under the bound torques, the velocity limits and the maximum acceleration (deceleration) are obtained by combining with the dynamics. We utilize the phase-plane analysis technique to generate the time optimal trajectory based on the shortest path. At last, the computer simulations for our laboratory mobile robot were performed. The simulation results prove the proposed method is simple and effective for practical use.展开更多
The solution of minimum-time feedback optimal control problems is generally achieved using the dynamic programming approach,in which the value function must be computed on numerical grids with a very large number of p...The solution of minimum-time feedback optimal control problems is generally achieved using the dynamic programming approach,in which the value function must be computed on numerical grids with a very large number of points.Classical numerical strategies,such as value iteration(VI)or policy iteration(PI)methods,become very inefficient if the number of grid points is large.This is a strong limitation to their use in real-world applications.To address this problem,the authors present a novel multilevel framework,where classical VI and PI are embedded in a full-approximation storage(FAS)scheme.In fact,the authors will show that VI and PI have excellent smoothing properties,a fact that makes them very suitable for use in multilevel frameworks.Moreover,a new smoother is developed by accelerating VI using Anderson’s extrapolation technique.The effectiveness of our new scheme is demonstrated by several numerical experiments.展开更多
针对正交时频空(Orthogonal Time Frequency Space, OTFS)调制系统中均衡器性能不佳及线性滤波器复杂度较高等问题,提出了一种LU(Lower-Upper)分解与迭代最小均方误差(Iterative Minimum Mean Square Error, IMMSE)均衡器结合的OTFS系...针对正交时频空(Orthogonal Time Frequency Space, OTFS)调制系统中均衡器性能不佳及线性滤波器复杂度较高等问题,提出了一种LU(Lower-Upper)分解与迭代最小均方误差(Iterative Minimum Mean Square Error, IMMSE)均衡器结合的OTFS系统信号检测算法(LU-IMMSE)。该算法依据时延多普勒域稀疏信道矩阵的特征,采用一种低复杂度的LU分解方法,以避免MMSE均衡器求解矩阵逆的过程,在保证均衡器性能的前提下降低了均衡器复杂度。在OTFS系统中引入一种IMMSE均衡器,通过不断迭代更新发送符号均值和方差这些先验信息来逼近MMSE均衡器最优估计值。LU-IMMSE算法通过调节迭代次数可以有效降低误比特率。在比特信噪比为8 dB时,5次迭代后的LU-IMMSE均衡器误比特率相比传统的MMSE均衡器降低了约11 dB。随着迭代次数的增大,较传统IMMSE算法降低了计算复杂度。在最大时延系数为4、符号数为16的情况下,与直接求逆相比,所提出的低复杂度LU分解方法降低了约91.72%的矩阵求逆计算复杂度。展开更多
基金supported by the National Natural Sci‐ence Foundation of China(Grant No.62306325)。
文摘During the use of robotics in applications such as antiterrorism or combat,a motion-constrained pursuer vehicle,such as a Dubins unmanned surface vehicle(USV),must get close enough(within a prescribed zero or positive distance)to a moving target as quickly as possible,resulting in the extended minimum-time intercept problem(EMTIP).Existing research has primarily focused on the zero-distance intercept problem,MTIP,establishing the necessary or sufficient conditions for MTIP optimality,and utilizing analytic algorithms,such as root-finding algorithms,to calculate the optimal solutions.However,these approaches depend heavily on the properties of the analytic algorithm,making them inapplicable when problem settings change,such as in the case of a positive effective range or complicated target motions outside uniform rectilinear motion.In this study,an approach employing a high-accuracy and quality-guaranteed mixed-integer piecewise-linear program(QG-PWL)is proposed for the EMTIP.This program can accommodate different effective interception ranges and complicated target motions(variable velocity or complicated trajectories).The high accuracy and quality guarantees of QG-PWL originate from elegant strategies such as piecewise linearization and other developed operation strategies.The approximate error in the intercept path length is proved to be bounded to h^(2)/(4√2),where h is the piecewise length.
文摘By using a phase-plane analysis method,the minimum-time trajectory plan-ning problem of a manipulator moving along a given geometric path subject to the con-straints of joint velocities and accelerations is solved in this paper.The simulation resultfor the first three joints of PUMA-560 is given.
文摘The time-optimal trajectory planning is proposed under kinematic and dynamic constraints for a 2-DOF wheeled robot. In order to make full use of the motor’s capacity, we calculate the maximum torque and the minimum torque by considering the maximum heat-converted power generated by the DC motor. The shortest path is planned by using the geometric method under kinematic constraints. Under the bound torques, the velocity limits and the maximum acceleration (deceleration) are obtained by combining with the dynamics. We utilize the phase-plane analysis technique to generate the time optimal trajectory based on the shortest path. At last, the computer simulations for our laboratory mobile robot were performed. The simulation results prove the proposed method is simple and effective for practical use.
文摘The solution of minimum-time feedback optimal control problems is generally achieved using the dynamic programming approach,in which the value function must be computed on numerical grids with a very large number of points.Classical numerical strategies,such as value iteration(VI)or policy iteration(PI)methods,become very inefficient if the number of grid points is large.This is a strong limitation to their use in real-world applications.To address this problem,the authors present a novel multilevel framework,where classical VI and PI are embedded in a full-approximation storage(FAS)scheme.In fact,the authors will show that VI and PI have excellent smoothing properties,a fact that makes them very suitable for use in multilevel frameworks.Moreover,a new smoother is developed by accelerating VI using Anderson’s extrapolation technique.The effectiveness of our new scheme is demonstrated by several numerical experiments.
文摘针对正交时频空(Orthogonal Time Frequency Space, OTFS)调制系统中均衡器性能不佳及线性滤波器复杂度较高等问题,提出了一种LU(Lower-Upper)分解与迭代最小均方误差(Iterative Minimum Mean Square Error, IMMSE)均衡器结合的OTFS系统信号检测算法(LU-IMMSE)。该算法依据时延多普勒域稀疏信道矩阵的特征,采用一种低复杂度的LU分解方法,以避免MMSE均衡器求解矩阵逆的过程,在保证均衡器性能的前提下降低了均衡器复杂度。在OTFS系统中引入一种IMMSE均衡器,通过不断迭代更新发送符号均值和方差这些先验信息来逼近MMSE均衡器最优估计值。LU-IMMSE算法通过调节迭代次数可以有效降低误比特率。在比特信噪比为8 dB时,5次迭代后的LU-IMMSE均衡器误比特率相比传统的MMSE均衡器降低了约11 dB。随着迭代次数的增大,较传统IMMSE算法降低了计算复杂度。在最大时延系数为4、符号数为16的情况下,与直接求逆相比,所提出的低复杂度LU分解方法降低了约91.72%的矩阵求逆计算复杂度。
