Continuum robot has become a research hotspot due to its excellent dexterity, flexibility and applicability to constrained environments. However, the effective, secure and accurate path planning for the continuum robot remains a challenging issue, for that it is difficult to choose a suitable inverse kinematics solution due to its redundancy in the confined environment. This paper presents a collision-free path planning method based on the improved artificial potential field (APF) for the cable-driven continuum robot, in which the beetle antennae search algorithm is adopted to deal with the optimal problem of APF without the necessary for velocity kinematics. In addition, the local optimum problem of traditional APF is solved by the randomness of the antennae’s direction vector which can make the algorithm easily jump out of local minima. The simulation and experimental results verify the efficiency of the proposed path planning method.

Several studies have been conducted on collision avoidance (CA) and path planning for maritime autonomous surface ships (MASS) based on artificial potential field (APF) and electronic navigation chart (ENC) data. However, to date, accurate, highly efficient, and automatic modelling of complicated geometry environment potential fields (EPFs) has not been realised. In this study, an accurate EPF model is established using ENC data to describe different types of obstacles, navigable areas, and non-navigable areas. The implicit equations of complex polygons are constructed based on the R-function theory, and the discrete-convex hull method is introduced to realise the automatic modelling of EPF. Moreover, collaborative CA and obstacle avoidance (OA) experiments are designed and conducted in a simulated environment and based on the ENC data. The results show that the proposed EPF modelling method is accurate, reliable, and time-efficient even with numerous ENC data and complex shapes owing to the R-function representation for geometric objects and discrete-convex hull method. The combination of improved APF and EPF models is proven to be effective for CA and OA. This paper presents a practical EPF modelling approach for APF-based ship path planning.

This paper presents a new algorithm to navigate robots in dynamically cluttered environments. The proposed algorithm uses basic concepts of space attraction (hence the term Agoraphilic) to navigate robots through dynamic obstacles. The new algorithm in this paper is an advanced development of the original Agoraphilic navigation algorithm that was only able to navigate robots in static environments. The Agoraphilic algorithm does not look for obstacles (problems) to avoid but rather for a free space (solutions) to follow. Therefore, it is also described as an optimistic navigation algorithm. This algorithm uses only one attractive force created by the available free space. The free-space concept allows the Agoraphilic algorithm to overcome inherited challenges of general navigation algorithms. However, the original Agoraphilic algorithm has the limitation in navigating robots only in static, not in dynamic environments. The presented algorithm was developed to address this limitation of the original Agoraphilic algorithm. The new algorithm uses a developed object tracking module to identify the time-varying free spaces by tracking moving obstacles. The capacity of the algorithm was further strengthened by the new prediction module. Future space prediction allowed the algorithm to make decisions considering future growing/diminishing free spaces. This paper also includes a bench-marking study of the new algorithm compared with a recently published APF-based algorithm under a similar operating environment. Furthermore, the algorithm was validated based on experimental tests and simulation tests.

To eliminate the effect of ocean currents for optimal path planning for unmanned underwater vehicles (UUVs) in the underwater environment, an intelligent algorithm is designed and proposed in this paper. The algorithm consists of two parts: an artificial potential field-based algorithm that derives the shortest path and avoids collision accidents; and an adjusting function that eliminates the effect of ocean currents. The planning results of the intelligent algorithm are presented in detail, and compared with the conventional algorithm that does not consider the effect of currents. The effectiveness of the optimised path planning method given in this paper is proved.

We present a robot navigation system based on Behavioral Finite State Social Machine. The paper makes a robot operate as a social tour guide that adapts its navigation based on the behavior of the visitors. The problem of a robot leading a human group with a limited field-of-view vision is relatively untouched in the literature. Uncertainties arise when the visitors are not visible, wherein the behavior of the robot is adapted as a social response. Artificial potential field is used for local planning, and a velocity manager sets the speed disproportional to time duration of missing visitors.

The constrained coverage path planning addressed in this paper refers to finding an optimal path traversed by a unmanned aerial vehicle (UAV) to maximize its coverage on a designated area, considering the time limit and the feasibility of the path. The UAV starts from its current position to assess the condition of a new entry to the area. Nevertheless, the UAV needs to comply with the coverage task, simultaneously and therefore, it is likely that the optimal policy would not be the shortest path in such a condition, since a wider area can be covered through a longer path. From the other side, along with a longer path, the UAV may not reach to the target in due time. In addition, the speed of UAV is assumed to be constant and as a result, a feasible path needs to be smooth enough to support this assumption. The problem is modeled as an Epsilon-constraint optimization in which a coverage function has to be maximized, considering the constraints on the length and the smoothness of the path. For this purpose, a new genetic path planning algorithm with adaptive operator selection is proposed to solve such a complicated constrained optimization problem. The proposed approach has been compared to some classical approaches like, a modified version of the Artificial Potential Field and a modified version of Dijkstra's algorithm (a graph-based approach). All the methods are implemented and tested in different scenarios and their performances are evaluated via the simulation results.

In this paper, a novel scheme is presented to conquer the motion-planning problem for autonomous space robots. Minimizing the consumed energy of atomic batteries within the daily planetary missions of robot on the planet is taken into account, i.e., utilization of the generated solar power by its embedded photocells leads to saving energy of batteries for night missions. Aforementioned objective could be acquired by appropriate interaction of motion planning paradigm with shadows of obstacles. Modeling of the shadow with the proposed artificial potential field leads to generalize the concept of potential fields not only for static and dynamic obstacles but also for being confronted with the intrinsic time-variant phenomena such as shadows. With due attention to the noticeable computational complexity of the introduced strategy, fuzzy techniques are applied to optimize the sampling times effectively. To accomplish this objective, a smart control scheme based on the fuzzy logic is mounted to the primitive version of algorithm. Regarding the need to identify some structural parameters of obstacles, PIONEER™ mobile robot is designed as a test bed for the verification of simulated results. Investigation on empirical accomplishments shows that the goal-oriented definition of Time–Variant Artificial Potential Fields is able to resolve the motion-planning problem in planetary applications.

Inspired by the mechanisms of idiotypic network hypothesis and ant finding food, a hybrid ant colony and immune network algorithm (AC-INA) for motion planning is presented. Taking the environment surrounding the robot and robot action as antigen and antibody respectively, an artificial immune network is constructed through the stimulation and suppression between the antigen and antibody, and the antibody network is searched using improved ant colony algorithm (ACA) with pseudo- random-proportional rule and super excellent ant colony optimization strategy. To further accelerate the convergence speed of AC-INA and realize the optimal dynamic obstacle avoidance, an improved adaptive artificial potential field (AAPF) method is provided by constructing new repulsive potential field on the basis of the relative position and velocity between the robot and obstacle. Taking the planning results of AAPF method as the prior knowledge, the initial instruction definition of new antibody is initialized through vaccine extraction and inoculation. During the motion planning, once the robot meets with moving obstacles, the AAPF method is used for the optimal dynamic obstacle avoidance. The simulation results indicate that the proposed algorithm is characterized by good convergence property, strong planning ability, self-organizing, self-learning, and optimal obstacle avoidance in dynamic environments. The experiment in known indoor environment verifies the validity of AAPF-based AC-INA, too.

The paper presents research on the APF approach for solving the GNRON and local minima problems. The repulsive potential function is modified in order to solve the GNRON problem. A simulated annealing algorithm integrated into the APF has solved the local minimum problem. The improved APF is applied to the path-planning problem of soccer robots. The simulated experiments show the validity of this approach.