首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 15 毫秒
1.
In an autonomous multi-mobile robot environment, path planning and collision avoidance are important functions used to perform a given task collaboratively and cooperatively. This study considers these important and challenging problems. The proposed approach is based on a potential field method and fuzzy logic system. First, a global path planner selects the paths of the robots that minimize the potential value from each robot to its own target using a potential field. Then, a local path planner modifies the path and orientation from the global planner to avoid collisions with static and dynamic obstacles using a fuzzy logic system. In this paper, each robot independently selects its destination and considers other robots as dynamic obstacles, and there is no need to predict the motion of obstacles. This process continues until the corresponding target of each robot is found. To test this method, an autonomous multi-mobile robot simulator (AMMRS) is developed, and both simulation-based and experimental results are given. The results show that the path planning and collision avoidance strategies are effective and useful for multi-mobile robot systems.  相似文献   

2.
为了实现在多移动机器人和多窄通道的复杂动态环境中机器人的节能运动规划,提出异构多目标差分-动态窗口法(heterogeneous multi-objective differential evolution-dynamic window algorithm,HMODE-DWA).首先,建立行驶时间、执行器作用力和平滑度的3目标优化模型,设计具有碰撞约束的异构多目标差分进化算法来获得3个目标函数的最优解,进而在已知的静态环境中获得帕累托前沿,利用平均隶属度函数获得起点与终点间最优的全局路径;其次,定义基于环境缓冲区域的模糊动态窗口法使机器人完成动态复杂环境中避障,利用所提出的HMODE-DWA算法动态避障的同时实现节能规划.仿真和实验结果表明,所提出的混合路径规划控制策略能够有效降低移动机器人动态避障过程中的能耗.  相似文献   

3.
传统的路径规划算法只能在障碍物不发生位置变化的环境中计算最优路径。但是随着机器人在商场、医院、银行等动态环境下的普及,传统的路径规划算法容易与动态障碍物发生碰撞等危险。因此,关于随机动态障碍物条件下的机器人路径规划算法需要得到进一步改善。为了解决在动态环境下的机器人路径规划问题,提出了一种融合机器人与障碍物运动信息的改进动态窗口法来解决机器人在动态环境下的局部路径规划问题,并且与优化A*算法相结合来实现全局最优路径规划。主要内容体现为:在全局路径规划上,采用优化A*算法求解最优路径。在局部路径规划上,以动态障碍物的速度作为先验信息,通过对传统动态窗口法的评价函数进行扩展,实现机器人在动态环境下的自主智能避障。实验证明,该算法可以实现基于全局最优路径的实时动态避障,具体表现为可以在不干涉动态障碍物的条件下减少碰撞风险、做出智能避障且路径更加平滑、长度更短、行驶速度更快。  相似文献   

4.
基于几何法的移动机器人路径规划   总被引:2,自引:0,他引:2  
旨在解决动态环境中移动机器人与障碍物发生碰撞可能性的判断和避开障碍的路径规划。提出了采用几何计算的方法判断机器人和障碍物之间发生碰撞的条件,规划出机器人沿着收敛曲线运动到安全圆周,在安全圆周上作动态圆周运动,最后沿着圆弧退出圆周到达预定的避障路径。将基本的避开障碍的理论和几何算法有机地结合起来,获得了光滑的路径,提高了机器人避开障碍的效率。  相似文献   

5.
针对传统人工势场法在多障碍物复杂环境的全局路径规划中出现的目标不可达、易陷入陷阱区域以及局部极小点问题,提出一种简化障碍物预测碰撞人工势场法(simplified obstacles and predict collision of artificial potential field method,SOPC-APF)...  相似文献   

6.
张志杰 《计算机应用》2012,32(9):2527-2529
随机路径规划算法大量用于商品化的室内清洁机器人,但规划效率低下,为此提出一种低成本、高效的改进方法。由于机器人到其四周障碍物的距离随空间位置不同而变化,先使用超声测距模块获得障碍距离并组成特征向量用以区分不同的空间位置;然后,用推土机距离(EMD)进行特征向量匹配,建立并维护碰撞点集;最后,利用模糊控制理论处理碰撞后的旋转角度,完成路径规划过程。实验结果表明,所提方法一方面保留了随机规划的工作趣味性和环境适应性,另一方面大大提高了清洁效率。  相似文献   

