Distributed Averaging Problems of Agriculture Picking Multi-Robot Systems via Sampled Control.

Distributed control of agriculture picking multi-robot systems has been widely used in the field of smart agriculture, this paper aims to explore the distributed averaging problems of agriculture picking multi-robot systems under directed communication topologies by taking advantage of the sampled data. With the algebraic graph theory concepts and the matrix theory, a distributed protocol is proposed based on the nearest sampled neighbor information. It is shown that under the proposed protocol, the states of all agents can be guaranteed to reach average consensus whose value is the averaging of the initial states of all agents. Besides, when considering time-delay, the other distributed protocol is constructed, in which a time margin of the time-delay can be determined simultaneously. The necessary and sufficient consensus results can be developed even though the time delay exists. Simulation results are given to demonstrate the effectiveness of our developed consensus results.

1. Introduction

Recently, the issue of smart agriculture has attracted wide attention. Driven by the digital revolution, agriculture has entered a new era of digital and intelligent development (Yang et al., 2013; Alsamhi et al., 2019a; Horng et al., 2019; Fuentes et al., 2021; Li and Chao, 2022; Teng et al., 2022). Smart agriculture is a modern agricultural production mode with information, theoretical knowledge, and hardware equipment as the core elements, and it is an important direction of the development of modern agriculture (Chen and Yang, 2019). Realizing precision agriculture is a goal of smart agriculture (Luo et al., 2016), the present stage of agriculture at a relatively low level of agricultural mechanization, especially in the area of vegetable picking. The traditional way of vegetables is picked manually, which requires a lot of labor during the picking season. Although some plantations have begun to mechanize agricultural picking, the level of automation is low, and vegetable picking is usually carried out by a single mechanical equipment (Brondino et al., 2021), which is inefficient and costly. Therefore, it is urgent to improve the efficiency and mechanization of vegetable picking agriculture.

The emergence of the multi-agent system provides a new trend for the development of smart agriculture. Multi-agent systems are composed of some agents and interactions among agents to solve problems that are impossible for a single agent, which can be applied in many aspects, such as multi-robots (Yu et al., 2020), unmanned aerial vehicles (Lian and Deshmukh, 2006; Alsamhi et al., 2021; Liang et al., 2021), unmanned ground vehicles (Ma et al., 2006), etc. To realize the cooperation between the agents, communication is the fundamental problem, many scholars have carried out a lot of research on communication. In Alsamhi et al. (2019b), the development status of artificial intelligence in the field of the communication among robots is reviewed, and new ideas for its future research directions are provided. In order to better realize the cooperation between robots and ensure effective communication between robots, Alsamhi et al. (2020) fully analyze and discusses robots in different spatial positions through the fusion of machine learning and communication. A sufficient overview is provided for the use of various machine learning techniques in the communication among robots, and it is shown that machine learning plays an important role in improving the communication among robots. In practical application, information communication will be delayed, which may result in the instability of the control system (Seuret et al., 2018). In Zhang et al. (2022), a more general communication mode between delay subsystems and studies of the effect of time delay on the performance of interconnected systems by using the hybrid system theory with memory has been considered. Agriculture picking multi-robot systems consist of multiple robots and interactions among robots, which can be regarded as a kind of multi-agent system. Distributed control of the multi-agent system is also an important issue in the study of multi-agent systems. Cooperative control tasks of multi-agent include clustering, swarming, clustering, formation, tracking, and other tasks. These collective behaviors can all be unified as consensus problems. As the core problem of distributed cooperative control, consensus means that the state values of all agents tend to be the same as time goes to infinity. The average consensus problem is a special consensus problem, which means that the final convergence value of all agents is the average of the initial value (Hu et al., 2020). In smart agriculture, average consensus plays an important role in improving the precision of agriculture. It can better realize the state consensus among agents through the initial state value of each agent, and complete cooperative agricultural tasks among agricultural multi-agents. Particularly, the average consensus of multi-agent systems also has been widely concerned in computer science, energy ecology, social economics, and other fields.

