一种移动机器人路径规划新算法

快速搜索随机树（Rapidly-exploring random Tree Star,RRT*）算法在移动机器人实际应用中规划路径在转向部分存在较多的冗余转折点,导致移动机器人在移动转向过程中出现多次停顿与转向,为剔除规划路径中的冗余路径点,提高机器人移动流畅性,提出一种改进的 RRT*算法。算法将局部逆序试连法引入移动机器人路径规划,在确保RRT*算法概率完备性和渐进最优性的前提下,剔除规划路径中的冗余路径节点,使最终路径更加接近最短路径。通过MATLAB仿真实验证明,规划路径平均长度缩短4%,算法耗时缩短35%,改进后的RRT*算法能缩短规划路径且转向部分路径更加平滑。最后,使用改进后的RRT*算法在室内环境下进行移动机器人路径规划实验。实验结果表明：规划路径上无冗余路径点,且移动机器人沿路径移动流畅。     

An interactive tool for mobile robot motion planning

This paper presents an interactive tool aimed at facilitating the understanding of several well-known algorithms and techniques involved in solving mobile robot motion problems. These range from those modelling the mechanics of mobility to those used in navigation. The tool focuses on describing these problems in a simple manner in order to be useful for education purposes among different disciplines. By highlighting interactivity, the tool provides a novel means to study robot motion planning ideas in a manner that enhances full understanding. Furthermore, the paper discuses how the tool can be used in an introductory course of mobile robotics.     

A roadmap construction algorithm for mobile robot path planning using skeleton maps

Path planning using conventional roadmaps, such as visibility graphs, probability roadmaps and skeleton maps, may have some disadvantages of long length, sharp turns or collisions with obstacles. Specifically, the paths using the conventional skeleton map have unnecessary turns around crossing points, which make longer paths and prevent the robot from moving smoothly. To improve the skeleton map, this paper proposes a new roadmap construction algorithm for path planning of a mobile robot using skeleton maps. The proposed algorithm alleviates the problems of the conventional algorithms by constructing roadmaps which consist of polygons around the crossing points. Simulation results show the efficiency of the proposed algorithm by comparing the results with those obtained using the conventional algorithm.     

A new hybrid algorithm for path planning of mobile robot

The Journal of Supercomputing - The selection of algorithm is the most critical part in the mobile robot path planning. At present, the commonly used algorithms for path planning are genetic...     

一种生物地理学移动机器人路径规划算法

目前,虽然有多种智能计算方法用于移动机器人路径规划问题,但在复杂环境下,多数智能计算方法表现出效率低下,结果较差的问题。提出一种结合基于有效顶点的栅格编码法和改进的生物地理学优化算法的移动机器人路径规划方法,以解决该类问题。结合已知的环境信息,从精英策略、降维机制和基于惯性算子的迁移操作3方面改进了生物地理学优化算法。改进算法用于机器人移动路径,与人工蜂群算法、粒子群算法和人工鱼群算法等智能算法进行比较,实验的结果证实改进算法能够更有效地解决复杂环境下机器人路径规划问题。     

非完整移动机器人鲁棒运动规划

非完整移动机器人利用传感器可以解决不确定性模型和未知环境中的许多问题. 利用移动机器人上配备的传感器的信息组合提出了一种在线视点寻求算法, 结合移动机器人的运动方程和传感器的量测方程采用扩展Kalman估计来对移动机器人的位置进行修正, 以降低运动的不确定性, 从而得到一种鲁棒的规划算法, 仿真的结果证明了上述方法是行之有效的.     

基于传感器的非完整移动机器人运动规划

针对非完整移动机器人在未知室内环境中提出了一种路径规划方法, 通过利用传感器对周围环境的探测和实时处理传感器数据, 以及所设计的目标寻找函数, 可以有效地完成其运动规划. 该方法能够确保移动机器人在无障碍物区或障碍物对机器人不构成危险时加速前进, 在障碍物区能够慢速绕过, 从而使得移动机器人快速且安全地到达目标位置, 仿真的结果证明了该方法的有效性.     

Using occupancy grids for mobile robot perception and navigation

An approach to robot perception and world modeling that uses a probabilistic tesselated representation of spatial information called the occupancy grid is reviewed. The occupancy grid is a multidimensional random field that maintains stochastic estimates of the occupancy state of the cells in a spatial lattice. To construct a sensor-derived map of the robot's world, the cell state estimates are obtained by interpreting the incoming range readings using probabilistic sensor models. Bayesian estimation procedures allow the incremental updating of the occupancy grid, using readings taken from several sensors over multiple points of view. The use of occupancy grids from mapping and for navigation is examined. Operations on occupancy grids and extensions of the occupancy grid framework are briefly considered     

移动机器人最优路径规划方法

针对移动机器人路径规划效率低的问题,提出了一种基于改进的最短路径快速算法的移动机器人最优路径规划方法。该方法在障碍Voronoi图基础上根据规则将起始点与终点加入该图以得到无碰撞路径图,然后采用改进的最短路径快速算法搜索从起始点到终点的最优无碰撞路径。仿真结果表明,采用该改进算法后,移动机器人能够沿着最优无碰撞路径前进,快速达到终点。     

提高移动机器人路径规划效率的方法

针对传统遗传算法存在的初始种群数目庞大,寻优效率和收敛速度慢的缺点,提出了一种基于粗糙集约简决策规则和删除冗余属性的方法。首先建立基于特定栅格法的环境模型,获得机器人路径规划的初始决策表,然后根据粗糙集约简推导最小化决策规则,并用于训练初始种群。最后利用遗传算法优化初始种群,获得最优规划路径。分别在简单和复杂的环境模型下进行了实验,仿真结果表明该方法能够大大减小遗传算法初始种群的规模,缩小算法搜索范围,提高遗传算法的收敛速度和寻优效率,验证了该方法的可行性和优越性。     

