机器人抓取运动目标的轨迹规划方法

本文讨论了机器人在抓取运动目标前的接近轨迹规划问题，给出了一种新的在平面上抓取目标的方案。这种方案适用于机器人接近作直线运动或轨迹已知的平面曲线运动的目标的轨迹规划。本文还研究了当目标沿直线以不同速度运动时机器人手爪要抓取它而必须达到的最小末端速度，最后给出了一些仿真结果。     

基于比例导引的足球机器人截球算法研究

常用的足球机器人截球运动控制算法较少,通过类比机器人截球运动与导弹或鱼雷追踪目标的相似性,引入军事目标追踪导引算法中常用的比例导引算法,并给出了导引算法模型及其在足球机器人系统中的应用实现。仿真结果表明该算法效果明显,行之有效,并能够根据不同的应用要求灵活的调整导引系数,取得比较理想的截球控制效果。     

Mobile robot path planning and tracking using simulated annealing and fuzzy logic control

This article describes the development and implementation of an automatic controller for path planning and navigation of an autonomous mobile robot using simulated annealing and fuzzy logic. The simulated annealing algorithm was used to obtain a collision-free optimal trajectory among fixed polygonal obstacles. C-space was used to represent the working space and B-spline curves were used to represent the trajectories. The trajectory tracking was performed with a fuzzy logic algorithm. A detailed explanation of the algorithm is given. The objectives of the control algorithm were to track the planned trajectory and to avoid collision with moving obstacles. Simulation and implementation results are shown. A Nomadic 200 mobile robot was used to perform the experiments.     

基于改进粒子群算法的移动机器人路径规划

为了提高复杂环境下移动机器人的精准导航作用,提出了移动机器人路径规划的改进粒子群优化(PSO)算法,即利用粒子个体极值的加权平均值,同时加入惯性权重.建立了移动机器人工作环境的栅格模型,利用Matlab软件进行移动机器人路径规划仿真分析.仿真结果表明:改进后的粒子群算法容易使粒子移动到最佳位置,加强了全局寻优能力,在复杂环境中搜索路径性能优于传统算法.     

Path planning of wheeled mobile robot with simultaneous free space locating capability

This paper presents a hybrid path planning algorithm for the design of autonomous vehicles such as mobile robots. The hybrid planner is based on Potential Field method and Voronoi Diagram approach and is represented with the ability of concurrent navigation and map building. The system controller (Look-ahead Control) with the Potential Field method guarantees the robot generate a smooth and safe path to an expected position. The Voronoi Diagram approach is adopted for the purpose of helping the mobile robot to avoid being trapped by concave environment while exploring a route to a target. This approach allows the mobile robot to accomplish an autonomous navigation task with only an essential exploration between a start and goal position. Based on the existing topological map the mobile robot is able to construct sub-goals between predefined start and goal, and follows a smooth and safe trajectory in a flexible manner when stationary and moving obstacles co-exist.     

Navigation system including associative memory

A new adaptive linear robot control system for a robot work cell that can visually track and intercept stationary and moving objects undergoing arbitrary motion anywhere along its predicted trajectory within the robot's workspace is presented in this paper. The proposed system was designed by integrating a stationary monocular CCD camera with off-the-shelf frame grabber and an industrial robot operation into a single application on the MATLAB platform. A combination of the model based object recognition technique and a learning vector quantization network is used for classifying stationary objects without overlapping. The optical flow technique and the MADALINE network are used for determining the target trajectory and generating the predicted robot trajectory based on visual servoing, respectively. The necessity of determining a model of the robot, camera, all the stationary and moving objects, and environment is eliminated. The location and image features of these objects need not be preprogrammed, marked and known before, and any change in a task is possible without changing the robot program. After the learning process on the robot, it is shown that the KUKA robot is capable of tracking and intercepting both stationary and moving objects at an optimal rendezvous point on the conveyor accurately in real-time.     

基于多参数优化的多机器人图案构成的分配算法

在不同应用场景下多机器人系统的图案构成受到越来越多的关注,然而现有方法不能有效地优化在障碍物环境中的图案在线自主构成.为解决这一问题,提出一种新的基于目标匹配和路径优化的实时在线的优化算法.首先,以机器人与虚拟期望图案的距离为目标函数,建立一个多参数的图案构成模型,进而在一定的约束条件下求解得到最优的期望图案参数;其次,建立迭代控制器,使机器人在向目标点移动的过程中,可以实时在线地进行机器人与目标点的分配;然后,采用最佳避碰速度算法使机器人无碰撞地到达期望图案的目标点,完成图案构成;最后,通过在MATLAB和V-REP中的仿真实验,验证所提出方法的正确性和有效性.     

Seeking a path through the crowd: Robot navigation in unknown dynamic environments with moving obstacles based on an integrated environment representation

