基于动态椭圆曲线的足球机器人射门路径规划算法

为提高机器人足球比赛中射门成功率,提出了一种基于动态椭圆曲线的射门路径规划算法。通过计算足球机器人当前位姿及期望射门角度,控制机器人按照椭圆曲线路径运动至射门目标点,实现快速有效击球射门。仿真实验及实物机器人实验验证了算法的有效性,动态椭圆曲线射门规划算法运动路径短,且能够以合理射门角度完成射门。     

Bezier曲线与A~*算法融合的移动机器人路径规划

移动机器人路径规划一直是移动机器人领域里的重要技术问题。A*算法在最优路径搜索上有着比较成功的运用,但在栅格环境下的A*算法也存在着折线多、转折角度大等问题。在考虑移动机器人的实际工作环境及相关运动参数后,这些问题都将大大地影响移动机器人的工作效率。在对以上问题进行分析后提出了一种基于Bezier曲线与A*算法融合的方法来实现移动机器人的路径规划,再通过MATLAB、V-REP仿真工具来实现Bezier_A*融合算法与平滑A*算法及A*算法的对比。通过Bezier_A*融合算法使得机器人在工作中的寻优能力、路径规划效率都得到较大的提高。     

基于时间最短的足球机器人进攻路径规划

足球机器人采取基于路径最短的进攻规划的不足之处主要体现在时间上不能满足比赛环境实时性和高度动态性的要求.提出理想的进攻路径曲线应为时间最短的平滑路径,结合足球机器人的运动特点,采用基于Bezier曲线的方法拟合出该曲线.最后通过C 程序代码实现了该方法,并在仿真实验平台FIRA Simurosot5vs5上验证了其可行性和有效性.     

An extended any-angle path planning algorithm for maintaining formation of multi-agent jellyfish elimination robot system

International Journal of Control, Automation and Systems - In recent years, the increasing influence of climate change has given rise to an uncontrolled proliferation of jellyfish in marine...     

基于智能路径规划算法的移动机器人系统设计

提出了移动机器人的一种全局路径规划与局部路径规划相结合的新型算法.在以TMS320LS2407A为核心处理器设计的移动机器人平台上,研究移动机器人智能路径规划的算法问题并予以实现.上位机规划机器人的最优路径,并通过与机器人无线通信,发送路径信息,实时接收机器人方位信息.上位机通过操作应用程序对机器人进行监控.机器人能够自主计算轨迹并准确跟踪路径,检测到障碍物后,智能地重新规划路径,避开障碍物到达目的地.实验结果表明:该方法能有效实现机器人的最佳行走路线规划.     

Intelligent decision making in multi-agent robot soccer system through compounded artificial neural networks

This paper proposes a two-stage approach using artificial neural networks for the intelligent decision-making by the robots in a MiroSot small league. The first stage involves the use of an evolutionary algorithm for getting a rough estimate of the neural network weight matrices. The proposed approach is then generalized to the case of quick, intelligent and accurate decision-making in the case of a robot soccer system with robots utilizing the concept of compounded artificial neural networks. In the proposed approach a soccer field is divided into three zones so that the decision of the robots depends on the zone of the ball at any instant. The concept of a forward robot is also introduced in this paper to enhance the accuracy of the decision-making with the global strategy of advancing towards the goal area of the opponent for scoring a goal. Simulation results indicate that the proposed techniques are very effective in taking intelligent decision-making in a multi-agent robot soccer system in MiroSot small league as well as middle league.     

A multi-agent based agile manufacturing planning and control system

In today’s manufacturing enterprise, the performance of customer service level (e.g., short ordering-to-delivery time, low price) is highly dependent on the effectiveness of its manufacturing planning and control system (MPCS). However, most of the current MPCS, employed the hierarchical planning approach, may have some drawbacks, such as structural rigidity, difficulty of designing a control system, and lack of flexibility. Currently, RFID (Radio Frequency Identification) technology has been applied to enhance the visibility, accountability, track ability and traceability of manufacturing system whenever the accurate and detailed manufacturing information (e.g., raw material, WIP, products in factory and products in the down streams) of products will be followed in real-time basis by RFID technique. In addition, a multi-agent approach may be applied in a distributed and autonomous system which allows negotiation-based decision making. Therefore, the objective of this research is to study the application of RFID technique and multi-agent system (MAS) in developing an agent-based agile manufacturing planning and control system (AMPCS) to respond to the dynamically changing manufacturing activities and exceptions.In AMPCS, RFID-based manufacturing control (R-MC) module plays the role of controlling the manufacturing system in which production items and manufacturing resources attached with RFID tag may actively feedback production status to and receive production and operations schedule from advanced manufacturing planning (AMP) module. In addition, a bidding process and algorithm is developed to generate operations schedule by using the characteristics of MAS. Performance analysis (PA) module is responsible not only for evaluating the scheduling results but also for evaluating the performance of production execution. The development of an AMPCS for an automated manufacturing cell demonstrates that the integration of RFID technique and MAS in developing an agile manufacturing planning and control system can really possess the characteristics of visibility, accountability, track ability, responsiveness, and flexibility in a distributed and dynamic manufacturing system.     

