异构多目标差分-动态窗口算法 及其在移动机器人中的应用

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

面向未知环境及动态障碍的人工势场路径规划算法

实际战场环境错综复杂,很多隐蔽、动态的障碍无法通过高空手段预先探测得知,因而对智能体执行任务的安全性产生威胁。针对未知且障碍形态多样的战场环境,以躲避动、静障碍,追踪目标为研究对象,提出一种面向未知环境及动态障碍的改进人工势场(Artificial Potential Field,APF)路径规划算法。在该算法中,智能体构建了以目标点为中心的引力势场,以及以障碍物为中心的斥力势场,在智能体行进路途中感知局部障碍及目标点的运动信息,并且将信息加入势场函数的计算中达到动态避障与追踪的效果;另一方面,引入距离因子及动态临时目标点来消除APF算法常见的无解问题——极小解情况及路径抖动现象。通过建立不同数量的随机障碍场景,进行多次仿真对比实验,结果表明:所提算法能够在未知环境中灵活躲避动态障碍并进行目标点的追踪,可以有效消除死解及路径抖动问题。将所提算法与传统APF算法及添加了动态避障机制的文献[19]所述算法进行对比实验,结果表明所提算法能成功化解两种对比算法路径规划失败的情况,顺利完成路径规划任务,且成功率在95%以上。     

Motion planning of multiple mobile robots by a combination of learned visibility graphs and virtual impedance

A motion planning algorithm for multiple mobile robots is proposed in this paper. A hierarchical architecture with two layers 'learned visibility graph layer (upper layer)' and 'virtual impedance layer (lower layer)' (one of the potential field planning method) is presented. This system has the following characteristics: (1) is applicable to unknown dynamic environments, (2) is applicable to distributed multiple robot systems and (3) is capable of adequate path generation and motion. At the upper layer, efficient exploration of environments makes it possible to generate sub-shortest paths that avoid static obstacles. At the lower layer, on-line avoidance can be made with virtual impedance against moving obstacles such as other robots. Simulation results show the validity of the proposed method.     

一种动态未知环境下的机器人路径搜索方法

提出了一种新的路径搜索算法——"触觉感知法"来实现机器人在未知静态与动态环境情况下的路径搜索。该方法不需要提供地图信息,机器人仅收集目标点的距离和方位信息以及通过自带传感器作为触觉器收集周围局部环境信息。机器人以BP神经网络作为决策器,经过训练,可以在静态和动态环境中搜索出一条光滑无碰撞且便捷并能有效避开动态障碍物的运动轨迹。对所提出的方法进行了仿真实验,仿真结果表明算法在静态和动态环境下均能有高效率的路径搜索表现。     

概率模型下异构传感器网络部署算法的研究

目前采用虚拟力方法解决传感器节点部署问题的算法均基于同构传感器网络,面向异构传感器网络的部署需求,提出扩展的虚拟力算法.该算法采用概率感知模型,部署时根据感知半径的悬殊采用静态部署与动态部署相结合的策略,根据节点感知半径差异度决定最佳距离的取值,节点移动时采用接替移动法.仿真结果表明该算法能够根据应用需要将异构传感器节点合理地部署于目标区域内,同时能有效地均衡网络节点的能耗,延长网络的生存时间.     

栅格地图中多机器人协作搜索目标

目标搜索是多机器人领域的一个挑战.本文针对栅格地图中多机器人目标搜索算法进行研究.首先,利用Dempster-Shafer证据理论将声纳传感器获取的环境信息进行融合,构建搜索环境的栅格地图.然后,基于栅格地图建立生物启发神经网络用于表示动态的环境.在生物启发神经网络中,目标通过神经元的活性值全局的吸引机器人.同时,障碍物通过神经元活性值局部的排斥机器人,避免与其相撞.最后,机器人根据梯度递减原则自动的规划出搜索路径.仿真和实验结果显示本文提及的算法能够实现栅格地图中静态目标和动态目标的搜索.与其他搜索算法比较,本文所提及的目标搜索算法有更高的效率和适用性.     

A method for combining odometry and distance sensor information for effective obstacle avoidance of autonomous mobile robots

In this paper, a concept for virtual sensors is proposed for efficient avoidance of obstacles during the motion of robots. The virtual sensor yields new data by combining encoder values and real distance data, and derives new sensor data that includes the mobility of the robot. Simulation on Windows XP is executed to illustrate the proposed approach with actually acquired distance from virtual and actual sensors. To facilitate comparison with the alternative results developed in this paper, we refer to the conventional artificial potential field method using actual distance. Data from virtual sensors show smoother and safer motion in obstacle avoidance traces in regards to obstacle and robot mobility.     

感知范围受限的群机器人自主围捕算法