7.
Traditional artificial potential field algorithm for multi-robot formation is easy to fall into local minima and the path planning efficiency is low. To this end, we propose a new method of a hybrid formation path planning based on A* and multi-target improved artificial potential field algorithm (A*-MTIAPF) that provides the optimal collision free path and improves the efficiency for multi-robot formation path planning. The A*-MTIAPF algorithm integrates global path planning and local path planning. The novelties include combining A* with the improved artificial potential field algorithm and dividing multiple virtual sub-target points on the global optimal path of A* planning. Firstly, A* algorithm is used to complete the global path planning. Secondly, the improved artificial potential field algorithm which takes multiple sub-target points divided by the global optimal path as virtual target points is used to complete local path planning by switching target points. In addition, we propose a double priority judgment control algorithm (DPJC) to solve the collision problem among multiple robots by setting double priority to determine the movement order of each robot. Then, a new experimental method is designed by using the randomly generated 2D maps to verify the effectiveness of the proposed method. The results show that our method has advantages that it solves the local minimum problem, improves the efficiency of formation path planning and avoids collision among multiple robots over existing methods.  相似文献   

8.
针对移动机器人在复杂环境下采用传统方法路径规划收敛速度慢和局部最优问题,提出了斥力场下粒子群优化(PSO)的移动机器人路径规划算法。首先采用栅格法对机器人的移动路径进行初步规划,并将栅格法得到的初步路径作为粒子的初始种群,根据障碍物的不同形状和尺寸以及障碍物所占的地图总面积确定栅格粒度的大小,进而对规划路径进行数学建模;然后根据粒子之间的相互协作实现对粒子位置和速度的不断更新;最后采用障碍物斥力势场构造高安全性适应度函数,从而得到一条机器人从初始位置到目标的最优路径。利用Matlab平台对所提算法进行仿真,结果表明,该算法可以实现复杂环境下路径寻优和安全避障;同时还通过对比实验验证了算法收敛速度快,能解决局部最优问题。  相似文献   

9.
In this paper, a practically viable approach for conflict free, coordinated motion planning of multiple robots is proposed. The presented approach is a two phase decoupled method that can provide the desired coordination among the participating robots in offline mode. In the first phase, the collision free path with respect to stationary obstacles for each robot is obtained by employing an A* algorithm. In the second phase, the coordination among multiple robots is achieved by resolving conflicts based on a path modification approach. The paths of conflicting robots are modified based on their position in a dynamically computed path modification sequence (PMS). To assess the effectiveness of the developed methodology, the coordination among robots is also achieved by different strategies such as fixed priority sequence allotment for motion of each robot, reduction in the velocities of joints of the robot, and introduction of delay in starting of each robot. The performance is assessed in terms of the length of path traversed by each robot, time taken by the robot to realize the task and computational time. The effectiveness of the proposed approach for multi-robot motion planning is demonstrated with two case studies that considered the tasks with three and four robots. The results obtained from realistic simulation of multi-robot environment demonstrate that the proposed approach assures rapid, concurrent and conflict free coordinated path planning for multiple robots.  相似文献   

10.
许维健  郑文波 《机器人》1990,12(5):40-45
本文应用在障碍时变工作空间中把固定障碍和时变障碍分解的思想.首先就固定障碍问题,为机器人规划一条无碰撞路径,然后通过规划机器人的速度来达到避开活动障碍的目的.本文接着提出在时间-路径空间中以忽略可动障碍时机器人的运动策略为基准策略,根据障碍约束和机器人速度或加速度约束,用有理二次函数来规划机器人避开可动障碍的运动策略.  相似文献   