The development of distributed cooperative control has aroused the attention of many researchers in the fields of automatic control. In Olfati-Saber and Murray (2004), the Laplacian potential has been introduced for calculating the difference among agents, with which the distributed control protocol can be induced to ensure the average consensus of multi-agent systems under the undirected graph. The consensus problems have been extended to multi-agent systems whose topologies are switching (Ren and Beard, 2005), in which the consensus objective can be guaranteed if the topologies are joint connected. In the practical application, due to the limitation of speed and bandwidth of network transmission, the problem of time delay certainly exists (Sun and Wang, 2009; Chen et al., 2017; Yan and Huang, 2017). Besides, how to improve the convergence rate should be considered. In Hu et al. (2019), Zou et al. (2019), Dong et al. (2020), and Ran et al. (2020), the distributed control protocols and their convergence analyses have been investigated for finite-time consensus of multi-agent systems.

At present, continuous control protocols are used in most research, so the requirements for network communication are increased. Sampling control can not only reduce the control cost of the system by reducing information transfer redundancy but also improve the robustness of the system (Guan et al., 2012; Ding and Zheng, 2016; Park et al., 2016). Therefore, how to select the appropriate sampling time and sampling mechanism has become a concern of researchers. In Gao et al. (2009), a sampling control protocol is proposed to analyze the consensus of multi-agent systems with fixed and switched topologies, respectively. In Gao and Wang (2011), the consensus of second-order dynamical systems with time-varying topologies is studied by sampling data. The study shows that the system can be consensus by designing appropriate controller gain and the sampling period when the union graph has a spanning tree. To the best of our knowledge, there are quite limited results concerning distributed averaging problems of multi-agent systems, which are suitable for practical applications (e.g., picking multi-robot systems).

Motivated by the above discussions, we aim to reduce information transfer redundancy and control costs of smart agricultural multi-agent systems by sampling control. There are many kinds and complex communication structures in agricultural multi-agent systems. In this article, we explore the distributed averaging problems of the multi-robot systems for vegetable picking agriculture under directed communication topologies. We design a distributed control protocol by taking advantage of the nearest neighbor sampled information for the agriculture picking multi-robot system. With this protocol being used, the necessary and sufficient conditions can be provided for the average consensus objective of the agriculture picking multi-robot system. We further give how to select the sampled period. Besides, in the practical application of multi-agent systems, communication delays may exist. Especially when carrying out agricultural cooperation tasks, information needs to be transmitted between agents. Excessive communication delay will lead to the failure of agricultural multi-agent systems to achieve state consensus and thus fail to complete agricultural tasks. Therefore, we also consider the existence of time-delay among agents. We use the bilinear transformation method to develop the associated convergence analysis, which can simultaneously determine the time margin. It is shown that the agriculture picking multi-robot system can achieve the average consensus if and only if both sampled period and time delay satisfies the appropriate conditions. In addition, simulation examples are carried out to verify the theoretical results. Different from other existing sampling control studies, we carry out an average consensus analysis on picking multi-robot systems with fixed communication topology as a directed graph. The major contributions of this article include:

the average consensus of agricultural multi-agent systems with fixed communication topology as a digraph is studied, and a distributed control protocol based on sampling information is proposed to ensure the average consensus of the agricultural multi-agent system.

considering the communication time-delay, another communication protocol is proposed to ensure that the agricultural multi-agent systems can achieve average consensus even with time-delay.

through the proposed distributed control protocols, the necessary and sufficient conditions for the system to achieve average consensus without time-delay and with time-delay are obtained. Because the average consensus of the system is achieved through the proposed control protocols, the relationship between the initial value and the state value is determined, and the control of the system can be realized more conveniently.

The remainder is outlined below. In Section 2, we introduce some preliminaries for graph and matrix theory. In Section 3, we introduce the problem statement for the distributed averaging of agricultural multi-agent systems for vegetable picking. Section 4 addresses the average consensus of directed the agriculture picking multi-robot system without and with communication time-delay, respectively. Simulation examples are introduced in Section 5. We give comprehensive conclusions in Section 6.

2. Preliminaries for Notations and Graph Theory

In this section, some basic concepts related to notations and graph theory are introduced as follows.

We denote , R is the set of n-dimensional real numbers, R is a set of real matrices with n-dimensional row vectors and n-dimensional column vectors, , and 0 = [0, 0, ⋯ , 0] ∈ R, and diag{α1, α2, ⋯ , α} is a diagonal matrix in which diagonal elements are α1, α2, ⋯ , α, zero are the value of non-diagonal elements.

Let represent a directed digraph, where {v1, v2, ⋯ , v} is a node set, is an edge set and with and . Besides, all neighbors of v are denoted as . An edge means that the data can be transmitted from the node v to the node v. Let stand for a directed way from v to v, where v, v, v, ⋯ , v, v are different. The digraph is called strongly connected on condition that have at least one directed way between any twain different nodes. Let be the in-degree matrix of . The Laplacian matrix L ∈ R of is defined as L = Δ − A. Benefiting from L, we can introduce the following diagonal matrix

