Topology Optimization for Harmonic Excitation Structures with Minimum Length Scale Control Using the Discrete Variable Method

Continuumtopology optimization considering the vibration response is of great value in the engineering structure design.The aimof this studyis toaddress the topological designoptimizationof harmonic excitationstructureswith minimumlength scale control to facilitate structuralmanufacturing.Astructural topology design based on discrete variables is proposed to avoid localized vibration modes,gray regions and fuzzy boundaries in harmonic excitation topology optimization.The topological design model and sensitivity formulation are derived.The requirement of minimum size control is transformed into a geometric constraint using the discrete variables.Consequently,thin bars,small holes,and sharp corners,which are not conducive to the manufacturing process,can be eliminated from the design results.The present optimization design can efficiently achieve a 0–1 topology configuration with a significantly improved resonance frequency in a wide range of excitation frequencies.Additionally,the optimal solution for harmonic excitation topology optimization is not necessarily symmetric when the load and support are symmetric,which is a distinct difference fromthe static optimization design.Hence,one-half of the design domain cannot be selected according to the load and support symmetry.Numerical examples are presented to demonstrate the effectiveness of the discrete variable design for excitation frequency topology optimization,and to improve the design manufacturability.

Lyapunov-Based Output Containment Control of Heterogeneous Multi-Agent Systems With Markovian Switching Topologies and Distributed Delays

This paper considers the mean square output containment control problem for heterogeneous multi-agent systems(MASs)with randomly switching topologies and nonuniform distributed delays.By modeling the switching topologies as a continuous-time Markov process and taking the distributed delays into consideration,a novel distributed containment observer is proposed to estimate the convex hull spanned by the leaders'states.A novel distributed output feedback containment controller is then designed without using the prior knowledge of distributed delays.By constructing a novel switching Lyapunov functional,the output containment control problem is then solved in the sense of mean square under an easily-verifiable sufficient condition.Finally,two numerical examples are given to show the effectiveness of the proposed controller.

Consensus tracking protocol and formation control of multi-agent systems with switching topology

Consensus tracking control problems for single-integrator dynamics of multi-agent systems with switching topology are investigated.In order to design effective consensus tracking protocols for a more general class of networks,which are aimed at ensuring that the concerned states of agents converge to a constant or time-varying reference state,new consensus tracking protocols with a constant and time-varying reference state are proposed,respectively.Particularly,by contrast with spanning tree,an improved condition of switching interaction topology is presented.And then,convergence analysis of two consensus tracking protocols is provided by Lyapunov stability theory.Moreover,consensus tracking protocol with a time-varying reference state is extended to achieve the formation control.By introducing formation structure set,each agent can gain its individual desired trajectory.Finally,several simulations are worked out to illustrate the effectiveness of theoretical results.The test results show that the states of agents can converge to a desired constant or time-varying reference state.In addition,by selecting appropriate structure set,agents can maintain the expected formation under random switching interaction topologies.

Consensus of high-order dynamic multi-agent systems with switching topology and time-varying delays

This paper studies the consensus problems for a group of agents with switching topology and time-varying communication delays, where the dynamics of agents is modeled as a high-order integrator. A linear distributed consensus protocol is proposed, which only depends on the agent＇s own information and its neighbors＇ partial information. By introducing a decomposition of the state vector and performing a state space transformation, the closed-loop dynamics of the multi-agent system is converted into two decoupled subsystems. Based on the decoupled subsystems, some sufficient conditions for the convergence to consensus are established, which provide the upper bounds on the admissible communication delays. Also, the explicit expression of the consensus state is derived. Moreover, the results on the consensus seeking of the group of high-order agents have been extended to a network of agents with dynamics modeled as a completely controllable linear time-invariant system. It is proved that the convergence to consensus of this network is equivalent to that of the group of high-order agents. Finally, some numerical examples are given to demonstrate the effectiveness of the main results.

Consensus Control of Leader-Following Multi-Agent Systems in Directed Topology With Heterogeneous Disturbances

This paper investigates the consensus problem for linear multi-agent systems with the heterogeneous disturbances generated by the Brown motion.Its main contribution is that a control scheme is designed to achieve the dynamic consensus for the multi-agent systems in directed topology interfered by stochastic noise.In traditional ways,the coupling weights depending on the communication structure are static.A new distributed controller is designed based on Riccati inequalities,while updating the coupling weights associated with the gain matrix by state errors between adjacent agents.By introducing time-varying coupling weights into this novel control law,the state errors between leader and followers asymptotically converge to the minimum value utilizing the local interaction.Through the Lyapunov directed method and It?formula,the stability of the closed-loop system with the proposed control law is analyzed.Two simulation results conducted by the new and traditional schemes are presented to demonstrate the effectiveness and advantage of the developed control method.

