This paper proposes a distributed second-order consensus time synchronization, which incorporates the second-order consensus algorithm into wireless sensor networks. Since local clocks may have different skews and off...This paper proposes a distributed second-order consensus time synchronization, which incorporates the second-order consensus algorithm into wireless sensor networks. Since local clocks may have different skews and offsets, the algorithm is designed to include offset compensation and skew compensation. The local clocks are not directly modified, thus the virtual clocks are built according to the local clocks via the compensation parameters. Each node achieves a virtual consensus clock by periodically updated compensation parameters. Finally, the effectiveness of the proposed algorithm is verified through a number of simulations in a mesh network. It is proved that the proposed algorithm has the advantage of being distributed, asymptotic convergence, and robust to new node joining.展开更多
Continuous control protocols are extensively utilized in traditional MASs,in which information needs to be transmitted among agents consecutively,therefore resulting in excessive consumption of limited resources.To de...Continuous control protocols are extensively utilized in traditional MASs,in which information needs to be transmitted among agents consecutively,therefore resulting in excessive consumption of limited resources.To decrease the control cost,based on ISC,several LFC problems are investigated for second-order MASs without and with time delay,respectively.Firstly,an intermittent sampled controller is designed,and a sufficient and necessary condition is derived,under which state errors between the leader and all the followers approach zero asymptotically.Considering that time delay is inevitable,a new protocol is proposed to deal with the time-delay situation.The error system’s stability is analyzed using the Schur stability theorem,and sufficient and necessary conditions for LFC are obtained,which are closely associated with the coupling gain,the system parameters,and the network structure.Furthermore,for the case where the current position and velocity information are not available,a distributed protocol is designed that depends only on the sampled position information.The sufficient and necessary conditions for LFC are also given.The results show that second-order MASs can achieve the LFC if and only if the system parameters satisfy the inequalities proposed in the paper.Finally,the correctness of the obtained results is verified by numerical simulations.展开更多
To solve the dynamical consensus problem of second-order multi-agent systems with communication delay,delay-dependent compensations are added into the normal asynchronously-coupled consensus algorithm so as to make th...To solve the dynamical consensus problem of second-order multi-agent systems with communication delay,delay-dependent compensations are added into the normal asynchronously-coupled consensus algorithm so as to make the agents achieve a dynamical consensus. Based on frequency-domain analysis, sufficient conditions are gained for second-order multi-agent systems with communication delay under leaderless and leader-following consensus algorithms respectively. Simulation illustrates the correctness of the results.展开更多
Two second-order consensus algorithms with a time-vary reference state without relative velocity measurements are proposed in a directed topology. Necessary and sufficient conditions are presented to ensure second-ord...Two second-order consensus algorithms with a time-vary reference state without relative velocity measurements are proposed in a directed topology. Necessary and sufficient conditions are presented to ensure second-order consensus. It is shown that all the coupling strengths and the ei- genvalues of the Laplacian matrix play important roles in reaching consensus. Specially when all non- zero eigenvalues of the Laplacian matrix are real, consensus can be achieved if and only if the cou- pling strengths are positive and the directed topology has a spanning tree for the first algorithm, and for the second one, consensus can be achieved if and only if the coupling strengths are positive. Fi- nally, simulation examples are presented to verify the theoretical analysis.展开更多
This paper investigates the cluster consensus problem for second-order multi-agent systems by applying the pinning control method to a small collection of the agents. Consensus is attained independently for different ...This paper investigates the cluster consensus problem for second-order multi-agent systems by applying the pinning control method to a small collection of the agents. Consensus is attained independently for different agent clusters according to the community structure generated by the group partition of the underlying graph and sufficient conditions for both cluster and general consensus are obtained by using results from algebraic graph theory and the LaSalle Invariance Principle. Finally, some simple simulations are presented to illustrate the technique.展开更多
This paper proposes second-order consensus protocols with time-delays and gives the measure of the robustness of the protocols to the time-delay existing in the network of agents with second-order dynamics. By employi...This paper proposes second-order consensus protocols with time-delays and gives the measure of the robustness of the protocols to the time-delay existing in the network of agents with second-order dynamics. By employing a frequency domain method, it is proven that the information states and their time derivatives of all the agents in the network achieve consensus asymptotically, respectively, for appropriate communication timedelay if the topology of weighted network is connected. Particularly, a tight upper bound on the communication time-delay that can be tolerated in the dynamic network is found. The consensus protocols are distributed in the sense that each agent only needs information from its neighboring agents, which reduces the complexity of connections between neighboring agents significantly. Numerical simulation results are provided to demonstrate the effectiveness and the sharpness of the theoretical results for second-order consensus in networks in the presence of communication time-delays.展开更多
This article investigates the consensus problem of the second-order multi-agent systems with an active leader and coupling time delay in direct graph. One decentralized state control rule is constructed for each agent...This article investigates the consensus problem of the second-order multi-agent systems with an active leader and coupling time delay in direct graph. One decentralized state control rule is constructed for each agent to track the active leader and it is proved that the proposed control scheme enables the consensus to be obtained when the adjacency topology is fixed/switched. Simulation results show effectiveness of the proposed theoretical analysis.展开更多
This paper investigates the consensus tracking problems of second-order multi-agent systems with a virtual leader via event-triggered control. A novel distributed event-triggered transmission scheme is proposed, which...This paper investigates the consensus tracking problems of second-order multi-agent systems with a virtual leader via event-triggered control. A novel distributed event-triggered transmission scheme is proposed, which is intermittently examined at constant sampling instants. Only partial neighbor information and local measurements are required for event detection. Then the corresponding event-triggered consensus tracking protocol is presented to guarantee second-order multi-agent systems to achieve consensus tracking. Numerical simulations are given to illustrate the effectiveness of the proposed strategy.展开更多
In this paper, a consensus algorithm of multi-agent second-order dynamical systems with nonsymmetric interconnection and heterogeneous delays is studied. With the hypothesis of directed weighted topology graph with a ...In this paper, a consensus algorithm of multi-agent second-order dynamical systems with nonsymmetric interconnection and heterogeneous delays is studied. With the hypothesis of directed weighted topology graph with a globally reachable node, decentralized consensus condition is obtained by applying generalized Nyquist criterion. For the systems with both communication and input delays, it is shown that the consensus condition is dependent on input delays but independent of communication delays.展开更多
This paper deals with the consensus problem of multi-agent systems with second-order dynamics. The objective is to design algorithms such that all agents will have same positions and velocities. First, a reference mod...This paper deals with the consensus problem of multi-agent systems with second-order dynamics. The objective is to design algorithms such that all agents will have same positions and velocities. First, a reference model based consensus algorithm is proposed. It is proved that the consensus can be achieved if the communication graph has a spanning tree. Different from most of the consensus algorithms proposed in the literature, the parameters of the control laws are different among agents. Therefore, each agent can design its control law independently. Secondly, it gives a consensus algorithm for the case that the velocities of the agents are not available. Thirdly, the effectiveness of the input delay and the communication delay is considered. It shows that consensus can be achieved if the input delay of every agent is smaller than a bound related to parameters in its control law. Finally, some numerical examples are given to illustrate the proposed results.展开更多
This article studies the almost-sure and the mean-square consensus control problems of second-order stochastic discrete-time multi-agent systems with multiplicative noises.First,a control law based on the absolute vel...This article studies the almost-sure and the mean-square consensus control problems of second-order stochastic discrete-time multi-agent systems with multiplicative noises.First,a control law based on the absolute velocity and relative position information is designed.Second,considering the existence of multiplicative noises and nonlinear terms with Lipschitz constants,the consensus control problem is solved through the use of a degenerated Lyapunov function.Then,for the linear second-order multi-agent systems,some explicit consensus conditions are provided.Finally,two sets of numerical simulations are performed.展开更多
This paper studies consensus control problems for a class of second-order multi-agent systems without relative velocity measurement. Some dynamic neighbour-based rules are adopted for the agents in the presence of ext...This paper studies consensus control problems for a class of second-order multi-agent systems without relative velocity measurement. Some dynamic neighbour-based rules are adopted for the agents in the presence of external disturbances. A sufficient condition is derived to make all agents achieve consensus while satisfying desired H∞ performance. Finally, numerical simulations are provided to show the effectiveness of our theoretical results.展开更多
This paper proposes second-order consensus protocols and gives a measure of the robustness of the protocols to the time-delays existing in the dynamics of agents with second-order dynamics. By employing a frequency do...This paper proposes second-order consensus protocols and gives a measure of the robustness of the protocols to the time-delays existing in the dynamics of agents with second-order dynamics. By employing a frequency domain method, it is proven that the information states achieve second-order consensus asymptotically for appropriate time-delay if the topology of the network is connected. Particularly, a nonconservative upper bound on the fixed time-delay that can be tolerated is found. The consensus protocols are distributed in the sense that each agent only needs information from its neighboring agents, which makes the proposed protocols scalable. It reduces the complexity of connections among agents significantly. Simulation results are provided to verify the effectiveness of the theoretical results for second-order consensus in networks in the presence of time-delays existing in the dynamics of agents.展开更多
The bounded consensus tracking problems of second-order multi-agent systems under directed networks with sam- pling delay are addressed in this paper. When the sampling delay is more than a sampling period, new protoc...The bounded consensus tracking problems of second-order multi-agent systems under directed networks with sam- pling delay are addressed in this paper. When the sampling delay is more than a sampling period, new protocols based on sampled-data control are proposed so that each agent can track the time-varying reference state of the virtual leader. By using the delay decomposition approach, the augmented matrix method, and the frequency domain analysis, necessary and sufficient conditions are obtained, which guarantee that the bounded consensus tracking is realized. Furthermore, some numerical simulations are presented to demonstrate the effectiveness of the theoretical results.展开更多
A distributed coordinated consensus problem for multiple networked Euler-Lagrange systems is studied. The communication between agents is subject to time delays, unknown parameters and nonlinear inputs, but only with ...A distributed coordinated consensus problem for multiple networked Euler-Lagrange systems is studied. The communication between agents is subject to time delays, unknown parameters and nonlinear inputs, but only with their states available for measurement. When the communication topology of the system is connected, an adaptive control algorithm with selfdelays and uncertainties is suggested to guarantee global full-state synchro-nization that the difference between the agent＇s positions and ve-locities asymptotically converges to zero. Moreover, the distributed sliding-mode law is given for chaotic systems with nonlinear inputs to compensate for the effects of nonlinearity. Finally, simulation results show the effectiveness of the proposed control algorithm.展开更多
A globally convergent infeasible-interior-point predictor-corrector algorithm is presented for the second-order cone programming （SOCP） by using the Alizadeh- Haeberly-Overton （AHO） search direction. This algorith...A globally convergent infeasible-interior-point predictor-corrector algorithm is presented for the second-order cone programming （SOCP） by using the Alizadeh- Haeberly-Overton （AHO） search direction. This algorithm does not require the feasibility of the initial points and iteration points. Under suitable assumptions, it is shown that the algorithm can find an -approximate solution of an SOCP in at most O（√n ln（ε0/ε）） iterations. The iteration-complexity bound of our algorithm is almost the same as the best known bound of feasible interior point algorithms for the SOCP.展开更多
In this paper, we propose a compound algorithm for the image restoration. The algorithm is a convex combination of the ROF model and the LLT model with a parameter function 0. The numerical experiments demonstrate tha...In this paper, we propose a compound algorithm for the image restoration. The algorithm is a convex combination of the ROF model and the LLT model with a parameter function 0. The numerical experiments demonstrate that our compound algorithm is efficient and preserves the main advantages of the two models. In particular, the errors of the compound algorithm in L2 norm between the exact images and corresponding restored images are the smallest among the three models. For images with strong noises, the restored images of the compound algorithm are the best in the corresponding restored images. The proposed algorithm combines the fixed point method, an improved AMG method and the Krylov acceleration. It is found that the combination of these methods is efficient and robust in the image restoration.展开更多
As one of the underlying technologies of the blockchain,the consensus algorithm plays a vital role in ensuring security and efficiency.As a consensus algorithm for the private blockchain,Raft has better performance th...As one of the underlying technologies of the blockchain,the consensus algorithm plays a vital role in ensuring security and efficiency.As a consensus algorithm for the private blockchain,Raft has better performance than the rest of the consensus algorithms,and it does not cause problems such as the concentrated hashing power,resource waste and fork.However,Raft can only be used in a non-byzantine environment with a small network size.In order to enable Raft to be used in a large-scale network with a certain number of byzantine nodes,this paper combines Raft and credit model to propose a Raft blockchain consensus algorithm based on credit model CRaft.In the node credit evaluation phase,RBF-based support vector machine is used as the anomaly detection method,and the node credit evaluation model is constructed.Then the Trust Nodes List(TNL)mechanism is introduced to make the consensus phase in a creditable network environment.Finally,the common node is synchronized to the consensus node to update the blockchain of the entire network.Experiments show that CRaft has better throughput and lower latency than the commonly used consortium blockchain consensus algorithm PBFT(Practical Byzantine Fault Tolerance).展开更多
The advent of blockchain technology has transformed traditional methods of information exchange,shifting reliance from centralized data centers to decentralized frameworks.While blockchain’s decentralization and secu...The advent of blockchain technology has transformed traditional methods of information exchange,shifting reliance from centralized data centers to decentralized frameworks.While blockchain’s decentralization and security are strengths,traditional consensus mechanisms like Proof of Work(PoW)and Proof of Stake(PoS)face limitations in scalability.PoW achieves decentralization and security but struggles with scalability as transaction volumes grow,while PoS enhances scalability,but risks centralization due to monopolization by high-stake participants.Sharding,a recent advancement in blockchain technology,addresses scalability by partitioning the network into shards that process transactions independently,thereby improving throughput and reducing latency.However,cross-shard communication,essential for transactions involving multiple shards,introduces challenges in coordination and fault tolerance.This research introduces a shard-based hybrid consensus model,PoSW,which combines PoW and PoS to mitigate the limitations of both mechanisms.By integrating PoW’s fairness with PoS’s scalability in a shard-based blockchain,the proposed model addresses key issues of scalability and monopolization.We evaluate the model against state-of-the-art consensus algorithms,including Monoxide and Practical Byzantine Fault Tolerance(PBFT).The results show that the proposed PoSW model reduces communication overhead compared to PBFT and improves resource utilization over Monoxide.In addition to performance gains,the security analysis demonstrates that the PoSW model provides robust defense against common blockchain attacks such as the 51%and Sybil attacks,etc.The proposed approach is particularly suited for applications like decentralized finance(DeFi)and supply chain management,which require both high scalability and robust security.The contributions of this research include the development of the PoSW hybrid consensus mechanism,its comparative evaluation with leading algorithms,and a thorough security analysis.These contributions represent a significant step forward in addressing blockchain’s scalability,fairness,and security challenges.展开更多
Blockchain is a distributed public ledger that keeps track of all transactions that have ever taken place in the system. As a distributed ledger, a consensus mechanism is required to ensure all the transaction functio...Blockchain is a distributed public ledger that keeps track of all transactions that have ever taken place in the system. As a distributed ledger, a consensus mechanism is required to ensure all the transaction functions properly. In order to reach a consensus, it is critical to emphasize the importance of performance and efficiency. The use of the right consensus algorithm will significantly improve the efficiency of a blockchain application. This paper reviewed several types of consensus algorithms used in blockchain and discusses the idea of a new consensus algorithm that can improve the performance of consortium blockchain.展开更多
基金Supported by the National Natural Science Foundation of China(No.61340034)the Research Program of Application Foundation and Advanced Technology of Tianjin(No.13JCYBJC15600)
文摘This paper proposes a distributed second-order consensus time synchronization, which incorporates the second-order consensus algorithm into wireless sensor networks. Since local clocks may have different skews and offsets, the algorithm is designed to include offset compensation and skew compensation. The local clocks are not directly modified, thus the virtual clocks are built according to the local clocks via the compensation parameters. Each node achieves a virtual consensus clock by periodically updated compensation parameters. Finally, the effectiveness of the proposed algorithm is verified through a number of simulations in a mesh network. It is proved that the proposed algorithm has the advantage of being distributed, asymptotic convergence, and robust to new node joining.
基金supported by the National Natural Science Foundation of China under Grants 62476138 and 42375016.
文摘Continuous control protocols are extensively utilized in traditional MASs,in which information needs to be transmitted among agents consecutively,therefore resulting in excessive consumption of limited resources.To decrease the control cost,based on ISC,several LFC problems are investigated for second-order MASs without and with time delay,respectively.Firstly,an intermittent sampled controller is designed,and a sufficient and necessary condition is derived,under which state errors between the leader and all the followers approach zero asymptotically.Considering that time delay is inevitable,a new protocol is proposed to deal with the time-delay situation.The error system’s stability is analyzed using the Schur stability theorem,and sufficient and necessary conditions for LFC are obtained,which are closely associated with the coupling gain,the system parameters,and the network structure.Furthermore,for the case where the current position and velocity information are not available,a distributed protocol is designed that depends only on the sampled position information.The sufficient and necessary conditions for LFC are also given.The results show that second-order MASs can achieve the LFC if and only if the system parameters satisfy the inequalities proposed in the paper.Finally,the correctness of the obtained results is verified by numerical simulations.
基金Supported by the National Natural Science Foundation of China under Grant Nos.61104092,61134007,and61203147the Priority Academic Program Development of Jiangsu Higher Education Institutions
文摘To solve the dynamical consensus problem of second-order multi-agent systems with communication delay,delay-dependent compensations are added into the normal asynchronously-coupled consensus algorithm so as to make the agents achieve a dynamical consensus. Based on frequency-domain analysis, sufficient conditions are gained for second-order multi-agent systems with communication delay under leaderless and leader-following consensus algorithms respectively. Simulation illustrates the correctness of the results.
基金Supported by the National Natural Science Foundation of China(61074031)
文摘Two second-order consensus algorithms with a time-vary reference state without relative velocity measurements are proposed in a directed topology. Necessary and sufficient conditions are presented to ensure second-order consensus. It is shown that all the coupling strengths and the ei- genvalues of the Laplacian matrix play important roles in reaching consensus. Specially when all non- zero eigenvalues of the Laplacian matrix are real, consensus can be achieved if and only if the cou- pling strengths are positive and the directed topology has a spanning tree for the first algorithm, and for the second one, consensus can be achieved if and only if the coupling strengths are positive. Fi- nally, simulation examples are presented to verify the theoretical analysis.
基金Project supported by the National Natural Science Foundation of China (Grant No. 70571059)
文摘This paper investigates the cluster consensus problem for second-order multi-agent systems by applying the pinning control method to a small collection of the agents. Consensus is attained independently for different agent clusters according to the community structure generated by the group partition of the underlying graph and sufficient conditions for both cluster and general consensus are obtained by using results from algebraic graph theory and the LaSalle Invariance Principle. Finally, some simple simulations are presented to illustrate the technique.
基金supported by the National Natural Science Foundation of China (6057408860274014)
文摘This paper proposes second-order consensus protocols with time-delays and gives the measure of the robustness of the protocols to the time-delay existing in the network of agents with second-order dynamics. By employing a frequency domain method, it is proven that the information states and their time derivatives of all the agents in the network achieve consensus asymptotically, respectively, for appropriate communication timedelay if the topology of weighted network is connected. Particularly, a tight upper bound on the communication time-delay that can be tolerated in the dynamic network is found. The consensus protocols are distributed in the sense that each agent only needs information from its neighboring agents, which reduces the complexity of connections between neighboring agents significantly. Numerical simulation results are provided to demonstrate the effectiveness and the sharpness of the theoretical results for second-order consensus in networks in the presence of communication time-delays.
基金supported by the National Natural Science Foundation of China(11301492)the Ph.D.Programs Foundation of Ministry of Education of China(20130145120005)the TianYuan Special Funds of the National Natural Science Foundation of China(11226134)
文摘This article investigates the consensus problem of the second-order multi-agent systems with an active leader and coupling time delay in direct graph. One decentralized state control rule is constructed for each agent to track the active leader and it is proved that the proposed control scheme enables the consensus to be obtained when the adjacency topology is fixed/switched. Simulation results show effectiveness of the proposed theoretical analysis.
基金Project supported by the National Natural Science Foundation of China(Grant Nos.61203147,61374047,and 61403168)
文摘This paper investigates the consensus tracking problems of second-order multi-agent systems with a virtual leader via event-triggered control. A novel distributed event-triggered transmission scheme is proposed, which is intermittently examined at constant sampling instants. Only partial neighbor information and local measurements are required for event detection. Then the corresponding event-triggered consensus tracking protocol is presented to guarantee second-order multi-agent systems to achieve consensus tracking. Numerical simulations are given to illustrate the effectiveness of the proposed strategy.
基金supported by National Natural Science Foundation of China (No. 60774016, No. 60875039, No. 60904022)the Science Foundation of Education Office of Shandong Province of China (No. J08LJ01)Internal Visiting Scholar Object for Excellence Youth Teacher of the College of Shandong Province of China
文摘In this paper, a consensus algorithm of multi-agent second-order dynamical systems with nonsymmetric interconnection and heterogeneous delays is studied. With the hypothesis of directed weighted topology graph with a globally reachable node, decentralized consensus condition is obtained by applying generalized Nyquist criterion. For the systems with both communication and input delays, it is shown that the consensus condition is dependent on input delays but independent of communication delays.
基金supported by the National Natural Science Foundation of China (Grant No. 60904022)
文摘This paper deals with the consensus problem of multi-agent systems with second-order dynamics. The objective is to design algorithms such that all agents will have same positions and velocities. First, a reference model based consensus algorithm is proposed. It is proved that the consensus can be achieved if the communication graph has a spanning tree. Different from most of the consensus algorithms proposed in the literature, the parameters of the control laws are different among agents. Therefore, each agent can design its control law independently. Secondly, it gives a consensus algorithm for the case that the velocities of the agents are not available. Thirdly, the effectiveness of the input delay and the communication delay is considered. It shows that consensus can be achieved if the input delay of every agent is smaller than a bound related to parameters in its control law. Finally, some numerical examples are given to illustrate the proposed results.
基金supported by the National Natural Science Foundation of China(No.62073305)the Hubei Provincial Natural Science Foundation(No.2022CFA041)the 2022 Innovation and Entrepreneurship Plan for College Students of China University of Geosciences,Wuhan,China(No.S202210491203).
文摘This article studies the almost-sure and the mean-square consensus control problems of second-order stochastic discrete-time multi-agent systems with multiplicative noises.First,a control law based on the absolute velocity and relative position information is designed.Second,considering the existence of multiplicative noises and nonlinear terms with Lipschitz constants,the consensus control problem is solved through the use of a degenerated Lyapunov function.Then,for the linear second-order multi-agent systems,some explicit consensus conditions are provided.Finally,two sets of numerical simulations are performed.
基金supported by the National High Technology Research and Development Program of China (Grant Nos. 2007AA041104,2007AA041105 and 2007AA04Z163)
文摘This paper studies consensus control problems for a class of second-order multi-agent systems without relative velocity measurement. Some dynamic neighbour-based rules are adopted for the agents in the presence of external disturbances. A sufficient condition is derived to make all agents achieve consensus while satisfying desired H∞ performance. Finally, numerical simulations are provided to show the effectiveness of our theoretical results.
基金Supported by the National Natural Science Foundation of China (60574088, 60274014)
文摘This paper proposes second-order consensus protocols and gives a measure of the robustness of the protocols to the time-delays existing in the dynamics of agents with second-order dynamics. By employing a frequency domain method, it is proven that the information states achieve second-order consensus asymptotically for appropriate time-delay if the topology of the network is connected. Particularly, a nonconservative upper bound on the fixed time-delay that can be tolerated is found. The consensus protocols are distributed in the sense that each agent only needs information from its neighboring agents, which makes the proposed protocols scalable. It reduces the complexity of connections among agents significantly. Simulation results are provided to verify the effectiveness of the theoretical results for second-order consensus in networks in the presence of time-delays existing in the dynamics of agents.
基金Project supported by the National Natural Science Foundation of China(Grant Nos.60874053 and 61034006)
文摘The bounded consensus tracking problems of second-order multi-agent systems under directed networks with sam- pling delay are addressed in this paper. When the sampling delay is more than a sampling period, new protocols based on sampled-data control are proposed so that each agent can track the time-varying reference state of the virtual leader. By using the delay decomposition approach, the augmented matrix method, and the frequency domain analysis, necessary and sufficient conditions are obtained, which guarantee that the bounded consensus tracking is realized. Furthermore, some numerical simulations are presented to demonstrate the effectiveness of the theoretical results.
基金supported by the National Natural Sciences Foundation of China (60974146)
文摘A distributed coordinated consensus problem for multiple networked Euler-Lagrange systems is studied. The communication between agents is subject to time delays, unknown parameters and nonlinear inputs, but only with their states available for measurement. When the communication topology of the system is connected, an adaptive control algorithm with selfdelays and uncertainties is suggested to guarantee global full-state synchro-nization that the difference between the agent＇s positions and ve-locities asymptotically converges to zero. Moreover, the distributed sliding-mode law is given for chaotic systems with nonlinear inputs to compensate for the effects of nonlinearity. Finally, simulation results show the effectiveness of the proposed control algorithm.
基金the National Science Foundation(60574075, 60674108)
文摘A globally convergent infeasible-interior-point predictor-corrector algorithm is presented for the second-order cone programming （SOCP） by using the Alizadeh- Haeberly-Overton （AHO） search direction. This algorithm does not require the feasibility of the initial points and iteration points. Under suitable assumptions, it is shown that the algorithm can find an -approximate solution of an SOCP in at most O（√n ln（ε0/ε）） iterations. The iteration-complexity bound of our algorithm is almost the same as the best known bound of feasible interior point algorithms for the SOCP.
基金suppprt from NSFC of China,Singapore NTU project SUG 20/07,MOE Grant T207B2202NRF2007IDMIDM002-010
文摘In this paper, we propose a compound algorithm for the image restoration. The algorithm is a convex combination of the ROF model and the LLT model with a parameter function 0. The numerical experiments demonstrate that our compound algorithm is efficient and preserves the main advantages of the two models. In particular, the errors of the compound algorithm in L2 norm between the exact images and corresponding restored images are the smallest among the three models. For images with strong noises, the restored images of the compound algorithm are the best in the corresponding restored images. The proposed algorithm combines the fixed point method, an improved AMG method and the Krylov acceleration. It is found that the combination of these methods is efficient and robust in the image restoration.
基金Supported by the National Natural Science Foundation of China(61672297)。
文摘As one of the underlying technologies of the blockchain,the consensus algorithm plays a vital role in ensuring security and efficiency.As a consensus algorithm for the private blockchain,Raft has better performance than the rest of the consensus algorithms,and it does not cause problems such as the concentrated hashing power,resource waste and fork.However,Raft can only be used in a non-byzantine environment with a small network size.In order to enable Raft to be used in a large-scale network with a certain number of byzantine nodes,this paper combines Raft and credit model to propose a Raft blockchain consensus algorithm based on credit model CRaft.In the node credit evaluation phase,RBF-based support vector machine is used as the anomaly detection method,and the node credit evaluation model is constructed.Then the Trust Nodes List(TNL)mechanism is introduced to make the consensus phase in a creditable network environment.Finally,the common node is synchronized to the consensus node to update the blockchain of the entire network.Experiments show that CRaft has better throughput and lower latency than the commonly used consortium blockchain consensus algorithm PBFT(Practical Byzantine Fault Tolerance).
文摘The advent of blockchain technology has transformed traditional methods of information exchange,shifting reliance from centralized data centers to decentralized frameworks.While blockchain’s decentralization and security are strengths,traditional consensus mechanisms like Proof of Work(PoW)and Proof of Stake(PoS)face limitations in scalability.PoW achieves decentralization and security but struggles with scalability as transaction volumes grow,while PoS enhances scalability,but risks centralization due to monopolization by high-stake participants.Sharding,a recent advancement in blockchain technology,addresses scalability by partitioning the network into shards that process transactions independently,thereby improving throughput and reducing latency.However,cross-shard communication,essential for transactions involving multiple shards,introduces challenges in coordination and fault tolerance.This research introduces a shard-based hybrid consensus model,PoSW,which combines PoW and PoS to mitigate the limitations of both mechanisms.By integrating PoW’s fairness with PoS’s scalability in a shard-based blockchain,the proposed model addresses key issues of scalability and monopolization.We evaluate the model against state-of-the-art consensus algorithms,including Monoxide and Practical Byzantine Fault Tolerance(PBFT).The results show that the proposed PoSW model reduces communication overhead compared to PBFT and improves resource utilization over Monoxide.In addition to performance gains,the security analysis demonstrates that the PoSW model provides robust defense against common blockchain attacks such as the 51%and Sybil attacks,etc.The proposed approach is particularly suited for applications like decentralized finance(DeFi)and supply chain management,which require both high scalability and robust security.The contributions of this research include the development of the PoSW hybrid consensus mechanism,its comparative evaluation with leading algorithms,and a thorough security analysis.These contributions represent a significant step forward in addressing blockchain’s scalability,fairness,and security challenges.
文摘Blockchain is a distributed public ledger that keeps track of all transactions that have ever taken place in the system. As a distributed ledger, a consensus mechanism is required to ensure all the transaction functions properly. In order to reach a consensus, it is critical to emphasize the importance of performance and efficiency. The use of the right consensus algorithm will significantly improve the efficiency of a blockchain application. This paper reviewed several types of consensus algorithms used in blockchain and discusses the idea of a new consensus algorithm that can improve the performance of consortium blockchain.
