多管相贯线切割运动轨迹与位姿控制方法研究

针对空间多管相贯线的切割问题,基于简化的坡口模型,提出了一种实用的切割运动轨迹与位姿控制方法。用参数化图形方式给出了相贯线的计算模型,建立了由三维模型数据到6轴联动切割运动代码的转换算法。通过现场实际切割,表明该方法可明显提高相贯线的切割效率。     

基于离散化的六足机器人自由步态规划

为精细模仿生物步态,充分发挥六足机器人运动潜能,本文在离散化机器人足端轨迹的基础上,融合中枢模式发生器(central pattern generator,CPG)模型与反射模型的核心思想,建立了离散化步态模型,结合稳定性分析,构建了机器人稳定的位置状态空间,将复杂的步态规划问题转化为稳定的位置状态空间中位置状态间的排序问题,在此基础上,提出了一种新的自由步态生成算法,并基于平均稳定裕量对该算法进行了优化.样机步态实验结果表明,自由步态生成算法与自由步态优化算法均可生成在一定程度上符合生物运动特点的稳定步态,实现机器人运动过程中速度的动态调整,跨越宽度为步距的障碍,且基于平均稳定裕量的自由步态优化算法生成步态的稳定性要远大于自由步态生成算法.     

基于二段多项式的窄空间平行泊车路径规划方法

针对窄空间平行泊车路径规划问题, 提出一种基于二段五阶多项式的方法分别计算车辆前进路线与倒车路线, 其中前进路线用于调整车辆位姿, 实现倒车入库路径曲率最优. 根据常规停车位大小与家庭轿车的尺寸建立仿真环境, 结合车辆运动模型, 搜索自由空间内无碰撞路径. 仿真结果表明, 二段五阶多项式法可以实现在有限空间范围内的智能泊车, 且在由两段路径连接得到的路径上方向盘转向角连续变化.     

用对偶映射原理规划和分析机器人轨迹运动

在研究机器人广义位姿的基础上,依据从基坐标系列任一坐标系的旋转变换可以通过绕基坐标系中的瞬时转动轴的等效旋转来实现的原理,提出用等效角位移矢量来描述机器人姿态以及用姿态旋量及其 Pl(u|¨)cker线坐标来描述机器人的位姿.依据对偶数代数理论中关于三维欧氏空间中的有向直线与三维对偶空间中的点具有一一对应关系的对偶映射原理,在对偶空间中对姿态旋量所映射的点进行规划,从而找到一种机器人位姿轨迹生成和运动分析新方法,文末算例说明上述原理和推导的正确性.     

基于PostGIS的线要素空间聚合方法

针对当前常规方法线空间流量数据聚合效率低的问题，提出基于PostGIS的流空间线要素聚合方法。通过离散化所有的线为点集，建立点集的空间索引，计算点集的唯一点集，对唯一点集上的每个点累加所有与该点重叠的属性值并进行更新，根据点的序列号和上一步更新的属性值，重新连接该条线上所有的点，在属性值变化处进行打断形成新的线要素。在此基础上，去除空间重叠的线要素和图形为空的线要素得到最后的线聚合结果。实验结果表明，该方法以矢量数据形式输出的线聚合结果正确，提取速度显著提升，有效地解决了大量矢量线数据融合时常规方法效率低下的问题。     

增强现实环境下复杂板材的三维位姿跟踪方法

针对增强现实(AR)技术在实际工业生产场景应用中遇到的实时目标监测、复杂场景识别等问题,提出基于线特征求解板材三维位姿变化量的目标位姿跟踪方法,在单目摄像头环境下即可实现复杂表面板材的位姿监测与拟合。在利用头顶摄像头检测工件状态后,首先将当前帧图像进行降采样,再在HSV空间对进行图像预处理,并利用形态学梯度和改进的直线分割检测(LSD)直线算法提取边缘直线,然后结合模板图像的边缘直线以及利用多项式回归拟合关系曲线的方法求解出天线板的位姿变化量。实验结果表明:所提的基于改进的LSD算法提取线特征位姿监测方法相比基于ORB特征点和纹理特征位姿跟踪方法具有求解速度快、鲁棒性好等优点。     

一种基于传感信息的机器人在线路径规划方法

针对非结构化环境下的多关节机器人实时避障问题,提出一种基于传感信息的机器人在线路径规划方法.由红外线传感器提供机器人手臂周围环境信息,通过计算C-空间内一些方向上的C-空间障碍距离,分阶段控制位姿点到达目标.避免了建立整个位姿点附近的C-空间,适合机器人在未知环境下的实时避障要求.仿真结果验证了该算法的有效性.     

