Energy Optimized Robot Arm Path Planning Using Differential Evolution in Dynamic Environment

In this paper we propose an energy efficient method for path planning by a robot arm. First we have developed a cost function that provides a set of via points determining a suitable path according to the obstacles present in the surroundings and other restrictions in its motion. Then we fit a suitable polynomial to this set of interior points to ensure that the journey is smooth and takes place with the consumption of minimum energy. The set of via-points as well as the minimum energy path have been determined using IWO (Invasive Weed Optimization) which is a new search heuristic based on the colonizing property of weeds. Application of such evolutionary algorithms in trajectory planning is advantageous because the exact solution to the path planning problem is not always available beforehand and must be determined dynamically. The entire procedure has been demonstrated through simulations. The above formulation is very simple and versatile and can be effectively applied to a variety of situations.

This paper proposes an improved algorithm applied to path planning for the inspection of unmanned aerial vehicles (UAVs) in urban pipe corridors, which introduces a collaborative game between spherical vector particle swarm optimization (SPSO) and differential evolution (DE) algorithms. Firstly, a high-precision 3D grid map model of urban pipe corridors is constructed based on the actual urban situation. Secondly, the cost function is formulated, and the constraints for ensuring the safe and smooth inspection of UAVs are proposed to transform path planning into an optimization problem. Finally, a hybrid algorithm of SPSO and DE algorithms based on the Nash bargaining theory is proposed by introducing a cooperative game model for optimizing the cost function to plan the optimal path of UAV inspection in complex urban pipe corridors. To evaluate the performance of the proposed algorithm (GSPSODE), the SPSO, DE, genetic algorithm (GA), and ant colony optimization (ACO) are compared with GSPSODE, and the results show that GSPSODE is superior to other methods in UAV inspection path planning. However, the selection of algorithm parameters, the difference in the experimental environment, and the randomness of experimental results may affect the accuracy of experimental results. In addition, a high-precision urban pipe corridors scenario is constructed based on the RflySim platform to dynamically simulate the optimal path planning of UAV inspection in real urban pipe corridors.

This paper presents a survey of the most recent literature developments in the field of computational guidance and control for space applications. In recent years, the space sector has changed significantly, shifting towards solutions requiring increased performance and autonomy. This change has also been accelerated by the technical and economic needs of the new space approach. However, traditional guidance and control techniques cannot always meet the increasing requirements of autonomy and performance. For this reason, computational guidance and control has become of increasing interest to the aerospace sector. In contrast to traditional guidance and control, computational guidance and control generates commands in real time by using on-board numerical computation. It represents, therefore, a fundamental step on the way to system autonomy and autonomous operations, with the potential to increase system capabilities and reduce operational costs. On-board computation introduces, however, a series of challenges, including the need to develop algorithms which are computationally efficient, reliable and robust. The literature has classified computational guidance and control techniques into two major categories, namely model-based and data-based. The model-based category encompasses all techniques in which the guidance and control laws are explicitly related to the system dynamic and kinematic models. On the contrary, data-based techniques infer guidance and control laws from a set of data, derived from the models, but do not explicitly use such models in the algorithm itself. Model-based guidance and control includes optimal control, model predictive control and convex optimisation. For the specific case of space attitude re-orientation manoeuvres, additional techniques are path planning and artificial potential functions. The general concept behind the Model Predictive Control (MPC) framework is to solve an optimal control problem repeatedly, for example whenever new measurements are available. The MPC implements only the first element of the returned solution, and the process is then repeated. By doing so, the system is better able to cope autonomously with model uncertainties, failures, or errors. For spacecraft with limited on-board capability, having to repeatedly solve an optimisation problem on-board could represent a challenge. In this case, explicit implementations of the MPC have been proposed, in which the guidance and control laws are precomputed offline and implemented on-board using look-up tables or simple functions. If the optimal control problem of the MPC is convex, or if it can be convexified, convex optimisation can be used directly. If the problem cannot be convexified, the solution can be found by sequentially solving a convex approximation of the original non-convex problem. Convex optimisation can be used either repeatedly in the context of an MPC framework, or as a single function call to generate guidance and control laws, e.g. at the beginning of an attitude re-orientation manoeuvre. Convex optimisation has received increased attention in recent years, also due to its suitability to on-board implementation. In fact, if the optimal control problem is convex, it can be solved reliably and efficiently on-board. Convex optimisation has been successfully applied to the space sector with the notable examples of the SpaceX rocket booster landing and of the Mars pinpoint landing demonstration aboard the Masten Xombie sounding rocket. Model-based guidance techniques, not based on optimisation, have been increasingly explored in recent years, as guidance strategies employed in other engineering fields, such as robotics, are being applied to spacecraft. Among these strategies, of particular importance are path planning and artificial potential field methods, due to their applicability to spacecraft autonomous attitude manoeuvres. Path planning algorithms have been applied for decades to ground vehicles and robotic manipulators. These algorithms consist of techniques to find the best route between two points of a graph representing the search space of a problem. For spacecraft re-orientation applications, the literature has proposed different attitude representation conventions and various cost functions associated to the graph search algorithm. Each approach comes with advantages and disadvantages, which will be analysed in the paper. Along with path planning, Artificial Potential Function (APF) techniques have been developed in the field of robotics, and are now also considered for space applications, to track or maintain a specific reference under a set of constraints. The main idea behind these methods is to synthetise the controller using a potential function. This function is specifically built to grant asymptotic stability to the system, according to Lyapunov’s second stability theorem. This formulation grants flexibility to accommodate system constraints, in a computationally light-weight and efficient manner. Data-based guidance and control laws are mainly based on Artificial Intelligence (AI) technologies, and generate guidance commands after training an algorithm with a large set of data. The interest of the space sector towards AI has accelerated in the last years due to the greater maturity of the technology. Some of the most powerful examples lie in the area of machine learning, like reinforcement learning, supervised learning and deep learning. These algorithms are used to extract patterns from large amounts of data derived from complex nonlinear dynamical and kinematical models. Examples of such data can be numerical solutions of an optimal control problem. The patterns extracted from the data allow the system to identify, in a short computational time, the critical parameters needed to relate the state and control variables. Creating a sufficiently large dataset for training the algorithm requires a considerable computational effort, though, and for certain methods optimality cannot be guaranteed due to the lack of theoretical support derived from the optimality conditions. Advancements made in the last years span several research directions and open a wide variety of opportunities and challenges, which need to be examined to guide further exploration. In this paper, both model-based and data-based techniques and applications are presented. The considered techniques include model predictive control, convex optimisation and machine learning. In addition, for the implementation of autonomous attitude manoeuvres, path planning methods and artificial potential function methods are analysed. These techniques have been applied, in the literature, to a range of different applications. The applications discussed in this paper include, in addition to attitude manoeuvres, powered descent landing guidance, low-thrust orbital transfers, proximity operations and station keeping.