针对在有障碍物场地中感知范围受限的群机器人协同围捕问题,本文首先给出了机器人个体、障碍物、目标的模型,并用数学形式对围捕任务进行描述,在此基础上提出了机器人个体基于简化虚拟速度和基于航向避障的自主围捕控制律.基于简化虚拟速度模型的控制律使得机器人能自主地围捕目标同时保持与同伴的距离避免互撞;基于航向的避障方法提升了个体的避障效率,避免斥力避障方法导致的死锁问题.其次本文证明了在该控制律下系统的稳定性.仿真结果表明,该算法在有效围捕目标的同时能够高效地避开障碍物,具有对复杂环境的适应性.最后本文分析了与其他方法相比该算法的优点.     

Optimal self assembly of modular manipulators with active and passive modules

In this paper, we develop self-assembling robot systems composed of active modular robots and passive bars. The target structure is modeled as a dynamic graph. We present two provably correct algorithms for creating the structure. A decentralized optimal algorithm for the navigation of multiple modular robots on a partial truss structure is used to guide the robots to their location on the target structure. A decentralized algorithm for scheduling the transportation and placement of truss elements is used to coordinate the creation of the target structure. Both algorithms rely on locally optimal matching. The truss self-assembly algorithm has quadratic competitive ratio for static as well as dynamic graph representation. We show simulation results and results for experiments with two 3DOF robots and passive bars that can create and control a 6DOF manipulation.     

基于改进人工势场法的医疗配送机器人路径规划

随着科技的高速发展和近几年新冠疫情的影响,医疗配送机器人开始逐步出现在各大医疗机构中,然而传统医疗配送机器人在使用人工势场算法进行路径规划时存在局部最优解和目标不可达问题。因此,针对局部最优解问题,提出了设计虚拟目标点的方法,将机器人从局部最优状态解救出来;针对目标不可达问题,在障碍物斥力势场函数中引入了目标距离函数对障碍物斥力进行限制,从而解决目标不可达问题。最后将该方法在多种复杂环境中与传统算法进行比较验证,实验结果表明,该改进算法能够解决传统算法存在的局部最优解和目标不可达问题,在算法效率上也提高了5%～9%,并且能够有效运用于实际场景。     

A Neural Network Approach to Dynamic Task Assignment of Multirobots

In this paper, a neural network approach to task assignment, based on a self-organizing map (SOM), is proposed for a multirobot system in dynamic environments subject to uncertainties. It is capable of dynamically controlling a group of mobile robots to achieve multiple tasks at different locations, so that the desired number of robots will arrive at every target location from arbitrary initial locations. In the proposed approach, the robot motion planning is integrated with the task assignment, thus the robots start to move once the overall task is given. The robot navigation can be dynamically adjusted to guarantee that each target location has the desired number of robots, even under uncertainties such as when some robots break down. The proposed approach is capable of dealing with changing environments. The effectiveness and efficiency of the proposed approach are demonstrated by simulation studies.     

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.     

Multirobot Rendezvous With Visibility Sensors in Nonconvex Environments

This paper presents a coordination algorithm for mobile autonomous robots. Relying on distributed sensing, the robots achieve rendezvous, i.e., they move to a common location. Each robot is a point mass moving in a simply connected, nonconvex, unknown environment according to an omnidirectional kinematic model. It is equipped with line-of-sight limited-range sensors, i.e., it can measure the relative position of any object (robots or environment boundary) if and only if the object is within a given distance and there are no obstacles in between. The perimeter minimizing algorithm is designed using the notions of robust visibility, connectivity-preserving constraint sets, and proximity graphs. The algorithm provably achieves rendezvous if the interagent sensing graph is connected at any time during the evolution of the group. Simulations illustrate the theoretical results and the performance of the proposed algorithm in asynchronous setups and with measurement errors, control errors, and nonzero robot size. Simulations to illustrate the importance of visibility constraints and comparisons with the optimal centralized algorithm are also included.     

Decentralized control of a group of mobile robots for deployment in sweep coverage

This paper addresses a problem of sweep coverage by deploying a network of autonomous mobile robots. We propose a decentralized control algorithm for the robots to accomplish the sweep coverage. The sweep coverage is achieved by coordinating the robots to move along a given path that is unknown to the vehicles a priori. The motion coordination algorithm is developed based on simple consensus algorithms. The effectiveness of the algorithm is demonstrated via numerical simulations. The proposed algorithm would have applications to military and civilian operations.     

Error Analysis and Effective Adjustment of the Walking-Ready Posture for a Biped Humanoid Robot

A walking control algorithm is generally a mixture of various controllers; it depends on the characteristics of the target system. Simply adopting one part of another researcher's algorithm does not guarantee an improvement in walking performance. However, this paper proposes an effective algorithm that can be easily adopted to other biped humanoid robots; the algorithm enhances the walking performance and stability of the robot merely by adjusting the walking-ready posture. The walking performance of biped humanoid robots is easily affected by an unsuitable walking-ready posture in terms of accuracy and repeatability. More specifically, low accuracy for the walking-ready posture may cause a large difference between an actual biped robot and its mathematical model, and the low repeatability may disturb the evaluation of the performances of balance controllers. Therefore, this paper first discusses the factors that detrimentally affect bipedal walking performance and their phenomena in the walking-ready posture. The necessary conditions for an ideal walking-ready posture are then defined based on static equilibrium and a suitable adjustment algorithm is proposed. Finally, the effectiveness of the algorithm is verified through dynamic computer simulations.     

