Biologically-Inspired Learning and Adaptation of Self-Evolving Control for Networked Mobile Robots

Abstract

This paper presents a biologically-inspired learning and adaptation method for self-evolving control of networked mobile robots. A Kalman filter (KF) algorithm is employed to develop a self-learning RBFNN (Radial Basis Function Neural Network), called the KF-RBFNN. The structure of the KF-RBFNN is optimally initialized by means of a modified genetic algorithm (GA) in which a Lévy flight strategy is applied. By using the derived mathematical kinematic model of the mobile robots, the proposed GA-KF-RBFNN is utilized to design a self-evolving motion control law. The control parameters of the mobile robots are self-learned and adapted via the proposed GA-KF-RBFNN. This approach is extended to address the formation control problem of networked mobile robots by using a broadcast leader-follower control strategy. The proposed pragmatic approach circumvents the communication delay problem found in traditional networked mobile robot systems where consensus graph theory and directed topology are applied. The simulation results and numerical analysis are provided to demonstrate the merits and effectiveness of the developed GA-KF-RBFNN to achieve self-evolving formation control of networked mobile robots.

1. Introduction

Networked mobile robots that are capable of self-learning have received growing attention in the mobile robotics research community [1,2,3]. This emerging technology has surpassed the conventional robotic system by taking advantage of robot collaboration, system robustness, scalability, and greater flexibility. This modern robotic system has been commonly applied in manufacturing, military applications, surveillance, etc. to perform complex tasks [4,5,6]. Some self-learning strategies have been proposed to develop motion controllers for networked mobile robots [6,7]. Among them, an RBFNN incorporating the gradient descent method is regarded as a powerful tool for designing the self-learning controllers of networked mobile robots [7,8].

The RBFNN introduced by Broomhead and Lowe is a three-layer feedforward artificial neural network in which radial basis functions are used as activation functions [9,10]. This methodology takes advantage of fast learning capability and universal approximation. To date, it is a useful neural network architecture for addressing many engineering problems [11,12]. However, traditional RBFNNs adopt a gradient descent approach for training the neural network that is not capable of noise reduction [10,11,12]. In other words, these studies did not consider the uncertainty and noise induced in the process and measurement phases. This paper presents a Kalman filter based RBFNN and its application to self-learning control of networked mobile robots.

The Kalman filter is a state estimation technique introduced by R.E. Kalman [13]. It is a classic state estimation technique used widely in engineering applications, including spacecraft navigation, motion planning in robotics, signal processing and wireless sensor networks [14,15,16] because of its ability to extract useful information from noisy data. It is an optimal estimator for evaluating the internal state of a dynamic system under certain process patterns and/or measurement disturbances in the physical environment [13,17,18]. The objective of the Kalman filter is to minimize the mean squared error between the actual and estimated data. Although the proposed KF-RBFNN is useful for designing learning control schemes with noise reduction, the initial network parameters influences the system performance, namely that the selection of centers, widths and output weights for the Gaussian functions is an important consideration.

Parameter-tuning of an RBFNN is challenging when using this neural network to solve multidimensional optimization problems. Over the years, several methods have been developed for addressing this RBFNN optimization problem [19,20,21]. However, these traditional RBFNN methods may cause the output to converge to local optimum when the dimensionality of the problem increases [22]. Since RBFNN optimization can be formulated as a search problem, biologically, algorithms are new paths for optimizing RBFNNs. This is a successful hybridization of RBFNNs and evolutionary algorithms. Although there are some metaheuristic algorithms used to develop evolutionary RBFNNs [23,24,25,26], there has been no attempt to present an evolutionary KF-RBFNN using a GA to achieve learning control of networked mobile robotic systems.

The GA is one of the most popular evolutionary algorithms for solving optimization problems [27,28,29]. Although GAs have been widely applied to various optimization problems, these biologically inspired algorithms suffer from premature convergence. In other words, these traditional computing paradigms may converge to local optimum. This paper contributes to the development of a modified GA to improve the search diversity by including the Lévy flight approach. An adaptive determination of crossover and mutation probabilities in the GA is proposed via the Lévy flights. This random walk is very efficient in exploring the search space of the optimization problem. The proposed modified GA metaheuristics is then applied to the design of an optimal GA-KF-RBFNN for self-tuning motion control of networked mobile robots.