RoboCup比赛环境下足球机器人路径规划研究

RoboCup中型组足球机器人比赛具有高度的对抗性和实时性．比赛中机器人需要针对不同的比赛态势进行角色切换和任务选择．在这种环境下，应用传统人工势场或一般改进型人工势场的路径规划方法都无法得到令人满意的结果．将障碍物与机器人之间的相对速度矢量以及目标与机器人之间的相对速度矢量分别引入人工势场法中，对传统的势场函数进行了改进；并根据机器人的不同角色和任务，采用模糊逻辑方法对势场函数进行修正，提出一种处理多角色多任务环境的改进型人工势场法机器人路径规划方法．仿真试验和实际应用验证了此算法存足球机器人比赛系统中的可行性．     

A study on robot path planning from a solid model

CAD/CAM technologies have been developed and are beginning to penetrate rapidly into industries. At present, however, there are many problems that should be solved before CAD/CAM technologies can play their proper role in the total process. In an effort to improve CAD/CAM current circumstances, a trial CAE system which generates an operation path of a robot from a solid-model built-in CAD process, has been examined. In this system, solid models are built by performing set operations such as addition, subtraction, intersection between several primitives or solid models. Processing is made for a solid model represented by B-rep (boundary representation). To ease the processing, curved faces such as spherical, cylindrical, or conical surfaces, are approximated by several flat planes. As a first step, by assuming Gaussian spatial distribution for a painting gun, path planning of a painting robot for a convex solid body has been examined. A scanning plane is defined for each flat plane and a path of robot effector is generated on this plane.     

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

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

一种基于免疫机理的确定性移动机器人路径规划算法

为了解决移动机器人路径规划算法的确定性与搜索空间之间的矛盾,基于免疫机理提出一种确定性移动机器人路径规划算法.该算法首先利用路径起始点和目标点垂线确定的正向环境空间,在此空间内依据疫苗启发规则构建初始抗体种群,保证路径起始点和二级节点对正向解空间全覆盖;然后,根据正向切线点数量进行抗体克隆,在疫苗启发作用下对后续节点进...     

Heuristic approaches in robot path planning: A survey

Autonomous navigation of a robot is a promising research domain due to its extensive applications. The navigation consists of four essential requirements known as perception, localization, cognition and path planning, and motion control in which path planning is the most important and interesting part. The proposed path planning techniques are classified into two main categories: classical methods and heuristic methods. The classical methods consist of cell decomposition, potential field method, subgoal network and road map. The approaches are simple; however, they commonly consume expensive computation and may possibly fail when the robot confronts with uncertainty. This survey concentrates on heuristic-based algorithms in robot path planning which are comprised of neural network, fuzzy logic, nature-inspired algorithms and hybrid algorithms. In addition, potential field method is also considered due to the good results. The strengths and drawbacks of each algorithm are discussed and future outline is provided.     

A heuristic approach to robot path planning based on task requirements using a genetic algorithm

In order to enhance integration between CAD and robots, wer propose a scheme to plan kinematically feasible paths in the presence of obstacles based on task requirements. Thus, the feasibility of a planned path from a CAD system is assured before the path is sent for execution. The proposed scheme uses a heuristic approach to deal with a rather complex search space, involving high-dimensional C-space obstacles and task requirements specified in Cartesian space. When the robot is trapped by the local minimum in the potential field related to the heuristic, a genetic algorithm is then used to find a proper intermediate location that will guide it to escape out of the local minimum. For demonstration, simulations based on using a PUMA-typed robot manipulator to perform different tasks in the presence of obstacles were conducted. The proposed scheme can also be used for mobile robot planning. The paper falls into Category (5). Please address correspondence to the second author. This work was supported in part by the National Science Council, Taiwan, R.O.C., under grant NSC 82-0422-E-009-403.     

基于侦察蚁和觅食蚁协作的机器人路径规划算法

根据对真实蚂蚁的最新研究成果,提出了一种全新的机器入路径规划蚂蚁算法.该算法由两组侦察蚁采用最近邻侦察搜索策略相向搜索出一条较优路径,再由一组觅食蚁通过在该路径附近觅食实现对该路径的优化,从而得到一条优化的路径.计算机仿真实验结果表明,算法收敛速度提高显著,且在障碍物非常复杂的地理环境,也能迅速规划出最优或基本最优的路径,效果令人满意.     