where is induced from the Laplacian matrix L by deleting its ith row and ith column, det (L) represents the determinant value of the matrix L. The Laplacian matrix L of a strongly connected digraph has a zero eigenvalue and all other eigenvalues with positive real parts. It follows from Li and Jia (2009) that if is strongly connected, then is the left eigenvector of L associated with the zero eigenvalue, i.e., . With the help of W, we can construct a new graph , where the element of satisfies

By taking advantage of (1), we can easily obtain

With (2), we can establish the relationship between L and .

Lemma 1. For any digraph

proof We can directly derive this result with the help of (2) and the definition of Laplacian matrices

Lemma 2. Consider a partitioned matrix , where A ∈ R, B ∈ R, C ∈ R, and D ∈ R.

If A is an invertible matrix, then |P| = |A||D − CA−1B|;

If D is an invertible matrix, then |P| = |D||A − CD−1B|.

In the analysis of discrete-time systems, by using a bilinear transformation, the problem of determining Schur stability of a discrete-time system can be transformed into the problem of determining Hurwitz stability of a continuous-time system. Given a polynomial with complex coefficients:

where Perform a bilinear transformation on g(s), a new polynomial is deduced

where χ = a + ιb, a, b ∈ R, i = 0, 1,…, n. The Hurwitz stability of f(z) implies the Schur stability of g(s). Substituting z = wι into f(z), we get

where fω(ω), fι(ω) ∈ R(ω), and

fω(ω) and fι(ω) constituent interlaced polynomial, to determine whether f(z) Hurwitz stable, the Hermite-Biehler theorem is given as follows

