有向无环图上k步可达查询优化算法

k步可达查询用于在给定的有向无环图（DAG）中回答两点之间是否存在长度不超过k的路径。针对现有方法的索引规模大、查询处理效率低的问题,提出一种基于部分点的双向最短路径索引来提升索引的可达信息覆盖率,并提出一组优化规则来减小索引规模;然后提出基于简化图的正反互逆拓扑索引来加速回答不可达查询;最后提出远距离优先的双向遍历策略来提高查询处理的效率。基于21个真实数据集（如引用网络、社交网络等）的实验结果表明,相比已有的高效方法PLL及BFSI-B,所提出的算法具有更小的索引规模和更快的查询响应速度。     

A simple characterization of optimal ARMA predictors

The coefficients of the optimal steady state k-step ahead predictor for an ARMA process in general depend on k. It is shown that a simple formula completely characterizes all these coefficients.     

基于激光传感器移动机器人的目标定位和多模式跟踪

移动机器人对运动目标的感知和跟踪是实现机器人与环境交互的一项重要能力。针对移动机器人以人为目标的跟踪中在复杂动态环境下经常出现的目标丢失和跟踪模式单一的问题,提出了基于机器学习的人物目标识别算法。该算法可以处理复杂环境下的目标检测和定位。同时设计了交互多模型跟踪算法,可以较好的跟踪以不规律模式运动的目标。最后在交龙移动机器人平台上实现了整个系统,验证了人物目标检测和多模式跟踪算法的鲁棒性和优越性。     

六足机器人动态目标检测与跟踪系统研究

动态目标检测与目标跟踪是图像领域的热点研究问题,为研究其在移动机器人领域的应用价值,设计了六足机器人动态目标检测与跟踪系统。针对非刚体运动目标容易被检测为多个分散区域的问题提出区域合并算法,并通过对称匹配、自适应外点滤除对运动背景进行精确补偿,最终基于背景补偿法实现对运动目标的精确检测。研究了基于KCF（Kernel Correlation Filter）的目标跟踪算法在六足机器人平台上的应用,设计了自适应跟踪算法实现六足机器人对运动目标的角度跟踪。将运动目标检测及跟踪算法应用于六足机器人系统。实验表明,在六足机器人移动过程中,系统可对运动目标进行精确检测与跟踪。     

移动机器人全覆盖信度函数路径规划算法

针对移动机器人全覆盖路径规划问题,给出一种基于栅格信度函数的全覆盖路径规划算法。目的是为了控制移动机器人能够遍历工作区域中所有的可到达点,同时保证能够自动避开障碍物。首先,根据环境的信息对栅格地图进行赋值,使用不同的函数值表示障碍物、已覆盖栅格和未覆盖栅格;其次,判断机器人是否陷入死区引入不同方向信度函数,对栅格函数值进行调整;最后,机器人根据栅格信度函数值规划覆盖路径。本文所提及的算法不仅能够引导移动机器人实现工作区域的全覆盖而且能够快速逃离死区,实现覆盖路径的低重复率。仿真实验中,通过与生物启发神经网络算法的比较,证明本文提及算法有更高的覆盖效率。     

带滚动约束轮移式机器人动态规划的研究

根据轮移式机器人的运动学模型,研究受到滚动约束轮移式机器人在动态环境中的运动规划问题.将快速随机搜索树算法与优化方法相结合,实现了一种新的算法,规划出既可避障又可满足机器人滚动约束的运动.将该算法运用到动态环境下机器人的运动规划中,并通过仿真表明该算法能较好地引导机器人在动态环境中实现满足滚动约束的避障路径.     

动态环境中基于改进粒子群的机器人路径规划

提出一种模糊隶属度函数对动态环境中机器人的运动状况进行建模,该建模方法不会无谓地牺牲机器人的可运动空间,可尽量减少机器人路径规划的约束强度;同时提出通过调整位置加权趋向无约束最优解的算子改进粒子群算法,提高算法的寻优速度。仿真结果表明,通过两者结合,可快速获得动态环境中的优化路径。     

Reaching a goal with directional uncertainty

We study two problems related to planar motion planning for robots with imperfect control, where, if the robot starts a linear movement in a certain commanded direction, we only know that its actual movement will be confined in a cone of angle centered around the specified direction.

First, we consider a single goal region, namely the “region at infinity”, and a set of polygonal obstacles, modeled as a set S of n line segments. We are interested in the region from where we can reach infinity with a directional uncertainty of . We prove that the maximum complexity of is O(n/⁵). Second, we consider a collection of k polygonal goal regions of total complexity m, but without any obstacles. Here we prove an O(k³m) bound on the complexity of the region from where we can reach a goal region with a directional uncertainty of . For both situations we also prove lower bounds on the maximum complexity, and we give efficient algorithms for computing the regions.     

