This thesis addresses the problem of positional consensus of multi-agent systems. A positional consensus is achieved when the agents converge to a point. Some applications of this class of problem is in mid-air refueling of the aircraft or UAVs, targeting a geographical location, etc. In this research work some positional consensus algorithms have been developed. They can be categorized in two part (i) Broadcast control based algorithm (ii) Distributed control based algorithm. In case of broadcast based algorithm control strategies for a group of agents is developed to achieve positional consensus. The problem is constrained by the requirement that every agent must be given the same control input through a broadcast communication mechanism. Although the control command is computed using state information in a global framework, the control input is implemented by the agents in a local coordinate frame. The mathematical formulation has been done in a linear programming framework that is computationally less intensive than earlier proposed methods. Moreover, a random perturbation input in the control command, that helps to achieve reasonable proximity among agents even for a large number of agents, which was not possible with the existing strategy in the literature, is introduced. This method is extended to achieve positional consensus at a pre-specified location. A comparison between the LP approach and the existing SOCP based approach is also presented. Some of the algorithm has been demonstrated successfully on a robotic platform made from LEGO Mindstorms NXT Robots. In the second case of broadcast based algorithm, a decentralized algorithm for a group of multiple autonomous agents to achieve positional consensus has been developed using the broadcast concept. Even here, the mathematical formulation has done using a linear programming framework. Each agent has some sensing radius and it is capable of sensing position and orientation with other agents within their sensing region. The method is computationally feasible and easy to implement. In case of distributed algorithms, a computationally efficient distributed rendezvous algorithm for a group of autonomous agents has been developed. The algorithm uses a rectilinear decision domain (RDD), as against the circular decision domain assumed in earlier work available in the literature. This helps in reducing its computational complexity considerably. An extensive mathematical analysis has been carried out to prove the convergence of the algorithm. The algorithm has also been demonstrated successfully on a robotic platform made from LEGO Mindstorms NXT Robots.

Design of robotic cell for welding operations at specific production part including unchangeable process technology. Design of subsystems provides required functions and abilities. Risk management of entire model and its transformation into Siemens Process Simulate simulation software including creation task-cycle simulation.

[ES] Uno de los elementos más importantes en el sistema de control de un robot es su Modelo Cinemático Inverso (IKM, por sus siglas en inglés), el cual calcula las referencias de posición y velocidad requeridas para que dicho robot pueda seguir una trayectoria. Los métodos más comúnmente empleados para la síntesis del IKM de sistemas robotizados de cadena cinemática abierta dependen fuertemente de la geometría del robot, por lo que no son procedimientos sistemáticos que puedan ser aplicados uniformemente en todas las situaciones. Este proyecto presenta el desarrollo de un procedimiento sistemático para la síntesis del IKM completo de sistemas robotizados no redundantes de cadena cinemática abierta usando la teoría de Bases de Groebner, el cual no depende de la geometría del robot. Las entradas del procedimiento desarrollado son los parámetros de Denavit-Hartenberg del robot y el rango de movimiento de sus actuadores, mientras que la salida es el IKM sintetizado, listo para ser usado en el sistema de control del robot o en una simulación de su funcionamiento. El desempeño del procedimiento desarrollado fue demostrado sintetizando los IKMs de un manipulador PUMA y un hexápodo caminante. Los tiempos de ejecución de ambos IKMs son comparables con los requeridos por los modelos cinemáticos calculados por procedimientos tradicionales, y los errores de las referencias que ofrecen como salida son totalmente despreciables. Los IKMs sintetizados son completos, porque no sólo ofrecen las referencias de posición para todos los actuadores del robot, sino que también calculan las correspondientes referencias de velocidades y aceleraciones de dichos actuadores, por lo que el procedimiento desarrollado puede ser empleado en una amplia variedad de sistemas robotizados. / [CA] Un dels elements més importants en el sistema de control d'un robot és el seu Model Cinemàtic Invers (IKM, per les seues sigles en anglés), el qual calcula les referències de posició i velocitat requerides perquè aquest robot puga seguir una trajectòria. Els mètodes més comunament emprats per a la síntesi del IKM de sistemes robotitzats de cadena cinemàtica oberta depenen fortament de la geometria del robot analitzat, per la qual cosa no són procediments sistemàtics que puguen ser aplicats uniformement en totes les situacions. Aquest projecte presenta el desenvolupament d'un procediment sistemàtic per a la síntesi del IKM complet de sistemes robotitzats no redundants de cadena cinemàtica oberta usant la teoria de Bases de Groebner, el qual no depén de la geometria del robot. Les entrades del procediment desenvolupat són els paràmetres de Denavit-Hartenberg del robot i el rang de moviment dels seus actuadors, mentre que l'eixida és el IKM sintetitzat, llest per a ser usat en el sistema de control del robot o en una simulació del seu funcionament. L'acompliment del procediment desenvolupat va ser demostrat sintetitzant els IKMs d'un manipulador PUMA i un robot caminante. Els temps d'execució de tots dos IKMs són comparables amb els requerits pels models cinemàtics calculats per procediments tradicionals, i els errors de les referències que ofereixen com a eixida són totalment menyspreables. Els IKMs sintetitzats són complets, perquè no sols ofereixen les referències de posició per a tots els actuadors del robot, sinó que també calculen les corresponents referències de velocitats i acceleracions d'aquests actuadors, per la qual cosa el procediment desenvolupat pot ser emprat en una àmplia varietat de sistemes robotitzats. / [EN] One of the most important elements of a robot's control system is its Inverse Kinematic Model (IKM), which calculates the position and velocity references required by the robot's actuators to follow a trajectory. The methods that are commonly used to synthesize the IKM of open-chain robotic systems strongly depend on the geometry of the analyzed robot, so they are not systematic procedures that can be applied equally in all situations. This project presents the development of a systematic procedure to synthesize the complete IKM of non-redundant open-chain robotic systems using Groebner Basis theory, which does not depend on the robot's geometry. The inputs to the developed procedure are the robot's Denavit-Hartenberg parameters and the movement range of its actuators, while the output is the IKM, ready to be used in the robot's control system or in a simulation of its behavior. This procedure's performance was proved synthesizing the IKMs of a PUMA manipulator and a walking hexapod robot. The computation times of both IKMs are comparable to those required by the kinematic models calculated by traditional methods, while the errors of their computed references were absolutely negligible. The synthesized IKMs are complete in the sense that they not only supply the position reference for all the robot's actuators, but also the corresponding references for their velocities and accelerations, so the developed procedure can be used in a wide range of robotic systems. / Guzmán Giménez, J. (2022). Synthesis of the Complete Inverse Kinematic Model of Non-Redundant Open-Chain Robotic Systems using Groebner Basis Theory [Tesis doctoral]. Universitat Politècnica de València. https://doi.org/10.4995/Thesis/10251/181632 / TESIS

