Tracking control of redundant mobile manipulator: An RNN based metaheuristic approach

In this paper, we propose a topology of Recurrent Neural Network (RNN) based on a metaheuristic optimization algorithm for the tracking control of mobile-manipulator while enforcing nonholonomic constraints. Traditional approaches for tracking control of mobile robots usually require the computation of Jacobian-inverse or linearization of its mathematical model. The proposed algorithm uses a nature-inspired optimization approach to directly solve the nonlinear optimization problem without any further transformation. First, we formulate the tracking control as a constrained optimization problem. The optimization problem is formulated on position-level to avoid the computationally expensive Jacobian-inversion. The nonholonomic limitation is ensured by adding equality constraints to the formulated optimization problem. We then present the Beetle Antennae Olfactory Recurrent Neural Network (BAORNN) algorithm to solve the optimization problem efficiently using very few mathematical operations. We present a theoretical analysis of the proposed algorithm and show that its computational cost is linear with respect to the degree of freedoms (DOFs), i.e., O(m). Additionally, we also prove its stability and convergence. Extensive simulation results are prepared using a simulated model of IIWA14, a 7-DOF industrial-manipulator, mounted on a differentially driven cart. Comparison results with particle swarm optimization (PSO) algorithm are also presented to prove the accuracy and numerical efficiency of the proposed controller. The results demonstrate that the proposed algorithm is several times (around 75 in the worst case) faster in execution as compared to PSO, and suitable for real-time implementation. The tracking results for three different trajectories; circular, rectangular, and rhodonea paths are presented

Practical application of pseudospectral optimization to robot path planning

To obtain minimum time or minimum energy trajectories for robots it is necessary to employ planning methods which adequately consider the platform’s dynamic properties. A variety of sampling, graph-based or local receding-horizon optimisation methods have previously been proposed. These typically use simplified kino-dynamic models to avoid the significant computational burden of solving this problem in a high dimensional state-space. In this paper we investigate solutions from the class of pseudospectral optimisation methods which have grown in favour amongst the optimal control community in recent years. These methods have high computational efficiency and rapid convergence properties. We present a practical application of such an approach to the robot path planning problem to provide a trajectory considering the robot’s dynamic properties. We extend the existing literature by augmenting the path constraints with sensed obstacles rather than predefined analytical functions to enable real world application

Cellular Automata Applications in Shortest Path Problem

Cellular Automata (CAs) are computational models that can capture the essential features of systems in which global behavior emerges from the collective effect of simple components, which interact locally. During the last decades, CAs have been extensively used for mimicking several natural processes and systems to find fine solutions in many complex hard to solve computer science and engineering problems. Among them, the shortest path problem is one of the most pronounced and highly studied problems that scientists have been trying to tackle by using a plethora of methodologies and even unconventional approaches. The proposed solutions are mainly justified by their ability to provide a correct solution in a better time complexity than the renowned Dijkstra's algorithm. Although there is a wide variety regarding the algorithmic complexity of the algorithms suggested, spanning from simplistic graph traversal algorithms to complex nature inspired and bio-mimicking algorithms, in this chapter we focus on the successful application of CAs to shortest path problem as found in various diverse disciplines like computer science, swarm robotics, computer networks, decision science and biomimicking of biological organisms' behaviour. In particular, an introduction on the first CA-based algorithm tackling the shortest path problem is provided in detail. After the short presentation of shortest path algorithms arriving from the relaxization of the CAs principles, the application of the CA-based shortest path definition on the coordinated motion of swarm robotics is also introduced. Moreover, the CA based application of shortest path finding in computer networks is presented in brief. Finally, a CA that models exactly the behavior of a biological organism, namely the Physarum's behavior, finding the minimum-length path between two points in a labyrinth is given.Comment: To appear in the book: Adamatzky, A (Ed.) Shortest path solvers. From software to wetware. Springer, 201

Motion Planning for Mobile Robots

This chapter introduces two kinds of motion path planning algorithms for mobile robots or unmanned ground vehicles (UGV). First, we present an approach of trajectory planning for UGV or mobile robot under the existence of moving obstacles by using improved artificial potential field method. Then, we propose an I-RRT* algorithm for motion planning, which combines the environment with obstacle constraints, vehicle constraints, and kinematic constraints. All the simulation results and the experiments show that two kinds of algorithm are effective for practical use

Probabilistic stable motion planning with stability uncertainty for articulated vehicles on challenging terrains

© 2015, Springer Science+Business Media New York. A probabilistic stable motion planning strategy applicable to reconfigurable robots is presented in this paper. The methodology derives a novel statistical stability criterion from the cumulative distribution of a tip-over metric. The measure is dynamically updated with imprecise terrain information, localization and robot kinematics to plan safety-constrained paths which simultaneously allow the widest possible visibility of the surroundings by simultaneously assuming highest feasible vantage robot configurations. The proposed probabilistic stability metric allows more conservative poses through areas with higher levels of uncertainty, while avoiding unnecessary caution in poses assumed at well-known terrain sections. The implementation with the well known grid based A* algorithm and also a sampling based RRT planner are presented. The validity of the proposed approach is evaluated with a multi-tracked robot fitted with a manipulator arm and a range camera using two challenging elevation terrains data sets: one obtained whilst operating the robot in a mock-up urban search and rescue arena, and the other from a publicly available dataset of a quasi-outdoor rover testing facility