基于执行时间约束的机器人关节空间轨迹优化

为在保证机器人运动轨迹的平滑性的条件下提高机器人工作效率,提出一种基于轨迹执行时间归一化处理的关节空间运动轨迹规划优化算法。对轨迹的执行时间进行归一化处理,分析关节空间位置、速度、加速度的运动轨迹相对于归一化时间的数学模型;考虑关节运动参数的约束条件,采用五次多项式拟合机器人在关节空间的运动轨迹,分析不同轨迹执行时间对关节位置运动轨迹的超调量的影响,实现机器人关节空间的位置轨迹优化;在M atlab环境里对机器人的运动轨迹进行仿真建模,完成机器人运动学仿真。多组仿真结果表明,该算法在保证机器人轨迹平滑的基础上,能保证轨迹执行时间最优,有效地提高机器人的运动效率。     

基于连续－离散MRF图模型的鲁棒多机器人地图融合方法

针对多机器人同步定位与建图（MSLAM）中感知偏差会产生高度相关且互一致的异常回环,进而导致定位与地图变形等问题,提出了基于马尔可夫随机场（MRF）的通用连续－离散图模型．其中,连续图对标准位姿图（pose graph）进行建模;离散图通过对异常值相关关系的显式建模,建立剔除模型．在此基础上,进一步利用凸松弛方法,将连续－离散图代表的非凸且NP（非确定性多项式）完全的组合优化问题转化为半正定规划（SDP）问题,方便利用现有凸优化工具进行求解．仿真和实测数据实验表明,本文方法提高了位姿图对感知偏差带来异常外点的鲁棒性,且结果不依赖于位姿初始值的好坏,在异常值占比为50%的情况下,剔除率仍可达99.8%,地图融合精度优于现有主流动态协方差缩放（DCS）方法和两两一致测量集（PCM）方法．     

基于自主行为智能体的月球车运动规划与控制

研究基于自主行为智能体的月球车运动规划与控制方法．在基于自主行为智能体的月球车系统结构基础上,首先设计了月球车运动规划与控制的一组基本行为,对其原理进行证明．通过行为状态机对行为进行选择,如果不能保障月球车安全性能,则由运动规划智能体学习其行为参数,并由神经网络记忆．将月球车运动规划与控制分解为行为设计与学习两个过程,使月球车控制系统易于加入先验知识．同时,月球车运动规划能够满足其机动性与地形传送性约束,保证工程开发的结构化与可实现性．该方法不仅具有实时性,而且对未知环境具有较强的适应能力．仿真研究与实验证明了该方法的有效性．     

Human-robot collaboration while sharing production activities in dynamic environment: SPADER system

Interactive robot doing collaborative work in hybrid work cell need adaptive trajectory planning strategy. Indeed, systems must be able to generate their own trajectories without colliding with dynamic obstacles like humans and assembly components moving inside the robot workspace. The aim of this paper is to improve collision-free motion planning in dynamic environment in order to insure human safety during collaborative tasks such as sharing production activities between human and robot. Our system proposes a trajectory generating method for an industrial manipulator in a shared workspace. A neural network using a supervised learning is applied to create the waypoints required for dynamic obstacles avoidance. These points are linked with a quintic polynomial function for smooth motion which is optimized using least-square to compute an optimal trajectory. Moreover, the evaluation of human motion forms has been taken into consideration in the proposed strategy. According to the results, the proposed approach is an effective solution for trajectories generation in a dynamic environment like a hybrid workspace.     

A model predictive obstacle avoidance method based on dynamic motion primitives and a Kalman filter

A dynamic motion primitive (DMP) is a robust framework that generates obstacle avoidance trajectories by introducing perturbative terms. The perturbative term is usually constructed with an artificial potential field (APF) method. Dynamic obstacle avoidance is rarely considered with this approach; furthermore, even when dynamic obstacles are considered, only the velocity and position information of the current state are incorporated into the obstacle avoidance framework. However, if the position of an obstacle changes suddenly, a robot may be placed in a dangerous position close to the obstacle, resulting in large obstacle avoidance accelerations, sharp trajectories, or even obstacle avoidance failure. Therefore, we present a model predictive obstacle avoidance method based on dynamic motion primitives and a Kalman filter. This method has three main components: Dynamic motion primitives are used to generate the desired trajectory and introduce perturbations to achieve obstacle avoidance; the Kalman filter method is adopted to estimate the future positions of the obstacles; and model predictive control is employed to optimize the repulsive force generated by the APF while minimizing the defined cost function, thus guaranteeing the safety and flexibility of the method. We validate the presented method with 2D and 3D obstacle avoidance simulations. The method is also verified with a real robot: the-Kinova MOVO. The simulation and experimental results show that the proposed method not only avoids dynamic obstacles but also tracks the desired trajectory more smoothly and precisely.     