A Clustering-tree Topology Control Based on the Energy Forecast for Heterogeneous Wireless Sensor Networks

How to design an energy-efficient algorithm to maximize the network lifetime in complicated scenarios is a critical problem for heterogeneous wireless sensor networks(HWSN).In this paper, a clustering-tree topology control algorithm based on the energy forecast(CTEF) is proposed for saving energy and ensuring network load balancing, while considering the link quality, packet loss rate, etc. In CTEF, the average energy of the network is accurately predicted per round(the lifetime of the network is denoted by rounds) in terms of the difference between the ideal and actual average residual energy using central limit theorem and normal distribution mechanism, simultaneously. On this basis, cluster heads are selected by cost function(including the energy, link quality and packet loss rate) and their distance.The non-cluster heads are determined to join the cluster through the energy, distance and link quality. Furthermore, several noncluster heads in each cluster are chosen as the relay nodes for transmitting data through multi-hop communication to decrease the load of each cluster-head and prolong the lifetime of the network. The simulation results show the efficiency of CTEF. Compared with low-energy adaptive clustering hierarchy(LEACH), energy dissipation forecast and clustering management(EDFCM) and efficient and dynamic clustering scheme(EDCS)protocols, CTEF has longer network lifetime and receives more data packets at base station.

Model-based adaptive locomotion and clustering control of microparticles through ultrasonic topological charge modulation

We present a novel motion control technique for microrobot clusters to exploit the characteristics of the ultrasonic field.The method comprises two steps,i.e.,introducing an ultrasonic actuation(UA)linear model for three-dimensional(3D)locomotion and controlling the topological charge(TC)in the ultrasonic vortex for microrobot clustering.Here,the TC is a controllable parameter for the expansion and contraction of the pressure null space inside the vortex.We present a TC control method to cluster sporadically distributed microrobots in a specific workspace.To validate the concept,a UA system composed of 30 ultrasonic transducers with 1 MHz frequency is fabricated,and the characteristics of the generated acoustic pressure field are analyzed through simulations.Subsequently,the performances of the adaptive controller for precise 3D locomotion and the TC control method for clustering are evaluated.Finally,the UA technology,which performs both clustering and locomotion in a complex manner,is validated with a gelatin phantom in an in-vitro environment.

Distributed Fault-Tolerant Containment Control for Nonlinear Multi-Agent Systems Under Directed Network Topology via Hierarchical Approach

This paper investigates the distributed fault-tolerant containment control(FTCC)problem of nonlinear multi-agent systems(MASs)under a directed network topology.The proposed control framework which is independent on the global information about the communication topology consists of two layers.Different from most existing distributed fault-tolerant control(FTC)protocols where the fault in one agent may propagate over network,the developed control method can eliminate the phenomenon of fault propagation.Based on the hierarchical control strategy,the FTCC problem with a directed graph can be simplified to the distributed containment control of the upper layer and the fault-tolerant tracking control of the lower layer.Finally,simulation results are given to demonstrate the effectiveness of the proposed control protocol.

Clustering Network Topology Control Method Based on Responsibility Transmission

The topology control is an effective approach which can improve the quality of wireless sensor network at all sides. Through studying the mechanism of sensor network data transmission, the nature of data transmission in wireless sensor network is concluded as a kind of responsibility transmission. By redefining the responsibility and availability of nodes, the strategy for cluster head selection is studied, the responsibility and availability is determined by the combination of the residual energy, location and current flow of nodes. Based on the above, new clustering network topology control algorithm based on responsibility transmission CNTCABRT and hierarchical multi-hop CNTCABRT is presented in this paper, whose algorithm structure is along the famous LEACH algorithm. Experimental result demonstrates its promising performance over the famous LEACH algorithm in the cluster head selection, the size of cluster, the deployment of nodes and the lifetime of nodes, and several innovative conclusions are proposed finally.

A Minimum-energy Path-preserving Topology Control Algorithm for Wireless Sensor Networks