基于蜂窝网结构的多目标自动辨识定位方法

针对移动蜂窝网对多目标难以检测识别且定位精度不高的问题,提出一种基于蜂窝网结构的多目标自动辨识定位方法。首先,根据对监测区域内目标源的多次定位结果方差来判别是否有多目标存在;其次,采用k-means无监督学习对定位点进行聚类,由于k-means算法的最优簇数难以确定,因此提出了一种基于波束分辨率的k值裂变算法来确定k值,并确定聚类中心;最后,为了提高接收信号的信噪比,通过各聚类中心确定波束方向,再使用基于线性约束的窄带波束形成器依次接收不同波束方向信号,分别对各目标源进行到达时间差定位。仿真结果表明,对于解决多目标定位问题,相对于时延估计算法和概率假设密度（PHD）滤波器算法,所提多目标自动辨识定位方法能够提高接收信号约10 dB的信噪比,对应的时延估计误差的克拉美罗下界能够下降约67%,定位精度相对误差可提高10个百分点以上,而且算法简洁有效,各次定位相对独立,具有较高的效率和较好的稳定性。     

Variable Structure Control of a Differentially Steered Wheeled Mobile Robot

This paper discusses dynamic modeling and robust control of a differentially steered mobile robot subject to wheel slip and external loads. Consideration of wheel slip and external loads is crucial for high load and/or high speed applications because they act as disturbances to the system. Furthermore, a tire model that adequately accounts for the tire/ground interaction is essential and Dugoff's pneumatic tire friction model is utilized herein in deriving the dynamic equations of motion of the mobile robot. It is shown that the dynamic equations satisfy the matching condition, and the variable structure control method is employed to design a tracking controller of the mobile robot. Numerical simulation shows the promise of the developed control algorithm.     

Smooth coverage path planning and control of mobile robots based on high-resolution grid map representation

This paper presents a new approach to a time and energy efficient online complete coverage solution for a mobile robot. While most conventional approaches strive to reduce path overlaps, this work focuses on smoothing the coverage path to reduce accelerations and yet to increase the average velocity for faster coverage. The proposed algorithm adopts a high-resolution grid map representation to reduce directional constraints on path generation. Here, the free space is covered by three independent behaviors: spiral path tracking, wall following control, and virtual wall path tracking. Regarding the covered region as a virtual wall, all the three behaviors adopt a common strategy of following the (physical or virtual) wall or obstacle boundaries for close coverage. Wall following is executed by a sensor-based reactive path planning control process, whereas the spiral (filling) path and virtual wall path are first modeled by their relevant parametric curves and then tracked via dynamic feedback linearization. For complete coverage, these independent behaviors are linked through a new path linking strategy, called a coarse-to-fine constrained inverse distance transform (CFCIDT). CFCIDT reduces the computational cost compared to the conventional constrained inverse distance transform (CIDT), which applies a region growing starting from the current robot position to find the nearest unexplored cell as well as the shortest path to it while constraining the search space. As for experimental validation, performance of the proposed algorithm is compared to those of conventional coverage techniques to demonstrate its completeness of coverage, energy and time efficiency, and robustness to the environment shape or the initial robot pose.     

改进动态规划算法的移动机器人路径规划

针对静态栅格环境下的移动机器人全局路径规划问题,通过分析移动机器人到达目标的搜索方向和路径变化的动态特征,分别建立下降路径搜索动态规划模型和上升路径搜索动态规划模型,并依据整列元素路径值变化特点设计了两种模型交互使用的改进动态规划算法。仿真实验结果表明算法具有较好的路径规划效率,可以同时完成多个目标路径规划,且覆盖率越大的环境求解越快速。实验也表明改进动态规划算法同蚁群算法对比能够更快速有效地给出移动机器人较优通行路径。     

Coordination of multiple mobile robots with limited communication range in pursuit of single mobile target in cluttered environment

This paper addresses the problem of coordinating multiple mobile robots in searching for and capturing a mobile target, with the aim of reducing the capture time. Compared with the previous algorithms, we assume that the target can be detected by any robot and captured successfully by two or more robots. In this paper, we assume that each robot has a limited communication range. We maintain the robots within a mobile network to guarantee the successful capture. In addition, the motion of the target is modeled and incorporated into directing the motion of the robots to reduce the capture time. A coordination algorithm considering both aspects is proposed. This algorithm can greatly reduce the expected time of capturing the mobile target. Finally, we validate the algorithm by the simulations and experiments.     

分块多特征目标描述子的移动机器人目标跟踪