未知环境下移动机器人自主搜索技术研究

将全区域搜索技术与基于动态模板匹配的目标识别方法相结合，提出了一种适用于未知环境的目标物体自主搜索方法，实现了移动机器人在陌生环境下的目标搜索任务．具体而言，移动机器人利用声纳和全景摄像头作为传感器来感知周围环境，并利用模糊逻辑方法来进行局部路径规划，在此基础上通过全区域搜索技术实现对空间的遍历，并采用动态模板匹配方法来实现目标物体的识别及其方位的确定．本文所提出的目标物体自主搜索方法可以从任意位置开始进行，算法对于陌生环境具有良好的适应性．论文最后通过实验结果证实了算法的良好性能．     

A virtual centrifugal force based navigation algorithm for explorative robotic tasks in unknown environments

In many robotic tasks, there is no a priori knowledge of the environment. This makes it necessary for robots to explore the environment. Navigation algorithms for robots to map the environment completely in a short time play a very important role in the robotic task completion. A navigation algorithm based on virtual centrifugal force is proposed to complete the robotic exploration of the unknown environment using rang sensors in this paper. Collisions between a robot and an obstacle or between robots can be avoided with the application of the proposed navigation rules. The kinematics and dynamics equations of robots adopting the algorithm are also given. The simulation experiments demonstrate the operation of the algorithm. Several simulation experiments of various representative robotic tasks are carried out, based on the explorative navigation algorithm, which successfully validate the virtual centrifugal force based navigation algorithm.     

Exploration strategies based on multi-criteria decision making for searching environments in rescue operations

Some applications require autonomous robots to search an initially unknown environment for static targets, without any a priori information about environment structure and target locations. Targets can be human victims in search and rescue or materials in foraging. In these scenarios, the environment is incrementally discovered by the robots exploiting exploration strategies to move around in an autonomous and effective way. Most of the strategies proposed in literature are based on the idea of evaluating a number of candidate locations on the frontier between the known and the unknown portions of the environment according to ad hoc utility functions that combine different criteria. In this paper, we show some of the advantages of using a more theoretically-grounded approach, based on Multi-Criteria Decision Making (MCDM), to define exploration strategies for robots employed in search and rescue applications. We implemented some MCDM-based exploration strategies within an existing robot controller and we evaluated their performance in a simulated environment.     

基于深度Q网络和人工势场的移动机器人路径规划研究

随着移动机器人在各个领域的研究与发展,人们对移动机器人路径规划的能力提出了更高的要求;为了解决传统的深度Q网络算法在未知环境下,应用于自主移动机器人路径规划时存在的收敛速度慢、训练前期产生较大迭代空间、迭代的次数多等问题,在传统DQN算法初始化Q值时,加入人工势场法的引力势场来协助初始化环境先验信息,进而可以引导移动机器人向目标点运动,来减少算法在最初几轮探索中形成的大批无效迭代,进而减少迭代次数,加快收敛速度;在栅格地图环境中应用pytorch框架验证加入初始引力势场的改进DQN算法路径规划效果;仿真实验结果表明,改进算法能在产生较小的迭代空间且较少的迭代次数后,快速有效地规划出一条从起点到目标点的最优路径。     

An efficient dynamic system for real-time robot-path planning.

This paper presents a simple yet efficient dynamic-programming (DP) shortest path algorithm for real-time collision-free robot-path planning applicable to situations in which targets and barriers are permitted to move. The algorithm works in real time and requires no prior knowledge of target or barrier movements. In the case that the barriers are stationary, this paper proves that this algorithm always results in the robot catching the target, provided it moves at a greater speed than the target, and the dynamic-system update frequency is sufficiently large. Like most robot-path-planning approaches, the environment is represented by a topologically organized map. Each grid point on the map has only local connections to its neighboring grid points from which it receives information in real time. The information stored at each point is a current estimate of the distance to the nearest target and the neighbor from which this distance was determined. Updating the distance estimate at each grid point is done using only the information gathered from the point's neighbors, that is, each point can be considered an independent processor, and the order in which grid points are updated is not determined based on global knowledge of the current distances at each point or the previous history of each point. The robot path is determined in real time completely from the information at the robot's current grid-point location. The computational effort to update each point is minimal, allowing for rapid propagation of the distance information outward along the grid from the target locations. In the static situation, where both the targets and the barriers do not move, this algorithm is a DP solution to the shortest path problem, but is restricted by lack of global knowledge. In this case, this paper proves that the dynamic system converges in a small number of iterations to a state where the minimal distance to a target is recorded at each grid point and shows that this robot-path-planning algorithm can be made to always choose an optimal path. The effectiveness of this algorithm is demonstrated through a number of simulations.