Search results for "function"
showing 10 items of 14432 documents
Darboux integrable system with a triple point and pseudo-abelian integrals
2016
We study pseudo-abelian integrals associated with polynomial perturbations of Dar-boux integrable system with a triple point. Under some assumptions we prove the local boundedness of the number of their zeros. Assuming that this is the only non-genericity, we prove that the number of zeros of the corresponding pseudo-abelian integrals is bounded uniformly for nearby Darboux integrable foliations.
Periodic Controls in Step 2 Strictly Convex Sub-Finsler Problems
2020
We consider control-linear left-invariant time-optimal problems on step 2 Carnot groups with a strictly convex set of control parameters (in particular, sub-Finsler problems). We describe all Casimirs linear in momenta on the dual of the Lie algebra. In the case of rank 3 Lie groups we describe the symplectic foliation on the dual of the Lie algebra. On this basis we show that extremal controls are either constant or periodic. Some related results for other Carnot groups are presented. peerReviewed
Iterated greedy with variable neighborhood search for a multiobjective waste collection problem
2020
Abstract In the last few years, the application of decision making to logistic problems has become crucial for public and private organizations. Efficient decisions clearly contribute to improve operational aspects such as cost reduction or service improvement. The particular case of waste collection service considered in this paper involves a set of economic, labor and environmental issues that translate into difficult operational problems. They pose a challenge to nowadays optimization technologies since they have multiple constraints and multiple objectives that may be in conflict. We therefore need to resort to multiobjective approaches to model and solve this problem, providing efficie…
Crowd-Averse Robust Mean-Field Games: Approximation via State Space Extension
2016
We consider a population of dynamic agents, also referred to as players. The state of each player evolves according to a linear stochastic differential equation driven by a Brownian motion and under the influence of a control and an adversarial disturbance. Every player minimizes a cost functional which involves quadratic terms on state and control plus a cross-coupling mean-field term measuring the congestion resulting from the collective behavior, which motivates the term “crowd-averse.” Motivations for this model are analyzed and discussed in three main contexts: a stock market application, a production engineering example, and a dynamic demand management problem in power systems. For th…
New results on stability analysis and stabilization of time-delay continuous Markovian jump systems with partially known rates matrix
2015
Summary In this note, the problems of stability analysis and controller synthesis of Markovian jump systems with time-varying delay and partially known transition rates are investigated via an input–output approach. First, the system under consideration is transformed into an interconnected system, and new results on stochastic scaled small-gain condition for stochastic interconnected systems are established, which are crucial for the problems considered in this paper. Based on the system transformation and the stochastic scaled small-gain theorem, stochastic stability of the original system is examined via the stochastic version of the bounded realness of the transformed forward system. Th…
Opinion dynamics in social networks through mean field games
2016
Emulation, mimicry, and herding behaviors are phenomena that are observed when multiple social groups interact. To study such phenomena, we consider in this paper a large population of homogeneous social networks. Each such network is characterized by a vector state, a vector-valued controlled input, and a vector-valued exogenous disturbance. The controlled input of each network aims to align its state to the mean distribution of other networks' states in spite of the actions of the disturbance. One of the contributions of this paper is a detailed analysis of the resulting mean-field game for the cases of both polytopic and $mathcal L_2$ bounds on controls and disturbances. A second contrib…
Input Selection Methods for Soft Sensor Design: A Survey
2020
Soft Sensors (SSs) are inferential models used in many industrial fields. They allow for real-time estimation of hard-to-measure variables as a function of available data obtained from online sensors. SSs are generally built using industries historical databases through data-driven approaches. A critical issue in SS design concerns the selection of input variables, among those available in a candidate dataset. In the case of industrial processes, candidate inputs can reach great numbers, making the design computationally demanding and leading to poorly performing models. An input selection procedure is then necessary. Most used input selection approaches for SS design are addressed in this …
Using Inverse Reinforcement Learning with Real Trajectories to Get More Trustworthy Pedestrian Simulations
2020
Reinforcement learning is one of the most promising machine learning techniques to get intelligent behaviors for embodied agents in simulations. The output of the classic Temporal Difference family of Reinforcement Learning algorithms adopts the form of a value function expressed as a numeric table or a function approximator. The learned behavior is then derived using a greedy policy with respect to this value function. Nevertheless, sometimes the learned policy does not meet expectations, and the task of authoring is difficult and unsafe because the modification of one value or parameter in the learned value function has unpredictable consequences in the space of the policies it represents…
Stabilized branch-and-price algorithms for vector packing problems
2018
Abstract This paper considers packing and cutting problems in which a packing/cutting pattern is constrained independently in two or more dimensions. Examples are restrictions with respect to weight, length, and value. We present branch-and-price algorithms to solve these vector packing problems (VPPs) exactly. The underlying column-generation procedure uses an extended master program that is stabilized by (deep) dual-optimal inequalities. While some inequalities are added to the master program right from the beginning (static version), other violated dual-optimal inequalities are added dynamically. The column-generation subproblem is a multidimensional knapsack problem, either binary, boun…
Gray code for derangements
2004
AbstractWe give a Gray code and constant average time generating algorithm for derangements, i.e., permutations with no fixed points. In our Gray code, each derangement is transformed into its successor either via one or two transpositions or a rotation of three elements. We generalize these results to permutations with number of fixed points bounded between two constants.