This paper is oriented to the transmission line inspection environment, aiming to solve the problem of how to control the robotic arm to quickly and accurately grasp the target object, and work on the planning of the motion path and the position-based visual servo control method. For the spatial trajectory planning of the robotic arm, linear trajectory planning and circular arc trajectory planning are carried out respectively. Between the reaction speed problem of the traditional RRT motion algorithm in collision-free motion planning, a two-way RRT-Connect path planning method is proposed. Then the visual servo control algorithm of the UAV robotic arm is proposed. The position-based visual servo control method is adopted, while the EK-SVSF position estimation algorithm and the OWA-based stepwise data fusion algorithm are combined for optimal position estimation of the target during transmission line inspection. It is verified in simulation experiments that the improved RRT algorithm can obtain the shortest path planning in a shorter time with better performance. Finally, the grasping experiment is carried out in a real robotic arm transmission line inspection scene. The robotic arm path planning algorithm and visual servo control proposed in this paper are combined to carry out grasping experiments in a static cluttered environment. The experimental results show that the algorithm proposed in this paper has the best grasping success rate, servo success rate, and grasping similarity. In addition, the average errors in x-axis, y-axis and z-axis of the proposed method are 0.19cm, 1.11cm and 0.18cm, respectively, which show a good grasping accuracy, indicating that the control method proposed in this paper can be applied to the real transmission line inspection work scenarios.

Traditional ice and snow path planning methods still have internal environmental problems in intelligent path planning, such as weak innovation ability, imperfect management, long planning path, unreasonable security structure, and low degree of specialization. Therefore, more and more ice and snow sports lovers are eager to solve this problem. This paper designs a path planning method based on three-dimensional ice and snow model. The path planning method of moving snow and ice based on MNN (Multiclass Neural Networks) algorithm is studied from many aspects. MNN algorithm is used for comprehensive analysis and evaluation. The mobile phone provides data information on key nodes, air resistance, momentum change, ice and snow movement track, and so on. The results show that the ice and snow path planning system based on MNN algorithm designed in this paper has the advantages of high feasibility, high data accuracy, and good prediction effect and can effectively improve the efficiency of ice and snow path planning.

