共查询到20条相似文献,搜索用时 46 毫秒
1.
扫描覆盖问题一直是无线传感网络的热点问题,目前大多数研究主要集中于同构无人机扫描覆盖问题,目标为无人机数量最小的情况下对区域节点达到全覆盖。近年来,扫描覆盖问题衍生出新的方向,即MTMC(min-time max-coverage)问题,即使用有限无人机对区域节点进行扫描覆盖,使得覆盖率尽可能大的同时任务时间尽可能小。在考虑了无人机异构性的基础上,分析了MTMC问题的数学模型,提出了CWBGAA(CW Based on Genetic Annealing Algorithm optimization)算法解决MTMC问题。上述算法分为两阶段解决问题,第一阶段基于启发式插入算法生成每架无人机对应的飞行路径,第二阶段基于遗传退火算法对生成后路径进行路径优化,使得无人机的飞行时间降低。仿真结果表明,CWBGAA算法相较于其它算法拥有更好的性能,提升覆盖率的同时降低了任务执行时间。 相似文献
2.
3.
针对弯折加工而成的3维细长管路的测量问题,设计了一种由工业机器人和多种传感器组成的自主测量系统.为完成测量中关键的管路点云自主扫描,提出了一种基于遗传算法的管路扫描路径规划算法,可求取出能够完整扫描管路且扫描次数尽可能少的1组无碰关键扫描点,并且在关键扫描点处机器人的姿态被约束在竖直方向周围的一定范围内.此外,在每代群体产生后根据向前覆盖因子更新探索步长,并据此调整新采样个体的采样区间用以快速采集到更合适的个体.路径规划算法的性能验证中,首先实施了弯曲管路仿真,然后进行了圆柱段和圆环段在不同姿态下的扫描路径规划的仿真,最后开展了汽车管路扫描路径规划的仿真和实测实验.仿真结果中最优个体扫描长度随迭代次数增加而增大,且两种管路段和汽车管路的扫描覆盖率均超过0.99,表明规划得到的关键扫描点数量少,且关键扫描点的扫描体可近乎完整地扫描对应管路.汽车管路仿真与实测实验结果表明该算法对复杂管路可规划出合适的扫描路径. 相似文献
4.
基于扫描法在线构造拓扑图的路经规划算法 总被引:1,自引:0,他引:1
该文提出了一种基于扫描法在线构造环境拓扑图的路径规划算法。与传统路图法相比,该算法利用扫描的方法搜索障碍物切点,并构造环境拓扑图,降低了计算复杂度,提高了实用性;利用启发式函数选择适当的离开点进行扩展,并逐步完善拓扑图,避免了一次性构造整个环境拓扑图所带来的不必要的大计算量。通过“沿直线行走”和“绕障碍物行走”这两种行为模式的切换,保证机器人顺利地避开障碍物到达目标位置。该算法的计算复杂度低,易于在线实现,并在仿真中得到了验证。 相似文献
5.
并行栅格扫描填充路径及其规划算法 总被引:2,自引:0,他引:2
深入分析快速成形制件翘曲变形的原因后,提出一种全新的扫描填充路径--并行栅格路径及其规划算法.按照这种路径能够近似、并行地完成整个待成形二维平面区域的扫描填充过程,在减小XY向温度梯度的同时,均匀化不同位置材料成形后的冷却收缩约束力,使得不同位置材料的冷却收缩趋于同步和均匀,减小了制件的整体翘曲变形量.实验表明,该算法能够在与其他类型路径的规划算法大致相当的时间和空间复杂度下,获得扫描填充性能更加优越的路径. 相似文献
6.
目的 SLAM(simultaneous localization and mapping)是移动机器人在未知环境进行探索、感知和导航的关键技术。激光SLAM测量精确,便于机器人导航和路径规划,但缺乏语义信息。而视觉SLAM的图像能提供丰富的语义信息,特征区分度更高,但其构建的地图不能直接用于路径规划和导航。为了实现移动机器人构建语义地图并在地图上进行路径规划,本文提出一种语义栅格建图方法。方法 建立可同步获取激光和语义数据的激光-相机系统,将采集的激光分割数据与目标检测算法获得的物体包围盒进行匹配,得到各物体对应的语义激光分割数据。将连续多帧语义激光分割数据同步融入占据栅格地图。对具有不同语义类别的栅格进行聚类,得到标注物体类别和轮廓的语义栅格地图。此外,针对语义栅格地图发布导航任务,利用路径搜索算法进行路径规划,并对其进行改进。结果 在实验室走廊和办公室分别进行了语义栅格建图的实验,并与原始栅格地图进行了比较。在语义栅格地图的基础上进行了路径规划,并采用了语义赋权算法对易移动物体的路径进行对比。结论 多种环境下的实验表明本文方法能获得与真实环境一致性较高、标注环境中物体类别和轮廓的语义栅格地图,且实验硬件结构简单、成本低、性能良好,适用于智能化机器人的导航和路径规划。 相似文献
7.
针对移动机器人未知环境下的安全路径规划,本文采用了一种局部连接Hopfield神经网络(ANN)规划器。对任意形状环境,ANN中兼顾处理了“过近”和“过远”来形成安全 路径,而无需学习过程。为在单处理器上进行有效的在线路径规划,提出用基于距离变换的串行模拟,加速数值势场的传播。仿真表明,该方法具有较高的实时性和环境适应性。 相似文献
8.
基于神经网络的移动机器人路径规划 总被引:12,自引:0,他引:12
针对移动机器人的未知环境下安全路径规划,论文采用了一种局部连接Hopfield神经网络(ANN)规划器。对任意形状环境,ANN中兼顾处理了“过近”和“过远”来形成安全路径,而无需学习过程。为在单处理器上进行有效的在线路径规划,提出用基于距离变换的串行模拟,加速了数值势场的传播。仿真表明该方法具有较高的实时性和环境适应性。 相似文献
9.
航空薄壁件具有厚度小、刚度低、易变形的特点.在装配过程中装夹位置选择是航空薄壁件产生变形的重要因素之一.根据实际装配工况,建立航空薄壁件装配过程有限元分析模型,通过对航空薄壁件在不同的装夹位置装配进行有限元分析,获得航空薄壁件的装夹面上表面平均变形值及神经网络训练样本.以航空薄壁件在装配过程中上表面平均变形值最小为目标,利用BP神经网络非线性映射能力构建预测模型,遗传算法优化BP神经网络训练模型,获取最佳装夹位置.使用航空薄壁件上表面所有点的平均位移来代替平均变形量,以典型航空薄壁件I型桁条为案例验证该方法的可行性.试验结果表明,BP神经网络与遗传算法预测值和有限元仿真值误差符合实际工程需要. 相似文献
10.
车脸部件检测能够广泛地应用于车辆识别及车辆的语义分割。尽管对于车脸的检测已经做出过大量的努力,但现有的研究大多集中在车脸的整块区域的检测及定位,提出了一种基于选择性搜索的车脸部件检测算法。该算法分为两个阶段:首先,将车辆图片进行高斯滤波去噪以及图像归一化预处理。其次,对预处理后的图片,利用基于图表示的图像分割算法获取初始分割区域,计算两两相邻区域在颜色、纹理、大小及吻合度之间的相似度;随后利用初始分割区域相邻区域间的颜色、纹理、大小以及吻合度的相似性对初始分割区域进行合并,从而准确分割车脸各部件。采用部分香港中文大学的公开数据集CompCars,总计4 199张图像,作为测试样本以测试车脸部件分割检测效果。实验结果表明,该算法检测车脸部件的平均重合度达到73.74%,明显胜过其它目标检测算法,此外,该算法不需训练,具有更强的通用性。 相似文献
11.
This article introduces the new problem of planning spatially distributed lanes for supporting multi-agent navigation applications in 3D environments. Our proposed approach computes the max-flow of a 3D medial axis representation of the environment in order to globally compute collision-free lanes exploring the entire free space of the volumetric scene. Our method addresses agent clearance and path dispersion in order to provide a comprehensive solution to globally compute lanes to be used by multiple agents in 3D environments. By selecting the desired lane dispersion our approach offers an intuitive and powerful way to explore variations in the computed collections of lanes. Dispersion is addressed with a combination of new techniques based on max flow computation, clearance-based path separation, and adaptive shortcut-based smoothing. 相似文献
12.
Tsaiyun Hong Phillips 《Pattern recognition letters》1985,3(4):271-277
A shrinking technique is described for the segmentation of a 2D complex object, represented by a binary array, into compact subobjects. A novel feature of the technique is that it uses the distance values on the skeleton of the object to estimate the number of shrinking steps needed in order to decompose the object. 相似文献
13.
Boundary Smoothing via Symmetry Transforms 总被引:1,自引:0,他引:1
This paper proposes a smoothing technique for shape based on a perturbation analysis of the underlying medial axis, and by iteratively removing skeletal branches. While medial axis regularization usually aims at dealing with its sensitivity in the context of applications such as recognition, we use it here to smooth shape. The approach overcomes a basic drawback with current smoothing techniques, namely, the rounding of perceptually salient corners. The key idea is that the instability of the skeleton under a family of deformations can be dealt with via a symmetry transform which is applied to all related symmetry branches so as to effect an appropriate change in the shape. This leads to the notion of a splice transform which removes a branch coupled with simultaneous changes in the skeleton. In contrast to point-based pruning techniques which use local salience and which cannot construct coarse-scale corners, our approach constructs and preserves coarse-scale curvature extrema, leading to a scale-discrete scale-space for shape. The approach is also applicable to the smoothing of incomplete shapes represented as a set of curve segments. 相似文献
14.
针对冠脉造影图像模糊、对比度低等导致的冠脉血管提取不完整、骨架不连续等问题,提出一种基于Hessian矩阵的多尺度冠脉分割与骨架提取算法,并估计血管半径值,为冠脉结构的三维重建奠定基础。该方法利用Hessian矩阵特征值对应线性目标的关系,构造一个新颖的血管相似性响应函数,对冠脉增强并阈值化得到分割结果,同时由 Hessian 矩阵确定冠脉血管的法线方向,通过求解法线方向上的极值点得到冠脉骨架的初始像素点集,以此来提取冠脉血管的欧氏骨架。实验结果表明,该算法简洁高效,相比现有算法能提取到更多的细小分支,得到的冠脉骨架完整,半径估计准确。 相似文献
15.
16.
In this paper we explore the local geometry of the medial axis (MA) and shocks (SH), and their structural changes under deformations, by viewing these symmetries as subsets of the symmetry set (SS) and present two results. First, we establish that the local form of the medial axis must generically be one of three cases, which we denote by the A notation explained below (here, it merely serves as a reference to sections of the paper): endpoints (A
3), interior points (A
1
2), and junctions (A
1
3). The local form of shocks is then derived from a sub-classification of these points into six types. Second, we address the (classical) instabilities of the MA, i.e., abrupt changes in the representation arising from slight changes in shape, as when a new branch appears with slight protrusion. The identification of these transitions is clearly crucial in robust object recognition. We show that for the medial axis only two such instabilities are generically possible: (i) when four branches come together (A
1
4), and (ii) when a new branch grows out of an existing one (A
1
A
3). Similarly, there are six cases of shock instabilities, derived as sub-classifications of the MA instabilities. We give an explicit example of a dent forming in an ellipse where many of the transitions described in the paper can be seen to appear. 相似文献
17.
通过研究遗传算法,发现可以利用搜索其整个种群中的基因块来修复最好个体的基因缺陷;基因修复作为一种复制算子,它概括了经典交叉(如n点交叉或均匀交叉)和基因扫描,并且适用于任意(两个或更多)个父代,在机器人导航的路径规划中应用了此种算子,并且得到良好的结果。 相似文献
18.
This paper presents a new method that combines a medial axis and implicit surfaces in order to reconstruct a 3D solid from an unstructured set of points scattered on the object's surface. The representation produced is based on iso-surfaces generated by skeletons, and is a particularly compact way of defining a smooth free-form solid. The method is based on the minimisation of an energy representing a “distance” between the set of data points and the iso-surface, resembling previous reserach19. Initialisation, however, is more robust and efficient since there is computation of the medial axis of the set of points. Instead of subdividing existing skeletons in order to refine the object's surface, a new reconstruction algorithm progressively selects skeleton-points from the pre- computed medial axis using an heuristic principle based on a “local energy” criterion. This drastically speeds up the reconstruction process. Moreover, using the medial axis allows reconstruction of objects with complex topology and geometry, like objects that have holes and branches or that are composed of several connected components. This process is fully automatic. The method has been successfully applied to both synthetic and real data. 相似文献
19.
结合足球机器人比赛的具体应用背景,提出了一种基于扇形扫描的机器人智能避障方法,该方法是先对机器人前进方向进行扇形扫描,确定障碍物的位置,然后进行路径规划,确定局部目标点,最终目标点由一连串局部目标点构成.经仿真和实践证明,该方法是有效的局部路径规划. 相似文献