Rescheduling policies for large-scale task allocation of autonomous straddle carriers under uncertainty at automated container terminals

This paper investigates replanning strategies for container-transportation task allocation of autonomous Straddle Carriers (SC) at automated container terminals. The strategies address the problem of large-scale scheduling in the context of uncertainty (especially uncertainty associated with unexpected events such as the arrival of a new task). Two rescheduling policies–Rescheduling New arrival Jobs (RNJ) policy and Rescheduling Combination of new and unexecuted Jobs (RCJ) policy–are presented and compared for long-term Autonomous SC Scheduling (ASCS) under the uncertainty of new job arrival. The long-term performance of the two rescheduling policies is evaluated using a multi-objective cost function (i.e., the sum of the costs of SC travelling, SC waiting, and delay of finishing high-priority jobs). This evaluation is conducted based on two different ASCS solving algorithms–an exact algorithm (i.e., branch-and-bound with column generation (BBCG) algorithm) and an approximate algorithm (i.e., auction algorithm)–to get the schedule of each short-term planning for the policy. Based on the map of an actual fully-automated container terminal, simulation and comparative results demonstrate the quality advantage of the RCJ policy compared with the RNJ policy for task allocation of autonomous straddle carriers under uncertainty. Long-term testing results also show that although the auction algorithm is much more efficient than the BBCG algorithm for practical applications, it is not effective enough, even when employed by the superior RCJ policy, to achieve high-quality scheduling of autonomous SCs at the container terminals.     

Scalable multi-radio communication in modular robots

Decentralized control of self-reconfiguring modular robots requires reliable inter-module communication. Communication links must tolerate module misalignment and implement the neighbor-to-neighbor communication model. In this paper, we propose a wireless system based on multiple radios per module that addresses these challenges. Although the capacity of general wireless mesh networks is known to rapidly decrease with network size, we show that a multi-radio single-channel system has constant capacity in square and cubic lattices of infinite size. We validate the performance of such a system in a testbed with 15 unactuated modules using synthetic data and a benchmark decentralized algorithm. We also demonstrate automatic neighbor detection. The main benefits of radio communication in modular robots are tolerance to module misalignment and to eliminate the tight coupling between communication and mechanical design necessitated by typical existing infrared and wired systems. Our results are the first to establish the feasibility of radio as the primary means of inter-module communication in modular robots.     

Adaptive tracking control of an autonomous underwater vehicle

This paper presents the trajectory tracking control of an autonomous underwater vehicle(AUV). To cope with parametric uncertainties owing to the hydrodynamic effect, an adaptive control law is developed for the AUV to track the desired trajectory. This desired state-dependent regressor matrix-based controller provides consistent results under hydrodynamic parametric uncertainties.Stability of the developed controller is verified using the Lyapunov s direct method. Numerical simulations are carried out to study the efficacy of the proposed adaptive controller.     

UWSNs中基于AUV移动的覆盖盲区修复算法

提出了一种水下无线传感器网络(UWSNs)中基于自主水下航行器(AUV)移动的覆盖算法。首先将要覆盖的区域网格化,然后以适当的策略遍历各个小格,从而实现盲区的覆盖修复。该算法克服了水下环境复杂未知、覆盖场景多样化而难以可靠覆盖的问题,同时使得AUV路径移动消耗最小化。文中还对3D场景和多AUVs协同等情况进行了分析和探讨。仿真实验表明,该算法在覆盖盲区规则、不规则或不连续等场景下均有较好的表现。     

面向自主Web服务的态势信息监视模型及其实现技术

为了应对互联网环境的开放性和动态性,需要加强传统服务的自主性并对其服务态势状况进行有效监视和管理,从而为自主Web服务的灵活应用以及适应调整提供有效支持。在传统的SOA架构基础之上,对Web服务进行了自主化扩展,提出了自主Web服务的态势模型及其监视架构,设计和实现了相应的软件平台,并开展了案例分析来验证模型和实现技术的可行性。     

