When a mechanical system is subject to constraints its motion is in some way restricted. In accordance with Newton's second law, motion is a direct result of forces acting on a system; hence, constraint is inextricably linked to force. The presence of a constraint implies the application of particular forces needed to compel motion in accordance with the constraint; absence of a constraint implies the absence of such forces. The objective of this thesis is to formulate a comprehensive, consistent, and concise method for identifying a set of forces needed to constrain the behavior of a mechanical system modeled as a set of particles and rigid bodies. The goal is accomplished in large part by expressing constraint equations in vector form rather than entirely in terms of scalars. The method developed here can be applied whenever constraints can be described at the acceleration level by a set of independent equations that are linear in acceleration. Hence, the range of applicability extends to servo-constraints or program constraints described at the velocity level with relationships that are nonlinear in velocity. All configuration constraints, and an important class of classical motion constraints, can be expressed at the velocity level by using equations that are linear in velocity; therefore, the associated constraint equations are linear in acceleration when written at the acceleration level. Two new approaches are presented for deriving equations governing motion of a system subject to constraints expressed at the velocity level with equations that are nonlinear in velocity. By using partial accelerations instead of the partial velocities normally employed with Kane's method, it is possible to form dynamical equations that either do or do not contain evidence of the constraint forces, depending on the analyst's interests.

Nature and its variety of motion forms have inspired new robot designs with inherentunderactuated dynamics. The fundamental characteristic of these controlled mechanicalsystems, called underactuated, is to have the number of actuators less than the number ofdegrees of freedom. The absence of full actuation brings challenges to planning feasibletrajectories and designing controllers. This is in contrast to classical fully-actuated robots.A particular problem that arises upon study of such systems is that of generating periodicmotions, which can be seen in various natural actions such as walking, running,hopping, dribbling a ball, etc. It is assumed that dynamics can be modeled by a classicalset of second-order nonlinear differential equations with impulse effects describing possibleinstantaneous impacts, such as the collision of the foot with the ground at heel strikein a walking gait. Hence, we arrive at creating periodic solutions in underactuated Euler-Lagrange systems with or without impulse effects. However, in the qualitative theory ofnonlinear dynamical systems, the problem of verifying existence of periodic trajectoriesis a rather nontrivial subject.The aim of this work is to propose systematic procedures to plan such motions and ananalytical technique to design orbitally stabilizing feedback controllers. We analyze andexemplify both cases, when the robotmodel is described just by continuous dynamics, andwhen continuous dynamics is interrupted from time to time by state-dependent updates.For trajectory planning, systems with one or two passive links are considered, forwhich conditions are derived to achieve periodicmotions by encoding synchronizedmovementsof all the degrees of freedom. For controller design we use an explicit form tolinearize dynamics transverse to the motion. This computation is valid for an arbitrarydegree of under-actuation. The linear system obtained, called transverse linearization, isused to analyze local properties in a vicinity of the motion, and also to design feedbackcontrollers. The theoretical background of these methods is presented, and developedin detail for some particular examples. They include the generation of oscillations forinverted pendulums, the analysis of human movements by captured motion data, and asystematic gait synthesis approach for a three-link biped walker with one actuator.