This paper presents a fuzzy adaptive differential evolution (DE) for 3D UAV path planning. The path-planning problem is formulated as a multi-objective unconstrained optimization problem in the aim of minimizing the fuel and the threat cost as well as finding the shortest path. A fuzzy logic controller is used to find the parameter values of DE during this optimization process. The mutation operation of DE is modified in a way to strike a balance between the DE/rand/1 and DE/best/1 strategies. This method is compared with both DE/rand/1 and DE/best/1 and it relatively outperformed both the classical variations. As it is often tedious to find the right parameter values for DE, this method will give freedom from the process of finding the parameter values for the acceptable performance in 3D path planning optimization.

Aiming at the problem of multi-objective path planning (MOPP) and dynamic obstacle avoidance of manipulator in dynamic environment, this paper proposes a solution based on hierarchical reinforcement learning (HRL) framework. Traditional path planning methods have some problems in dynamic scenes, such as poor real-time performance, difficult to balance multi-objective conflicts and insufficient adaptability to environmental changes. Therefore, this paper designs a two-tier architecture including global path planning layer and local obstacle avoidance layer, which is trained by Proximal policy optimization (PPO) and Soft Actor-Critic (SAC) algorithms respectively, and achieves collaborative optimization through an efficient information exchange mechanism between layers. At the same time, a multi-objective reward function based on dynamic weight adjustment strategy is introduced. Fuzzy logic is used to adaptively balance the relationship among path length, obstacle avoidance safety and energy consumption according to environmental complexity. Combined with Long Short-Term Memory (LSTM), the trajectory of obstacles is predicted, and the potential field method is further introduced to modify the obstacle avoidance reward, which improves the real-time response ability and robustness of the algorithm in dynamic environment. The experimental results show that the HRL-SAC-PPO method proposed in this paper shows superior performance in both static and dynamic scenarios. In the static scene, the success rate of this method reaches 100%, the average path length is shortened to 2.13m, no collision occurs, and the energy consumption is reduced to 1.12 kJ, which shows a good multi-objective optimization effect. In the dynamic scene, the trajectory error of obstacles predicted by LSTM is only 4.2%, and the safe distance between the robot arm and obstacles is improved by 35%, which significantly enhances the reliability of obstacle avoidance. In addition, the average decision delay of this method is only 11.3ms, and the peak delay is 23ms, which is much lower than that of the contrast algorithm, showing stronger real-time response ability. The ablation experiment further verified the key role of LSTM trajectory prediction, dynamic weight adjustment and layered structure on the overall performance. In the welding task verification of the real UR5 manipulator, the success rate of the system in dynamic environment is 95.3%, the average path length is 3.41m, and the maximum joint acceleration is only 0.87 radian/s², which is far below the safety threshold, indicating that the algorithm has good stability and obstacle avoidance ability in practical application. The comprehensive performance comparison shows that this method performs well in different industrial scenarios, and has stronger environmental adaptability and comprehensive path planning ability.

Trajectory planning is an essential part of systems controlling autonomous entities such as vehicles or robots. It requires not only finding spatial curves but also that dynamic properties of the vehicles (such as speed limits for certain maneuvers) must be followed. In this paper, we present an approach for augmenting existing path planning methods to support basic dynamic constraints, concretely speed limit constraints. We apply this approach to the well known A* and state-of-the-art Theta* and Lazy Theta* path planning algorithms. We use a concept of trajectory planning based on a modular architecture in which spatial and dynamic parts can be easily implemented. This concept allows dynamic aspects to be processed during planning. Existing systems based on a similar concept usually add dynamics (velocity) into spatial curves in a post-processing step which might be inappropriate when the curves do not follow the dynamics. Many existing trajectory planning approaches, especially in mobile robotics, encode dynamic aspects directly in the representation (e.g. in the form of regular lattices) which requires a precise knowledge of the environmental and dynamic properties of particular autonomous entities making designing and implementing such trajectory planning approaches quite difficult. The concept of trajectory planning we implemented might not be as precise but the modular architecture makes the design and implementation easier because we can use (modified) well known path planning methods and define models of dynamics of autonomous entities separately. This seems to be appropriate for simulations used in feasibility studies for some complex autonomous systems or in computer games etc. Our basic implementation of the augmented A*, Theta* and Lazy Theta* algorithms is also experimentally evaluated. We compare (i) the augmented and basic A*, Theta* and Lazy Theta* algorithms and (ii) optimizing of augmented Theta* and Lazy Theta* for distance (the trajectory length) and duration (time needed to move through the trajectory).

