It is essential in many applications to impose a scalable coordinated motion control on a large group of mobile robots, which is efficient in tasks requiring repetitive execution, such as environmental monitoring. In this paper, we design a guiding vector field to guide multiple robots to follow possibly different desired paths while coordinating their motions. The vector field uses a path parameter as a virtual coordinate that is communicated among neighboring robots. Then, the virtual coordinate is utilized to control the relative parametric displacement between robots along the paths. This enables us to design a saturated control algorithm for a Dubins-car-like model. The algorithm is distributed, scalable, and applicable for any smooth paths in an n-dimensional configuration space, and global convergence is guaranteed. Simulations with up to fifty robots and outdoor experiments with fixed-wing aircraft validate the theoretical results.

Using a designed vector field to control a mobile robot to follow a given desired path is intuitive and practical, and to build a rigorous theory to guide its implementation is essential. In this paper, we study the properties of a general 3D vector field for robotic path following. We propose and investigate assumptions that turn out to be crucial for this method, but have been rarely explicitly stated in related works. We derive conditions under which the local path-following error vanishes exponentially in a sufficiently small neighborhood of the desired path, which is key to show the local input-to-state stability (local ISS) property of the path-following error dynamics. The local ISS property then justifies the control algorithm design for a fixed-wing aircraft model. Our approach is effective for any sufficiently smooth desired path in 3D, bounded or unbounded; note that the case for unbounded desired paths has not been sufficiently discussed in the literature. Simulations are conducted to verify the theoretical results.

In robot navigation tasks, such as unmanned aerial vehicle (UAV) highway traffic monitoring, it is important for a mobile robot to follow a specified desired path. However, most of the existing path-following navigation algorithms cannot guarantee global convergence to desired paths or enable following self-intersected desired paths due to the existence of singular points where navigation algorithms return unreliable or even no solutions. One typical example arises in vector-field guided path-following (VF-PF) navigation algorithms. These algorithms are based on a vector field, and the singular points are exactly where the vector field diminishes. Conventional VF-PF algorithms generate a vector field of the same dimensions as those of the space where the desired path lives. In this article, we show that it is mathematically impossible for conventional VF-PF algorithms to achieve global convergence to desired paths that are self-intersected or even just simple closed (precisely, homeomorphic to the unit circle). Motivated by this new impossibility result, we propose a novel method to transform selfintersected or simple closed desired paths to nonself-intersected and unbounded (precisely, homeomorphic to the real line) counterparts in a higher dimensional space. Corresponding to this new desired path, we construct a singularity-free guiding vector field on a higher dimensional space. The integral curves of this new guiding vector field is thus exploited to enable global convergence to the higher dimensional desired path, and therefore the projection of the integral curves on a lower dimensional subspace converge to the physical (lower dimensional) desired path. Rigorous theoretical analysis is carried out for the theoretical results using dynamical systems theory. In addition, we show both by theoretical analysis and numerical simulations that our proposed method is an extension combining conventional VF-PF algorithms and trajectory tracking Manuscript

A path-following control algorithm enables a system's trajectories under its guidance to converge to and evolve along a given geometric desired path. There exist various such algorithms, but many of them can only guarantee local convergence to the desired path in its neighborhood. In contrast, the control algorithms using a well-designed guiding vector field can ensure almost global convergence of trajectories to the desired path; here, "almost" means that in some cases, a measure-zero set of trajectories converge to the singular set where the vector field becomes zero (with all other trajectories converging to the desired path). In this article, we first generalize the guiding vector field from the Euclidean space to a general smooth Riemannian manifold. This generalization can deal with path-following in some abstract configuration space (such as robot arm joint space). Then, we show several theoretical results from a topological viewpoint. Specifically, we are motivated by the observation that singular points of the guiding vector field exist in many examples where the desired path is homeomorphic to the unit circle, but it is unknown whether the existence of singular points always holds in general (i.e., is inherent in the topology of the desired path). In the n-dimensional Euclidean space, we provide an affirmative answer, and conclude that it is not possible to guarantee global convergence to desired paths that are homeomorphic to the unit circle. Furthermore, we show that there always exist nonpath-converging trajectories (i.e., trajectories that do not converge to the desired path) starting from the boundary of a ball containing the desired path in an n-dimensional Euclidean space where n ≥ 3. Examples are provided to illustrate the theoretical results.

In this paper, we apply deep reinforcement learning (DRL) to solve the flocking control problem of multi-robot systems in complex environments with dynamic obstacles. Starting from the traditional flocking model, we propose a DRL framework for implementing multi-robot flocking control, eliminating the tedious work of modeling and control designing. We adopt the multi-agent deep deterministic policy gradient (MADDPG) [1] algorithm, which additionally uses the information of multiple robots in the learning process to better predict the actions that robots will take. To address the problems such as low learning efficiency and slow convergence speed of the MADDPG algorithm, this paper studies a prioritized experience replay (PER) [2] mechanism and proposes the Prioritized Experience Replay-MADDPG (PER-MADDPG) algorithm. Based on the temporal difference (TD) error, a priority evaluation function is designed to determine which experiences are sampled preferentially from the replay buffer. In the end, the simulation results verify the effectiveness of the proposed algorithm. It has a faster convergence speed and enables the robot group to complete the flocking task in the environment with obstacles.

Path following and collision avoidance are two important functionalities for mobile robots, but there are only a few approaches dealing with both. In this paper, we propose an integrated path following and collision avoidance method using a composite vector field. The vector field for path following is integrated with that for collision avoidance via bump functions, which reduce significantly the overlapping effect. Our method is general and flexible since the desired path and the contours of the obstacles, which are described by the zero-level sets of sufficiently smooth functions, are only required to be homeomorphic to a circle or the real line, and the derivation of the vector field does not involve specific geometric constraints. In addition, the collision avoidance behaviour is reactive; thus, real-time performance is possible. We show analytically the collision avoidance and path following capabilities, and use numerical simulations to illustrate the effectiveness of the theory.

No abstract

In vector-field-based path following (VF-PF), a vector field is designed and utilized to guide a robot to follow a desired path. VF-PF algorithms have been shown to achieve high path-following precision under small control effort compared with many other path following algorithms. However, due to the existence of singular points where the vector field vanishes, the global convergence of VF-PF algorithms to the desired path cannot be guaranteed. Moreover, as it holds for most of the existing path following algorithms, VF-PF algorithms may fail to enable following a self-intersected desired path. In this paper, we propose a method to assist generic VF-PF algorithms in their global convergence. In particular, our method creates vector fields free of singular points in a higher-dimensional space containing the lower-dimensional desired path. Subsequently, the projection of our vector fields on the lower-dimensional space of the desired path can be exploited to guarantee the global convergence of the robot to the desired path, including those self-intersected. Finally, we show that our algorithm combines and fairly extends features from existing path following algorithms and a nonlinear trajectory tracking algorithm. The theoretical results have been validated by experiments and simulations.