Spelling suggestions: "subject:"ercontroller synthesis"" "subject:"felkontroller synthesis""
1 
Improved direct torque control and robust adaptive control of induction motor drivesWong, Wallace Shung Hui January 2003 (has links)
No description available.

2 
Application of reduced order MCS control in the electrohydraulic servo fieldBulut, S. January 1997 (has links)
No description available.

3 
Optimal Manufacturing Controller Synthesis Using Situation CalculusAdalat, Omar, Scrimieri, Daniele, Konur, Savas 17 October 2023 (has links)
Yes / In this paper, we discuss a framework for synthesising manufacturing process controllers using situation calculus, a wellknown secondorder logic for reasoning about actions in AI. Using a library of highlevel ConGolog programs and logical action theories for production resources, we demonstrate how to efficiently synthesise an ‘optimal’ plan, i.e. the plant that minimises the number of actions for a target highlevel program of a process recipe. / University of Bradford / The fulltext of this conference paper will be released for public view at the end of the publisher embargo on 8 Nov 2025.

4 
Locomotion Synthesis Methods for Humanoid CharactersWang, Jack 16 March 2011 (has links)
This thesis introduces locomotion synthesis methods for humanoid characters. Motion synthesis is an underconstrained problem that requires additional constraints beyond user inputs. Two main approaches to introducing additional constraints are physicsbased and datadriven. Despite significant progress in the past 20 years, major difficulties still exist for both approaches. In general, building animation systems that are flexible to user requirements while keeping the synthesized motions plausible remain a challenging task. The methods introduced in this thesis, presented in twoparts, aim to allow animation systems to be more flexible to user demands without radically violating constraints that are important for maintaining plausibility.
In the first part of the thesis, we address an important subproblem in physicsbased animation  controller synthesis for humanoid characters. We describe a method for optimizing the parameters of a physicsbased controller for fullbody, 3D walking. The objective function includes terms for power minimization, angular momentum minimization, and minimal head motion, among others. Together these terms produce a number of important features of natural walking, including active toeoff, nearpassive knee swing, and leg extension during swing. We then extend the algorithm to optimize for robustness to uncertainty. Many unknown factors, such as external forces, control torques, and user control inputs, cannot be known in advance and must be treated as uncertain. Controller optimization entails optimizing the expected value of the objective function, which is computed by Monte Carlo methods. We demonstrate examples with a variety of sources of uncertainty and task constraints.
The second part of this thesis deals with the datadriven approach and the problem of motion modeling. Defining suitable models for human motion data is nontrivial. Simple linear models are not expressive enough, while more complex models require setting many parameters and are difficult to learn with limited data. Using Bayesian methods, we demonstrate how the Gaussian process prior can be used to derive a kernelized version of multilinear models. The result is a locomotion model that takes advantage of training data addressed by multiple indices to improve generalization to unseen motions.

5 
Locomotion Synthesis Methods for Humanoid CharactersWang, Jack 16 March 2011 (has links)
This thesis introduces locomotion synthesis methods for humanoid characters. Motion synthesis is an underconstrained problem that requires additional constraints beyond user inputs. Two main approaches to introducing additional constraints are physicsbased and datadriven. Despite significant progress in the past 20 years, major difficulties still exist for both approaches. In general, building animation systems that are flexible to user requirements while keeping the synthesized motions plausible remain a challenging task. The methods introduced in this thesis, presented in twoparts, aim to allow animation systems to be more flexible to user demands without radically violating constraints that are important for maintaining plausibility.
In the first part of the thesis, we address an important subproblem in physicsbased animation  controller synthesis for humanoid characters. We describe a method for optimizing the parameters of a physicsbased controller for fullbody, 3D walking. The objective function includes terms for power minimization, angular momentum minimization, and minimal head motion, among others. Together these terms produce a number of important features of natural walking, including active toeoff, nearpassive knee swing, and leg extension during swing. We then extend the algorithm to optimize for robustness to uncertainty. Many unknown factors, such as external forces, control torques, and user control inputs, cannot be known in advance and must be treated as uncertain. Controller optimization entails optimizing the expected value of the objective function, which is computed by Monte Carlo methods. We demonstrate examples with a variety of sources of uncertainty and task constraints.
The second part of this thesis deals with the datadriven approach and the problem of motion modeling. Defining suitable models for human motion data is nontrivial. Simple linear models are not expressive enough, while more complex models require setting many parameters and are difficult to learn with limited data. Using Bayesian methods, we demonstrate how the Gaussian process prior can be used to derive a kernelized version of multilinear models. The result is a locomotion model that takes advantage of training data addressed by multiple indices to improve generalization to unseen motions.

