共查询到18条相似文献,搜索用时 56 毫秒
1.
针对室内清洁机器人尽可能充满室内的可达区域执行清扫任务的需求,提出一种基于传感信息的清洁机器人的路径规划算法。在室内清扫环境未知的情况下,这种算法比较简单,清扫的效率较高。清洁机器人位姿也易于控制,且具有自主避障的功能。 相似文献
2.
3.
为了实现微型直升机自主飞行,论文设计了实时的计算机视觉系统。该系统包括机载上的硬件设备和软件算法,能够实现目标识别、特征点提取和位置估计。文中设计了特定图标,并主要依据颜色来进行快速识别。此外,通过检测4个共面的图像特征点,能够在单目单帧的基础上计算出直升机相对于特定目标的三维位置信息。视觉系统任务由位于机载上的IntelSitsang板来执行。由于受到板子运算能力的限制,每秒钟可以处理5帧160×120的彩色图像。飞行实验结果表明,该视觉系统的目标识别率高达93%,角点计算偏差小于3个像素,同时自身定位的三维位置坐标平均偏差为8cm、13cm和6cm。因此,该视觉系统通过精确自身定位,能够很好的辅助微型直升机完成自主悬停、起飞和降落等飞行任务。 相似文献
4.
翁妙凤 《小型微型计算机系统》1998,19(11):63-67
本文讨论了基于三角形模糊数的模糊约束条件和基于梯形模糊数的模糊费用。通过对模糊费用函数清晰化,使模糊目标函数清晰化。最后用最速下降法进行路径搜索,实现了自主车在模糊环境下的越野路径规划。 相似文献
5.
6.
智能机器人的一种新路径规划算法 总被引:1,自引:0,他引:1
为了使智能机器人的运动过程更加顺利快速,使其用更短的时间和更短的路径到达终点,采用了基于几何理论的路径规划算法,寻求智能机器人最优路径规划。该算法利用切线最短的理论优化机器人的运动过程,对智能机器人运动的每一段路径都进行了规划和优化,使智能机器人的整个运动过程更加顺畅。在实际应用中,成功地缩短了机器人的运动路径,并成功地进行了避障。这种方法使用简单,容易理解,可广泛应用于智能机器人的路径规划和避障系统中,在实际应用中更能减少能量损耗。 相似文献
7.
自动导向车(Automated Guided Vehicle, AGV)目前被广泛应用于物流、仓储、制造业和仓储等领域.AGV的路径规划和避障算法是实现AGV自主导航的关键技术,决定了AGV在复杂环境中能否高效、安全地完成任务,近年来成为AGV领域的重要研究热点之一.本文根据AGV路径规划及避障算法的原理与特点,将主流AGV路径规划及避障算法划分为局部避障路径规划算法、基于几何模型的路径规划算法、智能路径规划算法和混合算法4类,对算法的原理、工作流程、优缺点进行了深入分析,并介绍了相应的改进算法.最后,本文对AGV路径规划及避障的未来发展趋势进行展望,为AGV路径规划及避障算法的研究指出了方向. 相似文献
8.
9.
基于人工势场法的移动机器人路径规划研究 总被引:5,自引:0,他引:5
人工势场法是机器人局部路径规划常用的一种方法,具有反应速度快、计算量小和实时性等优点。但这种方法容易产生局部极点,导致机器人停止移动,达不到目标。文章利用传统的人工势场法对移动机器人避障行为进行了仿真实验并成功地规划出一条光滑路径,并对人工势场法研究现状进行了分析讨论。 相似文献
10.
11.
This paper describes a method for local path planning for mobile robots that combines reactive obstacle avoidance with on-line local path planning. Our approach is different to other model-based navigation approaches since it integrates both global and local planning processes in the same architecture while other methods only combine global path planning with a reactive method to avoid non-modelled obstacles. Our local planning is only triggered when an unexpected obstacle is found and reactive navigation is not able to regain the initial path. A new trajectory is then calculated on-line using only proximity sensor information. This trajectory can be improved during the available time using an anytime algorithm. The proposed method complements the reactive behaviour and allows the robot to navigate safely in a partially known environment during a long time period without human intervention. 相似文献
12.
On-line Planning for Collision Avoidance on the Nominal Path 总被引:4,自引:0,他引:4
In this paper a solution to the obstacle avoidance problem for a mobile robot moving in the two-dimensional Cartesian plane is presented. The robot is modelled as a linear time-invariant dynamic system of finite size enclosed by a circle and the obstacles are modelled as circles travelling along rectilinear trajectories. This work deals with the avoidance problem when the obstacles move in known trajectories. The robot starts its journey on a nominal straight line path with a nominal velocity. When an obstacle is detected to be on a collision course with the robot, the robot must devise a plan to avoid the obstacle whilst minimising a cost index defined as the total sum squared of the magnitudes of the deviations of its velocity from the nominal velocity. The planning strategy adopted here is adjustment of the robot's velocity on the nominal path based on the time of collision between the robot and a moving obstacle, and determination of a desired final state such that its Euclidean distance from the nominal final state is minimal. Obstacle avoidance by deviation from the nominal path in deterministic and random environments is based on the work presented here and is investigated in another paper. 相似文献
13.
We propose a novel sensor-based path-planning and obstacle avoidance algorithm GODZILA for navigation in unknown environments.
No prior knowledge of the environment is required. The path-planning algorithm follows a purely local approach using only
the current range sensor measurements at each sampling instant and requiring only a small number of stored variables in memory.
No map of the environment is built during navigation. This minimizes the memory and computational requirements for implementation
of the algorithm, a feature that is especially attractive for small autonomous vehicles. The algorithm utilizes three components:
an optimization algorithm, a local straight-line path planner to visible targets, and random navigation. It is proved, for
navigation in any finite-dimensional space, that the path-planning algorithm converges in finite time with probability 1.
The performance of the algorithm is demonstrated through simulations for path-planning in two-dimensional (2D) and three-dimensional
(3D) spaces. It is seen that a relatively small number of range sensor measurements is sufficient even in complex unknown
environments.
This work is supported in part by the ARO under contract #W911NF-04-C-002, by the ONR under contract #N00014-06-C-0051, and
by IntelliTech Microsystems, Inc. An earlier version of this paper was presented at the 2005 American Control Conference,
Portland, OR. 相似文献
14.
针对微小型直升机建模困难,而且内部和外部扰动都比较大的问题,提出一种基于自抗扰控制的飞行
控制方法.按照飞行控制的要求改进了原算法的扩张状态观测器离散方程和非线性反馈函数.起飞、悬停和强风中
飞行控制仿真验证了改进的自抗扰控制方法的有效性. 相似文献
15.
现有的差分全球定位系统通常需要高精度地图数据的支持,然而高精地图制作成本高昂,且
庞大的地图数据对车载电脑性能及网络通讯带宽有较高要求。该文提出一种基于低数据量矢量地图的智能车导航方法,通过引入道路标签机制,从高层次抽象组织道路点,以便快速建立矢量导航地图,并大幅度降低道路点的重复存储。基于该地图的导航方法自动规划最优全局路径,通过基于预瞄点与历史点的几何学算法进行路径跟踪与避障,从而将上位机计算出的方向盘转角、油门和制动踏板深度信息传递到车辆底层控制器,以控制车辆按规划路径行驶。该方法的有效性和准确性在自主开发的无人驾驶平台上得到了验证。 相似文献
16.
17.
针对机器人足球系统的高度实时性、不确定性,提出了一种基于统计预测的路径规划方法,该方法考虑到障碍物的速度大小和方向的不确定性,用数学统计的方法对障碍物的运动进行建模;机器人在运动过程中,根据得到的环境信息在机器视觉范围内建立预测窗口和避障窗口,在预测窗口内,机器人根据障碍物的信息建立障碍物的预测区域,在避障窗口内,机器人根据自身的位置与障碍物的预测区域,分别调用切线法或滚动窗口法进行路径规划;该方法属于局部路径规划方法,机器人在移动过程中需要不断更新环境信息来进行避障. 相似文献