We present a novel algorithm for collision free navigation of a non-holonomic robot in unknown complex dynamic environments with moving obstacles. Our approach is based on an integrated representation of the information about the environment which does not require to separate obstacles and approximate their shapes by discs or polygons and is very easy to obtain in practice. Moreover, the proposed algorithm does not require any information on the obstacles’ velocities. Under our navigation algorithm, the robot efficiently seeks a short path through the crowd of moving or steady obstacles. A mathematically rigorous analysis of the proposed approach is provided. The performance of the algorithm is demonstrated via experiments with a real robot and extensive computer simulations.     

基于鱼群算法的智能机器人全覆盖路径规划

为保证机器人的行驶轨迹可以全方位地的覆盖地图的全部坐标点,并降低路径重复率,基于鱼群算法设计智能机器人全覆盖路径规划方法。建立智能机器人死区脱困模型,计算栅格地图模型中的目标活性值,获取整体栅格数量,描述地图中栅格状态,得到脱困时的行驶角度差。基于鱼群算法设计全路径覆盖判定方法,描述不同目标鱼个体之间的距离,在三重移动目标坐标系下,获取元素坐标向量,建立每个目标点的求解代价和,计算下一个目标点行驶的最小距离。设计机器人全覆盖路径规划算法,判断当前位置是否为死区,获取路径规划的全局最优解,实现智能机器人的全覆盖路径规划。利用Matlab仿真软件完成智能机器人全覆盖路径规划实验。结果表明,在简单环境下,该路径规划方法覆盖率为100%,重复率为5.23%,路径长度为15.36m；在复杂环境下,该路径规划方法的覆盖率为100%,重复率则为10.24%,路径长度为20.34m。由此证明,该方法具有较好地规划效果较好。     

基于虚拟导航线的农业机器人精确视觉导航方法

针对农田、野外环境中无人工标记情况下的导航问题,提出了一种基于虚拟导航线的农业机器人精确视觉导航方法。该方法不需要铺设导航线或者路标即可引导机器人行走直线。首先,根据需求确定需要跟踪的目标区域,之后控制机器人调整方向直到目标移至视野中央;其次,根据机器人和目标的位置确定参照目标,并依据两个目标的位置确定虚拟导航线;然后,动态更新导航线,并结合虚拟定标线和虚拟导航线确定偏移角度和偏移距离;最后,利用偏移参数构建模糊控制表,并以此实现对机器人旋转角度和行走速度的调整。实验结果表明,该算法能较为精确地实现对导航路线的识别,进而利用模糊控制策略使机器人沿直线向目标行走,且导航精度在10 cm以内。     

Dynamic generation of subgoals for autonomous mobile robots usinglocal feedback information

An algorithm is presented for using a local feedback information to generate subgoals for driving an autonomous mobile robot (AMR) along a collision-free trajectory to a goal. The subgoals section algorithm (SSA) updates subgoal positions while the AMR is moving so that continuous motion is achieved without stopping to replan a path when new sensor data becomes available. Assuming a finite number of polynomial obstacles (i.e. the internal representation of the local environment in terms of a 2-D map with linear obstacles boundaries) and a dynamic steering control algorithm (SCA) capable of driving the AMR to safe subgoals, it is shown that the feedback algorithm for subgoal selection will direct the AMR along a collision-free trajectory to the final goal in finite time. Properties of the algorithm are illustrated by simulation examples     

Safe proactive plans and their execution

We present in this paper a methodology for computing the maximum velocity profile over a trajectory planned for a mobile robot. Environment and robot dynamics as well as the constraints of the robot sensors determine the profile. The planned profile is indicative of maximum speeds that can be possessed by the robot along its path without colliding with any of the mobile objects that could intercept its future trajectory. The mobile objects could be arbitrary in number and the only information available regarding them is their maximum possible velocity. The velocity profile also enables one to deform planned trajectories for better trajectory time. The methodology has been adopted for holonomic and non-holonomic motion planners. An extension of the approach to an online real-time scheme that modifies and adapts the path as well as velocities to changes in the environment such that both safety and execution time are not compromised is also presented for the holonomic case. Simulation and experimental results demonstrate the efficacy of this methodology.     

An algorithm for multi-robot collision-free navigation based on shortest distance

This paper presents a new approach for multi-robot navigation in dynamic environments, called the shortest distance algorithm. This approach uses both the current position and orientation of other robots to compute the collision free trajectory. The algorithm suggested in this paper is based on the concept of reciprocal orientation that guarantees smooth trajectories and collision free paths. All the robots move either in a straight line or in a circular arc using the Bresenham algorithms. The current approach is tested on three simulation scenarios.     

改进A*算法的移动机器人最短路径规划