11.
杨洋  童东兵  陈巧玉 《计算机应用》2018,38(6):1809-1813
针对移动机器人路径规划中无法准确得知全局地图的问题,提出了一种基于模糊规则和人工势场法的局部路径规划算法。首先,利用测距组与模糊规则,进行障碍物的形状分类,构建局部地图;其次,在人工势场法中引入了一种修正的斥力函数,基于局部地图,利用人工势场法进行局部路径规划;最后,随着机器人的运动,设置时间断点,以减少路径震荡。针对随机障碍物和凹凸障碍物的地图,分别采用传统人工势场法和改进的人工势场法进行仿真,其结果表明:在遇到随机障碍物时,相比传统人工势场法,改进的人工势场法能够显著减少与障碍物的碰撞;在遇到凹凸障碍物时,改进的人工势场法能够很好地完成路径规划的目标。所提算法对地形变化适应能力强,能够实现在未知地图下的六足机器人路径规划。  相似文献   

12.
Potential field method has been widely used for mobile robot path planning, but mostly in a static environment where the target and the obstacles are stationary. The path planning result is normally the direction of the robot motion. In this paper, the potential field method is applied for both path and speed planning, or the velocity planning, for a mobile robot in a dynamic environment where the target and the obstacles are moving. The robot’s planned velocity is determined by relative velocities as well as relative positions among robot, obstacles and targets. The implementation factors such as maximum linear and angular speed of the robot are also considered. The proposed approach guarantees that the robot tracks the moving target while avoiding moving obstacles. Simulation studies are provided to verify the effectiveness of the proposed approach.  相似文献   

13.
Reinforcement learning (RL) is a popular method for solving the path planning problem of autonomous mobile robots in unknown environments. However, the primary difficulty faced by learning robots using the RL method is that they learn too slowly in obstacle-dense environments. To more efficiently solve the path planning problem of autonomous mobile robots in such environments, this paper presents a novel approach in which the robot’s learning process is divided into two phases. The first one is to accelerate the learning process for obtaining an optimal policy by developing the well-known Dyna-Q algorithm that trains the robot in learning actions for avoiding obstacles when following the vector direction. In this phase, the robot’s position is represented as a uniform grid. At each time step, the robot performs an action to move to one of its eight adjacent cells, so the path obtained from the optimal policy may be longer than the true shortest path. The second one is to train the robot in learning a collision-free smooth path for decreasing the number of the heading changes of the robot. The simulation results show that the proposed approach is efficient for the path planning problem of autonomous mobile robots in unknown environments with dense obstacles.  相似文献   

14.
蒲兴成    谭令 《智能系统学报》2023,18(2):314-324
针对移动机器人在复杂环境下的路径规划问题,提出一种新的自适应动态窗口改进细菌算法,并将新算法应用于移动机器人路径规划。改进细菌算法继承了细菌算法与动态窗口算法(dynamic window algorithm, DWA)在避障时的优点,能较好实现复杂环境中移动机器人静态和动态避障。该改进算法主要分三步完成移动机器人路径规划。首先,利用改进细菌趋化算法在静态环境中得到初始参考规划路径。接着,基于参考路径,机器人通过自身携带的传感器感知动态障碍物进行动态避障并利用自适应DWA完成局部动态避障路径规划。最后,根据移动机器人局部动态避障完成情况选择算法执行步骤,如果移动机器人能达到最终目标点,结束该算法,否则移动机器人再重回初始路径,直至到达最终目标点。仿真比较实验证明,改进算法无论在收敛速度还是路径规划精确度方面都有明显提升。  相似文献   

15.
This paper aims to propose a novel design approach for on-line path planning of the multiple mobile robots system with free collision. Based on the artificial bee colony (ABC) algorithm, we propose an efficient artificial bee colony (EABC) algorithm for solving the on-line path planning of multiple mobile robots by choosing the proper objective function for target, obstacles, and robots collision avoidance. The proposed EABC algorithm enhances the performance by using elite individuals for preserving good evolution, the solution sharing provides a proper direction for searching, the instant update strategy provides the newest information of solution. By the proposed approach, the next positions of each robot are designed. Thus, the mobiles robots can travel to the designed targets without collision. Finally, simulation results of illustration examples are introduced to show the effectiveness and performance of the proposed approach.  相似文献   

