In various industrial robotic applications, the effective traversal of a manipulator amidst obstacles and its ability to reach specific task-points are imperative for the execution of predefined tasks. In certain scenarios, the sequence in which the manipulator reaches these task-points significantly impacts the overall cycle time required for task completion. Moreover, some tasks necessitate significant force exertion at the end-effector. Therefore, establishing an optimal sequence for the task-points reached by the end-effector’s tip is crucial for enhancing robot performance, ensuring collision-free motion and maintaining high-force application at the end-effector’s tip.

To maximize the manipulator’s manipulability, which serves as a performance index for assessing its force capability, we aim to establish an optimal collision-free task sequence considering higher mechanical advantage. Three optimization criteria are considered: the cycle time, collision avoidance and the manipulability index. Optimization is accomplished using a genetic algorithm coupled with the Bump-Surface concept for collision avoidance. The effectiveness of this approach is confirmed through simulation experiments conducted in 2D and 3D environments with obstacles employing both redundant and non-redundant robots.

Hyper-redundant manipulators (HRMs) exhibit promising adaptability and superior dexterity in cavity detection tasks, owing to their snake-like segmented backbones. Due to the safety concern in contactless operating tasks, reliable motion planning in a confined environment for HRMs is very challenging. However, existing expanding-based obstacle avoidance methods are not feasible in narrow environments, as they will excessively occupy free spaces required for maneuvering. In this work, a local collision-free motion planning strategy based on dynamic safety envelope (DSE) is proposed for HRMs. First, the local motion of HRMs is analyzed in detail, and DSE is proposed for the first time to describe the boundary of the collision-free area. Then, to maximize the efficient utilization of narrow spaces, a reference trajectory for HRM is roughly planned without expanding obstacles. Further, a tip-guided trajectory tracking method based on configuration prediction is proposed by considering the discrete characteristics of rigid links to avoid obstacles. During the tracking process, DSEs are applied to evaluate collision risk and optimize the configuration. Finally, to validate the effectiveness of our proposed method, simulations are conducted, followed by experiments by using a 18-degrees of freedom mobile HRM prototype system.

Most studies on path planning of robotic arm focus on obstacle avoidance at the end position of robotic arm, while ignoring the obstacle avoidance of robotic arm joint linkage, and the obstacle avoidance method has low flexibility and adaptability. This paper proposes a path obstacle avoidance algorithm for the overall 6-DOF robotic arm that is based on the improved A* algorithm and the artificial potential field method. In the first place, an improved A* algorithm is proposed to address the deficiencies of the conventional A* algorithm, such as a large number of search nodes and low computational efficiency, in robotic arm end path planning. The enhanced A* algorithm proposes a new node search strategy and local path optimization method, which significantly reduces the number of search nodes and enhances search efficiency. To achieve the manipulator joint rod avoiding obstacles, a method of robotic arm posture adjustment based on the artificial potential field method is proposed. The efficiency and environmental adaptability of the robotic arm path planning algorithm proposed in this paper are validated through three types of simulation analysis conducted in different environments. Finally, the AUBO-i10 robotic arm is used to conduct path avoidance tests. Experimental results demonstrate that the proposed method can make the manipulator move smoothly and effectively plan an obstacle-free path, proving the method’s viability.

Path-following control of wheeled mobile robots has been a crucial research topic in robotic control theory and applications. In path-following control with obstacles, the path-following control and collision avoidance goals might be conflicting, making it challenging to obtain near-optimal solutions for path-following control and obstacle avoidance with low tracking error and input energy consumption. To address this problem, we propose a potential field-based dual heuristic programming (P-DHP) algorithm with an actor–critic (AC) structure for path-following control of mobile robots with obstacle avoidance. In the proposed P-DHP, the path-following control and collision avoidance problems are decoupled into two ones to resolve the control conflict. Firstly, a neural network-based AC is constructed to approximate the near-optimal path-following control policy in a no-obstacle environment. Then, with the trained path-following control policy fixed, a potential field-based control policy structure is constructed by another AC network to generate opposite control forces as the robot moves toward the obstacle, which can guarantee the robot’s control safety and reduce the tracking error and input energy consumption in obstacle avoidance. The simulated and experimental results show that P-DHP can realize near-optimal path-following control with the satisfaction of safety constraints and outperforms state-of-the-art approaches in control performance.

