Path-Following Control With Obstacle Avoidance of Autonomous Surface Vehicles Subject to Actuator Faults

This paper investigates the path-following control problem with obstacle avoidance of autonomous surface vehicles in the presence of actuator faults,uncertainty and external disturbances.Autonomous surface vehicles inevitably suffer from actuator faults in complex sea environments,which may cause existing obstacle avoidance strategies to fail.To reduce the influence of actuator faults,an improved artificial potential function is constructed by introducing the lower bound of actuator efficiency factors.The nonlinear state observer,which only depends on measurable position information of the autonomous surface vehicle,is used to address uncertainties and external disturbances.By using a backstepping technique and adaptive mechanism,a path-following control strategy with obstacle avoidance and fault tolerance is designed which can ensure that the tracking errors converge to a small neighborhood of zero.Compared with existing results,the proposed control strategy has the capability of obstacle avoidance and fault tolerance simultaneously.Finally,the comparison results through simulations are given to verify the effectiveness of the proposed method.

Research on Anthropomorphic Obstacle Avoidance Trajectory Planning for Adaptive Driving Scenarios Based on Inverse Reinforcement Learning Theory

The forward design of trajectory planning strategies requires preset trajectory optimization functions,resulting in poor adaptability of the strategy and an inability to accurately generate obstacle avoidance trajectories that conform to real driver behavior habits.In addition,owing to the strong time-varying dynamic characteristics of obstacle avoidance scenarios,it is necessary to design numerous trajectory optimization functions and adjust the corresponding parameters.Therefore,an anthropomorphic obstacle-avoidance trajectory planning strategy for adaptive driving scenarios is proposed.First,numerous expert-demonstrated trajectories are extracted from the HighD natural driving dataset.Subsequently,a trajectory expectation feature-matching algorithm is proposed that uses maximum entropy inverse reinforcement learning theory to learn the extracted expert-demonstrated trajectories and achieve automatic acquisition of the optimization function of the expert-demonstrated trajectory.Furthermore,a mapping model is constructed by combining the key driving scenario information that affects vehicle obstacle avoidance with the weight of the optimization function,and an anthropomorphic obstacle avoidance trajectory planning strategy for adaptive driving scenarios is proposed.Finally,the proposed strategy is verified based on real driving scenarios.The results show that the strategy can adjust the weight distribution of the trajectory optimization function in real time according to the“emergency degree”of obstacle avoidance and the state of the vehicle.Moreover,this strategy can generate anthropomorphic trajectories that are similar to expert-demonstrated trajectories,effectively improving the adaptability and acceptability of trajectories in driving scenarios.

LSDA-APF:A Local Obstacle Avoidance Algorithm for Unmanned Surface Vehicles Based on 5G Communication Environment

In view of the complex marine environment of navigation,especially in the case of multiple static and dynamic obstacles,the traditional obstacle avoidance algorithms applied to unmanned surface vehicles(USV)are prone to fall into the trap of local optimization.Therefore,this paper proposes an improved artificial potential field(APF)algorithm,which uses 5G communication technology to communicate between the USV and the control center.The algorithm introduces the USV discrimination mechanism to avoid the USV falling into local optimization when the USV encounter different obstacles in different scenarios.Considering the various scenarios between the USV and other dynamic obstacles such as vessels in the process of performing tasks,the algorithm introduces the concept of dynamic artificial potential field.For the multiple obstacles encountered in the process of USV sailing,based on the International Regulations for Preventing Collisions at Sea(COLREGS),the USV determines whether the next step will fall into local optimization through the discriminationmechanism.The local potential field of the USV will dynamically adjust,and the reverse virtual gravitational potential field will be added to prevent it from falling into the local optimization and avoid collisions.The objective function and cost function are designed at the same time,so that the USV can smoothly switch between the global path and the local obstacle avoidance.The simulation results show that the improved APF algorithm proposed in this paper can successfully avoid various obstacles in the complex marine environment,and take navigation time and economic cost into account.

Multi-Robot Collaborative Hunting in Cluttered Environments With Obstacle-Avoiding Voronoi Cells

This work proposes an online collaborative hunting strategy for multi-robot systems based on obstacle-avoiding Voronoi cells in a complex dynamic environment. This involves firstly designing the construction method using a support vector machine(SVM) based on the definition of buffered Voronoi cells(BVCs). Based on the safe collision-free region of the robots, the boundary weights between the robots and the obstacles are dynamically updated such that the robots are tangent to the buffered Voronoi safety areas without intersecting with the obstacles. Then, the robots are controlled to move within their own buffered Voronoi safety area to achieve collision-avoidance with other robots and obstacles. The next step involves proposing a hunting method that optimizes collaboration between the pursuers and evaders. Some hunting points are generated and distributed evenly around a circle. Next, the pursuers are assigned to match the optimal points based on the Hungarian algorithm.Then, a hunting controller is designed to improve the containment capability and minimize containment time based on collision risk. Finally, simulation results have demonstrated that the proposed cooperative hunting method is more competitive in terms of time and travel distance.

