Search results for "optimal"
showing 10 items of 706 documents
Energy-related optimal control accounts for gravitational load: comparing shoulder, elbow, and wrist rotations.
2013
International audience; Gaveau J, Berret B, Demougeot L, Fadiga L, Pozzo T, Papaxanthis C. Energy-related optimal control accounts for gravitational load: comparing shoulder, elbow, and wrist rotations. J Neurophysiol 111: 4-16, 2014. First published October 16, 2013; doi: 10.1152/jn.01029.2012.-We permanently deal with gravity force. Experimental evidences revealed that moving against gravity strongly differs from moving along the gravity vector. This directional asymmetry has been attributed to an optimal planning process that optimizes gravity force effects to minimize energy. Yet, only few studies have considered the case of vertical movements in the context of optimal control. What kin…
Survey of methods to visualize alternatives in multiple criteria decision making problems
2012
When solving decision problems where multiple conflicting criteria are to be considered simultaneously, decision makers must compare several different alternatives and select the most preferred one. The task of comparing multidimensional vectors is very demanding for the decision maker without any support. Different graphical visualization tools can be used to support and help the decision maker in understanding similarities and differences between the alternatives and graphical illustration is a very important part of decision support systems that are used in solving multiple criteria decision making problems. The visualization task is by no means trivial because, on the one hand, the grap…
Stochastic Decision Support Models and Optimal Stopping Rules in a New Product Lifetime Testing
2010
Determining when to stop a statistical test is an important management decision. Several stopping criteria have been proposed, including criteria based on statistical similarity, the probability that the system has a desired reliability, and the expected cost of remaining faults. This paper presents a new stopping rule in fixed-sample testing based on the statistical estimation of total costs involved in the decision to continue beyond an early failure as well as a stopping rule in sequential-sample testing to determine when testing should be stopped. The paper considers the problem that can be stated as follows. A new product is submitted for lifetime testing. The product will be accepted …
Sur les problèmes d'optimisation structurelle
2000
We discuss existence theorems for shape optimization and material distribution problems. The conditions that we impose on the unknown sets are continuity of the boundary, respectively a certain measurability hypothesis. peerReviewed
Optimal shape design and unilateral boundary value problems: Part II
2007
In the first part we give a general existence theorem and a regularization method for an optimal control problem where the control is a domain in R″ and where the system is governed by a state relation which includes differential equations as well as inequalities. In the second part applications for optimal shape design problems governed by the Dirichlet-Signorini boundary value problem are presented. Several numerical examples are included.
Optimal Population Growth as an Endogenous Discounting Problem: The Ramsey Case
2018
International audience; This paper revisits the optimal population size problem in a continuous time Ramsey setting with costly child rearing and both intergenerational and intertemporal altruism. The social welfare functions considered range from the Millian to the Benthamite. When population growth is endogenized, the associated optimal control problem involves an endogenous effective discount rate depending on past and current population growth rates, which makes preferences intertemporally dependent. We tackle this problem by using an appropriate maximum principle. Then we study the stationary solutions (balanced growth paths) and show the existence of two admissible solutions except in…
Analysis of Optimal High Resolution and Fixed Rate Scalar Quantization
2009
In 2001, Hui and Neuhoff proposed a uniform quantizer with overload for the quantization of scalar signals and derived the asymptotically optimal size of the quantization bins in the high-bitrate limit. The purpose of the present paper is to prove a quantitatively more precise version of this result which, at the same time, is valid for a more general, quite natural class of probability distributions that requires only little regularity and includes, for instance, positive Lipschitz-continuous functions of unit integral.
Generation of Valid Labeled Binary Trees
2003
International audience; Generating binary trees is a well-known problem. In this paper, we add some constraints to leaves of these trees. Such trees are used in the morphing of polygons, where a polygon P is represented by a binary tree T and each angle of P is a weight on a leaf of T. In the following, we give two algorithms to generate all binary trees, without repetitions, having the same weight distribution to their leaves and representing all parallel polygons to P.
A formal proof of the ε-optimality of absorbing continuous pursuit algorithms using the theory of regular functions
2014
Published version of an article from the journal: Applied Intelligence. Also available on Springerlink: http://dx.doi.org/10.1007/s10489-014-0541-1 The most difficult part in the design and analysis of Learning Automata (LA) consists of the formal proofs of their convergence accuracies. The mathematical techniques used for the different families (Fixed Structure, Variable Structure, Discretized etc.) are quite distinct. Among the families of LA, Estimator Algorithms (EAs) are certainly the fastest, and within this family, the set of Pursuit algorithms have been considered to be the pioneering schemes. Informally, if the environment is stationary, their ε-optimality is defined as their abili…
Optimal paths in weighted timed automata
2004
AbstractWe consider the optimal-reachability problem for a timed automaton with respect to a linear cost function which results in a weighted timed automaton. Our solution to this optimization problem consists of reducing it to computing (parametric) shortest paths in a finite weighted directed graph. We call this graph a parametric sub-region graph. It refines the region graph, a standard tool for the analysis of timed automata, by adding the information which is relevant to solving the optimal-reachability problem. We present an algorithm to solve the optimal-reachability problem for weighted timed automata that takes time exponential in O(n(|δ(A)|+|wmax|)), where n is the number of clock…