Roadmap-based motion planning in dynamic environments

In this paper, a new method is presented for motion planning in dynamic environments, that is, finding a trajectory for a robot in a scene consisting of both static and dynamic, moving obstacles. We propose a practical algorithm based on a roadmap that is created for the static part of the scene. On this roadmap, an approximately time-optimal trajectory from a start to a goal configuration is computed, such that the robot does not collide with any moving obstacle. The trajectory is found by performing a two-level search for a shortest path. On the local level, trajectories on single edges of the roadmap are found using a depth-first search on an implicit grid in state-time space. On the global level, these local trajectories are coordinated using an A/sup */-search to find a global trajectory to the goal configuration. The approach is applicable to any robot type in configuration spaces with any dimension, and the motions of the dynamic obstacles are unconstrained, as long as they are known beforehand. The approach has been implemented for both free-flying and articulated robots in three-dimensional workspaces, and it has been applied to multirobot motion planning, as well. Experiments show that the method achieves interactive performance in complex environments.     

High-level motion planning for CPG-driven modular robots

Modular robots may become candidates for search and rescue operations or even for future space missions, as they can change their structure to adapt to terrain conditions and to better fulfill a given task. A core problem in such missions is the ability to visit distant places in rough terrain. Traditionally, the motion of modular robots is modeled using locomotion generators that can provide various gaits, e.g. crawling or walking. However, pure locomotion generation cannot ensure that desired places in a complex environment with obstacles will in fact be reached. These cases require several locomotion generators providing motion primitives that are switched using a planning process that takes the obstacles into account. In this paper, we present a novel motion planning method for modular robots equipped with elementary motion primitives. The utilization of primitives significantly reduces the complexity of the motion planning which enables plans to be created for robots of arbitrary shapes. The primitives used here do not need to cope with environmental changes, which can therefore be realized using simple locomotion generators that are scalable, i.e., the primitives can provide motion for robots with many modules. As the motion primitives are realized using locomotion generators, no reconfiguration is required and the proposed approach can thus be used even for modular robots without self-reconfiguration capabilities. The performance of the proposed algorithm has been experimentally verified in various environments, in physical simulations and also in hardware experiments.     

基于连续动态运动基元的移动机器人路径规划

针对二维动态场景下的移动机器人路径规划问题，提出了一种新颖的路径规划方法——连续动态运动基元（continuous dynamic movement primitives， CDMPs）.该方法将传统的单一动态运动基元推广到连续动态运动基元，通过对演示运动轨迹的学习，获得各运动基元的权重序列，利用相位变量的更新，实现对未知动态目标的追踪.该方法克服了移动机器人对环境模型的依赖，解决了动态场景下追踪运动目标和躲避动态障碍物的路径规划问题.最后通过一系列仿真实验，验证了算法的可行性.仿真实验结果表明，对于动态场景下移动机器人路径规划问题， CDMPs算法比传统的DMPs方法在连续性能和规划效率上具有更好的表现.     

Target following with motion prediction for unmanned surface vehicle operating in cluttered environments

The capability of following a moving target in an environment with obstacles is required as a basic and necessary function for realizing an autonomous unmanned surface vehicle (USV). Many target following scenarios involve a follower and target vehicles that may have different maneuvering capabilities. Moreover, the follower vehicle may not have prior information about the intended motion of the target boat. This paper presents a trajectory planning and tracking approach for following a differentially constrained target vehicle operating in an obstacle field. The developed approach includes a novel algorithm for computing a desired pose and surge speed in the vicinity of the target boat, jointly defined as a motion goal, and tightly integrates it with trajectory planning and tracking components of the entire system. The trajectory planner generates a dynamically feasible, collision-free trajectory to allow the USV to safely reach the computed motion goal. Trajectory planning needs to be sufficiently fast and yet produce dynamically feasible and short trajectories due to the moving target. This required speeding up the planning by searching for trajectories through a hybrid, pose-position state space using a multi-resolution control action set. The search in the velocity space is decoupled from the search for a trajectory in the pose space. Therefore, the underlying trajectory tracking controller computes desired surge speed for each segment of the trajectory and ensures that the USV maintains it. We have carried out simulation as well as experimental studies to demonstrate the effectiveness of the developed approach.     

