一种改进的镜像射线跟踪方法

镜像法通常只能运用在简单的传播环境中,为在复杂的环境中获得高精度的预测结果,分析测试射线法和镜像法的特点,提出一种新的射线跟踪方法。运用测试射线法快速地找出从源点到场点的粗略路径,利用镜像技术进行路径修正。测试结果表明,该方法具有较高的计算精度。     

机器人图形示教盒编程的研究

本文介绍机器人作业的图形示教盒编程.通过建立机器人的运动学和三维几何模型,采用实时动画技术,在计算机屏幕上对机器人进行图形仿真示教,文中还讨论了图形示教程序的单步执行和实时修正方法,并给出了国产 PJ-lA 机器人进行喷漆作业的图形示教盒编程的实例.结果表明:机器人的图形示教盒编程具有生动、方便的特点,为机器人的编程研究提供了适用的工具.     

基于遗传算法的多车体机器人路径规划方法

带拖车的移动机器人系统是一种复杂的多车体系统,在不同的转弯角度下所需的路径宽度也不同,其路径规划是个难题;在给出带拖车轮式移动机器人稳态和暂态过程运动学方程的基础上,推导得出了多车体移动机器人在最大转弯情况下所需的最大路径宽度,并将之定义为等效尺寸;应用遗传算法,提出了基于等效尺寸的多车体移动机器人的路径规划方法;首先通过等效尺寸的多步障碍扩张,对障碍物的临近区域和狭窄通道进行可行性约束的分析;然后应用遗传算法进行全局的路径规划,将路径的长度和宽度综合在适应度函数之中;在一定程度上,多车体移动机器人的路径规划问题得到解决;文章通过建立三维网格化地图,对障碍物的临近区域和狭窄的瓶颈通道区域进行了可行性约束的描述,遗传算法在较复杂的环境中实现了良好的避障,并得到了相对较短的有效路径。     

双机器人协调控制系统

本文描述了基于集散控制原理,采用分层递阶结构建立的一个3级结构双机器人协调控制系统.该系统共分3层,最高层为任务规划级.它对双机器人作业进行离线编程及仿真,并负责对整个系统的监控和管理.第2层为协调级,它实现机器人作业的协调控制.并通过传感器信息对机器人轨迹进行实时修正.该层既可接收来自上层的命令或指令.对机器人进行控制,亦可在该层上独立编程.实现对机器人的控制.第3层为执行级,它实现高精度伺服控制.此外,该系统还提供了灵活的编程环境及良好的人机界面.用户可根据需要选择离线编程环境或实时编程环境,并且可在其相应的界面下工作,运行结果表明,系统性能稳定可靠,结构合理,编程环境灵活.我们在该系统上,成功地进行了PUMA562机器人和PUMA760机器人的点位协调和轨迹协调以及复杂的联合作业.     

服务机器人导航与调度系统技术研究

针对服务机器人导航和调度系统问题进行了研究。首先根据事先确定的任务进行自主全局路径规划,移动机器人在执行路径跟踪时,还要不断感知周围的局部环境信息;其次,移动机器人不仅要避开附近的移动障碍物,而且要进行局部规划或局部路径修正;然后,完成了地图创建、机器人全局定位、规划局部路径并控制车体运动;最后,介绍了服务机器人调度系统终端软件。实现了机器人与调度系统的结合,完成通过调度系统进行机器人运动控制的功能。     

带拖车的移动机器人包络路径分析与描述

带拖车的移动机器人系统是一类复杂的多车体系统,其路径规划问题难以沿用单 体移动机器人系统的规划方法．本文通过分析这类系统运动时的路径特征,提出包络路径概 念;并根据路径与车体约束的关系,给出包络路径的量化描述,从而把这类多车体系统的路 径规划问题转化为单个车体的规划问题,本质地改变了带拖车移动机器人的运动规划．     

动态确定基因数的遗传算法路径规划*

静态环境中移动机器人全局路径规划一直是路径规划中的一个重要问题。探讨了一种改进的基于遗传算法的静态环境下机器人全局路径规划方法的可行性。该方法通过障碍物的数量来动态确定所需的路径点数（基因）,使得它能更广泛地应用于不同环境,最后对结果进行修正。仿真实验表明了该方法的有效性。     

水下机器人三维路径规划

本文提出了基于八叉树区域分别环境建模方法，在此基础上，利用A算法解决了静态环境的三维路径规划，并对规划出的路径进行了三维修正，使其满足机器人轨迹跟踪的要求，另外，以八叉树环境建模基础，对动态环境下的三维路径规划进行了研究。     