6 
Commande d'une classe de systèmes hybrides par automates hybrides rectangulaires / Control of a class of hybrid systems by rectangular hybrid automataBatis, Sonia 18 September 2013 (has links)
Notre travail de recherche concerne l’étude de la commande à base de modèles pour une sousclasse de systèmes dynamiques hybrides (SDH). L’outil de modélisation choisi est l’automate hybride rectangulaire (AHR) pour sa puissance d’analyse. Nous proposons ainsi une méthode pour la synthèse de la commande des SDH modélisés par des AHR. Cette méthode repose sur l’application d’une procédure amont/aval de commande horsligne qui détermine d’une façon maximale permissive les nouvelles gardes de transition de l’automate respectant des spécifications de commande imposées par l’utilisateur. Tous les calculs réalisés reposent sur la détermination de la durée de séjour, valeur contrainte par l’espace atteignable du sommet correspondant. La garde portant à la fois sur l’état continu et sur l’événement discret, la commande se fait par ce dernier car il s’agit du seul élément contrôlable. Nous nous intéressons alors à la construction du contrôleur temporisé autorisant l’occurrence des événements contrôlables du système dans un intervalle d’horloge défini au sens de la maximale permissivité. / In this thesis, we study the control of a class of hybrid dynamic systems (HDS). The chosen modeling tool is the rectangular hybrid automaton (RHA) for his analysis power. We propose a method for the control synthesis of HDS modeled with RHA. This method consists on the application of a downstream/upstream offline control procedure that determines in a maximal permissive way the new automaton transition guards respecting the desired control specifications. All computations are based on the determination of the duration of stay, a value constrained by the reachable space of the corresponding location. Since the guard refers to both continuous state and discrete event, the control is made by the latter because it is the controllable element. Then we are interested in the construction of the timed controller authorizing the system controllable event occurrence in a clock interval defined in a maximal permissive way.

7 
Analysis, Design, and Optimization of Embedded Control SystemsAminifar, Amir January 2016 (has links)
Today, many embedded or cyberphysical systems, e.g., in the automotive domain, comprise several control applications, sharing the same platform. It is well known that such resource sharing leads to complex temporal behaviors that degrades the quality of control, and more importantly, may even jeopardize stability in the worst case, if not properly taken into account. In this thesis, we consider embedded control or cyberphysical systems, where several control applications share the same processing unit. The focus is on the controlscheduling codesign problem, where the controller and scheduling parameters are jointly optimized. The fundamental difference between control applications and traditional embedded applications motivates the need for novel methodologies for the design and optimization of embedded control systems. This thesis is one more step towards correct design and optimization of embedded control systems. Offline and online methodologies for embedded control systems are covered in this thesis. The importance of considering both the expected control performance and stability is discussed and a controlscheduling codesign methodology is proposed to optimize control performance while guaranteeing stability. Orthogonal to this, bandwidthefficient stabilizing control servers are proposed, which support compositionality, isolation, and resourceefficiency in design and codesign. Finally, we extend the scope of the proposed approach to nonperiodic control schemes and address the challenges in sharing the platform with selftriggered controllers. In addition to offline methodologies, a novel online scheduling policy to stabilize control applications is proposed.

