Conference Program of WCICA 2012

Conference Program WCICA 2012
On Definition and Construction of Lyapunov Functions for Boolean Networks,
pp.1247–1252
Wang, Yuzhen
Li, Haitao
Shandong Univ.
Shandong U
This paper investigates how to define and construct a Lyapunov function
for Boolean networks, and presents a number of new results based
on the semi-tensor product of matrices. A proper form of pseudo-
Boolean functions is found, and the concept of (strict-)Lyapunov functions
is thus given. It is shown that a pseudo-Boolean function in
the proper form can play the role of Lyapunov functions for Boolean
networks, based on which some Lyapunov-based stability results are
obtained. Then, we study how to construct a Lyapunov function for
Boolean networks, and propose a definition-based method. The study
of illustrative examples shows that the new results/method presented in
this paper work very well.
◮ FrA08-2 13:50–14:10
Finding all controllers for disturbance decoupling of Boolean control networks,
pp.1344–1349
Yang, Meng
Chu, Tianguang
Peking Univ.
Peking Univ.
We investigate a type of disturbance decoupling problem (DDP) of
Boolean control networks. Using semi-tensor product of matrices, the
dynamics of Boolean control network is expressed in its algebraic form.
All the necessary arguments of the functions of outputs are called
output-friendly coordinates. In order to estimate the solvability of D-
DP, we give a necessary and sufficient condition of the output-friendly
coordinates being always in a known invariant subspace. Then it is
computationally feasible to construct all the valid feedback control matrices.
The logical function of each controller can be recovered from the
obtained feedback control matrix. We further discuss the constraints of
the selection of the invariant subspace. Examples are provided to show
the effectiveness of the proposed method.
◮ FrA08-3 14:10–14:30
New algorithm for finding fixed points and cycles of Boolean network,
pp.2691–2694
Suo, Jinghui
Sun, Jitao
Tongji Univ.
Tongji Univ.
Boolean networks have been successfully used in modeling biological
systems. The fixed points, cycles and transient states that lead to them
play an essential role to describe the structure of Boolean networks.
In this paper we propose an algorithm to get all the fixed points and
cycles of Boolean network by using the results of semi-tensor product
and permutation. At last, an example is given to illustrate the efficiency
of the obtained results.
◮ FrA08-4 14:30–14:50
Matrix Approach to Simulation and Bisimulation Analysis of Finite Automata,
pp.2716–2721
Xu, Xiangru
Hong, Yiguang
Lin, Hai
Acad. of Mathematics & Sys. Sci., CAS
Chinese Acad. of Sci.
Univ. of Notre Dame
In this paper, the simulation and bisimulation relations of finite automata
are investigated using matrix-based method. To solve the problem,
composition operations of automata are studied first and then the algorithms
and criteria are provided to check the simulation and bisimulation
relations of two automata. An illustrative example is also provided.
◮ FrA08-5 14:50–15:10
Approximation of Boolean Networks, pp.2280–2285
Cheng, Daizhan
Zhao, Yun-Bo
Zhao, Yin
Chinese Acad. of Sci.
Univ. of Glasgow
Acad. of mathematics & Sys. Sci., CAS
The problem of approximation to large-scale Boolean networks is considered.
First, we assume a large-scale Boolean network is aggregated
into several sub-networks. Using the outputs(or inputs) of each
sub-network as new state variables, a new simplified time-varying network
is obtained. Then a time-invariant Boolean network is used to
approximate each subsystem. Observed data are used to find the best
approximating dynamic models. Finally, the aggregation method is investigated.
FrA09 13:30–15:30 Room 311A
Invited Session: Coordination of Multi-Agent Systems and Networked
Systems With Constraints and Uncertainties
Chair: Chen, Zengqiang
Co-Chair: Cheng, Long
Nankai Univ.
Inst. of Automation, Chinese Acad. of Sci.
◮ FrA09-1 13:30–13:50
Discarded Consensus of Multi-Agent Systems with State Constraint,
pp.3460–3464
Liu, Zhongxin
Chen, Zengqiang
NanKai Univ.
Nankai Univ.
This work addresses the consensus problem of multi-agent systems
(MAS) with state constraint, while very few researchers consider such
constraint in their study of consensus. A simple distributed algorithm
named discarded consensus algorithm is proposed for weighted directed
multi-agent systems. The proposed method can ensure the MAS
reaching consensus while keeping the state estimate of each agent
within its own constraint if the digraph is strongly connected and the
initial state of each agent is within its constraint. Network of agents with
both fixed and switching communication topologies are investigated in
this paper. The convergence of the presented algorithms is analyzed
theoretically and numerical simulations are provided to demonstrate the
effectiveness of the theoretic results.
◮ FrA09-2 13:50–14:10
Control Design for Flexible Hierarchical Formation of Multiple Robots,
pp.3595–3600
Tang, Yutao
Hong, Yiguang
Chinese Acad. of Sci.
Chinese Acad. of Sci.
In this paper, we consider flexible formation and related control design
of multi-robot systems. A hierarchical structure is provided for flexible
formation of unicycle robots. With the virtual hierarchy defined in light
of interconnection graphs, the formation and related parameters can be
changed in different levels of the whole structure. The formation control
design is given from a leader-following viewpoint. Stability analysis is
also provided after that.
◮ FrA09-3 14:10–14:30
Performance Analysis for Multi-Agent Coordination With Partial Measurable
States Over Digital Networks, pp.863–868
Li, Tao
Acad. of Mathematics & Sys. Sci., Chinese Acad.
of Sci.
Xie, Lihua
Nanyang Technological Univ.
In this paper, we consider the performance of a class of distributed
coordination algorithms of discrete-time second-order multi-agent systems
with partially measurable states and a limited communication data
rate. The distributed coordinated control law is based on an encodingdecoding
scheme which integrates the state observation with encoding/decoding.
The convergence time, the selection of controller parameters
and the performance limit are discussed. We give upper bounds
of the convergence time in terms of precision, control and network parameters.
We develop a linear approximation of the spectral radius of
the closed-loop matrix with respect to the control gains and the algebraic
connectivity of the communication graph, by which we show that for a
connected network, 2-bit quantizers suffice for the exponential asymptotic
synchronization of the states of the agents. Furthermore, it is
shown that as the number of agents increases, the asymptotic convergence
rate can be approximated as a function of the number of agents,
the number of quantization levels (communication data rate) and the
ratio of the algebraic connectivity to the spectral radius of the Laplacian
matrix of the communication graph.
◮ FrA09-4 14:30–14:50
A Sampled-Data Based Average Consensus Protocol for Double-
Integrator Multi-Agent Systems with Switching Topologies and Commu-
98