Ce travail propose de nouvelles stratégies pour la planification et le contrôle des robots mobiles non-holonomes, de nouveaux algorithmes sont proposés. Tout d'abord, l'identification des différents modèles cinématiques de robot mobiles est discutée, et le problème est formulé comme l'identification en temps réel du signal de commutation d'un système singulier non-linéaire et à commutation. Deuxièmement, sur la base du modèle identifié, un algorithme de planification locale est proposé, et le contour irrégulier de l' obstacle est représenté par des segments. La trajectoire est obtenue en résolvant un problème de commande optimale avec contraintes. Troisièmement, nous appliquons un contrôleur i-PID pour contrôler le robot mobile non-holonome avec la perturbation dans les mesures. Un paramètre de commutation α est proposé en raison de la particularité du système non-holonome. En plus de notre algorithme de planification proposé, une autre approche de planification en utilisant de champs de potentiels est proposée. La nouvelle fonction de champ de potentiel est en mesure de résoudre les problèmes de minima locaux et de produire des forces lisses pour éviter les oscillations. Enfin, une approche de planification coopérative entre robots est proposée en utilisant les informations locales partagées par chaque robot. Le graphe de visibilité est utilisé pour générer une série d'objectifs intermédiaires qui assureront aux robots d’atteindre l'objectif final, et un algorithme est proposé pour étendre les obstacles et fusionner les obstacles lorsque deux obstacles s'entrecroisent / This PhD thesis is dedicated to the path planning and control strategy for non-holonomic mobile robots. After a review of the recent researches and their features, new path planning algorithms and control strategies are proposed. Firstly, the identification of different mobile robot kinematic models is discussed, robot kinematic models are formulated as a switched singular nonlinear system, and the problem becomes the real-time identification of the switching signal. Secondly, based on the identified model, a local path planning algorithm is proposed, in which the irregular contour of obstacles is represented by segments. The path planning problem is formulated as a constrained receding horizon planning problem and the trajectory is obtained by solving an optimal control problem with constraints. Thirdly, we apply an i-PID controller to control the non-holonomic mobile robot with measurement disturbance. A switching parameter α is proposed because of the particularity of the non-holonomic system. In addition to our proposed path planning algorithm, another path planning approach using potential field is proposed. The modified potential field function, which takes into account the robot orientation and angular velocity, is able to solve local minima problems and produce smooth forces to avoid oscillations. Finally, a cooperative path planning approach between robots is proposed by using the shared local information of each robot. The visibility graph is used to generate a series of intermediate objectives which will guarantee the robots reaching the final objective, and an algorithm is proposed to expand obstacles and merge obstacles when two obstacles intercross

No description available.

Quantum information technologies include secure quantum communications and ultra precise quantum sensing that are significantly more efficient than their classical counterparts. To enable such technologies, we need a scalable quantum platform in which qubits are con trollable. Color centers provide controllable optically-active spin qubits within the coherence time limit. Moreover, the nearby nuclear spins have long coherence times suitable for quantum memories. In this thesis, I present a theoretical understanding of and control protocols for various color centers. Using group theory, I explore the wave functions and laser pumping-induced dynamics of VSi color centers in silicon carbide. I also provide dynamical decoupling-based high-fidelity control of nuclear spins around the color center. I also present a control technique that combines holonomic control and dynamically corrected control to tolerate simultaneous errors from various sources. The work described here includes a theoretical understanding and control techniques of color center spin qubits and nuclear spin quantum memories, as well as a new platform-independent control formalism towards robust qubit control. / Doctor of Philosophy / Quantum information technologies promise to offer efficient computations of certain algorithms and secure communications beyond the reach of their classical counterparts. To achieve such technologies, we must find a suitable quantum platform to manipulate the quantum information units (qubits). Color centers host spin qubits that can enable such technologies. However, it is challenging due to our incomplete understanding of their physical properties and, more importantly, the controllability and scalability of such spin qubits. In this thesis, I present a theoretical understanding of and control protocols for various color centers. By using group theory that describes the symmetry of color centers, I give a phenomenological model of spin qubit dynamics under optical control of VSi color centers in silicon carbide. I also provide an improved technique for controlling nuclear spin qubits with higher precision. Moreover, I propose a new qubit control technique that combines two methods - holonomic control and dynamical corrected control - to provide further robust qubit control in the presence of multiple noise sources. The works in this thesis provide knowledge of color center spin qubits and concrete control methods towards quantum information technologies with color center spin qubits.

Formation planning and control for multi-agent robotic systems enables tasks to be completed more efficiently and robustly compared to using a single agent. Applications are found in fields such as agriculture, mining, autonomousvehicle platooning, surveillance, space exploration, etc. In this paper, a complete framework for formation path planning for holonomic ground robots in an obstacle-rich environment is proposed. The method utilizes the Fast Marching Square (FM2) path planning algorithm, and a formation keeping approach which falls within the Leader-Follower category. Contrary to most related works, the role of leader is dynamically assigned to avoid unnecessary rotation of the formation. Furthermore, the roles of the followers are also dynamically assigned to fit the current geometry of the formation. A flexible spring-damper system prevents inter-robot collisions and helps maintain the formation shape. An obstacle avoidance step at the end of the pipeline keeps the spring forces from driving robots into obstacles. The framework is tested on a formation consisting of three Unitree Go1 quadruped robots, both in the Gazebo simulation environment and in lab experiments. The results are successful and indicate that the method is feasible, although further work is needed to adjust the role assignment for larger formations, combine the framework with Simultaneous Localization and Mapping (SLAM) and provide a more robust handling of dynamic obstacles.