8 
Le problème de la valeur dans les jeux stochastiquesOualhadj, Youssouf 11 December 2012 (has links)
La théorie des jeux est un outils standard quand il s'agit de l'étude des systèmes réactifs. Ceci est une conséquence de la variété des modèle de jeux tant au niveau de l'interaction des joueurs qu'au niveau de l'information que chaque joueur possède.Dans cette thèse, on étudie le problème de la valeur pour des jeux où les joueurs possèdent une information parfaite, information partiel et aucune information. Dans le cas où les joueurs possèdent une information parfaite sur l'état du jeu,on étudie le problème de la valeur pour des jeux dont les objectifs sont des combinaisons booléennes d'objectifs qualitatifs et quantitatifs.Pour les jeux stochastiques à un joueur, on montre que les valeurs sont calculables en temps polynomiale et on montre que les stratégies optimalespeuvent être implementées avec une mémoire finie.On montre aussi que notre construction pour la conjonction de parité et de la moyenne positivepeut être étendue au cadre des jeux stochastiques à deux joueurs. Dans le cas où les joueurs ont une information partielle,on étudie le problème de la valeur pour la condition d'accessibilité.On montre que le calcul de l'ensemble des états à valeur 1 est un problème indécidable,on introduit une sous classe pour laquelle ce problème est décidable.Le problème de la valeur 1 pour cette sous classe est PSPACEcomplet dansle cas de joueur aveugle et dans EXPTIME dans le cas de joueur avec observations partielles. / Game theory proved to be very useful in the fieldof verification of open reactive systems. This is due to the widevariety of games' model that differ in the way players interactand the amount of information players have.In this thesis, we study the value problem forgames where players have full knowledge on their current configurationof the game, partial knowledge, and no knowledge.\\In the case where players have perfect information,we study the value problem for objectives that consist in combinationof qualitative and quantitative conditions.In the case of one player stochastic games, we show thatthe values are computable in polynomial time and show thatthe optimal strategies exist and can be implemented with finite memory.We also showed that our construction for parity and positiveaverage Markov decisionprocesses extends to the case of twoplayer stochastic games.\\In the case where the players have partial information,we study the value problem for reachability objectives.We show that computing the set of states with value 1 is an undecidableproblem and introduce a decidable subclass for the value 1 problem.This sub class is PSPACEcomplete in the case of blind controllersand EXPTIME is the setting of games with partial observations.

9 
A new computational approach to the synthesis of fixed order controllersMalik, Waqar Ahmad 15 May 2009 (has links)
The research described in this dissertation deals with an open problem concerning
the synthesis of controllers of xed order and structure. This problem is encountered
in a variety of applications. Simply put, the problem may be put as the
determination of the set, S of controller parameter vectors, K = (k1; k2; : : : ; kl),
that render Hurwitz a family (indexed by F) of complex polynomials of the form
fP0(s; ) + Pl
i=1 Pi(s; )ki; 2 Fg, where the polynomials Pj(s; ); j = 0; : : : ; l
are given data. They are specied by the plant to be controlled, the structure of the
controller desired and the performance that the controllers are expected to achieve.
Simple examples indicate that the set S can be nonconvex and even be disconnected.
While the determination of the nonemptiness of S is decidable and amenable
to methods such as the quantier elimination scheme, such methods have not been
computationally tractable and more importantly, do not provide a reasonable approximation
for the set of controllers. Practical applications require the construction of a
set of controllers that will enable a control engineer to check the satisfaction of performance
criteria that may not be mathematically well characterized. The transient
performance criteria often fall into this category. From the practical viewpoint of the construction of approximations for S, this
dissertation is dierent from earlier work in the literature on this problem. A novel
feature of the proposed algorithm is the exploitation of the interlacing property of
Hurwitz polynomials to provide arbitrarily tight outer and inner approximation to
S. The approximation is given in terms of the union of polyhedral sets which are
constructed systematically using the HermiteBiehler theorem and the generalizations
of the Descartes' rule of signs.

10 
A new computational approach to the synthesis of fixed order controllersMalik, Waqar Ahmad 10 October 2008 (has links)
The research described in this dissertation deals with an open problem concerning
the synthesis of controllers of xed order and structure. This problem is encountered
in a variety of applications. Simply put, the problem may be put as the
determination of the set, S of controller parameter vectors, K = (k1; k2,...,kl),
that render Hurwitz a family (indexed by F) of complex polynomials of the form
{P0(s.a) + [summation]
i=1 Pi(s,a)ki, a [set membership] F}, where the polynomials Pj(s,a), j = 0,...,l
are given data. They are specied by the plant to be controlled, the structure of the
controller desired and the performance that the controllers are expected to achieve.
Simple examples indicate that the set S can be nonconvex and even be disconnected.
While the determination of the nonemptiness of S is decidable and amenable
to methods such as the quantier elimination scheme, such methods have not been
computationally tractable and more importantly, do not provide a reasonable approximation
for the set of controllers. Practical applications require the construction of a
set of controllers that will enable a control engineer to check the satisfaction of performance
criteria that may not be mathematically well characterized. The transient
performance criteria often fall into this category. From the practical viewpoint of the construction of approximations for S, this
dissertation is dierent from earlier work in the literature on this problem. A novel
feature of the proposed algorithm is the exploitation of the interlacing property of
Hurwitz polynomials to provide arbitrarily tight outer and inner approximation to
S. The approximation is given in terms of the union of polyhedral sets which are
constructed systematically using the HermiteBiehler theorem and the generalizations
of the Descartes' rule of signs.

Page generated in 0.1002 seconds