Comment on "Computing the shortest network under a fixed topology

2006 ◽  
Vol 55 (6) ◽  
pp. 783-784 ◽  
Author(s):  
M. Zachariasen
Keyword(s):  
Shortest Network ◽  
Fixed Topology

Computing the shortest network under a fixed topology

2002 ◽  
Vol 37 (9) ◽  
pp. 1117-1120 ◽  
Author(s):  
Guoliang Xue ◽  
K. Thulasiraman
Keyword(s):  
Shortest Network ◽  
Fixed Topology

Computing the shortest network under a fixed topology

2002 ◽  
Vol 51 (9) ◽  
pp. 1118-1121
Author(s):  
Guoliang Xue ◽  
K. Thulasiraman
Keyword(s):  
Shortest Network ◽  
Fixed Topology

Consensus Problem of Singular Multi-Agent Systems with Continuous-Time and Fixed Topology

2013 ◽  
Vol 278-280 ◽  
pp. 1687-1691
Author(s):  
Tong Qiang Jiang ◽  
Jia Wei He ◽  
Yan Ping Gao
Keyword(s):  
Continuous Time ◽  
Spanning Tree ◽  
Undirected Graph ◽  
Necessary Condition ◽  
Multi Agent Systems ◽  
Agent Systems ◽  
Multi Agent ◽  
Fixed Topology ◽  
The Stability ◽  
Sufficient And Necessary Condition

The consensus problems of two situations for singular multi-agent systems with fixed topology are discussed: directed graph without spanning tree and the disconnected undirected graph. A sufficient and necessary condition is obtained by applying the stability theory and the system is reachable asymptotically. But for normal systems, this can’t occur in upper two situations. Finally a simulation example is provided to verify the effectiveness of our theoretical result.

scholarly journals Impulsive Consensus for Leader-Following Multiagent Systems with Fixed and Switching Topology

2013 ◽  
Vol 2013 ◽  
pp. 1-10 ◽  
Author(s):  
Zhi-Wei Liu ◽  
Zhi-Hong Guan ◽  
Hong Zhou
Keyword(s):  
Multiagent System ◽  
Impulsive Control ◽  
Sampling Period ◽  
Switching Topology ◽  
Sufficient Condition ◽  
Leader Following ◽  
Fixed Topology ◽  
The Stability ◽  
Sampling Instant ◽  
Necessary And Sufficient

This paper studied the consensus problem of the leader-following multiagent system. It is assumed that the state information of the leader is only available to a subset of followers, while the communication among agents occurs at sampling instant. To achieve leader-following consensus, a class of distributed impulsive control based on sampling information is proposed. By using the stability theory of impulsive systems, algebraic graph theory, and stochastic matrices theory, a necessary and sufficient condition for fixed topology and sufficient condition for switching topology are obtained to guarantee the leader-following consensus of the multiagent system. It is found that leader-following consensus is critically dependent on the sampling period, control gains, and interaction graph. Finally, two numerical examples are given to illustrate the effectiveness of the proposed approach and the correctness of theoretical analysis.

Channel design for 3D models with applications in powder-bed additive manufacturing

2019 ◽  
Vol 25 (9) ◽  
pp. 1536-1544
Author(s):  
Xiangzhi Wei ◽  
Xianda Li ◽  
Shanshan Wen ◽  
Yu Zheng ◽  
Yaobin Tian
Keyword(s):  
Additive Manufacturing ◽  
3D Model ◽  
3D Models ◽  
Linear Constraints ◽  
Channel Design ◽  
Channel Network ◽  
Content Type ◽  
Powder Bed ◽  
Shortest Network ◽  
Manufacturing Techniques

Purpose For any 3D model with chambers to be fabricated in powder-bed additive manufacturing processes such as SLM and SLS, powders are trapped in the chambers of the finished model. This paper aims to design a shortest network with the least number of outlets for efficiently leaking the trapped powders. Design/methodology/approach This paper proposes a nonlinear objective with linear constraints for solving the channel design problem and a particle swarm optimization algorithm to solve the nonlinear system. Findings Structural optimization for the channel network leads to fairly short channels in the interior of the 3D models and very few outlets on the model surface, which achieves the cleaning of the powders while causing almost the least changes to the model. Originality/value This paper reveals the NP-harness of computing the shortest channel network with the least number of outlets. The proposed approach helps the design of lightweight models using the powder-bed additive manufacturing techniques.

LIA: A LOCATION-INDEPENDENT TRANSFORMATION FOR ASOCS ADAPTIVE ALGORITHM 2

1996 ◽  
Vol 07 (05) ◽  
pp. 639-653
Author(s):  
GEORGE L. RUDOLPH ◽  
TONY R. MARTINEZ
Keyword(s):  
Adaptive Algorithm ◽  
Concurrent Systems ◽  
Local Information ◽  
General Strategy ◽  
Formal Description ◽  
Learning Models ◽  
Formal Definitions ◽  
Network Output ◽  
Fixed Topology ◽  
Independent Transformation

Most Artificial Neural Networks (ANNs) have a fixed topology during learning, and often suffer from a number of short-comings as a result. ANNs that use dynamic topologies have shown the ability to overcome many of these problems. Adaptive Self-Organizing Concurrent Systems (ASOCS) are a class of learning models with inherently dynamic topologies. This paper introduces Location-Independent Transformations (LITs) as a general strategy for implementing learning models that use dynamic topologies efficiently in parallel hardware. An LIT creates a set of location-independent nodes, where each node computes its part of the network output independent of other nodes, using local information. This type of transformation allows efficient support for adding and deleting nodes dynamically during learning. In particular, this paper presents the Location-Independent ASOCS (LIA) model as an LIT for ASOCS Adaptive Algorithm 2. The description of LIA gives formal definitions for LIA algorithms. Because LIA implements basic ASOCS mechanisms, these definitions provide a formal description of basic ASOCS mechanisms in general, in addition to LIA.

Sign in / Sign up

Export Citation Format

Share Document