移动机器人避障路径规划算法的研究

避障路径规划问题是在障碍物环境中,在满足与障碍物不相碰撞的前提条件下,规划一条从起点到达终点的路径.在此过程中,往往符合条件的路径不止一条,如何在其中找到最短路径则是我们关心的问题.本文以构建障碍物模型为基础,将路径规划问题转化为求解一条经过起点和终点的最短路径,并在此基础上构建了算法程序.通过计算机仿真表明该方法具备良好的路径规划能力.     

面向全方位双足步行跟随的路径规划

双足步行机器人的足迹规划方法难以满足快速步行条件下的计算效率要求, 并存在步幅变化时运动失稳的风险, 2D环境下点机器人栅格规划则难于生成针对双足步行的高效路径.本文提出针对各向异性特征全方位步行机器人的一种路径规划策略, 将状态网格图方法拓展到全方位移动机器人领域, 基于三项基本假设及基元类型划分给出了系统的运动基元枚举及选择方法, 借助实时修正的增量式AD*搜索算法实现仿人机器人在动态环境下的快速路径规划, 通过合理选择启发函数及状态转移代价, 生成了平滑高效的路径, 为后续足迹生成的动力学优化提供了基础.计算机仿真证实了方法对各类环境的适应性, Robocup避障竞速挑战赛的成功表现证明了方法对于机器人样机部署的可行性及其提高步行效率的潜力.     

机器人操作臂奇异路径约束最优轨迹规划

路径约束最优轨迹规划的关键是引入标量路径参数来降低优化问题的维数 ．当路径穿越奇异点时，由于关节位移难以表示为任务空间路径参数的解析函数，给常规的 路径参数化方法带来困难．本文引入一种新的参数化方法，采用路径跟踪方程解曲线的弧长 为参数，解决了奇异点邻域的路径跟踪问题，把奇异路径轨迹规划转化为常规规划问题，并 采用动态规划方法求解轨迹规划问题．仿真表明，本文提出的参数化方法与动态规划结合起 来，是解决奇异路径最优轨迹规划的有效途径．      

Collision avoidance for Robot manipulators: Application to Catia/IBM 7565 interface

A collision avoidance algorithm has been developed to augment the capability of an automatic (off-line) robot path planning (programming) tool. The use of off-line programming tools for robot task programming is becoming increasingly important, but the advantages to be gained by off-line programming may be lost if collision-free path planning capabilities are not included. This article addressed the problem of collision-free path planning in the context of a gantry type robot. The collision avoidance algorithm described here uses the <heuristic approach> to collision-free path planning. The manipulator and obstacles are modeled as spheres to simplify tests for collision. An important feature of this algorithm is that it permits the manipulation of objects in the robot's environment. When compared against an algorithm from the literature, given a lightly cluttered environment modelled by spheres, the new algorithm finds a collision-free path much faster. This new algorithm has been implemented as part of the CATIA/IBM 7565 interface which forms an automatic off-line programming system for the IBM 7565 robot. It has also been implemented as a supervisory collision filter to allow collision-free control of the robot from the operator's console. In both cases the algorithm has been demonstrated to provide efficient and effective collision avoidance for the IBM 7565 robot.     

基于PLC的小型柔性生产线PPI网络设计

针对小型柔性生产线中PLC之间需要进行实时数据通信这一问题,设计基于S7-200PLC的PPI网络通信系统.介绍PPI网络的特点和设计步骤,重点阐述通信读写数据的规划、通信子程的生成及调用、主站和从站的通信子程序设计等关键技术.     

Optimal path planning for automated dimensional inspection of free-form surfaces

Structural dimensional inspection is vital for the process monitoring, quality control, and fault diagnosis in the mass production of auto bodies. Comparing with the non-contact measurement, the high-precision five-axis measuring machine with the touch-trigger probe is a preferred choice for data collection. It can assist manufacturers in making accurate inspection quickly. As the increase of free-form surfaces and diverse surface orientations in product design, existing inspection approaches cannot capture some new critical features in the curvature of products in an efficient way. Therefore, we need to develop new path planning methods for automated dimensional inspection of free-form surfaces. This paper proposes an optimal path planning system for automated programming of measuring point inspection by incorporating probe rotations and effective collision detection. Specifically, the methodological contributions include: (i) a dynamic searching volume-based algorithm is developed to detect potential collisions in the local path between measurement points; (ii) a local path generation method is proposed with the integration of the probe trajectory and the stylus rotation. Then, the inspection time matrix is proposed to quantify the measuring time of diverse local paths; (iii) an optimization approach of the global inspection path for all critical points on the product is developed to minimize the total inspection time. A case study has been conducted on an auto body to verify the performance of the proposed method. Results show that the collision-free path for the free-form auto body could be generated automatically with off-line programming, and the proposed method produces about 40% fewer dummy points and needs 32% less movement time in the auto body inspection process.     

