摘要：The cooperative control and stability analysis problems for the multi-agent system with sampled com- munication are investigated. Distributed state feedback controllers are adopted for the cooperation of networked agents. A theorem in the form of linear matrix inequalities（LMI） is derived to analyze the system stability. An- other theorem in the form of optimization problem subject to LMI constraints is proposed to design the controller, and then the algorithm is presented. The simulation results verify the validity and the effectiveness of the pro- posed approach.

摘要：In order to guarantee the overall production performance of the multiple departments in an air-condition production industry, multidisciplinary design optimization model for production system is established based on the multi-agent technology. Local operation models for departments of plan, marketing, sales, purchasing, as well as production and warehouse are formulated into individual agents, and their respective local objectives are collectively formulated into a multi-objective optimization problem. Considering the coupling effects among the correlated agents, the optimization process is carried out based on self-adaptive chaos immune optimization algorithm with mutative scale. The numerical results indicate that the proposed multi-agent optimization model truly reflects the actual situations of the air-condition production system. The proposed multi-agent based multidisciplinary design optimization method can help companies enhance their income ratio and profit by about 33% and 36%, respectively, and reduce the total cost by about 1.8%.

摘要：The similarities and differences between the container terminal logistics system(CTLS)and the Harvard-architecture computer system are compared in terms of organization and *** mapping relation and the modeling framework of the CTLS are presented based on multi-agent,and the successful algorithms in the computer domain are applied to the modeling framework,such as the dynamic priority and multilevel feedback scheduling *** addition,a model and simulation on a certain quay at Shanghai harbor is built up on the AnyLogic platform to support the decision-making of terminal on service *** validates the feasibility and creditability of the above systematic methodology.

摘要：This paper deals with a cooperative control problem of a team of double-integrator agents moving along a set of given curves with a nominated formation. A projection-tracking design method is proposed for designing the path-following control and the formation protocol, which guarantee forma- tion motion of the multi-agent system under a directed communication graph. Necessary and sufficient conditions of the control gains for solving the coordinated problem are obtained when the directed communication graph has a globally reachable node. Simulation results of formation motion among three agents demonstrate the effectiveness of the proposed approach.

摘要：By introducing multi-agent technology to the online teaching system and establishing a personalized online teaching system model, the intelligent and personalized problems in the traditional online teaching system are solved; the needs of students for learning are fulfilled; the intelligent and interactive functions of the online teaching system are improved; a new interactive online teaching model is implemented. In this paper, the online system design based on multi-agent system technology is raised, and the modules and functions of the system are defined.

摘要：In order to find the completeness threshold which offers a practical method of making bounded model checking complete, the over-approximation for the complete threshold is presented. First, a linear logic of knowledge is introduced into the past tense operator, and then a new temporal epistemic logic LTLKP is obtained, so that LTLKP can naturally and precisely describe the system＇s reliability. Secondly, a set of prior algorithms are designed to calculate the maximal reachable depth and the length of the longest of loop free paths in the structure based on the graph structure theory. Finally, some theorems are proposed to show how to approximate the complete threshold with the diameter and recurrence diameter. The proposed work resolves the completeness threshold problem so that the completeness of bounded model checking can be guaranteed.