为解决机器人目标跟踪过程中的遮挡和外观改变等问题, 提出一种分块多特征描述子的方法. 该方法将候选样本分块, 提取图像片的深度、颜色、纹理特征来表示目标构造检测器. 结合目标与机器人的运动构造运动卡尔曼滤波器(MEKF) 作为跟踪器. 跟踪过程中根据目标深度信息调整其尺寸, 结合深度特征及图像片外观相似度进行检测并处理遮挡. 实验结果表明, 该算法对目标的尺度变化、光照改变和遮挡现象具有较强的鲁棒性.

     

未知环境下移动机器人遍历路径规划

为提高未知环境下移动机器人遍历路径规划的效率,提出了一种可动态调节启发式规则的滚动路径规划算法.该算法以生物激励神经网络为环境模型,通过在线识别环境信息特征,动态调用静态搜索算法和环绕障碍搜索算法,有效减少了路径的转弯次数.引入虚拟障碍和直接填充算法,解决了u型障碍区域的连续遍历问题.最后通过仿真实验表明了该方法在未知复杂环境下的有效性.     

Design and analysis of the statically balanced direct-drive robot manipulator

A practical architecture, using a four-bar linkage, is considered for the University of Minnesota direct-drive robot (Kazerooni, H., Kim, S.: A new architecture for direct drive robots. In Proc. IEEE International Conference on Robotics and Automation, Philadelphia, Pennsylvania, April 1988). This statically balanced direct-drive robot has been constructed for stability analysis of the robot in constrained manipulation (Kazerooni, H. et al.: Fundamentals of robust compliant motion for robot manipulators. IEEE J. Robotics Automation 2: 1986; Kazerooni, H.: On the robot compliant motion control. ASME J. Dynamic Systems Msmt Control; 111 (3): September 1989. Kazerooni, H. et al.: Theory and experiments on robot compliant motion control. ASME J. Dynamic Systems Msmt Control, June 1990). As a result of the elimination of the gravity forces (without any counterweights), smaller actuators and, consequently, smaller amplifiers were chosen. The motors yield acceleration of 5 g at the robot end point without overheating. High torque, low speed, brushless AC synchronous motors are used to power the robot. Graphite-epoxy composite material is used for construction of the robot links. A 4-node parallel processor has been used to control the robot. A compliant motion control method has been derived and experimentally verified to guarantee stable constrained maneuvers for the robot. As part of the research work, a general criterion has been derived to guarantee the stability of robot manipulators in constrained maneuvers.     

基于关联规则挖掘的全向轮移动机器人目标跟踪控制系统设计

为保证全向轮机器人在移动过程中所捕获到的目标对象能够完全符合理想目标设定条件,准确追踪目标节点的运动行为,设计基于关联规则挖掘的全向轮移动机器人目标跟踪控制系统;根据CAN主控框架的部署形式,按需连接核心管控电路与I/O跟踪模块;分别以转向控制器、速度控制器为例,完善全向轮控制结构的物理作用能力,实现机器人目标跟踪控制系统的硬件设计;在此基础上,定义频繁项集合,按照具体的关联规则特征描述结果,确定挖掘程序指令的执行能力,得到准确的关联离散度指标计算结果,实现控制系统的关联规则挖掘,再联合相关硬件设备结构,完成基于关联规则挖掘的全向轮移动机器人目标跟踪控制系统设计;分析对比实验结果可知,随着关联规则挖掘控制系统的应用,全向轮机器人在移动过程中所捕获到的目标对象能够将理想目标完全包含在内,机器人目标跟踪结果准确,可以辅助全向轮移动机器人更加准确地追踪目标节点的运动行为,符合实际应用需求。     

Path planning in GPS-denied environments via collective intelligence of distributed sensor networks

This paper proposes a framework for reactive goal-directed navigation without global positioning facilities in unknown dynamic environments. A mobile sensor network is used for localising regions of interest for path planning of an autonomous mobile robot. The underlying theory is an extension of a generalised gossip algorithm that has been recently developed in a language-measure-theoretic setting. The algorithm has been used to propagate local decisions of target detection over a mobile sensor network and thus, it generates a belief map for the detected target over the network. In this setting, an autonomous mobile robot may communicate only with a few mobile sensing nodes in its own neighbourhood and localise itself relative to the communicating nodes with bounded uncertainties. The robot makes use of the knowledge based on the belief of the mobile sensors to generate a sequence of way-points, leading to a possible goal. The estimated way-points are used by a sampling-based motion planning algorithm to generate feasible trajectories for the robot. The proposed concept has been validated by numerical simulation on a mobile sensor network test-bed and a Dubin’s car-like robot.