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

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

基于规则的移动机器人实时运动规划

研究移动机器人在动态环境中的导航与避障问题。为提高规划的实时性,提出了基于规则的规划方法,将多移动障碍环境机器人的运动规划分解为相对简单的单移动障碍运动规划,利用最优控制来实现单障碍的最优避障,并用智能搜索方法解决了移动机器人在多移动障碍环境中的实时运动规划问题。仿真实例表明了该方法的有效性。     

Weighted hierarchical quadratic programming: assigning individual joint weights for each task priority

This paper proposes a novel method that computes the optimal solution of the weighted hierarchical optimization problem for both equality and inequality tasks. The method is developed to resolve the redundancy of robots with a large number of Degrees of Freedom (DoFs), such as a mobile manipulator or a humanoid, so that they can execute multiple tasks with differently weighted joint motion for each priority level. The proposed method incorporates the weighting matrix into the first-order optimality condition of the optimization problem and leverages an active-set method to handle equality and inequality constraints. In addition, it is computationally efficient because the solution is calculated in a weighted joint space with symmetric null-space projection matrices for propagating recursively to a low priority task. Consequently, robots that utilize the proposed method effectively show whole-body motions handling prioritized tasks with differently weighted joint spaces. The effectiveness of the proposed method was validated through experiments with a nonholonomic mobile manipulator as well as a humanoid.

     

三维环境中多机器人动态目标主动协作观测方法

动态目标的多移动机器人主动协作观测方法是指以获取较优的观测结果为目的, 对携带同构/异构观测传感器的多个机器人系统的观测数据进行有效融合并同时对其行为进行协调优化的方法. 本文主要研究了三维环境中的多机器人动态目标主动协作观测的问题. 首先, 以扩展集员估计方法(Extended set-membership filter, ESMF)为基础, 将信息融合过程与算法本身存在的集合运算环节相结合, 提出了一种高精度的多机器人观测信息融合方法. 该方法在保证较高观测精度的同时, 并没有显著增加单机器人扩展集员估计算法的计算量, 因此具有较高的实时性. 此外, 利用最优观测角度的概念, 通过引入相对速度空间(Relative velocity coordinates, RVCs), 设计了多移动机器人协调行为优化方法, 该方法可以将多机器人协调行为优化问题转化为线性规划问题, 以实现具有较高实时性的多机器人三维动态目标主动协作观测. 最后, 为了验证所研究方法的可行性与有效性, 进行了三维空间动态目标协作观测仿真实验.     

Optimal design of a stair-climbing mobile robot with flip mechanism

Stairs overcoming is a primary challenge for mobile robots moving in human environments, and the contradiction between the portability and the adaptability of stair climbing robot is not well resolved. In this paper, we present an optimal design of a flip-type mobile robot in order to improve the adaptability as well as stability while climbing stairs. The kinematic constraints on the flip mechanism are derived to prevent undesired interferences among stairs, wheels and main body during climbing stairs. The objective function is proposed according to the traction demand of the robot during stair-climbing motion for the first time and the value of the objective function is calculated though kinetic analysis. The Taguchi method is using as the optimization tool because of its simplicity and cost-effectiveness both in formulating an objective function and in satisfying multiple constraints simultaneously. The performance of the robot under the optimal parameters is verified through simulations and experiments.     

一种新的位置数据融合方法的研究

给出了一新的基于团队一致法的多传感器位置数据融合方法，该方法按传感器队中的每个成员的测量不确定性，构造团队期望效用函数（或密度），并基于该期望效用函数求得位置参数估计，其优点是可消除失效传感器和测量值为野值的传感器的影响，本文给出了仿真结果。     

INTELLIGENT MOTION CONTROL FOR OMNIDIRECTIONAL MOBILE ROBOTS USING ANT COLONY OPTIMIZATION

This article presents an intelligent system-on-a-programmable-chip-based (SoPC) ant colony optimization (ACO) motion controller for embedded omnidirectional mobile robots with three independent driving wheels equally spaced at 120 degrees from one another. Both ACO parameter autotuner and kinematic motion controller are integrated in one field-programmable gate array (FPGA) chip to efficiently construct an experimental mobile robot. The optimal parameters of the motion controller are obtained by minimizing the performance index using the proposed SoPC-based ACO computing method. These optimal parameters are then employed in the ACO-based embedded kinematic controller in order to obtain better performance for omnidirectional mobile robots to achieve trajectory tracking and stabilization. Experimental results are conducted to show the effectiveness and merit of the proposed intelligent ACO-based embedded controller for omnidirectional mobile robots. These results indicate that the proposed ACO-based embedded optimal controller outperforms the nonoptimal controllers and the conventional genetic algorithm (GA) optimal controllers.     

移动机器人速度加速度饱和约束下的时间最优控制