The main body of this thesis consists of six appended papers. In the  first two, different  cooperative surveillance problems are considered. The second two consider different aspects of the trajectory planning problem, while the last two deal with observer design for mobile robotic and Euler-Lagrange systems respectively.In Papers A and B,  a combinatorial optimization based framework to cooperative surveillance missions using multiple Unmanned Ground Vehicles (UGVs) is proposed. In particular, Paper A  considers the the Minimum Time UGV Surveillance Problem (MTUSP) while Paper B treats the Connectivity Constrained UGV Surveillance Problem (CUSP). The minimum time formulation is the following. Given a set of surveillance UGVs and a polyhedral area, find waypoint-paths for all UGVs such that every point of the area is visible from  a point on a waypoint-path and such that the time for executing the search in parallel is minimized.  The connectivity constrained formulation  extends the MTUSP by additionally requiring the induced information graph to be  kept recurrently connected  at the time instants when the UGVs  perform the surveillance mission.  In these two papers, the NP-hardness of  both these problems are shown and decomposition techniques are proposed that allow us to find an approximative solution efficiently in an algorithmic manner.Paper C addresses the problem of designing a real time, high performance trajectory planner for an aerial vehicle that uses information about terrain and enemy threats, to fly low and avoid radar exposure on the way to a given target. The high-level framework augments Receding Horizon Control (RHC) with a graph based terminal cost that captures the global characteristics of the environment.  An important issue with RHC is to make sure that the greedy, short term optimization does not lead to long term problems, which in our case boils down to two things: not getting into situations where a collision is unavoidable, and making sure that the destination is actually reached. Hence, the main contribution of this paper is to present a trajectory planner with provable safety and task completion properties. Direct methods for trajectory optimization are traditionally based on a priori temporal discretization and collocation methods. In Paper D, the problem of adaptive node distribution is formulated as a constrained optimization problem, which is to be included in the underlying nonlinear mathematical programming problem. The benefits of utilizing the suggested method for  online  trajectory optimization are illustrated by a missile guidance example.In Paper E, the problem of active observer design for an important class of non-uniformly observable systems, namely mobile robotic systems, is considered. The set of feasible configurations and the set of output flow equivalent states are defined. It is shown that the inter-relation between these two sets may serve as the basis for design of active observers. The proposed observer design methodology is illustrated by considering a  unicycle robot model, equipped with a set of range-measuring sensors. Finally, in Paper F, a geometrically intrinsic observer for Euler-Lagrange systems is defined and analyzed. This observer is a generalization of the observer proposed by Aghannan and Rouchon. Their contractivity result is reproduced and complemented  by  a proof  that the region of contraction is infinitely thin. Moreover, assuming a priori bounds on the velocities, convergence of the observer is shown by means of Lyapunov's direct method in the case of configuration manifolds with constant curvature. / QC 20100622 / TAIS, AURES