Of the increasing demands on networked mobile robot systems, formation using a leader-follower control strategy is one of the most important and is becoming increasing crucial [30,31,32]. It is a coordinated control in which the leader robot follows a desired trajectory while the follower robots maintain a specified geometrical pattern [32]. Although some studies have addressed this control problem by considering graph theory and consensus control approaches [33,34,35], these networked mobile robot systems suffer from communication delay problem. This paper presents a pragmatic self-learning optimal GA-KF-RBFNN formation control method for networked mobile robot systems that avoids the communication delay problem.

This paper is structured as follows: a biologically-inspired Kalman filter based RBFNN control technique, called GA-FA-RBFNN control is introduced in Section 2. Section 3 employs the proposed GA-FA-RBFNN to develop a networked mobile robot system to achieve self-evolving formation control. In Section 4, several simulation results are reported to demonstrate the effectiveness of the proposed methods. Finally, Section 5 concludes this paper.

2. Biologically-Inspired Kalman Filter Based RBFNN Control

2.1. Kalman Filter Algorithm

This section aims to describe the Kalman filter algorithm by which measurements are taken, and the state is estimated at discrete time points. The Kalman filter deals with the general problems encountered in estimating the state of a discrete-time controlled process, which is governed by the following state-space Equation (1) at time index k:

$$\begin{array}{l}x(k)=Ax(k-1)+BU(k-1)+w(k)\\ y(k)=Cx(k)\\ z(k)=Hy(k)+v(k)\end{array}$$

(1)

where A, B, and C are matrices in the state-space Equation (2). $w(k)$ is the process noise and $v(k)$ is the measurement noise. $z(k)$ is the measured signal and H is the sensor matrix. The probability of the process noise $w(k)$ is p(w) and the probability of measurement noise $v(k)$ is p(v). The process noise covariance of p(w) is Q and the measured noise covariance of p(v) is R. In Kalman filtering, p(w) and p(v) are independent white noises with normal probability distributions, expressed by:

$$\begin{array}{l}p(w)\sim N(0,Q)\\ p(v)\sim N(0,R)\end{array}$$

(2)

Figure 1 presents the structure of Kalman filter algorithm in which the estimated state $\widehat{x}(k-1)$ and the error covariance P(k − 1) are included [13]. As shown in Figure 1, The Kalman filter algorithm consists of two phases: time update phase (predictor) and measurement update phase (corrector). The following summarizes the two important phases in classical Kalman filter algorithm.

• Time update phase:
  • At time step k − 1, calculate $\widehat{x}(k-1)$ and $P(k-1)$.
  • Update the estimation of state vector ${\widehat{x}}^{-}(k)$ and the estimation of error covariance matrix ${\widehat{P}}^{-}(k)$.
• Measurement update phase:
  • Update the optimal gain K(k) of Kalman filter.
  • Update the estimation of state vector $\widehat{x}(k)$ using $z(k)$, ${\widehat{x}}^{-}(k)$ and K(k).
  • Update the estimation of error covariance matrix p(k) by utilizing K(k) and $P^{-}(k)$ for next iteration in the Kalman filter algorithm process.

2.2. Classical RBFNN

Figure 2 presents the structure of a classical RBFNN. This feed forward multilayer neural network has three layers, comprising the input layer, hidden layer and output layer. As shown in Figure 2, the inputs of the hidden layer in the RBFNN structure are the linear combinations of the weights and the input vector ${[x_1{x}_2,x_3,\dots \dots ,x_n]}^T$. These vectors are then mapped by means of a radial basis functions in each node. Finally, the output layer of RBFNN generates a vector $y_p$ for m outputs by linear combination of the outputs of the hidden nodes. This kind of artificial neural network has been regarded as a powerful tool that can approximate any continuous function with satisfactory accuracy [11]. In Figure 2, the output of the RBFNN is expressed by:

$$y_m={\displaystyle \sum _{j=1}^m{w}_j{h}_j}$$

(3)

where $h_j$ is the radial basis vector. This vector is described by using the following Gaussian function:

$$h_j=\exp (\frac{-{\Vert X-C_j\Vert }^2}{2b_j^2}),j=1,2,\dots ,m$$

(4)