A novel seam extraction and path planning method for robotic welding of medium-thickness plate structural parts based on 3D vision

Currently, the robotic welding of medium-thickness plate structural parts has become a common welding application. With the rapid development of automation technology and robotics, the traditional teaching-playback mode and the off-line programming mode cannot meet the automation demand of welding robots. To realize automatic seam extraction and path planning for robotic welding of medium-thickness plate structural parts without programming and teaching, we use three models of medium-thickness plate structural parts as the research objects to propose a novel seam extraction and path planning method for robotic welding of medium-thickness plate structural parts based on 3D vision. Firstly, a set of improved RANSAC multiplanes fitting algorithms is proposed to accurately obtain the position of the intersection lines between the intersecting planes of the point cloud model. On this basis, we combine the geometric features of three models to propose the specific welding seam extraction methods respectively. Then, according to the spatial structure of the welding seams and the welding process, we carry out the welding path planning. Finally, a welding pose planning method based on the dihedral structure is proposed. Experiment results show that the proposed method can well realize the welding seam extraction, welding path and posture planning of medium-thickness plate structural parts without programming and teaching.     

基于改进动态规划的无人机搜寻航迹规划研究

针对传统动态规划算法在无人机航迹规划中存在耗时长以及冗余节点的问题,提出了一种基于多阶段决策的改进动态规划算法.在单向动态规划算法中加入双向策略,结合顺序法和逆序法以减少搜寻空间的状态总数;利用区间单调性和四边形不等式进一步减少每次决策涉及的状态点,得到优化后的状态转移方程,降低了搜寻的时间复杂度.最后,对改进动态规划...     

Path planning on the warp computer: using a linear systolic array in dynamic programming ∗

Given a map in which each position is associated with a traversabihty cost, the path planning problem is to find a minimum-cost path from a source position to every other position in the map. The paper proposes a dynamic programming algorithm to solve the problem, and analyzes the exact number of operations that the algorithm takes. The algorithm accesses the map in a highly regular way, so it is suitable for parallel implementation. The paper describes two general methods of mapping the dynamic programming algorithm onto the linear systolic array in the Warp machine developed by Carnegie Mellon. Both methods have led to efficient implementations on Warp. It is concluded that a linear systolic array of powerful cells like the one in Warp is effective in implementing the dynamic programming algorithm for solving the path planning problem     

一种基于罚函数的机器人路径规划方法

给出了一种基于罚函数的机器人路径规划方法；这种方法将机器人的路径规划由一系列带约束非线形规划问题转化为一系列无约束非线形规划问题来求解，仿真结果表明，罚函数方法是一种富有效率的解决机器人路径规划问题的方法，能够大幅度降低运算时间的复杂性，提高移动机器人的实时性。     

多约束下多无人机的任务规划研究综述

高度信息化的发展使得无人机作战优势凸显。准确的无人机任务规划技术是完成给定任务的重要保障。任务分配、路径规划是构成无人机任务规划技术的两个核心部分。基于该技术,首先讨论了无人机任务规划的发展状况、分类标准、体系结构。其次,分别详细介绍了影响任务分配、路径规划的重要指标,如分类标准、约束指标、相应模型、代表算法、评价指标等,然后,分别分析对比求解任务分配的启发式算法、数学规划方法、随机智能优化算法的优缺点和求解路径规划的数学规划方法、人工势场法、基于图形学法、智能优化算法的优缺点;最后,总结了无人机任务规划存在的开放性问题、未来发展方向和研究重点。     

一种内河海事无人艇路径规划算法设计与仿真

为了解决内河海事无人艇路径规划问题,提出了一种基于电子江图的路径遍历算法。该算法以分层的电子江图为基础,运用全局路径规划和局部路径规划的方法寻找近似可航路径。运用栅格法在复杂多变的内河环境中选择可航区域,运用Voronoi图对动态物标或可视为质点的碍航物建立航行路径集;将可航区域（或轻微碍航区域）与航行路径集公共区域记为可航路径;并运用贝塞尔曲线和二次规划数学方法进行优化。Matlab仿真结果表明,当障碍物位置坐标不同或目的地位置坐标不同时均可以生成近似可航路径;生成的不同近似可航路径均能被优化为最优安全可航路径,所以建立的环境模型以及使用的路径规划算法是有效、可行的。