This paper investigates the semi-online machine covering problem on three special uniform machines with the known largest size. Denote by sj the speed of each machine, j = 1, 2, 3. Assume 0 〈 s1 = s2 = r 〈 t = s3, and let s = t/r be the speed ratio. An algorithm with competitive ratio max（2, 3s＋6/s＋6 is presented. We also show the lower bound is at least max（2, 38 3s/s＋6）. For s ≤ 6, the algorithm is an optimal algorithm with the competitive ratio 2. Besides, its overall competitive ratio is 3 which matches the overall lower bound. The algorithm and the lower bound in this paper improve the results of Luo and Sun.
In this paper, we consider multi-agent consensus problems in a decentralised fashion. The interconnection topology graph among the agents is switching and undirected. The agent dynamics is expressed in the form of a double integrator model. Two different cases are considered in this study. One is the leader-following case and the other is leaderless case. Based on graph theory and common Lyapunov function method, some sufficient conditions are obtained for the consensus stability of the considered systems with the neighbour-based feedback laws in both leader-following case and leaderless case respectively. Finally, two numerical examples are given to illustrate the obtained results.
This paper considers the formation control problem of multi-agent systems in a distributed fashion. Two cases of the information propagating topologies among multiple agents, characterized by graphics model, are considered. One is fixed topology. The other is switching topology which represents the limited and less reliable information exchange. The local formation control strategies established in this paper are based on a simple modification of the existing consensus control strategies. Moreover, some existing convergence conditions are shown to be a special case of our model even in the continuous-time consensus case. Therefore, the results of this paper extend the existing results about the consensus problem.
