The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
This paper is concerned with the consensus problem for general first-order multi-agent systems over undirected topology. Under the assumption that the topology is connected and every agent receives neighbors information with time-varying communication delay, allowable delay bound depending on the agent dynamics, topology structure and the control gain is obtained. In particular, in case of first-order...
Order-batching is a common practice in orderpicking» which can reduce the total picking time if the orders have many relevant in Multi-Shuttle Warehouse System. In this paper, the performance of different order-batching methods that are made up of one seed-order selection rule and one accompanying-order selection rule is investigated. A seed-order selection rule selects the first order (i.e. the seed...
This paper considers global practical tracking for a class of nonlinear systems with unknown relative degree, unknown control direction and non-parametric uncertain nonlinearities. Different from the existing results, known upper bound is not required for the unknown relative degree, which makes it impossible to design a filter with fixed dimension. To compensate the multiple uncertainties, a novel...
According to the tensor diffusion theory, this paper proposes a novel active contour model for image segmentation in the level set formulation. Firstly, we define an external energy term using the trace-based tensor diffusion equation, which can locate the evolution curve to the neighborhood of one target boundaries adaptively. So it will enhance the robustness of the model to the initialization of...
The global synchronization problem of complex dynamical networks with memristive neural networks (MNNs) nodes is studied in this paper. By using the Filippov solution and some set-valued maps, the synchronization framework of complex networks with MNNs nodes is presented. Some sufficient criteria ensuring the considered complex networks to be globally exponentially synchronized are derived by using...
We investigate the filter design problem for discretetime interval uncertain positive systems under the ℓ1 performance in this paper. First, we propose some conditions expressed by linear programming to ensure the asymptotic stability and the ℓ1 performance for given positive systems. Then, we establish a novel filter design approach and an iterative algorithm to obtain the desired filter for interval...
This paper investigates the problem of finite-time extended dissipative analysis for a class of switched delay systems. By using average dwell-time and linear matrix inequality technique, sufficient conditions are proposed to guarantee the switched delay system is finite-time bounded and has finitetime extended dissipative performance, where the H∞, L2 — L∞, Passivity and (Q, S, Ä)-dissipativity performance...
This paper proposes plume-tracing strategy for an autonomous underwater vehicle (AUV) in the deep-sea environment. In order to dynamically adapt the complex environment and optimize the policy during interaction, reinforcement learning (RL) with continuous state and action domain is applied in this problem. Different from traditional strategies which have predesigned and stationary actions, this learning-based...
At present, shallow characteristics are usually utilized to represent the distributed features of text for Chinese spam classification, causing the problem of inexact text vector representation and low classification performance. A novel Chinese spam classification method based on weighted distributed feature is proposed by combining the features of TF-IDF weighted algorithm with the distributed text-based...
A Getz-Masden dynamic system 2 (GMDS2) is investigated in this paper. For the purpose of solving time-varying complex matrix inverse, we propose a TZ-type (i.e., Taylor-Zhang type) discrete Getz-Masden dynamic system 2; i.e., the proposed TZ-type discrete Getz-Masden dynamic system 2 is discretized by Taylor-Zhang discretization formula. The results of numerical experiments not only show the efficacy...
Quadratic minimization (QM) has been investigated for many years, which is generally supposed to be time-invariant and at the same level. Nevertheless, the QM which arises in practical applications, is usually time-varying and may be at the different levels. Different from general QM, a novel different-level time-varying QM (DLTVQM) is proposed and investigated in this paper. Firstly, the DLTVQM solving...
Jump random noises exist widely in control systems. In this paper, the guaranteed cost control problem for uncertain systems perturbed by jump random noises is considered. By adopting Poisson process to describe jump random noises, this paper utilize martingale theory to design a controller, which can stabilize such stochastic systems and guarantee the specified cost function has an upper bound.
This paper studies the controllability problem for weighted digraphs with antagonistic interactions. Based on the graph partition theory, the L-equitable partition(L-EP) is proposed. Using L-equitable partition, a graph-theoretic necessary condition is proposed for the controllability of the multi-agent system and an algorithm is given for the computation of the partition. Besides, the upper bound...
The distributed solving algorithms and experiments of the rendezvous problem for multiple quadrotors system are discussed in this paper. Firstly, the mathematical model of rendezvous problem is established and the distributed solution strategy based on coordinate variable is given. Secondly, the optimal control protocol based on consensus algorithm is derived. The cost function is defined, and the...
Compared with Zhang dynamics (ZD) method, gradient dynamics (GD) method, which is intrinsically feasible and efficient to solve time-invariant problems, could have a simpler hardware implementation. In this paper, different from conventional type-Z0G1 controller in Zhang-gradient (ZG) framework, which uses gradient descent of input vector, a type-Z0G1 controller using gradient descent of state vector...
Efficient and accurate access to foreground objects in video is the basis and key in the field of motion vision. Its difficulty lies in the dynamic background, illumination changes and such complex situations. The foreground object detection method based on robust principal component analysis (RPCA) has made great progress. In recent years, the Online Robust PCA (OR-PCA) has effectively solved the...
By analyzing the drivers' main consideration about how to choose a parking space, this paper is committed to path optimization of parking lot by modified Dijkstra algorithm. The main factors that impact drivers choosing optimal parking lot are driving distance, the number of vehicle moved along motorway, and the occupancy situations of free parking space. Finally, an example would be analyzed to verify...
This work is devoted to the admissibility analysis for singular time-delay systems by using delta operator approach. By estimating the delay term with a two-term approximation, the singular system in delta operator domain is transformed into an interconnection of a time-invariant subsystem with constant delay and a uncertain one. By resorting to the input-output approach, a delay-range-dependent admissibility...
This paper studies the set operations on maxitive belief structures. Unlike Dempster-Shafer structures, we show that different maxitive belief structures can induce the same upper and lower possibilities. Then the operations on the set of maxitive belief structures might not be the operations on their induced upper and lower possibilities. We call those operations on maxitive belief structures which...
Intersection computation of convex sets is a typical problem in distributed optimization. In this paper, a multi-agent network is considered for continuous-time dynamics with the fixed topology, in which each agent is associated with a convex set. The objective is for all the agents to achieve an agreement within the intersection of the associated convex sets. A distributed “projected consensus algorithm”...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.