Real-time robot path planning via a distance-propagating dynamic system with obstacle clearance.

An efficient grid-based distance-propagating dynamic system is proposed for real-time robot path planning in dynamic environments, which incorporates safety margins around obstacles using local penalty functions. The path through which the robot travels minimizes the sum of the current known distance to a target and the cumulative local penalty functions along the path. The algorithm is similar to D* but does not maintain a sorted queue of points to update. The resulting gain in computational speed is offset by the need to update all points in turn. Consequently, in situations where many obstacles and targets are moving at substantial distances from the current robot location, this algorithm is more efficient than D*. The properties of the algorithm are demonstrated through a number of simulations. A sufficient condition for capture of a target is provided.     

动态混沌蚁群系统及其在机器人路径规划中的应用

针对蚁群系统（ACS）解决机器人路径规划问题时种群多样性与收敛速度的不足,对蚁群系统引入动态混沌算子,从而平衡种群多样性和收敛速度之间的关系。动态混沌蚁群系统的核心是在传统蚁群系统引入Logistic混沌算子来增加种群多样性,从而提高解的质量。在迭代前期加入混沌算子,以调整路径中的全局信息素值,增加算法的种群多样性,从而避免算法陷入局域优化解;在后期则转为蚁群系统,来确保动态混沌蚁群系统的收敛速度。仿真结果表明,对于机器人路径规划问题,与蚁群系统相比,动态混沌蚁群系统具有更好的种群多样性、更高的解的质量和更快的收敛速度;与精英蚁群系统（EAS）和基于排序的蚂蚁系统（ASrank）相比,动态混沌蚁群系统能够平衡解的质量与收敛速度之间的关系,即使在复杂障碍物的环境下,动态混沌蚁群系统也能较好地找到最优解。动态混沌蚁群系统能够提升移动机器人路径规划中的效率。     

A stochastic algorithm for makespan minimized multi-agent path planning in discrete space

Makespan minimized multi-agent path planning (MAPP) requires the minimization of the time taken by the slowest agents to reach its destination. The resulting minimax objective function is non-smooth and the search for an optimal solution in MAPP can be intractable. In this work, a maximum entropy function is adopted to approximate the minimax objective function. An iterative algorithm named probabilistic iterative makespan minimization (PIMM) is then proposed to approximate a makespan minimized MAPP solution by solving a sequence of computationally hard MAPP minimization problems with a linear objective function. At each iteration, a novel local search algorithm called probabilistic iterative path coordination (PIPC) is used to find a sufficiently good solution for each MAPP minimization problem. Experimental results from comparative studies with existing MAPP algorithms show that the proposed algorithm strikes a good tradeoff between the quality of the makespan minimized solution and the computational cost incurred.     

非结构化场景下基于改进JPS算法的移动机器人路径规划

针对移动机器人在大范围非结构化场景下的路径规划问题,在改进跳点搜索(JPS)算法的基础上结合A*搜索,提出一种基于分层栅格地图的Jump A*(JA*)路径规划算法.该算法对三维点云地图进行栅格化分层处理,将环境信息划分为结构层与非结构层,并建立搜索策略切换规则,依据图层信息使用不同的搜索策略,从而有效减少计算量.为了验证JA*算法的有效性,在图层比例不同的三维地图中进行仿真,仿真结果表明,JA*算法相比于传统的A*算法遍历节点更少,搜索效率更高;相比于双向A*算法,具有更高的鲁棒性.最后将JA*算法应用在公开数据集中,实验结果表明,JA*算法能有效解决移动机器人在大范围非结构化场景下的路径规划问题.     

Cooperative neural field for the path planning of a robot arm

This paper deals with the problem of finding a good trajectory, from an initial position to a prescribed target point, for the end effector of a robot arm moving on a two-dimensional work field and avoiding obstacles lying on the work field. Two algorithms based on cooperative neural fields are proposed: the former is suited for the case where the location of obstacles is known, the latter doesn't require any a priori knowledge and is based on a very crude collision detector.     

动态未知环境下一种新的机器人路径规划方法

针对机器人动态路径规划问题,提出了一种机器人在复杂动态环境中实时路径规划方法.该方法基于滚动窗口的路径规划和避障策略,通过设定可视点子目标、绕行障碍物和对动态障碍物的分析预测,实现机器人在复杂动态环境下的路径规划.针对障碍物分布情况,合理设计可视点法和绕行算法之间转换,有效地解决了局部路径规划的死循环与极小值问题.该方...