In our earlier study, an energy-efficient passive UAV radar imaging system was formulated, which comprehensively analyzed the system performance. In this article, based on the evaluator set, a mission planning framework for the underlying energy-efficient passive UAV radar imaging system is proposed to achieve optimized mission performance for a given remote sensing task. First, the mission planning problem is defined in the context of the proposed synthetic aperture radar (SAR) system and a general framework is outlined, including mission specification, illuminator selection, and path planning. It is found that the performance of the system is highly dependent upon the flight path adopted by the UAV platform in a 3-D terrain environment, which offers the potential of optimizing the mission performance by adjusting the UAV path. Then, the path planning problem is modeled as a single-objective optimization problem with multiple constraints. Path planning can be divided into two substages based on different mission orientations and low mutual correlation. Based on this property, a path planning method, called substage division collaborative search (Sub-DiCoS), is proposed. The problem is divided into two subproblems with the corresponding decision space and subpopulation, which significantly relax the constraints for each subproblem and facilitates the search for feasible solutions. Then, differential evolution and the whole-stage best guidance technique are devised to cooperatively lead the subpopulations to search for the best solution. Finally, simulations are presented to demonstrate the effectiveness of the proposed Sub-DiCoS method. The result of the mission planning method can be used to guide the UAV platform to safely travel through a 3-D rough terrain in an energy-efficient manner and achieve optimized SAR imaging and communication performance during the flight.

ABSTRACTThis article addresses selective compliance assembly robot arm (SCARA) robot path planning using markers. Path planning requires the positions and orientations of goal points. A path planning method using markers finds the position and orientation of the markers and recognises the markers one by one to get to the goal points. This method uses two image processes: which are Speeded-Up Robust Features (SURF) and labelling. To obtain the 3D positions of the markers, the coordinate space is transformed from colour space to camera space using a Kinect sensor. This process was implemented on a SCARA robot system. By using D-H (Denavit–Hartenberg) parameters, the SCARA robot’s inverse kinematics transforms the extracted points into joint actuator trajectories. After finding the position and orientation of the markers, the path planning is performed. The time-efficiency of the proposed method is validated through experimental results.

This paper is introduced to be the obstacle recognition, path planning and oscillating control for an automobile crane system on-line. We studied the autonomous mobile overhead traveling crane so for. In particular, the research of obstacle recognition, path plan and oscillating control is carried out. For on-line obstacle recognition, the obstacle recognition system using the ultrasonic sensor(USS) is built. And on-line partial obstacle recognition of the conveyance environment is carried out using this obstacle recognition system. For an on-line path planning, the path plan system which it could process with the information of transfer object position and the obstacle position that is recognized by obstacle recognition system in a short time was built. The feedback transfer control system in consideration of oscillating control is built. Finally, the usefulness of the system that these were integrated is proved by an experiment. Keywords-component; Automation, Mobile Robot, Overhead Traveling Crane, On-line Path Planning, Oscillating control. I. INTORODUCTION OF THIS PAPER An overhead traveling crane system has an advantage of selecting 3rd-dimentionally and freely a transfer path achieving a freedom thereof. Therefore, automation and autonomy thereof is desired to increase the operational freedom of FMS(Flexible Manufacturing System). In the present, the overhead traveling crane is mainly operated by an expert operator to ensure safety during transferring. The development of an autonomous mobile overhead traveling crane is necessary for problem of the lack of skillful operators or the problem of work efficiency. For the reason, the results of research about an autonomous mobile overhead traveling crane system are presented by us[1],[2],[4],[5]. In particular, our research for path planning was conducted from various points of view[1],[2],[4],[5]. In a past research, we has made an experimental apparatus of on overhead traveling crane shown in Fig.1, and an autonomous mobile traveling crane system with function of the obstacle recognition, path planning on-line and oscillation control has been constructed. In this visual and planning system, when there was the change of an obstacle conveying, it was necessary for the path plan to be handled in a short time and had a problem with on-line processing in a conventional study. And the path planning system is constructed[2], [4],[5]. We propose the path-planning system that can be quickly carried out with an easy algorithm on-line. The proposed online path planning system is built using two-dimensions pathplanning algorithm[3] to perform a three-dimensional path planning[4],[5]. In this proposed system, path planning can be derived by information of target position and any obstacle position that is recognized by an ultrasonic sensor (USS). This on-line path plan method performs a path plan by the partial information of a transportation environment recognized by USS of the obstacle recognition system during transfer. The path plan of the overhead traveling crane is constructed to the goal position by repeating a suggested process (algorithm). Furthermore, the inspection of the proposed path planning method was evaluated from a view point of a qualitative and a quantitative[5]. In the present condition, the transfer control system in consideration of oscillating control was a feed-forward control system which using the notch filter. Therefore this control system had the problem that oscillating control was not completed when there was remains vibration at the time of change of a path. In this paper, 2 degrees of freedom control system which added the feedback control system to the present control system are designed. And the purpose of this research is to verify the usefulness of the on-line obstacle avoidance of the proposed autonomous mobile overhead traveling crane system. 2nd International Symposium on Computer, Communication, Control and Automation (3CA 2013) © 2013. The authors Published by Atlantis Press 468 Fig. 2 Obstacle recognition system