A two-stage mobile robot localization method by overlapping segment-based maps

This paper presents a new method for accurately estimating the pose (position and orientation) of a mobile robot by registering a segment-based local map observed from the current robot pose and a global map. The method works in a two-stage procedure. First, the orientation is determined by aligning the local and global map through a voting process based on a generalized Hough transform. Second, it uses a coarse-to-fine approach for selecting candidate positions and a weighted voting scheme to determine the degree of overlap of the two maps at each of these poses. Unlike other methods previously proposed, this approach allows us to uncouple the problem of estimating the robot orientation and the robot position which may be useful for some applications. In addition it can manage environments described by many (possibly short) segments. This paper presents some experimental results based on our mobile robot RAM-2 that show the accuracy and the robustness of the proposed method even for poor quality maps and large dead-reckoning errors.     

A visual tool for computer supported learning: The robot motion planning example

We introduce an effective computer aided learning visual tool (CALVT) to teach graph-based applications. We present the robot motion planning problem as an example of such applications. The proposed tool can be used to simulate and/or further to implement practical systems in different areas of computer science such as graphics, computational geometry, robotics and networking. In the robot motion planning example, CALVT enables users to setup the working environment by creating obstacles and a robot of different shapes, specifying starting and goal positions, and setting other path or environment parameters from a user-friendly interface. The path planning system involves several phases. Each of these modules is complex and therefore we provide the possibility of visualizing graphically the output of each phase. Based on our experience, this tool has been an effective one in classroom teaching. It not only cuts down, significantly, on the instructor’s time and effort but also motivates senior/graduate students to pursue work in this specific area of research.     

Fuzzy logic techniques for mobile robot obstacle avoidance

This paper is concerned with the problem of reactive navigation for a mobile robot in an unknown clustered environment. We will define reactive navigation as a mapping between sensory data and commands. Building a reactive navigation system means providing such a mapping. It can come from a family of predefined functions (like potential fields methods) or it can be built using ‘universal’ approximators (like neural networks). In this paper, we will consider another ‘universal’ approximator: fuzzy logic. We will explain how to choose the rules using a behaviour decomposition approach. It is possible to build a controller working quite well but the classical problems are still there: oscillations and local minima. Finally, we will conclude that learning is necessary for a robust navigation system and fuzzy logic is an easy way to put some initial knowledge in the system to avoid learning from zero.     

移动机器人全局覆盖路径规划算法研究进展与展望

首先通过势场栅格法、单元分解法、全局与局部转换法等三大方法介绍了单移动机器人各种不同的全覆盖算法,分析了各种不同算法的性能,指出了它们的优缺点,并对每种方法的改进方法进行了探讨分析;另外,针对多机器人协作全覆盖路径规划的研究,探讨了基于单机器人全覆盖路径规划算法和任务分配算法等结合得到的多机器人协作路径规划算法;最后探讨移动机器人全覆盖路径规划算法的研究方向。分析结果表明,对于移动机器人全覆盖算法的研究,可充分利用现有算法的优势互补,或借助多学科交叉的优势,寻找更有效的算法。     

Fuzzy control of a mobile robot

This paper describes the design of a new fuzzy logic-based navigation algorithm for autonomous robots. This design effectively achieves correct environment modeling and noisy and uncertain sensory data processing on low-cost hardware equipment. A hierarchical control strategy is presented in which three different reactive behaviors are fused in a single control law by means of a fuzzy supervisor guaranteeing robot safety and task accomplishment. Due to the inherent transparency of fuzzy logic, the proposed algorithm is computationally light, easily reconfigurable, and well-performing in a wide range of differing operating conditions and environments     

Constructing maps for mobile robot navigation based on ultrasonicrange data

This paper introduces an approach to generating environmental maps based on ultrasonic range data. By means of a learning classifier ultrasonic range data are condensed yielding abstract concepts which enable a mobile robot to discern situations. As a consequence the free-space can be partitioned into situation areas which are defined as regions wherein a specific situation can be recognized. Using dead-reckoning such situation areas can be attached to graph nodes generating a map of the free-space in the form of a graph representation. How the extended Kalman filter algorithm can be applied in this context to compensate the dead-reckoning drift is also discussed.     

Integrated planning and execution control for an autonomous mobile robot

We present a distributed hierarchical planning and execution monitoring system and its implementation on an actual mobile robot. The planning system is a distributed hierarchical domain independent system called FPS for Flexible Planning System. It is a rule based plan generation system with planning specific and domain specific rules. A planning solution to the ‘Boxes and Wedge’ Problem is presented.The Robot Control System (RCS) operates and monitors the robot in the real world. In order to allow real-time responses to asynchronous events (both internal and external), RCS consists of a rule-based decision kernel and a distributed set of sensor/effector monitors. RCS contains an execution model and may authorize local corrective actions, e.g., unexpected obstacle avoidance during execution of a trajectory. RCS also generates status and failure reports through which the PMs inform the different decision subsystems as to the robot's state and current capacities. The failure reports help the RCS and planners in correcting/replanning a plan that has aborted. An illustrative example of system behaviour is to be presented.     

一种基于改进Theta *的机器人路径规划算法

对Theta *算法进行改进,并用于解决机器人路径规划问题.首先,将障碍物对机器人产生的斥力作为一种惩罚函数加入到启发函数中,并合理地选择惩罚函数权重以确定启发函数.在此基础上,改进A *算法的变种——Theta *算法,提出对路径进行平滑处理的PS_Theta *算法.最后在二维仿真环境中进行验证及数据统计,并推广至三维复杂环境中,实验结果证明了算法的合理性与有效性