Lemma 3. (Ogata, (z) is Hurwitz stability if and only if the related pair fω(ω), fι(ω) is interlaced, and .

3. Problem Statements

In the picking process of vegetables, such as cucumbers, a device with multiple mechanical arms is used to pick the vegetables. In the actual picking process, multiple mechanical arms pick vegetables at the same time and then put vegetables into the picking robot which runs on a specific track. To accurately collect vegetables picked by mechanical arms, the corresponding collection robots should achieve position states consensus, to better pick and collect vegetables. To solve the problem, a consensus analysis of the robot's position state is needed. In this article, we treat each robot as an intelligent agent and all agents constitute an agriculture multi-agent system. To analyze the consensus of the agriculture multi-agent system, we use a digraph , , A) of the agricultural multi-agent system to denote the communication topology of the agriculture picking multi-robot system, in which the set of all agents can be described by , and the relationships among agents can be represented by and A. Let be the position state of agent v and denote the state vector. Every agent has the following dynamics

where u is the control protocol to be designed.

Generally, the decision value of the agriculture multi-agent system not only depends on the topological structure but also on the initial states. However, the average-consensus problems only rely on the initial states and have no relation to the topological structure. That is to say, for random initial states x(0), , the average consensus of the system (9) can be reached if

The agricultural multi-agent system (9) can reach average consensus means that we can infer the final position of agents from the initial position, so the control difficulty is reduced, and the controllability of the agriculture multi-agent system (9) is improved.

Since continuous control will increase the communication burden of agricultural multi-agent systems, in order to prevent information redundancy and reduce the cost of systems, we use sampling data to complete the distributed control of the agricultural multi-agent system. The sampling control can improve the robustness of the picking robot system. In what follows, the purpose of this article is to design a distributed control protocol so that the agricultural multi-agent system (9) under the strongly connected digraph accomplishes the average consensus objective via sampled information. Besides, when considering the communication time-delay, we further explore how to develop the time margin of the communication time-delay.

4. Main Results

In this section, we investigate the average consensus problems of the agricultural multi-agent system (9) whose communication topologies are directed. Besides, information needs to be transmitted between agents, and the excessive communication time-delay will cause the oscillation or divergence of agricultural multi-agent systems so that the robots in agriculture cannot achieve position state consensus, which means that the robots cannot accurately load the picked vegetables. Thus, we further explore the average consensus problems of agricultural multi-agent systems when there exist communication time-delays among agents.

4.1. Distributed Control Protocol Without Time-Delay

In this subsection, to reduce the communication cost of smart agricultural multi-agent systems, we aim to solve the average consensus problems of the agriculture multi-agent system by taking advantage of sampled data. Toward this end, we introduce a distributed control protocol by employing the sampled data as follows:

where p is the sampled period. Based on , we can rewrite (9) and (11) as a compact form

where .

In the following, we explore the convergence problems of the system (12). We propose a tree transformation for the system (12). We first introduce a series of states as follows:

Denote

and the inverse matrix of Q is given by

With the help of Q, the states y1(kp), y2(kp), ⋯ , y(kp) are defined by

Substituting y(kp + p) = Qx(kp + p) and y(kp) = Qx(kp) into the system (12) leads to

where We denote and the system (14) can be divided into two subsystems:

and

From (16), we can easily see that the reduced system (16) achieving stability implies the consensus of the system (12). Hence, the consensus problem of (12) turns into the asymptotic stability problem of a reduced-order system (16).

With protocol (11) being employed, the average consensus results can be obtained in the following theorem.

Theorem 1. For the system (9) whose communication topology is the strongly connected digraph , let the distributed control protocol (13) be used. Then, the system (9) can achieve the average consensus objective if and only if the following condition holds.

Proof. The digraph is strongly connected, its Laplacian matrix L has a zero eigenvalue and n − 1 non-zero eigenvalue with positive real parts. It follows from Lemma1 that is a symmetric matrix. The eigenvalues of contain a zero eigenvalue and n − 1 positive real numbers. Based on our defined H, we realize that the eigenvalues of are positive real numbers. To ensure the reduced-order system (16) is stable, the condition . Next, we target at exploring how to ensure by picking up the sampled period p.

We introduce an inverse matrix T such that

where λ2, λ3, ⋯ , λ are the nonzero eigenvalues of and the elements * maybe 0 or 1. Then, employing ỹ(kp + p) = P−1ŷ(kp + p), ỹ(kp) = P−1ŷ(kp), we can convert the reduced-order system (16) into

The stability of the systems (16) and (19) are equivalent. We can further induce

Therefore, ρ(I − pΛ) < 1 holds if and only if p meets the condition (17) holds. Based on the condition (17), the reduced system (16) can reach stability, which denotes that the system (9) is able to achieve the consensus.

Next, we calculate the convergence value of the dynamic system (9). Let w and w denote the right eigenvector and left eigenvector of associated with its eigenvalue 0, respectively, which satisfy . Correspondingly, we can easily obtain that w and w are also the right eigenvector and left eigenvector of associated with the eigenvalue 1. Since the digraph is strongly connected, we can develop that is undirected and connected. Without loss of generality, we select w and w that satisfy . With (9), we can deduce

Because has an eigenvalue 1 and n − 1 eigenvalues whose module is less than 1. Hence, we can develop

which implies the system (9) can achieve the average consensus objective via sampled control. The sampled control can be used to reduce the communication cost of the agricultural multi-agent system (9). We complete this proof.

4.2. Distributed Control Problems With Time-Delay

It is shown that under the proposed protocol without time-delay, the states of all agents can be guaranteed to reach a consensus whose value is the averaging of the initial states of all agents. However, in the practical application of agriculture multi-agent systems, it may suffer from the effect of communication time-delay. Especially in the completion of agricultural cooperative tasks, information needs to be transmitted between agents, and the excessive communication delay will cause the oscillation or divergence of multi-agent systems, so the time-delay problem needs to be considered. When considering the existing time-delay τ which is less than 1 sampling period, the distributed control protocol is constructed by

We rewrite (9) and (21) as follows

where

We can deduce from (22) and (23) that

In the following, we also use the tree transformation for the system (22), the consensus problem of (22) turns into the asymptotic stability problem of a reduced-order system.

Substituting y(kp + p) = Qx(kp + p), y(kp) = Qx(kp), and y(kp − p) = Qx(kp − p) into the system (22) leads to

where

We denote

and the system (25) can be divided into two subsystems:

and

From (27), we can easily see that the reduced system (27) achieving stability implies the consensus of the system (9). With the protocol (21) being employed, the average consensus results can be obtained in the theorem below.

Theorem 2. For the system (9) whose communication topology is the strongly connected digraph , let the distributed control protocol (21) be used. Then, the system (9) can achieve the average consensus objective if and only if the following condition holds.

Proof. Since the digraph is strongly connected, its Laplacian matrix L has a zero eigenvalue and n − 1 non-zero eigenvalue with positive real parts. It follows from Lemma1 that is a symmetric matrix.

We introduce an inverse matrix T such that

where λ2, λ3, ⋯ , λ are the nonzero eigenvalues of and the elements * may be 0 or 1. Then, employing ỹ(kp + p) = T−1ŷ(kp + p), ỹ(kp) = T−1ŷ(kp), and ỹ(kp − p) = T−1ŷ(kp − p) we can convert the reduced-order system (27) into

where

The stability of the systems (27) and (30) are equivalent. The characteristic polynomial of ζ is given by

From (32), we can easily obtain that ξ is a partitioned matrix. It follows from Lemma 2 that

Then, by applying bilinear transformation , we have

We can prove the polynomial g(s) is Schur stable by making sure that the polynomial (34) is Hurwitz stable. Let z = ωι, we can further deduce

The real part and imaginary part of (35) are given by

and

The polynomial (35) is Hurwitz stable if and only if the following conditions hold.

C1) fω(ω) = 0 has two distinct roots γ1 < γ2.

