Hybrid Gravity Gradient Inversion-Ant Colony Optimization Algorithm for Motion Planning of Mobile Robots

Motion planning is a common task required to be fulfilled by robots. A strategy combining Ant Colony Optimization (ACO) and gravity gradient inversion algorithm is proposed for motion planning of mobile robots. In this paper, in order to realize optimal motion planning strategy, the cost function in ACO is designed based on gravity gradient inversion algorithm. The obstacles around mobile robot can cause gravity gradient anomalies; the gradiometer is installed on the mobile robot to detect the gravity gradient anomalies. After obtaining the anomalies, gravity gradient inversion algorithm is employed to calculate relative distance and orientation between mobile robot and obstacles. The relative distance and orientation deduced from gravity gradient inversion algorithm is employed as cost function in ACO algorithm to realize motion planning. The proposed strategy is validated by the simulation and experiment results.

Adaptive Motion Planning for 6-DOF Robots Based on Trigonometric Functions

Building an appropriate motion model is crucial for trajectory planning of robots and determines the operational quality directly. An adaptive acceleration and deceleration motion planning based on trigonometric functions for the end-effector of 6-DOF robots in Cartesian coordinate system is proposed in this paper. This method not only achieves the smooth translation motion and rotation motion by constructing a continuous jerk model, but also automatically adjusts the parameters of trigonometric functions according to the variable inputs and the kinematic constraints. The results of computer simulation show that this method is correct and effective to achieve the adaptive motion planning for linear trajectories.

Motion Planning of SCARA Robots for Trajectory Tracking

The paper presents a method for a simple and immediate motion planning of a SCARA robot, whose end-effector has to move along a given trajectory; the calculation procedure requires the user to define in analytical form or by points the trajectory to be followed and to assign the curvilinear abscissa as function of the time. On the basis of the geometrical characteristics of the robot, a specifically developed program determines the motion laws of the actuators that enable the robot to generate the required movement; this software can be used in all industrial applications for which a SCARA robot has to be frequently reprogrammed, in order to generate various types of trajectories with different motion times.

Motion Planning and Posture Control of the General 3-Trailer System

This paper presents a set of artificial potential field functions that improves upon, in general, the motion planning and posture control, with theoretically guaranteed point and posture stabilities, convergence and collision avoidance properties of the general3-trailer system in a priori known environment. We basically design and inject two new concepts; ghost walls and the distance optimization technique (DOT) to strengthen point and posture stabilities, in the sense of Lyapunov, of our dynamical model. This new combination of techniques emerges as a convenient mechanism for obtaining feasible orientations at the target positions with an overall reduction in the complexity of the navigation laws. Simulations are provided to demonstrate the effectiveness of the controls laws.

Potential Field Functions for Motion Planning and Posture of the Standard 3-Trailer System

This paper presents a set of artificial potential field functions that improves upon, in general, the motion planning and posture control, with theoretically guaranteed point and posture stabilities, convergence and collision avoidance properties of 3-trailer systems in a priori known environment. We basically design and inject two new concepts; ghost walls and the distance optimization technique (DOT) to strengthen point and posture stabilities, in the sense of Lyapunov, of our dynamical model. This new combination of techniques emerges as a convenient mechanism for obtaining feasible orientations at the target positions with an overall reduction in the complexity of the navigation laws. The effectiveness of the proposed control laws were demonstrated via simulations of two traffic scenarios.

Obstacle and Collision Avoidance Control Laws of a Swarm of Boids

This paper proposes a new obstacle and collision avoidance control laws for a three-dimensional swarm of boids. The swarm exhibit collective emergent behaviors whilst avoiding the obstacles in the workspace. While flocking, animals group up in order to do various tasks and even a greater chance of evading predators. A generalized algorithms for attraction to the centroid, inter-individual swarm avoidance and obstacle avoidance is designed in this paper. We present a set of new continuous time-invariant velocity control laws is presented which is formulated via the Lyapunov-based control scheme. The control laws proposed in this paper also ensures practical stability of the system. The effectiveness of the proposed control laws is demonstrated via computer simulations  

Motion Planning and Control of a Swarm of Boids in a 3-Dimensional Space

In this paper, we propose a solution to the motion planning and control problem for a swarm of three-dimensional boids. The swarm exhibit collective emergent behaviors within the vicinity of the workspace. The capability of biological systems to autonomously maneuver, track and pursue evasive targets in a cluttered environment is vastly superior to any engineered system. It is considered an emergent behavior arising from simple rules that are followed by individuals and may not involve any central coordination. A generalized, yet scalable algorithm for attraction to the centroid and inter-individual swarm avoidance is proposed. We present a set of new continuous time-invariant velocity control laws, formulated via the Lyapunov-based control scheme for target attraction and collision avoidance. The controllers provide a collision-free trajectory. The control laws proposed in this paper also ensures practical stability of the system. The effectiveness of the control laws is demonstrated via computer simulations.