This paper, based on the idea of redundancy angle discretisation, proposes an obstacle avoidance method for the fixed tip pose trajectory of a seven degrees-of-freedom (7-DOF) modular manipulator. First, for the case in which a specific redundancy angle is given, the analytical solutions of the redundant manipulator left 6-DOF subchain are found. Then, through the discretisation of the redundancy angle, the concept of the self-motion space of the tip pose is proposed and is extended to the concept of the self-motion space of the trajectory. Based on this discrete space, a path-planning algorithm is proposed to help select the appropriate redundancy angles to obtain the collision-free solution set of the fixed Cartesian trajectory. However, due to the large fluctuation of the obtained path, a path optimisation method based on the path cost is proposed to smooth the path, and the continuous and collision-free solution set of the manipulator tip’s trajectory is obtained. The method proposed in this paper provides a new thought for the problem of collision-free solution set planning for the Cartesian trajectory of a 7-DOF manipulator and it has great application potential in working environments with high accuracy requirements for the trajectory.

The unmanned aerial vehicle (UAV) flocking among obstacles was transferred to a velocity-controllable UAV flocking problem, which means that multi-UAV gradually form and maintain the $\alpha$ -lattice geometry as they track the desired flocking velocity, and can be applied to tasks such as obstacle avoidance and velocity tracking. Velocity-controllable UAV flocking problem is a multi-objective flocking controller parameters optimisation problem, for which we design flocking velocity and geometry objective function, and solve them using a multi-objective particle swarm optimisation algorithm (MOPSO). On this basis, to address the problem that MOPSO has random results and long computation time, we propose to use a neural network (NN) to approximate the mathematical relationship between the UAV flocking state and the flocking controller parameters. We simulate the flight process of 5 and 49 UAVs performing obstacle avoidance and velocity tracking tasks, respectively. The results show that the proposed UAV flocking controller has better convergence performance, obtains reproducible results, reduces computation time, and can be used for large-scale UAV flocking control.

This paper proposes a novel real-time formation control and obstacle avoidance algorithm for multiple fixed-wing UAVs. A formation control algorithm is designed by a combination of the virtual structure, leader-follower, and artificial potential fields methods and harnessing the advantages of those approaches. The kinematic and dynamic constraints of fixed-wing UAVs are considered in the path planning. The performance of the proposed algorithm is examined through simulation in Matlab software by applying the translational dynamics of fixed-wing UAVs. Simulations of different complex scenarios demonstrate the effectiveness of the presented formation flight algorithm through generating multiple efficient paths, which are fully consistent with the functional constraints of the UAVs in the presence of obstacles.

This paper considers the problem of formation control for a team of nonholonomic wheeled mobile robots considering obstacle avoidance. A new control algorithm based on the model predictive control (MPC) and the nonlinear dynamics of the system is presented here. The control algorithm is applied to the nonlinear system using two different controllers including linear MPC and nonlinear MPC. The virtual structure formation approach and artificial potential field method are employed to determine the reference trajectories of the robots and to solve the problem of obstacle avoidance. A control algorithm consisting of two parts is proposed to track the trajectories and maintain the team’s formation. Two advantages of using MPC techniques are the ability to consider control and state constraints which are of high importance in practical applications. The main contribution of this paper is the design of two robust control systems to disturbance with respect to actuator saturation limits. Simulation results demonstrate the effectiveness and robustness of the proposed control algorithm in trajectory tracking and formation maintenance in the presence of disturbance and actuator limits.