针对复杂室内环境下移动机器人路径规划存在实时性差的问题,通过对Dijkstra算法、传统A^*算法以及一些改进的A^*算法的分析比较,提出了对A^*算法的进一步改进的思路。首先对当前节点及其父节点的估计路径代价进行指数衰减的方式加权,使得A^*算法在离目标点较远时能够很快地向目标点靠近,在距目标点较近时能够局部细致搜索保证目标点附近障碍物较多时目标可达;然后对生成的路径进行五次多项式平滑处理,使得路径进一步缩短且便于机器人控制。仿真结果表明,改进算法较传统A^*算法时间减少93.8%,路径长度缩短17.6%、无90°转折点,使得机器人可以连续不停顿地跟踪所规划路径到达目标。在不同的场景下,对所提算法进行验证,结果表明所提算法能够适应不同的环境且有很好的实时性。     

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.     

A learning fuzzy algorithm for motion planning of mobile robots

A sensor-based fuzzy algorithm is proposed to navigate a mobile robot in a 2-dimensional unknown environment filled with stationary polygonal obstacles. When the robot is at the starting point, vertices of the obstacles that are visible from the robot are scanned by the sensors and the one with the highest priority is chosen. Here, priority is an output fuzzy variable whose value is determined by fuzzy rules. The robot is then navigated from the starting point to the chosen vertex along the line segment connecting these two points. Taking the chosen vertex as the new starting point, the next navigation decision is made. The navigation process will be repeated until the goal point is reached.In implementation of fuzzy rules, the ranges of fuzzy variables are parameters to be determined. In order to evaluate the effect of different range parameters on the navigation algorithm, the total traveling distance of the robot is defined as the performance index first. Then a learning mechanism, which is similar to the simulated annealing method in the neural network theory, is presented to find the optimal range parameters which minimize the performance index. Several simulation examples are included for illustration.     

Reinforcement based mobile robot navigation in dynamic environment

In this paper, a new approach is developed for solving the problem of mobile robot path planning in an unknown dynamic environment based on Q-learning. Q-learning algorithms have been used widely for solving real world problems, especially in robotics since it has been proved to give reliable and efficient solutions due to its simple and well developed theory. However, most of the researchers who tried to use Q-learning for solving the mobile robot navigation problem dealt with static environments; they avoided using it for dynamic environments because it is a more complex problem that has infinite number of states. This great number of states makes the training for the intelligent agent very difficult. In this paper, the Q-learning algorithm was applied for solving the mobile robot navigation in dynamic environment problem by limiting the number of states based on a new definition for the states space. This has the effect of reducing the size of the Q-table and hence, increasing the speed of the navigation algorithm. The conducted experimental simulation scenarios indicate the strength of the new proposed approach for mobile robot navigation in dynamic environment. The results show that the new approach has a high Hit rate and that the robot succeeded to reach its target in a collision free path in most cases which is the most desirable feature in any navigation algorithm.     

Evolutionary algorithm based offline/online path planner for UAV navigation

An evolutionary algorithm based framework, a combination of modified breeder genetic algorithms incorporating characteristics of classic genetic algorithms, is utilized to design an offline/online path planner for unmanned aerial vehicles (UAVs) autonomous navigation. The path planner calculates a curved path line with desired characteristics in a three-dimensional (3-D) rough terrain environment, represented using B-spline curves, with the coordinates of its control points being the evolutionary algorithm artificial chromosome genes. Given a 3-D rough environment and assuming flight envelope restrictions, two problems are solved: i) UAV navigation using an offline planner in a known environment, and, ii) UAV navigation using an online planner in a completely unknown environment. The offline planner produces a single B-Spline curve that connects the starting and target points with a predefined initial direction. The online planner, based on the offline one, is given on-board radar readings which gradually produces a smooth 3-D trajectory aiming at reaching a predetermined target in an unknown environment; the produced trajectory consists of smaller B-spline curves smoothly connected with each other. Both planners have been tested under different scenarios, and they have been proven effective in guiding an UAV to its final destination, providing near-optimal curved paths quickly and efficiently.     

结合历史运动状态的机器人高效沿墙算法研究

针对目前室内移动机器人沿墙走算法过于复杂、路径易重复、不能完全遍历、效率低等问题, 采用室内未知环境下结合历史状态的机器人沿墙高效遍历研究来解决这些问题. 该算法由移动机器人的上一个周期历史环境运动状态(分8类)、当前环境运动状态(分8类)和旋向信息(分2类)建立运动规则库, 沿墙行走时移动机器人时时采集这三类信息(上一个周期历史环境运动状态、当前环境运动状态和旋向信息)决定移动机器人当前的运动方向, 如此循环直到完成指定的沿墙任务. 最后对该算法进行了仿真与实际实验, 实验结果证明该算法可以在不同的、复杂的环境中高效、快速地完成沿墙走的任务, 并且对室内未知环境有很好的适应性.     

一种改进的机器人滚动路径规划算法

针对静态和动态障碍物共存环境中机器人滚动路径规划的鲁棒性问题,提出了通过确定局部子目标位置判断机器人行进路线的路径规划算法.机器人以滚动窗口的形式实时检测局部环境信息,寻找并确定局部子目标的位置,从而做出下一步安全路径规划.机器人不断重复该过程,最终沿着一条优化路径安全到达目标点.仿真结果表明:该算法能使机器人沿着优化...