Task space consensus in networks of heterogeneous and uncertain robotic systems with variable time-delays

This work deals with the leader-follower and the leaderless consensus problems in networks of multiple robot manipulators. The robots are non-identical, kinematically different (heterogeneous), and their physical parameters are uncertain. The main contribution of this work is a novel controller that solves the two consensus problems, in the task space, with the following features: it estimates the kinematic and the dynamic physical parameters; it is robust to interconnecting variable-time delays; it employs the singularity-free unit-quaternions to represent the orientation; and, using energy-like functions, the controller synthesis follows a constructive procedure. Simulations using a network with four heterogeneous manipulators illustrate the performance of the proposed controller.Peer ReviewedPostprint (author's final draft

A heuristic distributed task allocation method for multivehicle multitask problems and its application to search and rescue scenario

Using distributed task allocation methods for cooperating multivehicle systems is becoming increasingly attractive. However, most effort is placed on various specific experimental work and little has been done to systematically analyze the problem of interest and the existing methods. In this paper, a general scenario description and a system configuration are first presented according to search and rescue scenario. The objective of the problem is then analyzed together with its mathematical formulation extracted from the scenario. Considering the requirement of distributed computing, this paper then proposes a novel heuristic distributed task allocation method for multivehicle multitask assignment problems. The proposed method is simple and effective. It directly aims at optimizing the mathematical objective defined for the problem. A new concept of significance is defined for every task and is measured by the contribution to the local cost generated by a vehicle, which underlies the key idea of the algorithm. The whole algorithm iterates between a task inclusion phase, and a consensus and task removal phase, running concurrently on all the vehicles where local communication exists between them. The former phase is used to include tasks into a vehicle’s task list for optimizing the overall objective, while the latter is to reach consensus on the significance value of tasks for each vehicle and to remove the tasks that have been assigned to other vehicles. Numerical simulations demonstrate that the proposed method is able to provide a conflict-free solution and can achieve outstanding performance in comparison with the consensus-based bundle algorithm

Coordination of multiple agents with double-integrator dynamics under generalized interaction topologies

The problem of the convergence of the consensus strategies for multiple agents with double-integrator dynamics is studied in this paper. The investigation covers two kinds of different settings. In the setting with the interaction topologies for the position and velocity information flows being modeled by different graphs, some sufficient conditions on the fixed interaction topologies are derived for the agents to reach consensus. In the setting with the interaction topologies for the position and velocity information flows being modeled by the same graph, we systematically investigate the consensus algorithm for the agents under both fixed and dynamically changing directed interaction topologies. Specifically, for the fixed case, a necessary and sufficient condition on the interaction topology is established for the agents to reach (average) consensus under certain assumptions. For the dynamically changing case, some sufficient conditions are obtained for the agents to reach consensus, where the condition imposed on the dynamical topologies is shown to be more relaxed than that required in the existing literature. Finally, we demonstrate the usefulness of the theoretical findings through some numerical examples

Coordination of multiple agents with double-integrator dynamics under generalized interaction topologies

The problem of the convergence of the consensus strategies for multiple agents with double-integrator dynamics is studied in this paper. The investigation covers two kinds of different settings. In the setting with the interaction topologies for the position and velocity information flows being modeled by different graphs, some sufficient conditions on the fixed interaction topologies are derived for the agents to reach consensus. In the setting with the interaction topologies for the position and velocity information flows being modeled by the same graph, we systematically investigate the consensus algorithm for the agents under both fixed and dynamically changing directed interaction topologies. Specifically, for the fixed case, a necessary and sufficient condition on the interaction topology is established for the agents to reach (average) consensus under certain assumptions. For the dynamically changing case, some sufficient conditions are obtained for the agents to reach consensus, where the condition imposed on the dynamical topologies is shown to be more relaxed than that required in the existing literature. Finally, we demonstrate the usefulness of the theoretical findings through some numerical examples

Consensus control in robot networks and cooperative teleoperation : an operational space approach

An interesting approach in cooperative control is to design distributed control strategies which use only local information so that a multi-agent system achieves specified behaviors. A basic behavior in cooperative control is the consensus. Given a multi-agent system, like a multiple robot network, it is said that the agents reach a consensus if the state of each agent converges to a common state. Examples of cooperative tasks in which consensus algorithms are employed include formation control, flocking theory, rendezvous problems and synchronization. These cooperative tasks have several possible applications, like: transportation systems (intelligent highways, air-traffic control); military systems (formation flight, surveillance, reconnaissance, cooperative attack and rendezvous) and mobile sensor networks (space-based interferometers, environmental sampling). The solution to the consensus problems involves the design of control algorithms such that the agents can reach an agreement on their states. There are two main problems that are studied in consensus, the leader-follower consensus and the leaderless consensus. In the leader-follower consensus problem, there exists a leader that specifies the state for the whole group while in a leaderless consensus problem, there is not a priori reference state. The main goal of this thesis is the design of operational space controllers that solve the leader-follower and the leaderless consensus problems in networks composed of multiple heterogeneous robots. Furthermore, this document proposes novel operational space control schemes for bilateral teleoperation systems. In both scenarios, different conditions are studied, such as the absence of robot velocity measurements, constant and variable time-delays in the robot's interconnection, and uncertainty in the robot's physical parameters. Most of the previous consensus control algorithms, only work with the position or orientation but not with both. On the contrary, this dissertation deals with the entire pose of the robots that contains both the position and the orientation. Moreover, in order to render a singularity-free description of the orientation, the unit-quaternions are employed. The dissertation provides a rigorous stability analysis of the control algorithms and presents simulations and experiments that validate the effectiveness of the proposed controllers.Un enfoque interesante en el control cooperativo es el diseño de estrategias de control distribuido que requieran sólo información local para que un sistema multi-agente logre comportamientos específicos. Un comportamiento básico del control cooperativo es el consenso. Dado un sistema multi-agente, como una red de múltiples robots, se dice que los agentes llegan a un consenso si el estado de cada agente converge a un estado común. Algunos ejemplos de tareas cooperativas en las que los algoritmos de consenso son utilizados son los siguientes: el control de la formación, flocking, rendezvous y sincronización. Estas tareas cooperativas tienen varias aplicaciones posibles, como: sistemas de transporte (carreteras inteligentes , control de tráfico aéreo); sistemas militares (vuelo en formación, vigilancia, reconocimiento, ataque cooperativo) y redes de sensores móviles (interferómetros en el espacio, el muestreo del ambiente). La solución a los problemas de consenso implica el diseño de algoritmos de control de tal manera que los agentes pueden llegar a un acuerdo sobre sus estados. Hay dos problemas principales que se estudian en el consenso, el consenso líder-seguidor y el consenso sin líder. En el problema de consenso líder-seguidor, existe un líder que especifica el estado de todo el grupo, mientras que en un problema de consenso sin líder, no hay ningún estado de referencia definido a priori. El objetivo principal de esta tesis es el diseño de controladores en el espacio operacional que resuelvan los problemas de consenso líder-seguidor y sin líder en redes compuestas de múltiples robots heterogéneos. Además, este documento propone novedosos esquemas de control en el espacio operacional para sistemas de teleoperación bilateral. En ambos escenarios, se estudian diferentes condiciones, tales como la ausencia de medidas de velocidad de los robots, retardos constantes y variables en la interconexión de los robots y la incertidumbre en los parámetros físicos de los robots. La mayoría de los anteriores algoritmos de control que resuelven el consenso, sólo trabajan con la posición o la orientación, pero no con ambos. Por el contrario, esta tesis doctoral se ocupa de toda la pose de los robots que contiene tanto la posición y la orientación. Por otra parte, a fin de usar una representación de la orientación libre de singularidades, se emplean los cuaterniones unitarios. Esta tesis doctoral proporciona un análisis riguroso de la estabilidad de los algoritmos de control y presenta simulaciones y experimentos que validan la eficacia de los controladores propuesto

Distributed Control of Networked Nonlinear Euler-Lagrange Systems

Motivated by recent developments in formation and cooperative control of networked multi-agent systems, the main goal of this thesis is development of efficient synchronization and formation control algorithms for distributed control of networked nonlinear systems whose dynamics can be described by Euler-Lagrange (EL) equations. One of the main challenges in the design of the formation control algorithm is its optimality and robustness to parametric uncertainties, external disturbances and ability to reconfigure in presence of component, actuator, or sensor faults. Furthermore, the controller should be capable of handling switchings in the communication network topology. In this work, nonlinear optimal control techniques are studied for developing distributed controllers for networked EL systems. An individual cost function is introduced to design a controller that relies on only local information exchanges among the agents. In the development of the controller, it is assumed that the communication graph is not fixed (in other words the topology is switching). Additionally, parametric uncertainties and faults in the EL systems are considered and two approaches, namely adaptive and robust techniques are introduced to compensate for the effects of uncertainties and actuator faults. Next, a distributed H_infinity performance measure is considered to develop distributed robust controllers for uncertain networked EL systems. The developed distributed controller is obtained through rigorous analysis and by considering an individual cost function to enhance the robustness of the controllers in presence of parametric uncertainties and external bounded disturbances. Moreover, a rigorous analysis is conducted on the performance of the developed controllers in presence of actuator faults as well as fault diagnostic and identification (FDI) imperfections. Next, synchronization and set-point tracking control of networked EL systems are investigated in presence of three constraints, namely, (i) input saturation constraints, (ii) unavailability of velocity feedback, and (iii) lack of knowledge on the system parameters. It is shown that the developed distributed controllers can accomplish the desired requirements and specification under the above constraints. Finally, a quaternion-based approach is considered for the attitude synchronization and set-point tracking control problem of formation flying spacecraft. Employing the quaternion in the control law design enables handling large rotations in the spacecraft attitude and, therefore, any singularities in the control laws are avoided. Furthermore, using the quaternion also enables one to guarantee boundedness of the control signals both with and without velocity feedback