Improved RRT^(∗)Algorithm for Automatic Charging Robot Obstacle Avoidance Path Planning in Complex Environments

A new and improved RRT∗algorithm has been developed to address the low efficiency of obstacle avoidance planning and long path distances in the electric vehicle automatic charging robot arm.This algorithm enables the robot to avoid obstacles,find the optimal path,and complete automatic charging docking.It maintains the global completeness and path optimality of the RRT algorithmwhile also improving the iteration speed and quality of generated paths in both 2D and 3D path planning.After finding the optimal path,the B-sample curve is used to optimize the rough path to create a smoother and more optimal path.In comparison experiments,the new algorithmyielded reductions of 35.5%,29.2%,and 11.7%in search time and 22.8%,19.2%,and 9%in path length for the 3D environment.Finally,experimental validation of the automatic charging of electric vehicles was conducted to further verify the effectiveness of the algorithm.The simulation experimental validation was carried out by kinematic modeling and building an experimental platform.The error between the experimental results and the simulation results is within 10%.The experimental results show the effectiveness and practicality of the algorithm.

A Novel Obstacle Avoidance Consensus Control for Multi-AUV Formation System

In this paper, the fixed-time event-triggered obstacle avoidance consensus control for a multi-AUV time-varying formation system in a 3D environment is presented by using an improved artificial potential field and leader-follower strategy(IAPF-LF). Firstly, the proposed fixed-time control can achieve the desired multi-AUV formation within a fixed settling time in any initial system state. Secondly, an event-triggered communication strategy is developed to govern the communication among AUVs, and the communication energy consumption can be decremented. The time-varying formation obstacle avoidance control algorithm based on IAPF-LF is designed to avoid static and dynamic obstacles, the desired formation is maintained in the presence of external disturbances, and there is no Zeno behavior under the fixed-time event-triggered consensus control strategy.The stability of the system is proved by the Lyapunov function and inequality scaling. Finally, simulation examples and water pool experiments are reported to verify the performance of the proposed theoretical algorithms.

Distributed formation control for a multi-agent system with dynamic and static obstacle avoidances

Formation control and obstacle avoidance for multi-agent systems have attracted more and more attention. In this paper, the problems of formation control and obstacle avoidance are investigated by means of a consensus algorithm. A novel distributed control model is proposed for the multi-agent system to form the anticipated formation as well as achieve obstacle avoidance. Based on the consensus algorithm, a distributed control function consisting of three terms （formation control term, velocity matching term, and obstacle avoidance term） is presented. By establishing a novel formation control matrix, a formation control term is constructed such that the agents can converge to consensus and reach the anticipated formation. A new obstacle avoidance function is developed by using the modified potential field approach to make sure that obstacle avoidance can be achieved whether the obstacle is in a dynamic state or a stationary state. A velocity matching term is also put forward to guarantee that the velocities of all agents converge to the same value. Furthermore, stability of the control model is proven. Simulation results are provided to demonstrate the effectiveness of the proposed control.

A Scalable Adaptive Approach to Multi-Vehicle Formation Control with Obstacle Avoidance

This paper deals with the problem of distributed formation tracking control and obstacle avoidance of multivehicle systems(MVSs)in complex obstacle-laden environments.The MVS under consideration consists of a leader vehicle with an unknown control input and a group of follower vehicles,connected via a directed interaction topology,subject to simultaneous unknown heterogeneous nonlinearities and external disturbances.The central aim is to achieve effective and collisionfree formation tracking control for the nonlinear and uncertain MVS with obstacles encountered in formation maneuvering,while not demanding global information of the interaction topology.Toward this goal,a radial basis function neural network is used to model the unknown nonlinearity of vehicle dynamics in each vehicle and repulsive potentials are employed for obstacle avoidance.Furthermore,a scalable distributed adaptive formation tracking control protocol with a built-in obstacle avoidance mechanism is developed.It is proved that,with the proposed protocol,the resulting formation tracking errors are uniformly ultimately bounded and obstacle collision avoidance is guaranteed.Comprehensive simulation results are elaborated to substantiate the effectiveness and the promising collision avoidance performance of the proposed scalable adaptive formation control approach.

Potential-based obstacle avoidance in formation control

Based on the double integrator mathematic model, a new kind of potential function is presented in this paper by referring to the concepts of the electric field; then a new formation control method is proposed, in which the potential functions are used between agent-agent and between agent-obstacle, while state feedback control is applied for the agent and its goal. This strategy makes the whole potential field simpler and helps avoid some local minima. The stability of this combination of potential functions and state feedback control is proven. Some simulations are presented to show the rationality of this control method.