Robot path planning in 3D space is a challenging problem for its complex configuration. Sampling-based algorithms have gained great success in solving path planning problems in 3D space, but the quality of the initial path is not guaranteed and the convergence to the optimal solution is slow. To address these problems, in this article, we present a novel sampling-based path planning framework enhanced by the deep neural network (DNN) with applications to 3D space. In the proposed framework, we first train the DNN with a number of successful path planning cases in 3D space. Then the DNN is utilized to predict the promising region where the feasible path probably exists for a given path planning problem. This predicted promising region serves as a nonuniform sampling heuristic to bias the sampling process of the path planner. In this way, the path planner can focus on the promising region in the exploration and exploitation process so that the path planning speed gets accelerated. We conduct numerical simulations to evaluate the performance of the proposed algorithm and the results show that it can perform much better than conventional path planning algorithms. Furthermore, we also investigate the performance of different DNN architectures for path planning in 3D space. Note to Practitioners—In this work, we aim to provide an efficient learning-based method to accelerate the robot path planning process in 3D space. Conventional path planning algorithms need to perceive the environment first, and then implement a series of calculations such as collision checking and data storing to generate a feasible path. When facing complex and high-dimensional environments, they do not perform well. But the proposed neural network method in this article can predict the promising region where the feasible path exists for any given environment. This prediction result is used to guide the path planning process so that the algorithm performance can get significantly improved. Apart from sampling-based algorithms, the proposed neural network model can also be extended to other types of path planning algorithms.

To enhance the performance of path planning problems, this paper proposes a Multi-strategy Enhanced Dung Beetle Optimization Algorithm (FEGDBO). This algorithm integrates Tent chaotic mapping for initialization, adaptive candidate search for exploration–exploitation balance, Differential Evolution perturbation, and a Golden Sine position update strategy to enhance global optimization capability and convergence efficiency. Experimental validation shows that FEGDBO outperforms traditional optimization algorithms and various advanced improved algorithms in terms of convergence speed, solution accuracy, and overall optimization performance. As a representative application case, this paper applies FEGDBO to the global path planning problem of warehouse AGVs, and the results confirm the effectiveness and applicability of the algorithm in practical AGV path planning tasks.

The problem of trajectory planning and obstacle avoidance in redundant robots is addressed in this paper. Four variants of Particle Swarm Optimization (PSO) and a Differential Evolution (DE) algorithm are proposed to solve this problem. Simulation experiments on a 5 degree-of-freedom (DOF) robot manipulator in an environment with static obstacles are conducted. The manipulator is required to move from a start position to a goal position with minimum error while avoiding collision with the obstacles in the workspace. The performance of the proposed algorithms is compared with the results reported in the literature and the comparative results are presented. It is observed that qPSO-C performs better in free space and PSO-C performs better in environment with obstacles in terms of minimizing error average convergence time. The performance of DE improves when the number of obstacles increases.

A cuspidal robot can move from one inverse kinematics (IK) solution to another without crossing a singularity. Multiple industrial robots are cuspidal. They tend to have a beautiful mechanical design, but they pose path-planning challenges. A task-space path may have a valid IK solution for each point along the path, but a continuous joint-space path may depend on the choice of the IK solution or even be infeasible. This article presents new analysis, path planning, and optimization methods to enhance the utility of cuspidal robots. We first demonstrate an efficient method to identify cuspidal robots and show, for the first time, that the ABB GoFa and certain robots with three parallel joint axes are cuspidal. We then propose a new path-planning method for cuspidal robots by finding all IK solutions for each point along a task-space path and constructing a graph to connect each vertex corresponding to an IK solution. Graph edges have a weight based on the optimization metric, such as minimizing joint velocity. The optimal feasible path is the shortest path in the graph. This method can find nonsingular paths as well as smooth paths that pass through singularities. Finally, we incorporate this path-planning method into a path optimization algorithm. Given a fixed workspace toolpath, we optimize the offset of the toolpath in the robot base frame while ensuring continuous joint motion. Code examples are available in a publicly accessible repository.