DISTRIBUTED FINITE-TIME χ-CONSENSUS ALGORITHMS FOR MULTI-AGENT SYSTEMS WITH VARIABLE COUPLING TOPOLOGY

<正> This paper considers finite-time χ-consensus problem for a multi-agent system with firstorderindividual dynamics and switching interaction topologies.Several distributed finite-time consensusrules are constructed for multi-agent dynamics in a unified way with the help of Lyapunovfunction and graph theory as well as homogeneity.Time-invariant non-smooth forms of finite-timeneighbor-based controllers are proposed and a numerical example is shown for illustration.     

Performance analysis of optimal channel estimation and multiuser detection in a randomly-spread CDMA channel

<正> This paper analyzes performance of optimal channel estimation and multiuser detection(MUD) in a block-fading code-division multiple-access (CDMA) channel on the assumptions of randomspreading and large-system limit,by using the replica method developed in statistical mechanics.The authors find that the asymptotic spectral efficiency of the linear minimum mean-squared error(LMMSE) MUD which was proposed and analyzed by Evans and Tse in 2000 is indistinguishable fromthat of the optimal MUD for small system loads.Our results imply that performance of MUD scarcelyimproves even if one spends more computational cost than that of the LMMSE MUD,i.e.,at most thecube of the number of users,on the above-described conditions.     

Adaptive tracking control for actuator failure compensation based on MT-filters

<正> This paper considers the problem of actuator failure compensation for a class of nonlinearsystems in the form of output-feedback.MT-filters are exploited to estimate the unmeasured states.The backsteppping technique is used to construct the controller recursively.The proposed compensationscheme can grantee the boundedness of all the closed-loop signals and asymptotic output tracking.Thetheoretical results are illustrated by a simulation example.     

Boundary control of two PDE’s separated by interface conditions

<正> This paper discusses the null boundary controllability of two PDE's,modeling a compositesolid with different physical properties in each layer.Interface conditions are imposed.     

A line search filter secant method for nonlinear equality constrained optimization

<正> This paper formulates and analyzes a line search method for general nonlinear equalityconstrained optimization based on filter methods for step acceptance and secant methods for searchdirection.The feature of the new algorithm is that the secant algorithm is used to produce a searchdirection,a backtracking line search procedure is used to generate step size,some filtered rules areused to determine step acceptance,second order correction technique is used to reduce infeasibility andovercome the Maratos effect.Global convergence properties of this method are analyzed:under mildassumptions it is showed that every limit point of the sequence of iterates generated by the algorithmis feasible,and that there exists at least one limit point that is a stationary point for the problem.Moreover,it is also established that the Maratos effect can be overcome in our new approach by addingsecond order correction steps so that fast local superlinear convergence to a second order sufficient localsolution is achieved.Finally,the results of numerical experiments are reported to show the effectivenessof the line search filter secant method.     

Rough function model and rough membership function

Two pairs of approximation operators, which are the scale lower and upper approximations as well as the real line lower and upper approximations, are defined. Their properties and antithesis characteristics are analyzed. The rough function model is generalized based on rough set theory, and the scheme of rough function theory is made more distinct and complete. Therefore, the transformation of the real function analysis from real line to scale is achieved. A series of basic concepts in rough function model including rough numbers, rough intervals, and rough membership functions are defined in the new scheme of the rough function model. Operating properties of rough intervals similar to rough sets are obtained. The relationship of rough inclusion and rough equality of rough intervals is defined by two kinds of tools, known as the lower （upper） approximation operator in real numbers domain and rough membership functions. Their relative properties are analyzed and proved strictly, which provides necessary theoretical foundation and technical support for the further discussion of properties and practical application of the rough function model.     

Optimal maintenance and replacement of extraction machinery

This paper considers a problem of optimal preventive maintenance and replacement schedule of equipment devoted to extracting resources from known deposits. Typical examples are oil drills, mine shovels, etc. At most one replacement of the existing machinery by a new one is allowed. The problem is formulated as an optimal control problem subject to the state constraint that the remaining deposit at any given time is nonnegative. We show that the optimal preventive maintenance, production rates, and the replacement and salvage times of the existing machinery and the new one, if required, can be obtained by solving sequentially a series of free-end-point optimal control problems. Moreover, an algorithm based on this result is developed and used to solve two illustrative examples.     

An improved branch-and-bound algorithm to minimize the weighted flowtime on identical parallel machines with family setup times

This article investigates identical parallel machines scheduling with family setup times. The objective function being the weighted sum of completion times, the problem is known to be strongly NP-hard. We propose a constructive heuristic algorithm and three complementary lower bounds. Two of these bounds proceed by elimination of setup times or by distributing each of them to jobs of the corresponding family, while the third one is based on a lagrangian relaxation. The bounds and the heuristic are incorporated into a branch-and-bound algorithm. Experimental results obtained outperform those of the methods presented in previous works, in term of size of solved problems.     

Efficient combination rule of Dezert-Smarandache theory

The Dezert-Smarandache theory （DSmT） is a useful method for dealing with uncertainty problems. It is more efficient in combining conflicting evidence. Therefore, it has been successfully applied in data fusion and object recognition. However, there exist shortcomings in its combination rule. An efficient combination rule is presented, that is, the evidence＇s conflicting probability is distributed to every proposition based on remaining the focal elements of conflict. Experiments show that the new combination rule improves the reliability and rationality of the combination results. Although evidences conflict another one highly, good combination results are also obtained.     

Simulated annealing algorithm for the optimal translation sequence of the jth agent in rough communication

In rough communication, because each agent has a different language and cannot provide precise communication to each other, the concept translated among multi-agents will loss some information and this results in a less or rougher concept. With different translation sequences, the problem of information loss is varied. To get the translation sequence, in which the jth agent taking part in rough communication gets maximum information, a simulated annealing algorithm is used. Analysis and simulation of this algorithm demonstrate its effectiveness.