Target Tracking and Obstacle Avoidance for Multi-agent Systems

This paper considers the problems of target tracking and obstacle avoidance for multi-agent systems. To solve the problem that multiple agents cannot effectively track the target while avoiding obstacle in dynamic environment, a novel control algorithm based on potential function and behavior rules is proposed. Meanwhile, the interactions among agents are also considered. According to the state whether an agent is within the area of its neighbors＇ influence, two kinds of potential functions are presented. Meanwhile, the distributed control input of each agent is determined by relative velocities as well as relative positions among agents, target and obstacle. The maximum linear speed of the agents is also discussed. Finally, simulation studies are given to demonstrate the performance of the proposed algorithm.

Improved Dijkstra Algorithm for Mobile Robot Path Planning and Obstacle Avoidance

Optimal path planning avoiding obstacles is among the most attractive applications of mobile robots(MRs)in both research and education.In this paper,an optimal collision-free algorithm is designed and implemented practically based on an improved Dijkstra algorithm.To achieve this research objectives,first,the MR obstacle-free environment is modeled as a diagraph including nodes,edges and weights.Second,Dijkstra algorithm is used offline to generate the shortest path driving the MR from a starting point to a target point.During its movement,the robot should follow the previously obtained path and stop at each node to test if there is an obstacle between the current node and the immediately following node.For this aim,the MR was equipped with an ultrasonic sensor used as obstacle detector.If an obstacle is found,the MR updates its diagraph by excluding the corresponding node.Then,Dijkstra algorithm runs on the modified diagraph.This procedure is repeated until reaching the target point.To verify the efficiency of the proposed approach,a simulation was carried out on a hand-made MR and an environment including 9 nodes,19 edges and 2 obstacles.The obtained optimal path avoiding obstacles has been transferred into motion control and implemented practically using line tracking sensors.This study has shown that the improved Dijkstra algorithm can efficiently solve optimal path planning in environments including obstacles and that STEAM-based MRs are efficient cost-effective tools to practically implement the designed algorithm.

Obstacle avoidance method of three-dimensional obstacle spherical cap

Focusing on obstacle avoidance in three-dimensional space for unmanned aerial vehicle(UAV), the direct obstacle avoidance method in dynamic space based on three-dimensional velocity obstacle spherical cap is proposed, which quantifies the influence of threatening obstacles through velocity obstacle spherical cap parameters. In addition, the obstacle avoidance schemes of any point on the critical curve during the multi-obstacles avoidance are given. Through prediction, the insertion point for the obstacle avoidance can be obtained and the flight path can be replanned. Taking the Pythagorean Hodograph(PH) curve trajectory re-planning as an example, the three-dimensional direct obstacle avoidance method in dynamic space is tested. Simulation results show that the proposed method can realize the online obstacle avoidance trajectory re-planning, which increases the flexibility of obstacle avoidance greatly.

Obstacle Avoidance and Multitarget Tracking of a Super Redundant Modular Manipulator Based on Bezier Curve and Particle Swarm Optimization

A super redundant serpentine manipulator has slender structure and multiple degrees of freedom.It can travel through narrow spaces and move in complex spaces.This manipulator is composed of many modules that can form different lengths of robot arms for different application sites.The increase in degrees of freedom causes the inverse kinematics of redundant manipulator to be typical and immensely increases the calculation load in the joint space.This paper presents an integrated optimization method to solve the path planning for obstacle avoidance and discrete trajectory tracking of a super redundant manipulator.In this integrated optimization,path planning is established on a Bezier curve,and particle swarm optimization is adopted to adjust the control points of the Bezier curve with the kinematic constraints of manipulator.A feasible obstacle avoidance path is obtained along with a discrete trajectory tracking by using a follow-the-leader strategy.The relative distance between each two discrete path points is limited to reduce the fitting error of the connecting rigid links to the smooth curve.Simulation results show that this integrated optimization method can rapidly search for the appropriate trajectory to guide the manipulator in obtaining the target while achieving obstacle avoidance and meeting joint constraints.The proposed algorithm is suitable for 3D space obstacle avoidance and multitarget path tracking.

Target Tracking and Obstacle Avoidance for Multi-agent Networks with Input Constraints

In this paper, the problems of target tracking and obstacle avoidance for multi-agent networks with input constraints are investigated. When there is a moving obstacle, the control objectives are to make the agents track a moving target and to avoid collisions among agents. First, without considering the input constraints, a novel distributed controller can be obtained based on the potential function. Second, at each sampling time, the control algorithm is optimized. Furthermore, to solve the problem that agents cannot effectively avoid the obstacles in dynamic environment where the obstacles are moving, a new velocity repulsive potential is designed. One advantage of the designed control algorithm is that each agent only requires local knowledge of its neighboring agents. Finally, simulation results are provided to verify the effectiveness of the proposed approach.