The topology control strategies of wireless sensor networks are very important for reducing the energy consumption of sensor nodes and prolonging the life-span of networks. In this paper, we put forward a minimum-energy path-preserving topology control （MPTC） algorithm based on a concept of none k-redundant edges. MPTC not only resolves the problem of excessive energy consumption because of the unclosed region in small minimum-energy communication network （SMECN）, but also preserves at least one minimum-energy path between every pair of nodes in a wireless sensor network. We also propose an energy-efficient reconfiguration protocol that maintains the minimum-energy path property in the case where the network topology changes dynamically. Finally, we demonstrate the performance improvements of our algorithm through simulation.

MST-BASED CLUSTERING TOPOLOGY CONTROL ALGORITHM FOR WIRELESS SENSOR NETWORKS

In this paper, we propose a novel clustering topology control algorithm named Minimum Spanning Tree (MST)-based Clustering Topology Control (MCTC) for Wireless Sensor Networks (WSNs), which uses a hybrid approach to adjust sensor nodes' transmission power in two-tiered hi- erarchical WSNs. MCTC algorithm employs a one-hop Maximum Energy & Minimum Distance (MEMD) clustering algorithm to decide clustering status. Each cluster exchanges information between its own Cluster Members (CMs) locally and then deliveries information to the Cluster Head (CH). Moreover, CHs exchange information between CH and CH and afterwards transmits aggregated in- formation to the base station finally. The intra-cluster topology control scheme uses MST to decide CMs' transmission radius, similarly, the inter-cluster topology control scheme applies MST to decide CHs' transmission radius. Since the intra-cluster topology control is a full distributed approach and the inter-cluster topology control is a pure centralized approach performed by the base station, therefore, MCTC algorithm belongs to one kind of hybrid clustering topology control algorithms and can obtain scalability topology and strong connectivity guarantees simultaneously. As a result, the network topology will be reduced by MCTC algorithm so that network energy efficiency will be improved. The simulation results verify that MCTC outperforms traditional topology control schemes such as LMST, DRNG and MEMD at the aspects of average node's degree, average node's power radius and network lifetime, respectively.

An Energy Efficient Color Based Topology Control Algorithm for Wireless Sensor Networks

Wireless Sensor Networks (WSNs) are universally being used and deployed to monitor the surrounding physical environments and detail events of interest. In wireless Sensor Networks energy is one of the primary issues and requires energy conservation of the sensor nodes, so that network lifetime can be maximized. To minimize the energy loss in dense WSNs a Color Based Topology Control (CBTC) algorithm is introduced and implemented in Visual Studio 6.0. The results are compared with Traditional dense WSNs. In the evaluation process it was observed that the numbers of CPU ticks required in traditional WSNs are much more than that’s of CBTC Algorithm, both in Normal and Random deployments. So by using CBTC, delay in network can be minimized. Using CBTC algorithm, the energy conservation and removal of coverage holes was also achieved in the present study.

Topology Control and Routing in Large Scale Wireless Sensor Networks

In this paper, a two-tiered Wireless Sensor Network (WSN) where nodes are divided into clusters and nodes forward data to base stations through cluster heads is considered. To maximize the network lifetime, two energy efficient approaches are investigated. We first propose an approach that optimally locates the base stations within the network so that the distance between each cluster head and its closest base station is decreased. Then, a routing technique is developed to arrange the communication between cluster heads toward the base stations in order to guaranty that the gathered information effectively and efficiently reach the application. The overall dynamic framework that combines the above two schemes is described and evaluated. The experimental performance evaluation demonstrates the efficacy of topology control as a vital process to maximize the network lifetime of WSNs.

A Controller-Based Architecture for Information Centric Network Construction and Topology management

Information-Centric Networking(ICN) has recently emerged as a result of the increased demand to access contents regardless of their location in the network services. This new approach facilitates content distribution as a service of the network with lower delay and higher security in comparison with the current IP network. Applying ICN in current IP infrastructure leads to major complexities. One approach to deploy ICN with less complexity is to integrate ICN with Software Defined Networking(SDN). The SDN controller manages the content distribution, caching, and routing based on the users' requests. In this paper, we extend these context by addressing the ICN topology management problem over the SDN network to achieve an improved user experience as well as network performance. In particular, a centralized controller is designed to construct and manage the ICN overlay. Experimental results indicate that this adopted topology management strategy achieves high performance, in terms of low failure in interest satisfaction and reduced download time compared to a plain ICN.

Dynamic Event-Triggered Consensus Control for Input Constrained Multi-Agent Systems With a Designable Minimum Inter-Event Time