Autonomous Control of a Mobile Manipulator

This paper considers the design of a motion planner that will simultaneously accomplish control and motion planning of a n-link nonholonomic mobile manipulator, wherein, a n-link holonomic manipulator is coupled with a nonholonomic mobile platform, within an obstacle-ridden environment. This planner, derived from the Lyapunov-based control scheme, generates collision-free trajectories from an initial configuration to a final configuration in a constrained environment cluttered with stationary solid objects of different shapes and sizes. We demonstrate the efficiency of the control scheme and the resulting acceleration controllers of the mobile manipulator with results through computer simulations of an interesting scenario.

Sensor-Based Motion Planning for a Car-like Robot Based On Bug Family Algorithms

This paper presents a sensor-based motion planning algorithm for 3-DOF car-like robots with a nonholonomic constraint. Similar to the classic Bug family algorithms, the proposed algorithm enables the car-like robot to navigate in a completely unknown environment using only the range sensor information. The car-like robot uses the local range sensor view to determine the local path so that it moves towards the goal. To guarantee that the robot can approach the goal, the two modes of motion are repeated, termed motion-to-goal and wall-following. The motion-to-goal behavior lets the robot directly move toward the goal, and the wall-following behavior makes the robot circumnavigate the obstacle boundary until it meets the leaving condition. For each behavior, the nonholonomic motion for the car-like robot is planned in terms of the instantaneous turning radius. The proposed algorithm is implemented to the real robot and the experimental results show the performance of proposed algorithm.

Navigation of Multiple Mobile Robots using Rule-based-Neuro-Fuzzy Technique

This paper deals with motion planning of multiple mobile robots. Mobile robots working together to achieve several objectives have many advantages over single robot system. However, the planning and coordination between the mobile robots is extremely difficult. In the present investigation rule-based and rulebased- neuro-fuzzy techniques are analyzed for multiple mobile robots navigation in an unknown or partially known environment. The final aims of the robots are to reach some pre-defined goals. Based upon a reference motion, direction; distances between the robots and obstacles; and distances between the robots and targets; different types of rules are taken heuristically and refined later to find the steering angle. The control system combines a repelling influence related to the distance between robots and nearby obstacles and with an attracting influence between the robots and targets. Then a hybrid rule-based-neuro-fuzzy technique is analysed to find the steering angle of the robots. Simulation results show that the proposed rulebased- neuro-fuzzy technique can improve navigation performance in complex and unknown environments compared to this simple rulebased technique.

Dynamic Optimization of Industrial Servomechanisms using Motion Laws Based On Bezier Curves

The motion planning procedure described in this paper has been developed in order to eliminate or reduce the residual vibrations of electromechanical positioning systems, without augmenting the motion time (usually imposed by production requirements), nor introducing overtime for vibration damping. The proposed technique is based on a suitable choice of the motion law assigned to the servomotor that drives the mechanism. The reference profile is defined by a Bezier curve, whose shape can be easily changed by modifying some numerical parameters. By means of an optimization technique these parameters can be modified without altering the continuity conditions imposed on the displacement and on its time derivatives at the initial and final time instants.

Pseudo-polynomial Motion Commands for Vibration Suppression of Belt-driven Rotary Platforms

The motion planning technique described in this paper has been developed to eliminate or reduce the residual vibrations of belt-driven rotary platforms, while maintaining unchanged the motion time and the total angular displacement of the platform. The proposed approach is based on a suitable choice of the motion command given to the servomotor that drives the mechanical device; this command is defined by some numerical coefficients which determine the shape of the displacement, velocity and acceleration profiles. Using a numerical optimization technique, these coefficients can be changed without altering the continuity conditions imposed on the displacement and its time derivatives at the initial and final time instants. The proposed technique can be easily and quickly implemented on an actual device, since it requires only a simple modification of the motion command profile mapped in the memory of the electronic motion controller.

Motion Planning and Control of Autonomous Robots in a Two-dimensional Plane

This paper proposes a solution to the motion planning and control problem of a point-mass robot which is required to move safely to a designated target in a priori known workspace cluttered with fixed elliptical obstacles of arbitrary position and sizes. A tailored and unique algorithm for target convergence and obstacle avoidance is proposed that will work for any number of fixed obstacles. The control laws proposed in this paper also ensures that the equilibrium point of the given system is asymptotically stable. Computer simulations with the proposed technique and applications to a planar (RP) manipulator will be presented.

Planning Rigid Body Motions and Optimal Control Problem on Lie Group SO(2, 1)