C2) The real root γ3 of fι = 0 satisfies γ1 < γ3 < γ2.

C3) .

The condition C1) can be guaranteed by

Noticing p > 0 and λ(i = 2, 3, …, N). Based on (38), we further induce

If Δ > 0, we can calculate two roots γ1 and γ2 of fω(ω) = 0 as follows:

Based on fι = 0, we can get its root γ3 = 0. The condition C2) is naturally satisfied. It is mainly because that γ1 < 0 and γ2 > 0 hold. Motivated by the condition C3), we can deduce

With (39) and (40), we can develop that the system (35) is Hurwitz stable if and only if p and τ meet (28). Therefore, we can develop that the reduced system (27) achieves asymptotic stability. It denotes that the system (22) can achieve the consensus objective.

Next, we calculate the convergence value of the system (22). One of the eigenvalues of is 0, Correspondingly, we can infer that 1 are the eigenvalues of ϕ and the module value of other eigenvalues is less than 1. Because is undirected and connected, we can pick up the right eigenvector and the left eigenvector of the matrix ϕ corresponding to the eigenvalue 1 as follows:

which satisfy . According to (24), we have

Because ϕ all the other eigenvalues are in the unit circle. Hence, we can develop

which implies that the system (9) can achieve the average consensus even if the sampled instance p and the communication time-delay τ satisfy the condition (28). This proof is complete.

4.3. Analysis and Comparison of Protocols

We compare and analyze the condition of achieving the average consensus of the agricultural multi-agent system without time-delay and with time-delay. The protocols in different cases and the conditions for achieving average consensus in agricultural multi-agent systems are given in Table 1, where λ ≠ 0 and . As shown in Table 1, number 1 is the distributed control protocol in the case of no time-delay, it can be found that the upper limit of the sampling period depends on the eigenvalue of through the control protocol (11) proposed by Theorem 1. For the case with time delay is number 2, by applying control protocol (21) and observation Theorem 2, we can find that the upper limit of time-delay τ depends on the eigenvalue of , and the sampling period is not only related to the eigenvalue of but also related to the value of τ. This means that on the premise that τ meets the value condition, the upper limit of sampling period p can be further calculated, and to obtain the corresponding value range of sampling period p under different time-delay τ values.

Table 1

Comparison of conditions for achieving average consensus in distributed control protocols.