针对机器人运动系统中普遍存在的速度和加速度约束, 提出一种满足以上约束的机器人运动时间最优控制方法. 首先, 通过最优条件构造哈密尔顿函数, 根据极小值原理求解时间最优控制; 其次, 通过相轨迹分析, 证明了满足约束的时间最优控制律的形式; 再次, 通过求解最优时间, 将满足约束的时间最优控制律转换成末端时间为最优时间的燃料最优控制律; 最后, 在RoboCup 小型足球机器人上进行对比实验, 验证了该方法在规划与实际上的一致性.     

多机器人体间动态碰撞检测方法仿真研究

当前多结合包围求碰撞检测法、Average-Case法、K-DOPs法等实现多机器人体间动态碰撞的检测,均存在寻优性能较差、检测效率较低的问题。为此提出一种基于动态粒子群的多机器人体间动态碰撞检测方法。采用OBB层次包围盒方法,缩小多机器人之间需要动态碰撞检测的区域,同时把动态碰撞检测问题转换为物体特征对间距离机制的非线性优化问题,进而构建层次拓扑框架进行局部碰撞检测,将机器人体引入到粒子群算法中建立混合进化算法,找到动态碰撞检测的最优解,实现多机器人体间动态碰撞检测。仿真结果证明,所提方法的检测效率高达96%,且具有较高的寻优性能。     

Control of leader–follower formation and path planning of mobile robots using Asexual Reproduction Optimization (ARO)

This paper presents the optimal path of nonholonomic multi robots with coherent formation in a leader–follower structure in the presence of obstacles using Asexual Reproduction Optimization (ARO). The robots path planning based on potential field method are accomplished and a novel formation controller for mobile robots based on potential field method is proposed. The efficiency of the proposed method is verified through simulation and experimental studies by applying them to control the formation of four e-Pucks robots (low-cost mobile robot platform). Also the proposed method is compared with Simulated Annealing, Improved Harmony Search and Cuckoo Optimization Algorithm methods and the experimental results, higher performance and fast convergence time to the best solution of the ARO demonstrated that this optimization method is appropriate for real time control application.     

Convex Optimization Strategies for Coordinating Large-Scale Robot Formations