In this paper smooth trajectories are computed in the Lie group SO(2, 1) as a motion planning problem by assigning a Frenet frame to the rigid body system to optimize the cost function of the elastic energy which is spent to track a timelike curve in Minkowski space. A method is proposed to solve a motion planning problem that minimizes the integral of the Lorentz inner product of Darboux vector of a timelike curve. This method uses the coordinate free Maximum Principle of Optimal control and results in the theory of integrable Hamiltonian systems. The presence of several conversed quantities inherent in these Hamiltonian systems aids in the explicit computation of the rigid body motions.

Dynamic Modeling of Underwater Manipulator and Its Simulation

High redundancy and strong uncertainty are two main characteristics for underwater robotic manipulators with unlimited workspace and mobility, but they also make the motion planning and control difficult and complex. In order to setup the groundwork for the research on control schemes, the mathematical representation is built by using the Denavit-Hartenberg (D-H) method [9]&[12]; in addition to the geometry of the manipulator which was studied for establishing the direct and inverse kinematics. Then, the dynamic model is developed and used by employing the Lagrange theorem. Furthermore, derivation and computer simulation is accomplished using the MATLAB environment. The result obtained is compared with mechanical system dynamics analysis software, ADAMS. In addition, the creation of intelligent artificial skin using Interlink Force Sensing ResistorTM technology is presented as groundwork for future work

Classic and Heuristic Approaches in Robot Motion Planning A Chronological Review

This paper reviews the major contributions to the Motion Planning (MP) field throughout a 35-year period, from classic approaches to heuristic algorithms. Due to the NP-Hardness of the MP problem, heuristic methods have outperformed the classic approaches and have gained wide popularity. After surveying around 1400 papers in the field, the amount of existing works for each method is identified and classified. Especially, the history and applications of numerous heuristic methods in MP is investigated. The paper concludes with comparative tables and graphs demonstrating the frequency of each MP method's application, and so can be used as a guideline for MP researchers.

Self-protection Method for Flying Robots to Avoid Collision

This paper provides a new approach to solve the motion planning problems of flying robots in uncertain 3D dynamic environments. The robots controlled by this method can adaptively choose the fast way to avoid collision without information about the shapes and trajectories of obstacles. Based on sphere coordinates the new method accomplishes collision avoidance of flying robots without any other auxiliary positioning systems. The Self-protection System gives robots self-protection abilities to work in uncertain 3D dynamic environments. Simulations illustrate the validity of the proposed method.

Robot Path Planning in 3D Space Using Binary Integer Programming

This paper presents a novel algorithm for path planning of mobile robots in known 3D environments using Binary Integer Programming (BIP). In this approach the problem of path planning is formulated as a BIP with variables taken from 3D Delaunay Triangulation of the Free Configuration Space and solved to obtain an optimal channel made of connected tetrahedrons. The 3D channel is then partitioned into convex fragments which are used to build safe and short paths within from Start to Goal. The algorithm is simple, complete, does not suffer from local minima, and is applicable to different workspaces with convex and concave polyhedral obstacles. The noticeable feature of this algorithm is that it is simply extendable to n-D Configuration spaces.

Geometric Data Structures and Their Selected Applications

Finding the shortest path between two positions is a fundamental problem in transportation, routing, and communications applications. In robot motion planning, the robot should pass around the obstacles touching none of them, i.e. the goal is to find a collision-free path from a starting to a target position. This task has many specific formulations depending on the shape of obstacles, allowable directions of movements, knowledge of the scene, etc. Research of path planning has yielded many fundamentally different approaches to its solution, mainly based on various decomposition and roadmap methods. In this paper, we show a possible use of visibility graphs in point-to-point motion planning in the Euclidean plane and an alternative approach using Voronoi diagrams that decreases the probability of collisions with obstacles. The second application area, investigated here, is focused on problems of finding minimal networks connecting a set of given points in the plane using either only straight connections between pairs of points (minimum spanning tree) or allowing the addition of auxiliary points to the set to obtain shorter spanning networks (minimum Steiner tree).

A Cognitive Robot Collaborative Reinforcement Learning Algorithm

A cognitive collaborative reinforcement learning algorithm (CCRL) that incorporates an advisor into the learning process is developed to improve supervised learning. An autonomous learner is enabled with a self awareness cognitive skill to decide when to solicit instructions from the advisor. The learner can also assess the value of advice, and accept or reject it. The method is evaluated for robotic motion planning using simulation. Tests are conducted for advisors with skill levels from expert to novice. The CCRL algorithm and a combined method integrating its logic with Clouse-s Introspection Approach, outperformed a base-line fully autonomous learner, and demonstrated robust performance when dealing with various advisor skill levels, learning to accept advice received from an expert, while rejecting that of less skilled collaborators. Although the CCRL algorithm is based on RL, it fits other machine learning methods, since advisor-s actions are only added to the outer layer.