<p>The main body of this thesis consists of four appended papers. The first two consider different aspects of the trajectory planning problem, while the last two deal with observer design for mobile robotic and Euler-Lagrange systems respectively.</p><p>The first paper addresses the problem of designing a real time, high performance trajectory planner for aerial vehicles. The main contribution is two-fold. Firstly, by augmenting a novel safety maneuver at the end of the planned trajectory, this paper extends previous results by having provable safety properties in a 3D setting. Secondly, assuming initial feasibility, the planning method is shown to have finite time task completion. Moreover, in the second part of the paper, the problem of simultaneous arrival of multiple aerial vehicles is considered. By using a time-scale separation principle, one is able to adopt standard Laplacian control to this consensus problem, which is neither unconstrained, nor first order.</p><p>Direct methods for trajectory optimization are traditionally based on<i> a</i> <i>priori </i>temporal discretization and collocation methods. In the second paper, the problem of adaptive node distribution is formulated as a constrained optimization problem, which is to be included in the underlying nonlinear mathematical programming problem. The benefits of utilizing the suggested method for online trajectory optimization are illustrated by a missile guidance example.</p><p>In the third paper, the problem of active observer design for an important class of non-uniformly observable systems, namely mobile robotics systems, is considered. The set of feasible configurations and the set of output flow equivalent states are defined. It is shown that the inter-relation between these two sets may serve as the basis for design of active observers. The proposed observer design methodology is illustrated by considering a unicycle robot model, equipped with a set of range-measuring sensors.</p><p>Finally, in the fourth paper, a geometrically intrinsic observer for Euler-Lagrange systems is defined and analyzed. This observer is a generalization of the observer recently proposed by Aghannan and Rouchon. Their contractivity result is reproduced and complemented by a proof that the region of contraction is infinitely thin. However, assuming <i>a</i> <i>priori </i>bounds on the velocities, convergence of the observer is shown by means of Lyapunov's direct method in the case of configuration manifolds with constant curvature.</p>

The main body of this thesis consists of four appended papers. The first two consider different aspects of the trajectory planning problem, while the last two deal with observer design for mobile robotic and Euler-Lagrange systems respectively. The first paper addresses the problem of designing a real time, high performance trajectory planner for aerial vehicles. The main contribution is two-fold. Firstly, by augmenting a novel safety maneuver at the end of the planned trajectory, this paper extends previous results by having provable safety properties in a 3D setting. Secondly, assuming initial feasibility, the planning method is shown to have finite time task completion. Moreover, in the second part of the paper, the problem of simultaneous arrival of multiple aerial vehicles is considered. By using a time-scale separation principle, one is able to adopt standard Laplacian control to this consensus problem, which is neither unconstrained, nor first order. Direct methods for trajectory optimization are traditionally based on a priori temporal discretization and collocation methods. In the second paper, the problem of adaptive node distribution is formulated as a constrained optimization problem, which is to be included in the underlying nonlinear mathematical programming problem. The benefits of utilizing the suggested method for online trajectory optimization are illustrated by a missile guidance example. In the third paper, the problem of active observer design for an important class of non-uniformly observable systems, namely mobile robotics systems, is considered. The set of feasible configurations and the set of output flow equivalent states are defined. It is shown that the inter-relation between these two sets may serve as the basis for design of active observers. The proposed observer design methodology is illustrated by considering a unicycle robot model, equipped with a set of range-measuring sensors. Finally, in the fourth paper, a geometrically intrinsic observer for Euler-Lagrange systems is defined and analyzed. This observer is a generalization of the observer recently proposed by Aghannan and Rouchon. Their contractivity result is reproduced and complemented by a proof that the region of contraction is infinitely thin. However, assuming a priori bounds on the velocities, convergence of the observer is shown by means of Lyapunov's direct method in the case of configuration manifolds with constant curvature. / QC 20101108