where $\Vert •\Vert$ is the Euclidean norm operation, $C_j={[c_{j1},c_{j2},\dots ,c_{jm}]}^T$ is the center vector of the jth node, $B={[b_1,b_2,\dots ,b_m]}^T$ is the basis width vector. $W={[w_1,w_2,\dots ,w_m]}^T$ is the weight vector in the RBFNN. Typically, this neural network is initialized with a randomly determined of RBFNN parameters, including $C_j$, $B$, and $W$.

Gradient descent is an effective method for training RBFNN networks compared with other conventional training approaches [9,10]. In gradient descent training with one neuron in the output layer, the weights are updated at each time step by using the following rules:

$$w_j(k+1)=w_j(k)+\eta e(k)h_j(k),$$

(5)

$$C_{ji}(k+1)=C_{ji}(k)+\eta e(k)w_j{h}_j\frac{x_i(k)-C_{ji}(k)}{b_j^2(k)},$$

(6)

$$b_j(k+1)=b_j(k)+\eta e(k)w_j{h}_j\frac{{\Vert X(k)-C_j(k)\Vert }^2}{b_j^3(k)},$$

(7)

where $e(k)$ represents the error at the kth time step and $\eta$ denotes the learning rate. Since the initial parameters for an RBFNN using the gradient descent method are determined either by a trial-and-error approach or randomly set, convergence to a local optimum solution is inevitable [10]. To improve the learning performance of the RBFNN, this paper has developed a Kalman filter to train the RBFNN network structure based on a gradient descent approach. The proposed KF-RBFNN is applied to the self-learning control of networked mobile robots.

2.3. Kalman Filter Based RBFNN Control

Figure 3 depicts the block diagram of the RBFNN-based control. In Figure 3, the error between the real output y(k) and the estimated output of the neural network $y_m(k)$ are considered to develop a self-learning RBFNN. The cost function or performance index is defined by the squared estimation error:

$$J(k)=\frac{1}{2}{\left[y(k)-y_m(k)\right]}^2.$$

(8)

Considering the gradient descent method in Equations (5)–(7), the structure parameters: w_j, C_ji, and b_j are updated online at every sampling point, expressed by:

$$\begin{array}{l}\Delta w_j=\left[y(k)-y_m(k)\right]h_j\\ w_j(k)=w_j(k-1)+\eta \Delta w_j+\varsigma \left[w_j(k-1)-w_j(k-2)\right]\\ \Delta b_j=\left[y(k)-y_m(k)\right]w_j{h}_j\frac{{\Vert X-C_j\Vert }^2}{b_j^3}\\ b_j(k)=b_j(k-1)+\eta \Delta b_j+\varsigma \left[b_j(k-1)-b_j(k-2)\right]\\ \Delta c_{ji}=\left[y(k)-y_m(k)\right]w_j\frac{x_j-c_{ji}}{b_j^2}\\ c_{ji}(k)=c_{ji}(k-1)+\eta \Delta c_{ji}+\varsigma \left[c_{ji}(k-1)-c_{ji}(k-2)\right]\end{array},$$

(9)

where $\varsigma$ denotes the momentum factor and $\eta$ is the learning rate of the neural network.

Based on Figure 3, the proposed KF-RBFNN control scheme depicted in Figure 4 considers the process noise w(k) and measurement noise v(k). In the proposed intelligent KF-RBFNN control scheme, the KF-RBFNN serves as an on-line learning and adapting mechanism in the intelligent controller. As shown in Figure 4, the effects of the process uncertainty w(k) and the measurement noise v(k) in the control scheme can be reduced via the implementation of the Kalman filter. To retrain the uncertainty and noise, the measured output z(k) is employed to derive an estimation $\widehat{y}(k)$ of the output y(k) in the proposed KF-RBFNN. Both the control signal u(k) and output $y_m(k)$ of the RBFNN are fed into the neural network for on-line learning. Moreover, the estimated output value $y_m(k)$ of the RBFNN is then utilized to update the control parameters to achieve self-learning control using the Kalman filter.

2.4. Evolutionary KF-RBFNN Control

2.4.1. Modified GA with Lévy Flight