In this project a qutrit tripod system is studied to implement quantum gates using non-Abelian geometric phases, allowing for holonomic quantum computation which in turn results in more robust computations. First, a general foundation of the theory is presented. This includes the relevant theory of matrices in Hilbert space, as well as theory of the quantum mechanics used in the report. The method is then described in depth, showing how the pulse area is fixed. Using properties of the Hamiltonian as well as the time-evolution operator of the tripod system the computational subspace can be derived. These findings are combined to show how the computational subspace evolves in time, resulting in the unitary matrix used to form quantum gates. Using educated guesses to find the necessary parameters or utilizing iterative methods to find the parameters are the two main approaches used for constructing the considered gates. Three of the suggested quantum gates are successfully implemented through educated guesses, namely X, T and Z using an angle parametrization of the phase and amplitude of the pulses. The last desired gate is the Hadamard-gate, but the implementation of said gate required numerical approximation. The reasons as to why this is the case, are later discussed.

Robotics has been the subject of academic study from as early as 1948. For much of this time, study has focused on very specific applications in very well controlled environments. For example, the first commercial robots (1961) were introduced in order to improve the efficiency of production lines. The tasks undertaken by these robots were simple, and all that was required of a control algorithm was speed, repetitiveness and reliability in these environments. Now however, robots are being used to move around autonomously in increasingly unpredictable environments, and the need for robotic control algorithms that can successfully react to such conditions is ever increasing. In addition to this there is an ever-increasing array of robots available, the control algorithms for which are often incompatible. This can result in extensive redesign and large sections of code being re-written for use on different architectures. The thesis presented here is that a new generic approach can be created that provides robust high quality smooth paths and time-optimal path tracking to substantially increase applicability and efficiency of autonomous motion plans. The control system developed to support this thesis is capable of producing high quality smooth paths, and following these paths to a high level of accuracy in a robust and near time-optimal manner. The system can control a variety of robots in environments that contain 2D obstacles of various shapes and sizes. The system is also resilient to sensor error, spatial drift, and wheel-slip. In achieving the above, this system provides previously unavailable functionality by generically creating and tracking high quality paths so that only minor and clear adjustments are required between different robots and also be being capable of operating in environments that contain high levels of perturbation. The system is comprised of five separate novel component algorithms in order to cater for five different motion challenges facing modern robots. Each algorithm provides guaranteed functionality that has previously been unavailable in respect to its challenges. The challenges are: high quality smooth movement to reach n-dimensional goals in regions without obstacles, the navigation of 2D obstacles with guaranteed completeness, high quality smooth movement for ground robots carrying out 2D obstacle navigation, near time-optimal path tracking, and finally, effective wheel-slip detection and compensation. In meeting these challenges the algorithms have tackled adherence to non-holonomic constraints, applicability to a wide range of robots and tasks, fast real-time creation of paths and controls, sensor error compensation, and compensation for perturbation. This thesis presents each of the above algorithms individually. It is shown that existing methods are unable to produce the results provided by this thesis, before detailing the operation of each algorithm. The methodology employed is varied in accordance with each of the five core challenges. However, a common element of methodology throughout the thesis is that of gradient descent within a new type of potential field, which is dynamic and capable of the simultaneous creation of high-quality paths and the controls required to execute them. By relating global to local considerations through subgoals, this methodology (combined with other elements) is shown to be fully capable of achieving the aims of the thesis. It is concluded that the produced system represents a novel and significant contribution as there is no other system (to the author’s knowledge) that provides all of the functionality given. For each component algorithm there are many control systems that provide one or more of its features, but none that are capable of all of the features. Applications for this work are wide ranging as it is comprised of five component algorithms each applicable in their own right. For example, high quality smooth paths may be created and followed in any dimensionality of space if time optimality and obstacle avoidance are not required. Broadly speaking, and in summary, applications are to ground-based robotics in the areas of smooth path planning, time optimal travel, and compensation for unpredictable perturbation.