Number	Distributed control protocols	Conditions
1	u_i(t)=∑_j∈N(i)a¯_ij(x_j(kp)-x_i(kp)),t∈[kp,kp+p)	0<p<min2λ_i
2	u_i(t)={∑j∈N(i)a¯_ij(x_j(kp-p)-x_i(kp-p)),t∈[kp,kp+τ)∑j∈N(i)a¯_ij(x_j(kp)-x_i(kp)),t∈[kp+τ,kp+p)	τ<min1λ_i0<p<min2λ_i+2τ

5. Simulations

This section will introduce two simulations to illustrate the correctness of our developed theoretical results. Here, we consider agriculture picking a multi-robot system including six robots in Figure 1, in which robots can pick the vegetables along the track. From Figure 1, we can see that the mechanical arm length of multi-robots needs to satisfy the distance between multi-robots and two plant areas for the purpose of conveniently gathering the vegetables. Hence, we should select a suitable orbital position to meet the distance d. Without loss of generality, we assume that the position state of the orbit is 5 such that the distance between orbit and planting area is d. Motivated by distributed averaging, we can pick up the initial states of six robots as follows:

Figure 1

Agriculture picking multi-robot system.

Example 1. The communication topology of multi-robots can be described in Figure 2. We can easily see from Figure 2 that the digraph is strongly connected and weight unbalanced, in which only the weight 1 is considered. We can get the Laplacian matrix L of . By Lemma 1, the specific values of the matrix are computed, and the eigenvalues of are further obtained. With the help of Theorem 1, then we can compute the upper bound value of p is 0.16198. Hence, the system (12) can reach the consensus objective if and only if p < 0.16198 holds.

Figure 2

Strong connected digraph .

With the distributed control protocol (11) being employed, the state evolution of the system (12) with the sampled period p = 0.1 is plotted in Figure 3 and with the sampled period p = 0.17 in Figure 4. It is obvious from Figures 3, 4 that the system (12) can achieve the average consensus objective with value 5 when the sampled instant is p = 0.1 and the system (12) is divergent when the sampled instant is p = 0.17, which coincide with the results of Theorem 1. Therefore, our designed protocol can ensure the multi-robots reach the arbitrary expected position by selecting the initial states of the robots.

Figure 3

The simulation result with p = 0.1.

Figure 4

The simulation result with p = 0.17.

Example 2. When considering the communication time-delay that is inevitable in communication among agents, we can calculate that the time margin τ satisfies τ = 0.081 and based on (28). The state evolution of the system (22) with τ = 0.06, p = 0.25, τ = 0.04, p = 0.24198, and τ = 0.081, p = 0.3 are plotted in Figures 5–7, respectively. From Figures 5–7, we can see that the system (12) can accomplish the average consensus objective if τ = 0.081 and hold and diverge, otherwise. Hence, the effectiveness of Theorem 2 can be verified.

Figure 5

The simulation result with τ = 0.06, p = 0.25.

Figure 7

The simulation result with τ = 0.081, p = 0.3.

The simulation result with τ = 0.04, p = 0.24198.

6. Conclusion

To prevent information transfer redundancy and reduce the cost of the agricultural multi-agent systems, this article has investigated the distributed averaging problems of directed agriculture picking multi-robot systems with sampling control. We have designed the distributed control protocols with and without time-delay by neighbor information to accomplish the average consensus objective, respectively. It is shown that the necessary and sufficient conditions have been provided for the average consensus, and the robots of the agriculture picking multi-robot system can achieve the purpose of consensus position state by setting the initial value. Two simulation examples have been introduced to demonstrate the effectiveness of our derived results. The distributed control protocols designed by sampling control can achieve the average consensus, which means that the agents of smart agricultural multi-robot systems can achieve state consensus, and the robots of agricultural multi-robot systems can accurately collect vegetables picked by mechanical arms. The protocols we designed also can reduce the information redundancy and control costs of smart agricultural multi-agent systems by sampling control, even agricultural multi-agent systems with time-delay, and provide a feasible method to improve the mechanization level of smart agriculture. At present, the proposed protocols are only applicable to the structure proposed, and only apply to the case where the sampling period is fixed, but we have further studied whether it is still applicable in other environments. In the future, we attempt to change the problem of the fixed sampling period into the study of the variable sampling period, so that the multi-robot systems can achieve average consistency under more working conditions and further promote the smooth completion of cooperative tasks among robots.

Data Availability Statement

The original contributions presented in the study are included in the article/supplementary material, further inquiries can be directed to the corresponding author/s.

Author Contributions

FM: funding acquisition and project administration. HY: writing—original draft. MD: conceptualization, methodology, and writing—reviewing and editing. PJ: supervision. XS: software. All the authors have read and agreed to the published version of the manuscript.

Funding

This study was supported in part by the National Natural Science Foundation of China under Grants 62103210 and 61903207, in part by the Industry-university-research Collaborative Innovation Fund project of Qilu University of Technology (Shandong Academy of Sciences) under Grant 2020-CXY26, and in part by the Key Technology Research and Development Program of Shandong (Major Scientific and Technological Innovation Project) under Grants 2019JZZY010731 and 2020CXGC010901.

Conflict of Interest

The authors declare that the research was conducted in the absence of any commercial or financial relationships that could be construed as a potential conflict of interest.

Publisher's Note

All claims expressed in this article are solely those of the authors and do not necessarily represent those of their affiliated organizations, or those of the publisher, the editors and the reviewers. Any product that may be evaluated in this article, or claim that may be made by its manufacturer, is not guaranteed or endorsed by the publisher.