The GA developed by John Holland is a search algorithm that is inspired by Charles Darwin’s theory of natural evolution. This evolutionary algorithm reflects the process of natural selection where the fittest individuals are selected for reproduction, thereby producing offspring of the next generation. This stochastic optimization technique starts with a set of solutions (chromosomes), called a population. This paradigm employs probabilistic rules to evolve a population from one generation to the next via the genetic operators: reproduction, crossover, and mutation. This paradigm is widely used to solve multidimensional optimization problems. When applying a GA to deal with optimization problems, an initial population of feasible solutions is generated. Each feasible solution is encoded as a chromosome string. These chromosomes are evaluated using a predefined fitness function or objective function based on the optimization problems. Figure 5 presents the flowchart of a GA. The initial population is randomly generated and the fitness function is defined before the GA evolutionary process begins. This study employs tournament selection, single-point crossover and single-point mutation strategies to develop a modified GA paradigm.

Crossover and mutation are important operations for generating new individuals in the GAs. The performance of a GA is sensitive to the control parameter setting. The probabilities of crossover and mutation are significant parameters that influence the convergence performance of a GA. The use of unsuitable probability for crossover and mutation can result in poor convergence performance. More precisely, choosing suitable parameter values is a problem dependent task and requires previous experiences. Most studies adopt fixed crossover and mutation probabilities; this paper employs the Lévy flight which is a specialized random walk to increase the search diversity, expressed by:

$$Levy(\beta )={\left|\frac{\Gamma (\beta +1)\times \sin \left(\frac{\pi \beta }{2}\right)}{\Gamma \left(\frac{1+\beta }{2}\right)\times \beta \times 2^{\left(\frac{\beta -1}{2}\right)}}\right|}^{\frac{1}{\beta }},$$

(10)

where $\Gamma$ denotes the gamma function and $\beta$ is a constant $\left(1<\beta \le 3\right)$. The proposed modified GA is then applied to optimally set the initial parameters of the KF-RBFNN.

2.4.2. GA-Based KF-RBFNN

In the proposed KF-RBFNN, the accuracy and performance are influenced by the selections of the radial functions that are defined by a center vector B, width vector C_j, and weight vector W. In other words, proper tuning of these parameters is an important part of the optimal KF-RBFNN designs. This study employs the modified GA to develop a parameter tuning process that optimizes the KF-RBFNN. When applying the GA to address this issue, a chromosome is defined by the RBFNN parameter sequence $Chromosome=\left\{C_{j,}B,W\right\}$ and the optimal RBFNN structure can be evolved via the GA process with Lévy flight. The following fitness function (root mean square error, RMSE) for the $N_s$ sample is used to evaluate the GA chromosomes.

$$Fitness=\sqrt{\frac{1}{N_s}{\displaystyle \sum _{k=1}^{N_s}{\left({y_p}^{*}(k)-y_p(k)\right)}^2}}$$

(11)

where $y_p(k)$ is the output and ${y_p}^{*}(k)$ is the predicted output at the k^th sampling time. The following describes the GA process for KF-RBFNN optimization.

Step 1:

Initialize the GA computing with Lévy flight.

Step 2:

Each GA chromosome in the population contains genes to represent the KF-RBFNN parameters, meaning that $Chromosome=\left\{C_{j,}B,W\right\}$.

Step 3:

Construct the KF-RBFNN using $Chromosome=\left\{C_{j,}B,W\right\}$ and evaluate the performance using the fitness function (11).

Step 4:

Perform GA crossover and mutation with the probabilities set by Lévy flight.

Step 5:

Update the GA population.

Step 6:

Check the termination criterion. Go to Step 3 or output the optimized GA individual $Chromosom{e}^{*}=\left\{C_j^{*},B^{*},W^{*}\right\}$ for the proposed GA-KF-RBFNN.

3. Application to Self-Evolving Control of Networked Mobile Robots

3.1. Modeling and Lyapunov-Based Control

Figure 6 depicts the geometrical structure of a mobile robot with four Swedish wheels for the proposed networked mobile robot system. Compared to the conventional differential-drive (non-holonomic) mobile robots, this kind of mobile robot with omnidirectional capability has superior mobility. The kinematic model of the four-wheeled Swedish mobile robot is expressed by:

$$\left[\begin{array}{l}{v}_1(t)\\ v_2(t)\\ v_3(t)\\ v_4(t)\end{array}\right]=\left[\begin{array}{l}r{\omega }_1(t)\\ r{\omega }_2(t)\\ r{\omega }_3(t)\\ r{\omega }_4(t)\end{array}\right]=T(\theta (t))\left[\begin{array}{l}\dot{x}(t)\\ \dot{y}(t)\\ \dot{\theta }(t)\end{array}\right],$$

(12)

where:

$$T(\theta (t))=\left[\begin{array}{ccc}\begin{array}{l}-\sin (\delta +\theta )\\ -\cos (\delta +\theta )\\ \sin (\delta +\theta )\\ \cos (\delta +\theta )\end{array}& \begin{array}{l}\cos (\delta +\theta )\\ -\sin (\delta +\theta )\\ -\cos (\delta +\theta )\\ \sin (\delta +\theta )\end{array}& \begin{array}{l}L\\ L\\ L\\ L\end{array}\end{array}\right],$$

$\delta$ is $\pi /4$; r represents the radius of the Swedish wheel; L denotes the distance from the Swedish wheel’s center to the geometric center of the mobile robot; $v_i(t)$ and ${\omega }_i(t),i=1,2,3,4$ respectively denote the linear and angular velocities of each omnidirectional wheel. ${[x(t)y(t)\theta (t)]}^T$ is the pose vector that includes the position and orientation of the mobile robot measured at time t.

In mobile robotic research, robots with over three degrees-of-freedom (DOFs) are classified as redundant robots because they provide redundancy. Note that $T(\theta (t))$ in Equation (12) is singular for any $\theta$ in this redundant mobile robot system. This study adopts the pseudo inverse matrix approach to address the redundant control problem of mobile robots. Considering the left pseudo-inverse matrix $T^{\#}(\theta (t))$ of $T(\theta (t))$ by using $T^{\#}(\theta (t))P(\theta (t))=I$, the matrix $T^{\#}(\theta (t))$ is expressed by:

$$T^{\#}(\theta (t))=\left[\begin{array}{cccc}\begin{array}{l}\frac{-\sin (\delta +\theta )}{2}\\ \frac{\cos (\delta +\theta )}{2}\\ \frac{1}{4L}\end{array}& \begin{array}{l}\frac{-\cos (\delta +\theta )}{2}\\ \frac{-\sin (\delta +\theta )}{2}\\ \frac{1}{4L}\end{array}& \begin{array}{l}\frac{\sin (\delta +\theta )}{2}\\ \frac{-\cos (\delta +\theta )}{2}\\ \frac{1}{4L}\end{array}& \begin{array}{l}\frac{\cos (\delta +\theta )}{2}\\ \frac{\sin (\delta +\theta )}{2}\\ \frac{1}{4L}\end{array}\end{array}\right].$$

(13)

Combining Equations (12) and (13), the kinematics of the four-wheeled omnidirectional mobile robot is derived as follows:

$$\left[\begin{array}{l}\dot{x}(t)\\ \dot{y}(t)\\ \dot{\theta }(t)\end{array}\right]=T^{\#}(\theta (t))\left[\begin{array}{l}{v}_1(t)\\ v_2(t)\\ v_3(t)\\ v_4(t)\end{array}\right].$$

(14)

After the kinematics analysis of the Swedish mobile robots, the next step is to design a motion control law and prove its stability using Lyapunov theory. The current pose of the omnidirectional Swedish mobile robot at time t is defined as $S={\left[\begin{array}{ccc}x(t)& y(t)& \theta (t)\end{array}\right]}^T$, and the desired reference trajectory of the Swedish mobile robot is expressed as $S_r={\left[\begin{array}{ccc}{x}_r(t)& y_r(t)& {\theta }_r(t)\end{array}\right]}^T$. With the two pre-defined vectors, the tracking error of the mobile robot is given by:

$$S_e=\left[\begin{array}{l}{x}_e(t)\\ y_e(t)\\ {\theta }_e(t)\end{array}\right]=\left[\begin{array}{l}x(t)\\ y(t)\\ \theta (t)\end{array}\right]-\left[\begin{array}{l}{x}_r(t)\\ y_r(t)\\ {\theta }_r(t)\end{array}\right]=S-S_r,$$

(15)

which gives:

$${\dot{S}}_e=\left[\begin{array}{l}{\dot{x}}_e(t)\\ {\dot{y}}_e(t)\\ {\dot{\theta }}_e(t)\end{array}\right]=\left[\begin{array}{l}\dot{x}(t)\\ \dot{y}(t)\\ \dot{\theta }(t)\end{array}\right]-\left[\begin{array}{l}{\dot{x}}_r(t)\\ {\dot{y}}_r(t)\\ {\dot{\theta }}_r(t)\end{array}\right]=T^{\#}(\theta (t))\left[\begin{array}{l}r{\omega }_1(t)\\ r{\omega }_2(t)\\ r{\omega }_3(t)\\ r{\omega }_4(t)\end{array}\right]-\left[\begin{array}{l}{\dot{x}}_r(t)\\ {\dot{y}}_r(t)\\ {\dot{\theta }}_r(t)\end{array}\right].$$

(16)

The goal of control law design is to derive the angular velocity vector ${\left[\begin{array}{cccc}{\omega }_1(t)& {\omega }_2(t)& {\omega }_3(t)& {\omega }_4(t)\end{array}\right]}^T$ for tracking the desired differentiable trajectory ${\left[\begin{array}{ccc}{x}_r(t)& y_r(t)& {\theta }_r(t)\end{array}\right]}^T$ with asymptotical stability. Based on the PID (Proportional-Integral-Derivative) control strategy, the following redundant control law is proposed:

$$\left[\begin{array}{l}{v}_1(t)\\ v_2(t)\\ v_3(t)\\ v_4(t)\end{array}\right]=T(\theta (t))\left(-K_P\left[\begin{array}{l}{x}_e(t)\\ y_e(t)\\ {\theta }_e(t)\end{array}\right]-K_I\left[\begin{array}{l}{\displaystyle {\int }_0^t{x}_e(\tau )d\tau }\\ {\displaystyle {\int }_0^t{y}_e(\tau )d\tau }\\ {\displaystyle {\int }_0^t{\theta }_e(\tau )d\tau }\end{array}\right]-K_D\left[\begin{array}{l}{\dot{x}}_e(t)\\ {\dot{y}}_e(t)\\ {\dot{\theta }}_e(t)\end{array}\right]+\left[\begin{array}{l}{\dot{x}}_r(t)\\ {\dot{y}}_r(t)\\ {\dot{\theta }}_r(t)\end{array}\right]\right),$$

(17)

where $K_P,K_I\mathrm{and}{K}_D$ are the control matrices. They are diagonal and positive, thus $K_P=diag[k_{xp}{k}_{yp}{k}_{\theta p}],$ $K_I=diag[k_{xi}{k}_{yi}{k}_{\theta i}],$ and $K_D=diag[k_{xd}{k}_{yd}{k}_{\theta d}]$. By substituting Equations (17) into (16), the closed-loop error system is obtained:

$${\dot{S}}_e=\left[\begin{array}{c}{\dot{x}}_e(t)\\ {\dot{y}}_e(t)\\ {\dot{\theta }}_e(t)\end{array}\right]=\left(-K_P\left[\begin{array}{c}{x}_e(t)\\ y_e(t)\\ {\theta }_e(t)\end{array}\right]-K_I\left[\begin{array}{c}{\displaystyle {\int }_0^t{x}_e(\tau )d\tau }\\ {\displaystyle {\int }_0^t{y}_e(\tau )d\tau }\\ {\displaystyle {\int }_0^t{\theta }_e(\tau )d\tau }\end{array}\right]-K_D\left[\begin{array}{c}{\dot{x}}_e(t)\\ {\dot{y}}_e(t)\\ {\dot{\theta }}_e(t)\end{array}\right]\right).$$

(18)

To prove the asymptotical stability of the closed-loop error system in (18) via Lyapunov theory, the following Lyapunov function is selected:

$$V(t)=\frac{1}{2}\left[\begin{array}{ccc}{x}_e(t)& y_e(t)& {\theta }_e(t)\end{array}\right]\left[\begin{array}{c}{x}_e(t)\\ y_e(t)\\ {\theta }_e(t)\end{array}\right]+\frac{1}{2}\left[\begin{array}{ccc}{\displaystyle {\int }_0^t{x}_e(\tau )d\tau }& {\displaystyle {\int }_0^t{y}_e(\tau )d\tau }& {\displaystyle {\int }_0^t{\theta }_e(\tau )d\tau }\end{array}\right]K_I\left[\begin{array}{c}{\displaystyle {\int }_0^t{x}_e(\tau )d\tau }\\ {\displaystyle {\int }_0^t{y}_e(\tau )d\tau }\\ {\displaystyle {\int }_0^t{\theta }_e(\tau )d\tau }\end{array}\right]+\frac{1}{2}\left[\begin{array}{ccc}{x}_e(t)& y_e(t)& {\theta }_e(t)\end{array}\right]K_D\left[\begin{array}{c}{x}_e(t)\\ y_e(t)\\ {\theta }_e(t)\end{array}\right]>0$$

one obtains:

$$\dot{V}(t)=-\left[\begin{array}{ccc}{x}_e(t)& y_e(t)& {\theta }_e(t)\end{array}\right]K_P\left[\begin{array}{c}{x}_e(t)\\ y_e(t)\\ {\theta }_e(t)\end{array}\right]<0.$$

Since $\dot{V}$ is negative definite, the asymptotical stability is therefore proven. The proposed motion control law can steer the mobile robot to achieve $S\to S_r$ as $t\to \infty$.

3.2. GA-KF-RBFNN Self-Learning Control

Figure 7 depicts the GA-KF-RBFNN self-learning control scheme, in which the noise from the process and measurement phases are included. As shown in Figure 7, the proposed GA-KF-RBFNN is employed to online adjust the parameters $K_P=diag[k_{xp}{k}_{yp}{k}_{\theta p}],$ $K_I=diag[k_{xi}{k}_{yi}{k}_{\theta i}]$, and $K_D=diag[k_{xd}{k}_{yd}{k}_{\theta d}]$ of the mobile robot. It is worthy to mention that the control matrices in Equation (17) are online adjusted at every sampling point to achieve tracking control. This GA-KF-RBFNN evolutionary online tuning method with noise reduction outperforms the traditional off-line and hand-tuning approaches.

In Figure 7, the control law $u(k)={[v_1,v_2,v_3,v_4]}^T$ and the output $y_m(k)$ of the RBFNN are fed into the network for on-line learning. Moreover, the estimated output value $y_m(k)$ of the RBFNN is then employed to update the control matrices $K_P=diag[k_{xp}{k}_{yp}{k}_{\theta p}],$ $K_I=diag[k_{xi}{k}_{yi}{k}_{\theta i}]$, and $K_D=diag[k_{xd}{k}_{yd}{k}_{\theta d}]$ of the four-wheeled omnidirectional mobile robot to achieve the auto-tuning control with a Kalman filter.

3.3. Leader-Follower Formation Control of Networked Mobile Robots

The leader-follower model is the main trend of networked mobile robotics, where a leader robot and several follower robots are included in a multi-robot system [32]. For networked mobile robots, formation control is an important topic that the leader robot tracks the desired trajectory while the follower robots maintain the formation shape. Figure 8 depicts a leader-follower networked mobile robotic system to achieve triangular formation control with three robots.

In this paper, all mobile robots are independently controlled by using Equation (17) to accomplish leader-follower formation control, and the control parameters are self-tuned via the GA-KF-RBFNN paradigm. Compared to traditional consensus multiple robot systems with directed graph topology, the proposed broadcast leader-follower networked mobile robot system circumvents the delay problem. The position and orientation of the robots are broadcasted via the network. To maintain the desired formation shape, the geometrical relationship of the leader robot and follower robots in Figure 7 is calculated. Since the data flow is broadcasted online to every robot, the communication delay issues that occur in the consensus multiple robot system are therefore avoided. The proposed GA-KF-RBFNN self-evolving formation control for networked mobile robots not only reduces the system noises, but also avoids the communication delay.

4. Simulations, Comparative Analysis, and Discussion

This section aims to conduct several simulations to examine the effectiveness of the proposed methods. The proposed networked mobile robot system consists of three four-wheeled Swedish omnidirectional mobile robots, including one leader and two follower mobile robots in a broadcast communication environment. The desired formation shape is triangular as shown in Figure 8. The system parameters in the proposed networked mobile robot system are L = 0.25 m and r = 5.08 cm.

The first simulation is conducted to demonstrate the performance of the circular formation control using the proposed GA-KF-RBFNN control approach. The number of iterations for the modified GA is 150, and the probabilities of crossover and mutation are determined by the Lévy flight. The circular trajectory for the leader robot is expressed as ${\left[\begin{array}{ccc}{x}_r(t)& y_r(t)& {\theta }_r(t)\end{array}\right]}^T={\left[\begin{array}{ccc}1.75\cos ({\omega }_{i}t)\mathrm{m}& 1.75\sin ({\omega }_{i}t)\mathrm{m}& \pi /4\mathrm{rad}\end{array}\right]}^T,$ ${\omega }_i=0.35\mathrm{rad}/\sec$. Figure 9 depicts the simulation result of the circular formation control. The three omnidirectional mobile robots are initially placed at different poses in the workspace. The desired trajectory for leader robot is a circular trajectory and the two follower robots aim to maintain a triangular formation. The tracking error of the leader mobile robot is presented in Figure 10. As shown in Figure 10, the leader mobile robot successfully tracks the desired circular trajectory in 4 s. Figure 11 depicts the formation error of follower robot #1 and Figure 12 depicts the formation error of follower robot #2. These simulation results demonstrate that the proposed GA-KF-RBFNN optimization is capable of accomplishing the self-learning formation control of networked mobile robotic systems.

The second simulation is provided to show the effectiveness of the proposed GA-KF-RBFNN formation control for daisy curve tracking. The desired trajectory of the leader robot is a special daisy curve with three petals, expressed by ${\left[\begin{array}{ccc}{x}_r(t)& y_r(t)& {\theta }_r(t)\end{array}\right]}^T={\left[\begin{array}{ccc}\frac{1}{2}+b\left(a+r^{\prime }\cos (p{\omega }_{i}t)\right)\cos ({\omega }_{i}t)\mathrm{m}& \frac{1}{2}+b\left(a+r^{\prime }\cos (p{\omega }_{i}t)\right)\sin ({\omega }_{i}t)\mathrm{m}& \pi /4\mathrm{rad}\end{array}\right]}^T,$ b = 0.2 m, a = 0.6 m, r′ = 0.42 m, p = 3, and ${\omega }_i=0.35\mathrm{rad}/\sec$. To illustrate the noise reduction capability of the proposed GA-KF-RBFNN self-learning controller, a Gaussian noise is added into the process and measurement phases. Figure 13 presents the simulation result of daisy curve formation control using the proposed GA-KF-RBFNN and Figure 14 depicts the tracking error of the leader robot. Moreover, Figure 15 and Figure 16 present the formation error of follower robot #1 and follower robot #2, respectively, for daisy curve formation control. Both the tracking performance and formation behavior are guaranteed. These simulation results clearly indicate that the proposed metaheuristic GA-KF-RBFNN self-evolving control scheme with noise reduction achieves the formation control task for networked mobile robots. This approach outperforms the traditional consensus control methods where the uncertainty and self-adaptation are not considered.

In order to provide a comparative analysis to illustrate the merits of the proposed methods over other existing approaches,

Table 1. A comparative analysis of the formation controllers for networked robots.

	Evolutionary Strategy	Noise Reduction	Distributed Formation	Leader-Follower Approach	Consensus Delayed Formation	Omnidirectional Capability
[1,2]	No	No	Yes	Yes	Yes	No
[3,4,5,6]	No	No	Yes	Yes	Yes	No
[7,8,9]	No	No	Yes	Yes	Yes	No
[10,11,12,13]	No	No	Yes	Yes	Yes	No
[31,32,33,34]	No	No	Yes	Yes	Yes	No
This Study	Yes	Yes	Yes	Yes	No	Yes

lists the comparison of the proposed GA-KF-RBFNN formation control and traditional controllers. As shown in Table 1, the proposed biologically-inspired GA-KF-RBFNN learning and adaptation for self-evolving of networked mobile robots is superior to the traditional formation control methods. With the modified GA metaheuristics and Kalman filter, both the noise and delay problem are avoided. The proposed GA-KF-RBFNN formation control strategy is applicable to all kinds of mobile robots, including different-drive [36] and three-wheeled mobile robotic systems.

5. Conclusions

This paper has presented a biologically-inspired GA-KF-RBFNN learning and adaptation method for the self-evolving control of networked mobile robots. The Kalman filter algorithm is employed to develop a self-learning RBFNN by considering uncertainty and noises. Moreover, the structure of the proposed KF-RBFNN is optimally initialized by means of the modified GA in which a Lévy flight strategy is applied. With the derived kinematic model of a four-wheeled omnidirectional mobile robot and broadcast leader-follower model, the GA-KF-RBFNN is utilized to design a self-evolving motion control law for a networked mobile robotic system. This approach overcomes the problem of communication delay found in conventional consensus networked robotic systems. Simulation results illustrate the merits of the proposed intelligent networked mobile robot system which uses a GA-KF-RBFNN to achieve self-learning formation control and consider the uncertainty and noise.