16.
A Cellular Automaton-based technique suitable for solving the path planning problem in a distributed robot team is outlined. Real-time path planning is a challenging task that has many applications in the fields of artificial intelligence, moving robots, virtual reality, and agent behavior simulation. The problem refers to finding a collision-free path for autonomous robots between two specified positions in a configuration area. The complexity of the problem increases in systems of multiple robots. More specifically, some distance should be covered by each robot in an unknown environment, avoiding obstacles found on its route to the destination. On the other hand, all robots must adjust their actions in order to keep their initial team formation immutable. Two different formations were tested in order to study the efficiency and the flexibility of the proposed method. Using different formations, the proposed technique could find applications to image processing tasks, swarm intelligence, etc. Furthermore, the presented Cellular Automaton (CA) method was implemented and tested in a real system using three autonomous mobile minirobots called E-pucks. Experimental results indicate that accurate collision-free paths could be created with low computational cost. Additionally, cooperation tasks could be achieved using minimal hardware resources, even in systems with low-cost robots.  相似文献   

17.
A collision-free motion planning method for mobile robots moving in 3-dimensional workspace is proposed in this article. To simplify the mathematical representation and reduce the computation complexity for collision detection, objects in the workspace are modeled as ellipsoids. By means of applying a series of coordinate and scaling transformations between the robot and the obstacles in the workspace, intersection check is reduced to test whether the point representing the robot falls outside or inside the transformed ellipsoids representing the obstacles. Therefore, the requirement of the computation time for collision detection is reduced drastically in comparison with the computational geometry method, which computes a distance function of the robot segments and the obstacles. As a measurement of the possible occurrence of collision, the collision index, which is defined by projecting conceptually an ellipsoid onto a 3-dimensional Gaussian distribution contour, plays a significant role in planning the collision-free path. The method based on reinforcement learning search using the defined collision index for collision-free motion is proposed. A simulation example is given in this article to demonstrate the efficiency of the proposed method. The result shows that the mobile robot can pass through the blocking obstacles and reach the desired final position successfully after several trials.  相似文献   

18.
《Advanced Robotics》2013,27(7):609-627
In this paper, we consider the problem of planning a feasible path for a quadruped walking robot in an environment of obstacles. In conventional path-planning problems, the main focus is merely collision avoidance with obstacles since a wheeled robot is involved. However, in the case of a legged robot, both collision avoidance and crossing over obstacles must be taken into account in the process of path planning. Furthermore, the constraints of the gait should be considered to guarantee the feasibility of a planned path. To resolve this complicated problem in a systematic way, a new concept of an artificial thermal field is proposed. Specifically, with the assumption that a robot walks with a periodic crab gait, a robot and obstacles in a three-dimensional (3D) space are projected on a 2D plane. Next, the 2D obstacles are transformed into the configuration space of a quadruped robot. A feasible path is finally sought in an artificial thermal field which is constructed numerically on the discretized configuration space. To verify the efficacy of the proposed approach, three notable simulation results are provided.  相似文献   

19.
为解决多机器人在静态环境中的路径规划问题,以路径长度为优化目标模型,并针对此模型设计了多机器人萤火虫算法(MR-FA)。首先,考虑到路径安全性对环境中的障碍物采取扩张操作,设计初始化规则以提高生成初始种群的效率;其次,根据算法的连续性原理及特点,设计个体等长策略将维度不一致的个体转变为等维度个体以便于萤火虫的移动更新,并对移动更新后的不可行解采取路径修正策略;然后对规划出的每个机器人的移动路径进行碰撞检测,同时针对机器人不同的碰撞情况设计相应的避碰策略,即暂停—回退策略(PFS)、局部路径重规划策略(LPRS);最后,为验证MR-FA的有效性,在三组环境中进行仿真实验并与其他三种算法进行对比,综合得出MR-FA在解决多机器人路径规划时更有优势。  相似文献   

20.
提出了一种机器人动态路径规划方法。该方法首先采用时间栅格法采标识动态障碍物。建立机器人的环境信息,然后使用免疫算法实现在动态环境下机器人的全局和局部路径规划,达到避障和避碰的目的。文中定义了免疫算法的多因素适应度函数由碰撞系数、距离、转角和安全系数决定。实验表明所提方法可以提高路径规划的效率,满足机器人实时导航要求。  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号