This paper investigates the consensus control of multi-agent systems(MASs) with constrained input using the dynamic event-triggered mechanism(ETM).Consider the MASs with small-scale networks where a centralized dynamic ETM with global information of the MASs is first designed.Then,a distributed dynamic ETM which only uses local information is developed for the MASs with large-scale networks.It is shown that the semi-global consensus of the MASs can be achieved by the designed bounded control protocol where the Zeno phenomenon is eliminated by a designable minimum inter-event time.In addition,it is easier to find a trade-off between the convergence rate and the minimum inter-event time by an adjustable parameter.Furthermore,the results are extended to regional consensus of the MASs with the bounded control protocol.Numerical simulations show the effectiveness of the proposed approach.

Robust Topology Optimization of Vehicle Suspension Control Arm

A robust topology optimization design framework is developed to solve lightweight structural design problems under uncertain conditions. To enhance the calculation accuracy and flexibility of the statistical moments of robust analysis, number theory integral method is applied to sample point selection and weight assignment. Both the structure topology optimization and number theory integral methods are combined to form a new robust topology optimization method. A suspension control arm problem is provided as a demonstration of robust topology optimization methods under loading uncertainties. Based on the results of deterministic and robust topology optimization, it is demonstrated that the proposed robust topology optimization method can produce a more robust design than that obtained by deterministic topology optimization. It is also found that this new approach is easy to apply in the existing commercial topology optimization software and thus feasible in practical engineering problems.

Time-varying formation for general linear multi-agent systems via distributed event-triggered control under switching topologies

This paper investigates the time-varying formation problem for general linear multi-agent systems using distributed event-triggered control strategy.Different from the previous works,to achieve the desired time-varying formation,a distributed control scheme is designed in an event-triggered way,in which for each agent the controller is triggered only at its own event times.The interaction topology among agents is assumed to be switching.The common Lyapunov function as well as Riccati inequality is applied to solve the time-varying formation problem.Moreover,the Zeno behavior of triggering time sequences can be excluded for each agent.Finally,a simulation example is presented to illustrate the effectiveness of the theoretical results.

Simulation of Topology Control Algorithms in Wireless Sensor Networks Using Cellular Automata

We use cellular automata for simulating a series of topology control algorithms in Wireless Sensor Networks (WSNs) using various programming environments. A cellular automaton is a decentralized computing model providing an excellent platform for performing complex computations using only local information. WSNs are composed of a large number of distributed wireless sensor nodes operating on batteries. The objective of the topology control problem in WSNs is to select an appropriate subset of nodes able to monitor a region at a minimum energy consumption cost and, therefore, extend network lifetime. Herein, we present topology control algorithms based on the selection—in a deterministic or randomized way—of an appropriate subset of sensor nodes that must remain active. We use cellular automata for conducting simulations in order to evaluate the performance of these algorithms and investigate the effect/role of the neighbourhood selection in the efficient application of our algorithms. Furthermore, we implement our simulations in Matlab, Java and Python in order to investigate in which ways the selection of an appropriate programming environment can facilitate experimentation and can result in more efficient application of our algorithms.

Energy Efficient Direction-Based Topology Control Algorithm for WSN

A wireless sensor network consists of hundreds or thousands of small nodes which could either have a static or dynamic position. These nodes are deployed through normal or random distribution to report events of a particular area to the base station through sink nodes. Having limited onboard energy of sensor nodes, conservation of energy in wireless sensor network is necessary. For this purpose, a new algorithm is proposed titled Energy-Efficient-Direction-Based-Topology-Control-Algorithm (EEDBTC). In proposed algorithm, direction is the main concern whenever an event occurs the node will send data in the direction of base station so that less energy is consumed. The results of the same were compared with customary dense wireless sensor network, color based WSNs and it was observed that this algorithm is much better than previous topology control algorithms used.

A Location-Based Clustering Topology Control Algorithm in WSN

Aiming at the existing problems in Leach algorithm,which has short network survival time and high energy consumption,a new location-based clustering topology control algorithm is proposed.Based on Leach algorithm,improvements have been done.Firstly,when selecting cluster head,node degree,remaining energy,and the number of being cluster head,these three elements are taken into consideration.Secondly,by running the minimum spanning tree algorithm,the tree routing is constructed.Finally,selecting the next hop between clusters is done by MTE algorithm.Simulation results show that the presented control algorithm has not only a better adaptability in the large-scale networks,but also a bigger improvement in terms of some indicators of performance such as network lifetime and network energy consumption.