Dynamic surface control-backstepping based impedance control for 5-DOF flexible joint robots

A new impedance controller based on the dynamic surface control-backstepping technique to actualize the anticipant dynamic relationship between the motion of end-effector and the external torques was presented. Comparing with the traditional backstepping method that has “explosion of terms” problem, the new proposed control system is a combination of the dynamic surface control technique and the backstepping. The dynamic surface control (DSC) technique can resolve the “explosion of terms” problem that is caused by differential coefficient calculation in the model, and the problem can bring a complexity that will cause the backstepping method hardly to be applied to the practical application, especially to the multi-joint robot. Finally, the validity of the method was proved in the laboratory environment that was set up on the 5-DOF (degree of freedom) flexible joint robot. Tracking errors of DSC-backstepping impedance control that were 2.0 and 1.5 mm are better than those of backstepping impedance control which were 3.5 and 2.5 mm in directions X, Y in free space, respectively. And the anticipant Cartesian impedance behavior and compliant behavior were achieved successfully as depicted theoretically.     

基于PSO的多机器人编队控制

提出了一种新的编队算法。该算法针对不同的编队形状,根据机器人的位置信息,构造不同的函数,利用群体智能优化算法中的微粒群算法进行函数优化,优化过程中的最优解作为机器人的运动方向。最后利用该算法实现了线形、三角形、六边形和圆形编队,仿真结果表明了该算法的有效性。     

一种可重构机器人运动学求解方法

针对可重构机器人没有统一的运动学求解形式问题,提出通过构形平面匹配方法求解可重构机器人的运动学.采用改进形式的D-H建模方法,可自动形成可重构机器人运动学模型;将机器人在目标点的位形分解成若干个构形平面,通过三级构形平面的匹配,可求得具有单一串连形式可重构机器人运动学逆解;对搭建的6自由度机器人和8自由度机器人构形的运动学进行实例仿真.仿真结果表明,采用有限个构形平面匹配方法能够求解出可重构机器人运动学,验证了算法的正确性和实用性.     

基于区块链的侦查机器人实时避障与航线控制

为弥补侦查机器人行进灵活性不足的缺陷,降低无故运动碰撞事件的发生几率,提出基于区块链的侦查机器人实时避障与航线控制算法;利用超声信号处理电路,提取可供直接应用的侦查运动节点,联合已完成配置的MoveIt避障程序,实现对侦查机器人的实时避障运动规划;在此基础上,设置LQR控制器,在控制机器人侦查航速的同时,建立必要运动操纵方程,完成对侦查机器人的运动航线控制,提升与运动设备元件相关的行进灵活性;完善P2P网络平台,以待交互的运动数据作为处理支持条件,将所有侦查信息封装至同一区块组织中,完成基于区块链的避障控制原理研究,实现侦查机器人实时避障与航线控制算法的搭建;对比实验结果表明,应用基于区块链的控制算法后,C-Space参数极值超过8.0,RRT灵敏度也提升至75%,实现了对侦查机器人的灵活性行进控制,有效抑制了无故运动碰撞事件的出现。     

一种水下群机器人路径规划算法的形式化研究

为了增强基于遗传算法的水下群机器人路径规划算法正确性的说服力,使用定理证明对其进行形式化研究,给出算法在定理证明器HOL4中的形式化模型。基于算法形式化的一般步骤,首先对算法的设计进行了详细的分析,指出算法设计的核心步骤与建模难点。在此基础上建立了总体形式化建模框架,然后对其进行化简,得到种群初始化、选择、交叉三个核心模块。接着给出模型中要用到的基本数据类型的形式化描述,并分别对三个模块进行形式化描述,最终得到算法的形式化模型。通过证明与模型相关的97条性质,说明了模型的合理性及有效性,在此模型的基础上,可以完成对算法的形式化验证,同时还能拓展HOL4的应用范围。