GPU based generation of state transition models using simulations for unmanned surface vehicle trajectory planning

This paper describes GPU based algorithms to compute state transition models for unmanned surface vehicles (USVs) using 6 degree of freedom (DOF) dynamics simulations of vehicle–wave interaction. A state transition model is a key component of the Markov Decision Process (MDP), which is a natural framework to formulate the problem of trajectory planning under motion uncertainty. The USV trajectory planning problem is characterized by the presence of large and somewhat stochastic forces due to ocean waves, which can cause significant deviations in their motion. Feedback controllers are often employed to reject disturbances and get back on the desired trajectory. However, the motion uncertainty can be significant and must be considered in the trajectory planning to avoid collisions with the surrounding obstacles. In case of USV missions, state transition probabilities need to be generated on-board, to compute trajectory plans that can handle dynamically changing USV parameters and environment (e.g., changing boat inertia tensor due to fuel consumption, variations in damping due to changes in water density, variations in sea-state, etc.). The 6 DOF dynamics simulations reported in this paper are based on potential flow theory. We also present a model simplification algorithm based on temporal coherence and its GPU implementation to accelerate simulation computation performance. Using the techniques discussed in this paper we were able to compute state transition probabilities in less than 10 min. Computed transition probabilities are subsequently used in a stochastic dynamic programming based approach to solve the MDP to obtain trajectory plan. Using this approach, we are able to generate dynamically feasible trajectories for USVs that exhibit safe behaviors in high sea-states in the vicinity of static obstacles.     

Trajectory time scaling of a mobile robot to avoid dynamic obstacles on the basis of the INLVO

To ensure the collision safety of mobile robots, the velocity of dynamic obstacles should be considered while planning the robot’s trajectory for high-speed navigation tasks. A planning scheme that computes the collision avoidance trajectory by assuming static obstacles may result in obstacle collisions owing to the relative velocities of dynamic obstacles. This article proposes a trajectory time-scaling scheme that considers the velocities of dynamic obstacles. The proposed inverse nonlinear velocity obstacle (INLVO) is used to compute the nonlinear velocity obstacle based on the known trajectory of the mobile robot. The INLVO can be used to obtain the boundary conditions required to avoid a dynamic obstacle. The simulation results showed that the proposed scheme can deal with typical collision states within a short period of time. The proposed scheme is advantageous because it can be applied to conventional trajectory planning schemes without high computational costs. In addition, the proposed scheme for avoiding dynamic obstacles can be used without an accurate prediction of the obstacle trajectories owing to the fast generation of the time-scaling trajectory.     

A Continuous Local Motion Planning Framework for Unmanned Vehicles in Complex Environments

As the complexity of an unmanned vehicle’s operational environment increases so does the need to consider the obstacle space continually, and this is aided by splitting the motion planning functionality into distinct global and local layers. This paper presents a new continuous local motion planning framework, where the output and control space elements of the traditional receding horizon control problem are separated into distinct layers. This separation reduces the complexity of the local motion trajectory optimisation, enabling faster design and increased horizon length. The focus of this paper is on the output space component of this framework. Bezier polynomial functions are used to describe local motion trajectories which are constrained to vehicle performance limits and optimised to track a global trajectory. Development and testing is in simulation, targeted at a nonlinear model of a quadrotor unmanned air vehicle. The defined framework is used to provide situation-aware tracking of a global trajectory in the presence of static and dynamic obstacles, as well as realistic turbulence and gusts. Also demonstrated is the immediate-term decentralised deconfliction of multiple unmanned vehicles, and multiple formations of unmanned vehicles.     

基于矢量场的无人机动力学规划算法

针对传统运动规划的分层策略导致生成的轨迹被限制在同伦类和快速搜索随机树算法的采样效率较低等问题,提出一种基于矢量场指导采样的动力学规划算法。首先,采用势场函数的梯度定义的矢量场来构造圆锥体,并利用该圆锥体约束RRT*的采样;然后,通过求解最优控制问题生成运动基元来解决两点边值问题,并给出运动基元的最佳持续时间的显式解,以便最佳地连接任意一对状态;最后,通过MATLAB仿真环境下的四旋翼飞行器验证所提出的运动规划算法的可行性。实验结果表明,提出的算法与现有的技术相比在相同的迭代次数下以更短的运行时间探索了更多的状态,并且生成的轨迹具有更小的到达时间和控制花销。