Optimisation-based Verification Process of Obstacle Avoidance Systems for Unicycle-like Mobile Robots

This paper presents an optimisatiombased verification process for obstacle avoidance systems of a unicycle-like mobile robot. It is a novel approach for the collision avoidance verification process. Local and global optimisation based verification processes are developed to find the worst-case parameters and the worst-case distance between the robot and an obstacle. The kinematic and dynamic model of the unicycle-like mobile robot is first introduced with force and torque as the inputs. The design of the control system is split into two parts. One is velocity and rotation using the robot dynamics, and the other is the incremental motion planning for robot kinematics. The artificial potential field method is chosen as a path planning and obstacle avoidance candidate technique for verification study as it is simple and widely used. Different optimisation algorithms are applied and compared for the purpose of verification. It is shown that even for a simple case study where only mass and inertia variations are considered, a local optimization based verification method may fail to identify the worst case. Two global optimisation methods have been investigated： genetic algorithms （GAs） and GLOBAL algorithms. Both of these methods successfully find the worst case. The verification process confirms that the obstacle avoidance algorithm functions correctly in the presence of all the possible parameter variations.

Dynamic A^*path finding algorithm and 3D lidar based obstacle avoidance strategy for autonomous vehicles

This paper presents a novel dynamic A^*path finding algorithm and 3D lidar based local obstacle avoidance strategy for an autonomous vehicle.3D point cloud data is collected and analyzed in real time.Local obstacles are detected online and a 2D local obstacle grid map is constructed at 10 Hz/s.The A^*path finding algorithm is employed to generate a local path in this local obstacle grid map by considering both the target position and obstacles.The vehicle avoids obstacles under the guidance of the generated local path.Experiment results have shown the effectiveness of the obstacle avoidance navigation algorithm proposed.

Formation Control and Obstacle Avoidance for Multiple Mobile Robots

这篇论文为一组 nonholonomic 考虑形成控制和障碍回避的问题活动机器人。根据非最优的模型预兆的控制，二个控制算法被建议。当解决费用在工作的最佳的控制问题被结合，两个算法被提出以便他们解决每个交往的机器人的动力学。潜在的功能被用来定义终端状态惩罚术语，和一个相应终端声明区域被加到优化限制。而且，包括稳定性和安全的主要问题也被讨论。模拟结果显示出建议控制策略的可行性。

A New Efficient Obstacle Avoidance Control Method for Cars Based on Big Data and Just-in-Time Modeling

This paper provides a new obstacle avoidance control method for cars based on big data and just-in-time modeling. Just-in-time modeling is a new kind of data-driven control technique in the age of big data and is used in various real systems. The main property of the proposed method is that a gain and a control time which are parameters in the control input to avoid an encountered obstacle are computed from a database which includes a lot of driving data in various situations. Especially, the important advantage of the method is small computation time, and hence it realizes real-time obstacle avoidance control for cars. From some numerical simulations, it is showed that the new control method can make the car avoid various obstacles efficiently in comparison with the previous method.

Formation Control of Mobile Robots with Active Obstacle Avoidance

在这份报纸，形成控制和障碍回避问题被处理一统一了控制算法，它允许追随者当维持从领导人的需要的相对适用或相对距离时，避免障碍。In the known 领导人追随者机器人形成控制文学，领导人机器人的绝对运动状态被要求控制追随者，它不能在一些环境是可得到的。在这研究，领导人追随者机器人形成以在领导人和追随者机器人之间的相对运动状态被建模并且控制。领导人机器人的绝对运动状态没在建议形成控制器被要求。而且，研究基于察觉到在机器人和障碍之间的相对运动被扩大了到一个新奇障碍回避计划。试验性的调查用平台被进行了由活动机器人和计算机视觉系统，和结果表明了的三 nonholonomic 组成了建议方法的有效性。

Swarm intelligence based dynamic obstacle avoidance for mobile robots under unknown environment using WSN

To solve dynamic obstacle avoidance problems, a novel algorithm was put forward with the advantages of wireless sensor network (WSN). In view of moving velocity and direction of both the obstacles and robots, a mathematic model was built based on the exposure model, exposure direction and critical speeds of sensors. Ant colony optimization (ACO) algorithm based on bionic swarm intelligence was used for solution of the multi-objective optimization. Energy consumption and topology of the WSN were also discussed. A practical implementation with real WSN and real mobile robots were carried out. In environment with multiple obstacles, the convergence curve of the shortest path length shows that as iterative generation grows, the length of the shortest path decreases and finally reaches a stable and optimal value. Comparisons show that using sensor information fusion can greatly improve the accuracy in comparison with single sensor. The successful path of robots without collision validates the efficiency, stability and accuracy of the proposed algorithm, which is proved to be better than tradition genetic algorithm (GA) for dynamic obstacle avoidance in real time.