This paper investigates convex optimization strategies for coordinating a large-scale team of fully actuated mobile robots. Our primary motivation is both algorithm scalability as well as real-time performance. To accomplish this, we employ a formal definition from shape analysis for formation representation and repose the motion planning problem to one of changing (or maintaining) the shape of the formation. We then show that optimal solutions, minimizing either the total distance or minimax distance the nodes must travel, can be achieved through second-order cone programming techniques. We further prove a theoretical complexity for the shape problem of O(m^1.5) as well as O(m) complexity in practice, where m denotes the number of robots in the shape configuration. Solutions for large-scale teams (1000's of robots) can be calculated in real time on a standard desktop PC. Extensions integrating both workspace and vehicle motion constraints are also presented with similar complexity bounds. We expect these results can be generalized for additional motion planning tasks, and will prove useful for improving the performance and extending the mission lives of large-scale robot formations as well as mobile ad hoc networks.     

Humanoid robot arm performance optimization using multi objective evolutionary algorithm

As humanoid robots are expected to operate in human environments they are expected to perform a wide range of tasks. Therefore, the robot arm motion must be generated based on the specific task. In this paper we propose an optimal arm motion generation satisfying multiple criteria. In our method, we evolved neural controllers that generate the humanoid robot arm motion satisfying three different criteria; minimum time, minimum distance and minimum acceleration. The robot hand is required to move from the initial to the final goal position. In order to compare the performance, single objective GA is also considered as an optimization tool. Selected neural controllers from the Pareto solution are implemented and their performance is evaluated. Experimental investigation shows that the evolved neural controllers performed well in the real hardware of the mobile humanoid robot platform.     

移动机器人的时间最优编队

针对移动机器人的最速编队问题,结合路径规划和任务分解,提出一种分派问题的新解法和时间最优的编队策略。该策略充分考虑了障碍物环境约束和各机器人运动时的相互影响,通过将系统整体路径规划的复杂问题分解为独立路径规划问题和冲突协调问题来分别求解,降低了计算的复杂性,并能了快编队。     

Leader–follower formation control of nonholonomic mobile robots based on a bioinspired neurodynamic based approach

This paper investigates the leader–follower formation control problem for nonholonomic mobile robots based on a bioinspired neurodynamics based approach. The trajectory tracking control for a single nonholonomic mobile robot is extended to the formation control for multiple nonholonomic mobile robots based on the backstepping technique, in which the follower can track its real-time leader by the proposed kinematic controller. An auxiliary angular velocity control law is proposed to guarantee the global asymptotic stability of the followers and to further guarantee the local asymptotic stability of the entire formation. Also a bioinspired neurodynamics based approach is further developed to solve the impractical velocity jumps problem. The rigorous proofs are given by using Lyapunov theory. Simulations are also given to verify the effectiveness of the theoretical results.     

Distributed Consensus of Multiple Nonholonomic Mobile Robots

Consensus problems of multiple nonholonomic mobile robots are considered in this paper. These problems are simplified into consensus problems of two subsystems based on structure of nonholonomic mobile robots. Linear distributed controllers are constructed respectively for these two subsystems thanks to the theory of nonautonomous cascaded systems. Consensus of multiple nonholonomic mobile robots has been realized using the methodology proposed in this paper no matter whether the group reference signal is persistent excitation or not. Different from previous research on cooperative control of nonholonomic mobile robots where the consensus problem under persistent exciting reference has received a lot of attention, this paper reports the first consensus result for multiple nonholonomic mobile robots whose group reference converges to zero. Simulation results using Matlab illustrate the effectiveness of the proposed controllers in this paper.      

Distributed consensus-based formation control for multiple nonholonomic mobile robots with a specified reference trajectory

In this paper, the distributed formation control problem for multiple nonholonomic mobile robots using consensus-based approach is considered. A transformation is given to convert the formation control problem for multiple nonholonomic mobile robots into a state consensus problem. Distributed control laws are developed for achieving the formation control objectives: a group of nonholonomic mobile robots at least exponentially converge to a desired geometric pattern with its centroid moving along the specified reference trajectory. Rigorous proofs are provided by using graph, matrix , and Lyapunov theories. Simulations are also given to verify the effectiveness of the theoretical results.     

路网约束下异构机器人系统路径规划方法

由无人机(Unmanned aerial vehicles, UAV)和地面移动机器人组成的异构机器人系统在协作执行任务时,可以充分发挥两类机器人各自的优势.无人机运动灵活,但通常续航能力有限;地面机器人载荷多,适合作为无人机的着陆平台和移动补给站,但运动受路网约束.本文研究这类异构机器人系统协作路径规划问题.为了降低完成任务的时间代价,提出一种由蚁群算法(Ant colony optimization, ACO)和遗传算法(Genetic algorithm, GA)相结合的两步法对地面机器人和无人机的路线进行解耦,同时规划地面机器人和无人机的路线.第1步使用蚁群算法为地面机器人搜索可行路线.第2步对无人机的最优路径建模,采用遗传算法求解并将无人机路径长度返回至第1步中,用于更新路网的信息素参数,从而实现异构协作系统路径的整体优化.另外,为了进一步降低无人机的飞行时间代价,研究了无人机在其续航能力内连续完成多任务的协作路径规划问题.最后,通过大量仿真实验验证了所提方法的有效性.     

Optimal Motion Synthesis – Dynamic Modelling and Numerical Solving Aspects

A general approach for generating optimal movements of actuatedmulti-jointed systems is presented. The method is based on theimplementation of the Pontryagin Maximum Principle (PMP) used as amathematical optimization tool. It applies to mechanical systems withkinematic tree-like topology such as serial robots, walking machines,and articulated biosystems. Emphasis is put on the choice of anappropriate dynamic model of the multibody system, together with thechoice of relevant performance criteria to be minimized for generatingthe optimal motion. It is shown that the Hamiltonian formalism isperfectly suitable to deal with the optimization problem using the PMP.On the other hand, prominence is given to performance criteria ensuringsoft and efficient functioning of the articulated systems. Two computingtechniques for solving the optimization problem are presented. Threenumerical simulations demonstrate the applicability of the method.     

基于改进的A*算法与动态窗口法的移动机器人路径规划

提出了一种改进的A^*算法与动态窗口法相结合的混合算法,以解决移动机器人在多目标复杂环境中的路径规划问题．首要,为了提升算法的运行效率,实现单次规划的路径可通过多个目标点,同时提升路径平滑处理的灵活性并满足移动机器人非完整约束条件,本文利用目标成本函数对所有目标进行优先级判定,进而利用改进的A^*算法规划一条经过多个目标点的最优路径,同时采用自适应圆弧优化算法与加权障碍物步长调节算法,有效地将路径长度缩短5%,转折角总度数降低26.62%．其次,为实现移动机器人在动态复杂环境中局部避障并追击动态目标点．提出将改进动态窗口算法与全局路径规划信息相结合的在线路径规划法,采用预瞄偏差角追踪法成功捕捉移动目标点,并提升了路径规划效率．最后,对所提方法进行仿真实验,结果表明该方法能够在复杂动态环境中更有效地实现路径规划．     

A* search algorithm applied to a Chinese chess game

This article presents an A* search algorithm to be applied to path planning in a Chinese chess game, and uses multiple mobile robots to present the scenario. The mobile robots have a cylindrical shape, and their diameter, height, and weight are 8 cm, 15 cm, and 1.5 kg, respectively. The controller of the mobile robots is a MCS-51 chip. We play the Chinese chess game using multiple mobile robots according to the evaluation algorithm of the game, and calculate the displacement by the encoder of a DC servomotor. The A* search algorithm can solve the shortest-path problem for the mobile robots from the starting point to the target point on the chess board. The simulated results found the shortest path for the mobile robots (chess pieces) moving to target points from their starting points in a collision-free environment. Finally, we implemented the experimental results on a Chinese chess board using mobile robots. Users can play the Chinese chess game using the supervising computer via a wireless RF interface. The scenario of the feedback of the Chinese chess game to the user interface uses an image system.