One of the most challenging tasks for autonomous robots is avoiding unexpected obstacles during their path following operation. Follow the gap method (FGM) is one of the most popular obstacle avoidance algorithms that recursively guides the robot to the goal state by considering the angle to the goal point and the distance to the closest obstacles. It selects the largest gap around the robot, where the gap angle is calculated by the vector to the midpoint of the largest gap. In this paper, a novel obstacle avoidance procedure is developed and applied to a real fully autonomous wheelchair. This proposed algorithm improves the FGM’s travel safety and brings a new solution to the obstacle avoidance task. In the proposed algorithm, the largest gap is selected based on gap width. Moreover, the avoidance angle (similar to the gap center angle of FGM) is calculated considering the locus of the equidistant points from obstacles that create obstacle circles. Monte Carlo simulations are used to test the proposed algorithm, and according to the results, the new procedure guides the robot to safer trajectories compared with classical FGM. The real experimental test results are in parallel to the simulations and show the real-time performance of the proposed approach.

Today, demandsin industrial manufacturing mandate humans to work with large-scale industrial robots, and this collaboration may result in dangerous conditions for humans. To deal with this situation, this work proposes a novel approach for redundant large-scale industrial robots. In the proposed approach, an admittance controller is designed to regulate the interaction between the end effector of the robot and the human. Additionally, an obstacle avoidance algorithm is implemented in the null space of the robot to prevent any possible unexpected collision between the human and the links of the robot. After safety performance of this approach is verified via simulations and experimental studies, the effect of the parameters of the admittance controller on the performance of collaboration in terms of both accuracy and total human effort is investigated. This investigation is carried out via 8 experiments by the participation of 10 test subjects in which the effect of different admittance controller parameters such as mass and damper are compared. As a result of this investigation, tuning insights for such parameters are revealed.

This paper proposes a kinematic obstacle avoidance algorithm for Space hyper-redundant manipulators, and its basic idea is to use a static and a dynamic curve to constrain the macroshape of the manipulators simultaneously. The static curve is constructed based on a traditional rapidly exploring random tree algorithm, and a backbone curve is utilized as the dynamic curve. For these two curves, two novel shape control methods are proposed to accomplish the shape constraining process. Finally, we verify the reliability and effectiveness of our algorithm through simulations.

This paper presents a trajectory planning method based on multi-objective optimization, including time optimal and jerk optimal for the manipulators in the presence of obstacles. The proposed method generates a trajectory configuration in the joint space with kinematic and obstacle constraints using quintic B-spline. Gilbert–Johnson–Keerthi detecting algorithm is utilized to detect whether there is a collision and obtain the minimum distance between the manipulator and obstacles. The degree of constraint violations is introduced to redefine the Pareto domination, and the constrained multi-objective particle swarm algorithm (CMOPSO) is adopted to solve the time-jerk optimization problem. Finally, the Z-type fuzzy membership function is proposed to select the best optimal solution in the Pareto front obtained by CMOPSO. Test results show the effectiveness of the proposed method.

In this paper, the inverse kinematics (IK) of redundant manipulators is presented and studied, where the performance of end-effector path planning is guaranteed. A new Jacobian pseudoinverse (JP)-based IK method is proposed and studied using a typical numerical difference rule to discretize the existing IK method based on JP. The proposed method is depicted in a discrete-time form and is theoretically proven to exhibit great performance in the IK of redundant manipulators. A discrete-time repetitive path planning (DTRPP) scheme and a discrete-time obstacle avoidance (DTOA) scheme are developed for redundant manipulators using the proposed method. Comparative simulations are conducted on a universal robot manipulator and a PA10 robot manipulator to validate the effectiveness and superior performance of the DTRPP scheme, the DTOA scheme, and the proposed JP-based IK method.

This paper proposes a mobile parallel robot (MPR) and focuses on obstacle avoidance. When analyzing the collision-free trajectories, the coupling constraints caused by the parallel mechanism and the obstacle should be emphatically solved. The solution is to divide the problem into two steps. First, the genetic algorithm is employed to search and optimize the feasible trajectories under the mechanism constraint of the MPR. Then the trajectory tracking controller is designed to make the tracked vehicles move cooperatively and track a trajectory asymptotically. Finally, simulations and experiments are carried out to verify the effectiveness of the solution.