Dans ces travaux, nous proposons un système de guidage automatique pour la navigation sûre d'un robot mobile dans un monde ouvert. Le principe est de contrôler la direction et la vitesse du véhicule afin de préserver son intégrité physique et celle de son environnement. Cela se traduit par la généralisation du concept d'obstacle permettant d'estimer l'espace de vitesses admissibles par le véhicule en fonction de la surface de navigation, des capacités du véhicule et de son état. Afin d'atteindre cet objectif, le système doit pour chaque itération : 1) fournir à la tâche de perception une zone sur laquelle elle devra focaliser son attention pour la reconstruction de l'environnement ; 2) générer des trajectoires admissibles par le véhicule ; 3) estimer le profil de vitesse admissible pour chacune d'entre elles ; 4) pour finir, sélectionner la plus optimale par rapport à un critère prédéfini. Des résultats simulés et obtenus sur un démonstrateur réel permettent d'analyser les performances obtenues du système face à des scénarios divers et en démontre la pertinence. / In this work, we propose an automatic guidance system for safe navigation of a mobile robot in an open environment. The principle is to control the direction and the speed oh the vehicle in order to preserve its physical integrity and that of its environment. That results in the generalization of obstacle's concept to estimate the admissible speeds of the vehicle taking into account the surface navigation, the capabilities of the vehicle and its state. To accomplish this objective, th system has to ; 1) provide to the perception task an area on witch it can focus its attention to build the environment, 2) generate acceptable trajectories by th vehicles ; 3) estimate the admissible speed profile for each of them, 4) finally, select the most optimal with respect to a predefined criterion. Simulated and real results show the performance of the system obtained against various scenarios.

Au cours des dernières années, les problèmes multi-agents ont été étudiés de manière intensive par la communauté de la théorie du contrôle. L'un des sujets les plus populaires est le problème de consensus où un groupe d'agents parvient à un accord sur la valeur d'un certain paramètre ou d’une variable. Dans ce travail, nous nous concentrons sur le consensus des réseaux d'agents avec une dynamique non linéaire de poursuite de référence. Nous utilisons des interactions sporadiques modélisées par la détection relative, pour traiter le consensus décentralisé des références. La référence est donc utilisée pour alimenter la dynamique de poursuite de chaque agent. L'analyse de stabilité du système globale a nécessitée l'utilisation d'outils théoriques propre de la théorie des systèmes hybrides, en raison de la double nature de l'approche en deux étapes. L'analyse est effectuée en tenant compte de différents scénarios de topologie et interactions. Pour chaque cas, une condition suffisante de stabilité est fournie, en termes de temps minimum autorisé entre deux mises à jour de référence consécutives. Le cadre proposé est appliqué aux missions de rendez-vous et de réalisation de formation pour les robots mobiles non-holonomes. Le même problème est abordé dans le contexte d'une application réelle sur le terrain, à savoir un système de gestion de flotte pour un groupe de véhicules robotisés déployés dans un environnement industriel à des fins de surveillance et de collecte de données. Le développement d'une telle application a été motivé par le fait que cette thèse s'inscrit dans le cadre du projet FFLOR, développé par le département de recherche technologique du CEA tech. / Over the last years, multi-agents problems have been extensively studied from the control theory community. One of the most popular multi-agents control topics is the consensus problem where a group of agents reaches an agreement over the value of a certain parameter or variable. In this work we focus our attention on the consensus problem of networks of non-linear reference tracking agents. In first place, we use sporadic interactions modeled by relative sensing to deal with the decentralized consensus of the references. The reference is therefore feeded the tracking dynamics of each agent. Differently from existent works, the stability analysis of the overall system required the usage of hybrid systems theory tools, due to dual nature of the two stages approach. The analysis is carried out considering different scenarios of network topology and interactions. For each case a stability sufficient condition in terms of the minimum allowed time between two consecutive reference updates is provided. The proposed framework is applied to the rendez-vous and formation realisation tasks for non-holonomic mobile robots, which appear among the richest research topics in recent years. The same problem is addressed in the context of a real field application, namely a fleet management system for a group of robotic vehicles deployable in an industrial environment for monitoring and data collection purpose. The development of such application was motivated by the fact that this thesis is part of the Future of Factory Lorraine (FFLOR) project, developed by the technological research department of the Commissariat à l'énergie atomique et aux énergies alternatives (CEA tech).