The V-groove joint of thick wall intersecting pipes must be filled by multi-layer weld. The welding path of intersecting pipes is complicated, and hence multi-layer welds increase the complexity of the problem. This paper proposes a methodology for path planning of multi-layer weld of thick wall intersecting pipes. The methodology is based on measuring the electrode pose located in both side and front views of intersecting pipes. In order to compensate for the path deviation around the pipe circumference, the measured values are used to interpolate the path of each pass between two views. The methodology has been applied in a case study. Simulation results approve that multi-layer weld appropriately fills the V-groove joint space around the pipe circumference. In addition, collision avoidance between welding torch and pipes is considered by introducing a safety ring. While the robot wrist moves inside the safety ring, no collision occurs. Simulation results show the robustness of the proposed path planning method, introduced for collision avoidance.

For acquiring a broad view in an unknown environment, we proposed a control strategy based on the Bézier curve for the snake robot raising its head. Then, an improved discretization method was developed to accommodate the backbone curves with more complex shapes. Besides, in order to determine the condition of using the improved discretization method, energy of framed space curve is introduced originally to estimate the shape complexity of the backbone curve. At last, based on degree elevation of the Bézier curve, an obstacle avoidance strategy of the head-raising motion was proposed and validated through simulation.

This paper presents a Chebyshev Pseudospectral (PS) method for solving the motion planning problem of nonholonomic mobile robots with kinematic and dynamic constraints. The state and control variables are expanded in the Chebyshev polynomial of order N, and Chebyshev–Gauss–Lobatto (CGL) nodes are provided for approximating the system dynamics, boundary conditions, and performance index. For the lack of enough nodes nearby the obstacles, the interpolation of trajectory may violate the obstacles and the multiple-interval strategy is proposed to deal with the violation. Numerical examples demonstrate that multiple-interval strategy yields more accurate results than the single-interval Chebyshev PS method.

This paper deals with the problem of navigating semi-autonomous mobile robots without global localization systems in unknown environments. We propose a planning-based obstacle avoidance strategy that relies on local maps and a series of short-time coordinate frames. With this approach, simple odometry and range information are sufficient to make the robot to safely follow the user commands. Different from reactive obstacle avoidance strategies, the proposed approach chooses a good and smooth local path for the robot. The methodology is evaluated using a mobile service robot moving in an unknown corridor environment populated with obstacles and people.

Navigation and path analysis in a cluttered environment is a challenging task over the last few decades. In this paper, a behavior-based neural network (BNN) and reactive control architecture have been presented for navigation of the mobile robot. Two different reactive behaviors have been taken as inputs function. Obstacle position is the first reactive behavior given by u(o), whereas obstacle angle u(n) according to the target position is the second reactive behavior. The angular velocity and steering angle are the output of the controller. The backpropagation architecture reduces the errors of weight function and records the best weight data that match the BNN controller. Using the BNN algorithm, the robot reacts quickly as compared to other developed techniques. To validate the performance of the controller, simulation and experimental results have been compared in the common platforms. The deviation in results for both the scenarios is found to be within 10%. The results of the BNN algorithm have also been compared with other existing techniques. Effectiveness of the proposed technique is measured in terms of smoothness of the realistic path, collision point detection, path length, and performance time.

Navigation tasks are often subject to several constraints that can be related to the sensors (visibility) or come from the environment (obstacles). In this paper, we propose a framework for autonomous omnidirectional wheeled robots that takes into account both collision and occlusion risk, during sensor-based navigation. The task consists in driving the robot towards a visual target in the presence of static and moving obstacles. The target is acquired by fixed – limited field of view – on-board cameras, while the surrounding obstacles are detected by lidar scanners. To perform the task, the robot has not only to keep the target in view while avoiding the obstacles, but also to predict its location in the case of occlusion. The effectiveness of our approach is validated through several experiments.