Search

Inverse kinematics is a fundamental technique for motion and positioning control in robotics, typically applied to end-effectors. In this paper, we extend the concept of inverse kinematics to guiding vector fields for path following in autonomous mobile robots. The desired path is defined by its implicit equation, i.e., by a collection of points belonging to one or more zero-level sets. These level sets serve as a reference to construct an error signal that drives the guiding vector field toward the desired path, enabling the robot to converge and travel along the path by following such a vector field. We start with the formal exposition on how inverse kinematics can be applied to guiding vector fields for single-integrator robots in an m-dimensional Euclidean space. Then, we leverage inverse kinematics to ensure that the level-set error signal behaves as a linear system, facilitating control over the robot's transient motion toward the desired path and allowing for the injection of feed-forward signals to induce precise motion behavior along the path. We then propose solutions to the theoretical and practical challenges of applying this technique to unicycles with constant speeds to follow 2D paths with precise transient control. We finish by validating the predicted theoretical results through real flights with fixed-wing drones., Comment: Yu Zhou and Jes\'us Bautista contributed equally to this work. In the proceedings of the IEEE International Conference on Robotics and Automation (ICRA) 2025

We propose a self-contained, resilient and fully distributed solution for locating the maximum of an unknown 3D scalar field using a swarm of robots that travel at constant speeds. Unlike conventional reactive methods relying on gradient information, our methodology enables the swarm to determine an ascending direction so that it approaches the source with arbitrary precision. Our source-seeking solution consists of three algorithms. The first two algorithms run sequentially and distributively at a high frequency providing barycentric coordinates and the ascending direction respectively to the individual robots. The third algorithm is the individual control law for a robot to track the estimated ascending direction. We show that the two algorithms with higher frequency have an exponential convergence to their eventual values since they are based on the standard consensus protocol for first-order dynamical systems; their high frequency depends on how fast the robots travel through the scalar field. The robots are not constrained to any particular geometric formation, and we study both discrete and continuous distributions of robots within swarm shapes. The shape analysis reveals the resiliency of our approach as expected in robot swarms, i.e., by amassing robots we ensure the source-seeking functionality in the event of missing or misplaced individuals or even if the robot network splits into two or more disconnected subnetworks. In addition, we also enhance the robustness of the algorithm by presenting conditions for \emph{optimal} swarm shapes, in the sense that the ascending directions can be closely parallel to the field's gradient. We exploit such an analysis so that the swarm can adapt to unknown environments by morphing its shape and maneuvering while still following an ascending direction., Comment: 15 pages, submitted version to T-RO. This version does not contain the field experiments. arXiv admin note: text overlap with arXiv:2309.02937

We present an algorithm to solve the problem of locating the source, or maxima, of a scalar field using a robot swarm. We demonstrate how the robot swarm determines its direction of movement to approach the source using only field intensity measurements taken by each robot. In contrast with the current literature, our algorithm accommodates a generic (non-degenerate) geometry for the swarm's formation. Additionally, we rigorously show the effectiveness of the algorithm even when the dynamics of the robots are complex, such as a unicycle with constant speed. Not requiring a strict geometry for the swarm significantly enhances its resilience. For example, this allows the swarm to change its size and formation in the presence of obstacles or other real-world factors, including the loss or addition of individuals to the swarm on the fly. For clarity, the article begins by presenting the algorithm for robots with free dynamics. In the second part, we demonstrate the algorithm's effectiveness even considering non-holonomic dynamics for the robots, using the vector field guidance paradigm. Finally, we verify and validate our algorithm with various numerical simulations.

This technical note aims to introduce geometric controllers to roboticists for aligning \emph{3D robots} with non-constant 3D vector fields. This alignment entails the control of the robot's 3D attitude. We derive with excessive detail all the calculations needed for the analysis and implementation of the controllers., Comment: Technical note/tutorial, 11 pages

Unlike the case with identical neighboring agents whose actions are mirrored, the problem of distributed formation control design with heterogeneous sensing is not straightforward. In this paper, we consider the problem of distributed formation control where each agent can only control distances or bearings with its neighbors. We firstly develop a rigidity theory with heterogeneous sensing to ensure that the desired shape is well-posed. Secondly, we propose an iterative method that allows us to scale up the number of agents with heterogeneous sensing. Finally, numerical simulations show the effectiveness of our method., Comment: 11 pages, 7 figures

This paper focuses on coordinating a robot swarm orbiting a convex path without collisions among the individuals. The individual robots lack braking capabilities and can only adjust their courses while maintaining their constant but different speeds. Instead of controlling the spatial relations between the robots, our formation control algorithm aims to deploy a dense robot swarm that mimics the behavior of tornado schooling fish. To achieve this objective safely, we employ a combination of a scalable overtaking rule, a guiding vector field, and a control barrier function with an adaptive radius to facilitate smooth overtakes. The decision-making process of the robots is distributed, relying only on local information. Practical applications include defensive structures or escorting missions with the added resiliency of a swarm without a centralized command. We provide a rigorous analysis of the proposed strategy and validate its effectiveness through numerical simulations involving a high density of unicycles., Comment: 7 pages, ICRA 2024

We present a solution for locating the source, or maximum, of an unknown scalar field using a swarm of mobile robots. Unlike relying on the traditional gradient information, the swarm determines an ascending direction to approach the source with arbitrary precision. The ascending direction is calculated from measurements of the field strength at the robot locations and their relative positions concerning the centroid. Rather than focusing on individual robots, we focus the analysis on the density of robots per unit area to guarantee a more resilient swarm, i.e., the functionality remains even if individuals go missing or are misplaced during the mission. We reinforce the robustness of the algorithm by providing sufficient conditions for the swarm shape so that the ascending direction is almost parallel to the gradient. The swarm can respond to an unexpected environment by morphing its shape and exploiting the existence of multiple ascending directions. Finally, we validate our approach numerically with hundreds of robots. The fact that a large number of robots always calculate an ascending direction compensates for the loss of individuals and mitigates issues arising from the actuator and sensor noises., Comment: 7 pages, CDC 2024, accepted version

We propose coordinating guiding vector fields to achieve two tasks simultaneously with a team of robots: first, the guidance and navigation of multiple robots to possibly different paths or surfaces typically embedded in 2D or 3D; second, their motion coordination while tracking their prescribed paths or surfaces. The motion coordination is defined by desired parametric displacements between robots on the path or surface. Such a desired displacement is achieved by controlling the virtual coordinates, which correspond to the path or surface's parameters, between guiding vector fields. Rigorous mathematical guarantees underpinned by dynamical systems theory and Lyapunov theory are provided for the effective distributed motion coordination and navigation of robots on paths or surfaces from all initial positions. As an example for practical robotic applications, we derive a control algorithm from the proposed coordinating guiding vector fields for a Dubins-car-like model with actuation saturation. Our proposed algorithm is distributed and scalable to an arbitrary number of robots. Furthermore, extensive illustrative simulations and fixed-wing aircraft outdoor experiments validate the effectiveness and robustness of our algorithm., Comment: Evolved paper from arXiv:2103.12372. Accepted to IEEE Transactions on Robotics. Supplementary video: https://www.bilibili.com/video/BV16e4y147xp/

In this paper, we present an online planning-scheduling approach for battery-powered autonomous aerial robots. The approach consists of simultaneously planning a coverage path and scheduling onboard computational tasks. We further derive a novel variable coverage motion robust to airborne constraints and an empirically motivated energy model. The model includes the energy contribution of the schedule based on an automatic computational energy modeling tool. Our experiments show how an initial flight plan is adjusted online as a function of the available battery, accounting for uncertainty. Our approach remedies possible in-flight failure in case of unexpected battery drops, e.g., due to adverse atmospheric conditions, and increases the overall fault tolerance., Comment: 8 pages, 6 figures, IROS'22

We present three classes of distributed formation controllers for achieving and maintaining the 2D/3D formation shape of manipulator end-effectors to cope with different scenarios due to availability of modeling parameters. We firstly present a distributed formation controller for manipulators whose system parameters are perfectly known. The formation control objective is achieved by assigning virtual springs between end-effectors and by adding damping terms at joints, which provides a clear physical interpretation of the proposed solution. Subsequently, we extend it to the case where manipulator kinematic and system parameters are not exactly known. An extra integrator and an adaptive estimator are introduced for gravitational compensation and stabilization, respectively. Simulation results with planar manipulators and with seven degree-of-freedom humanoid manipulator arms are presented to illustrate the effectiveness of the proposed approach., Comment: arXiv admin note: text overlap with arXiv:2103.14595

This article is a technical report on the two different guidance systems based on vector fields that can be found in Paparazzi, a free sw/hw autopilot. Guiding vector fields allow autonomous vehicles to track paths described by the user mathematically. In particular, we allow two descriptions of the path with an implicit or a parametric function. Each description is associated with its corresponding guiding vector field algorithm. The implementations of the two algorithms are light enough to be run in a modern microcontroller. We will cover the basic theory on how they work, how a user can implement its own paths in Paparazzi, how to exploit them to coordinate multiple vehicles, and we finish with some experimental results. Although the presented implementation is focused on fixed-wing aircraft, the guidance is also applicable to other kinds of aerial vehicles such as rotorcraft., Comment: Submitted to IMAV 2021, 5 pages

This paper proposes a novel distributed technique to induce collective motions in affine formation control. Instead of the traditional leader-follower strategy, we propose modifying the original weights that build the Laplacian matrix so that a designed steady-state motion of the desired shape emerges from the agents' local interactions. The proposed technique allows a rich collection of collective motions such as rotations around the centroid, translations, scalings, and shearings of a reference shape. These motions can be applied in useful collective behaviors such as \emph{shaped} consensus (the rendezvous with a particular shape), escorting one of the team agents, or area coverage. We prove the global stability and effectiveness of our proposed technique rigorously, and we provide some illustrative numerical simulations., Comment: 6 pages, submitted to CDC 2021

This paper addresses the problem of end-effector formation control for manipulators that are subjected to external disturbances: input disturbance torques and disturbance forces at each end-effector. The disturbances are assumed to be non-vanishing and are superposition of finite number of sinusoidal and step signals. The formation control objective is achieved by assigning virtual springs between end-effectors, by adding damping terms at joints, and by incorporating internal model-based dynamic compensators to counteract the effect of the disturbances; all of which presents a clear physical interpretation of the proposed approach. Simulation results are presented to illustrate the effectiveness of the proposed approach.

It is essential in many applications to impose a scalable coordinated motion control on a large group of mobile robots, which is efficient in tasks requiring repetitive execution, such as environmental monitoring. In this paper, we design a guiding vector field to guide multiple robots to follow possibly different desired paths while coordinating their motions. The vector field uses a path parameter as a virtual coordinate that is communicated among neighboring robots. Then, the virtual coordinate is utilized to control the relative parametric displacement between robots along the paths. This enables us to design a saturated control algorithm for a Dubins-car-like model. The algorithm is distributed, scalable, and applicable for any smooth paths in an $n$-dimensional configuration space, and global convergence is guaranteed. Simulations with up to fifty robots and outdoor experiments with fixed-wing aircraft validate the theoretical results., Comment: Accepted to 2021 IEEE International Conference on Robotics and Automation (ICRA)

This paper focuses on securing a triangular shape (up to translation) for a team of three mobile robots that uses heterogeneous sensing mechanism. Based on the available local information, each robot employs the popular gradient-based control law to attain the assigned individual task(s). In the current work, robots are assigned either distance and signed area task(s) or bearing task(s). We provide a sufficient condition on the gain ratio $R_{\text{Ad}}$ between the signed area and the distance control term such that the desired formation shape, an isosceles triangle, is reached from all feasible starting positions. Numerical simulations are provided to support the theoretical analyses., Comment: 13 pages, submitted for journal publication

Most of the existing path-following navigation algorithms cannot guarantee global convergence to desired paths or enable following self-intersected desired paths due to the existence of singular points where navigation algorithms return unreliable or even no solutions. One typical example arises in vector-field guided path-following (VF-PF) navigation algorithms. These algorithms are based on a vector field, and the singular points are exactly where the vector field diminishes. In this paper, we show that it is mathematically impossible for conventional VF-PF algorithms to achieve global convergence to desired paths that are self-intersected or even just simple closed (precisely, homeomorphic to the unit circle). Motivated by this new impossibility result, we propose a novel method to transform self-intersected or simple closed desired paths to non-self-intersected and unbounded (precisely, homeomorphic to the real line) counterparts in a higher-dimensional space. Corresponding to this new desired path, we construct a singularity-free guiding vector field on a higher-dimensional space. The integral curves of this new guiding vector field is thus exploited to enable global convergence to the higher-dimensional desired path, and therefore the projection of the integral curves on a lower-dimensional subspace converge to the physical (lower-dimensional) desired path. Rigorous theoretical analysis is carried out for the theoretical results using dynamical systems theory. In addition, we show both by theoretical analysis and numerical simulations that our proposed method is an extension combining conventional VF-PF algorithms and trajectory tracking algorithms. Finally, to show the practical value of our proposed approach for complex engineering systems, we conduct outdoor experiments with a fixed-wing airplane in windy environment to follow both 2D and 3D desired paths., Comment: Accepted for publication in IEEE Trransactions on Robotics (T-RO)

This paper focuses on the stability analysis of a formation shape displayed by a team of mobile robots that uses heterogeneous sensing mechanism. Depending on the convenience and reliability of the local information, each robot utilizes the popular gradient-based control law which, in this paper, is either the distance-based or the bearing-only formation control. For the two and three robot case, we show that the use of heterogeneous gradient-based control laws can give rise to an undesired invariant set where a distorted formation shape is moving at a constant velocity. The (in)stability of such an invariant set is dependent on the specified distance and bearing constraints. For the two robot case, we prove almost global stability of the desired equilibrium set while for the three robot case, we guarantee local asymptotic stability for the correct formation shape. We also derive conditions for the three robot case in which the undesired invariant set is locally attractive. Numerical simulations are presented for illustrating the theoretical results in the three robot case., Comment: 15 pages

Formation control of autonomous agents can be seen as a physical system of individuals interacting with local potentials, and whose evolution can be described by a Lagrangian function. In this paper, we construct and implement forced variational integrators for the formation control of autonomous agents modeled by double integrators. In particular, we provide an accurate numerical integrator with a lower computational cost than traditional solutions. We find error estimations for the rate of the energy dissipated along with the agents' motion to achieve desired formations. Consequently, this permits to provide sufficient conditions on the simulation's time step for the convergence of discrete formation control systems such as the consensus problem in discrete systems. We present practical applications such as the rapid estimation of regions of attraction to desired shapes in distance-based formation control., Comment: Submitted to IEEE. Transactions on Control of Network Systems. 12 pages

A multi-agent system designed to achieve distance-based shape control with flocking behavior can be seen as a mechanical system described by a Lagrangian function and subject to additional external forces. Forced variational integrators are given by the discretization of Lagrange-d'Alembert principle for systems subject to external forces, and have proved useful for numerical simulation studies of complex dynamical systems. We derive forced variational integrators that can be employed in the context of control algorithms for distance-based shape with velocity consensus. In particular, we provide an accurate numerical integrator with a lower computational cost than traditional solutions, while preserving the configuration space and symmetries. We also provide an explicit expression for the integration scheme in the case of an arbitrary number of agents with double integrator dynamics. For a numerical comparison of the performances, we use a planar formation consisting of three autonomous agents., Comment: Presented at IFAC World Congress 2020, 6 pages + refs

This paper proposes a novel maneuvering technique for the complex-Laplacian-based formation control. We show how to modify the original weights that build the Laplacian such that a designed steady-state motion of the desired shape emerges from the local interactions among the agents. These collective motions can be exploited to solve problems such as the shaped consensus (the rendezvous with a particular shape), the enclosing of a target, or translations with controlled speed and heading to assist mobile robots in area coverage, escorting, and traveling missions, respectively. The designed steady-state collective motions correspond to rotations around the centroid, translations, and scalings of a reference shape. The proposed modification of the weights relocates one of the Laplacian's zero eigenvalues while preserving its associated eigenvector that constructs the desired shape. For example, such relocation on the imaginary or real axis induces rotational and scaling motions, respectively. We will show how to satisfy a sufficient condition to guarantee the global convergence to the desired shape and motions. Finally, we provide simulations and comparisons with other maneuvering techniques., Comment: Automatica, 8 pages

In this paper, we first propose a novel maneuvering technique compatible with displacement-consensus-based formation controllers. We show that the formation can be translated with an arbitrary velocity by modifying the weights in the consensus Laplacian matrix. In fact, we demonstrate that the displacement-consensus-based formation control is a particular case of our more general method. We then uncover robustness issues with undesired steady-state motions and resultant distorted shapes in undirected displacement-consensus-based formation control. In particular, these issues are triggered when neighboring agents mismeasure their relative positions, e.g., their onboard sensors are misaligned and have different scale factors. We will show that if all the sensing is close to perfect but different among the agents, then the stability of the system is compromised. Explicit expressions for the eventual non-desired velocity and shape's distortion are given as functions of the scale factors and misalignments for formations based on tree graphs., Comment: Submitted and provisionally accepted in IEEE Trans. Automatic Control, 8 pages

In this letter, we investigate the formation control problem of mobile robots moving in the plane where, instead of assuming robots to be simple points, each robot is assumed to have the form of a disk with equal radius. Based on interior angle measurements of the neighboring robots' disk, which can be obtained from low-cost vision sensors, we propose a gradient-based distributed control law and show the exponential convergence property of the associated error system. By construction, the proposed control law has the appealing property of ensuring collision avoidance between neighboring robots. We also present simulation results for {a team} of four circular mobile robots forming a rectangular shape., Comment: 6 pages, submitted to the 59th IEEE Conf. Dec. Control and IEEE Control Systems Letters

Vector field guided path following (VF-PF) algorithms are fundamental in robot navigation tasks, but may not deliver the desirable performance when robots encounter singular points where the vector field becomes zero. The existence of singular points prevents the global convergence of the vector field's integral curves to the desired path. Moreover, VF-PF algorithms, as well as most of the existing path following algorithms, fail to enable following a self-intersected desired path. In this paper, we show that such failures are fundamentally related to the mathematical topology of the path, and that by "stretching" the desired path along a virtual dimension, one can remove the topological obstruction. Consequently, this paper proposes a new guiding vector field defined in a higher-dimensional space, in which self-intersected desired paths become free of self-intersections; more importantly, the new guiding vector field does not have any singular points, enabling the integral curves to converge globally to the "stretched" path. We further introduce the extended dynamics to retain this appealing global convergence property for the desired path in the original lower-dimensional space. Both simulations and experiments are conducted to verify the theory., Comment: Accepted by 2020 IEEE 59th Conference on Decision and Control (CDC). This is the full version

We consider the localization problem between agents while they run a formation control algorithm. These algorithms typically demand from the agents the information about their relative positions with respect to their neighbors. We assume that this information is not available. Therefore, the agents need to solve the observability problem of reconstructing their relative positions based on other measurements between them. We first model the relative kinematics between the agents as a left-invariant control system so that we can exploit its appealing properties to solve the observability problem. Then, as a particular application, we will focus on agents running a distance-based control algorithm where their relative positions are not accessible but the distances between them are., Comment: Accepted paper for CDC conference 2019

We propose a combined method for the collaborative transportation of a suspended payload by a team of rotorcraft. A recent distance-based formation-motion control algorithm based on assigning distance disagreements among robots generates the acceleration signals to be tracked by the vehicles. In particular, the proposed method does not need global positions nor tracking prescribed trajectories for the motion of the members of the team. The acceleration signals are followed accurately by an Incremental Nonlinear Dynamic Inversion controller designed for rotorcraft that measures and resists the tensions from the payload. Our approach allows us to analyze the involved accelerations and forces in the system so that we can calculate the worst case conditions explicitly to guarantee a nominal performance, provided that the payload starts at rest in the 2D centroid of the formation, and it is not under significant disturbances. For example, we can calculate the maximum safe deformation of the team with respect to its desired shape. We demonstrate our method with a team of four rotorcraft carrying a suspended object two times heavier than the maximum payload for an individual. Last but not least, our proposed algorithm is available for the community in the open-source autopilot Paparazzi., Comment: ICRA 2019, 6+1 pages

This paper considers a collaborative tracking control problem using a group of fixed-wing unmanned aerial vehicles (UAVs) with constant and non-identical speeds. The dynamics of fixed-wing UAVs are modelled by unicycle-type equations with nonholonomic constraints, assuming that UAVs fly at constant altitudes in the nominal operation mode. The controller is designed such that all fixed-wing UAVs as a group can collaboratively track a desired target's position and velocity. We first present conditions on the relative speeds of tracking UAVs and the target to ensure that the tracking objective can be achieved when UAVs are subject to constant speed constraints. We construct a reference velocity that includes both the target's velocity and position as feedback, which is to be tracked by the group centroid. In this way, all vehicles' headings are controlled such that the group centroid follows a reference trajectory that successfully tracks the target's trajectory. A spacing controller is further devised to ensure that all vehicles stay close to the group centroid trajectory. Trade-offs in the controller design and performance limitations of the target tracking control due to the constant-speed constraint are also discussed in detail. Experimental results with three fixed-wing UAVs tracking a target rotorcraft are provided., Comment: 33 pages (single column). To be published in the AIAA Journal of Guidance, Dynamics, and Control

In this paper, we present the design and implementation of a robust motion formation distributed control algorithm for a team of mobile robots. The primary task for the team is to form a geometric shape, which can be freely translated and rotated at the same time. This approach makes the robots to behave as a cohesive whole, which can be useful in tasks such as collaborative transportation. The robustness of the algorithm relies on the fact that each robot employs only local measurements from a laser sensor which does not need to be off-line calibrated. Furthermore, robots do not need to exchange any information with each other. Being free of sensor calibration and not requiring a communication channel helps the scaling of the overall system to a large number of robots. In addition, since the robots do not need any off-board localization system, but require only relative positions with respect to their neighbors, it can be aimed to have a full autonomous team that operates in environments where such localization systems are not available. The computational cost of the algorithm is inexpensive and the resources from a standard microcontroller will suffice. This fact makes the usage of our approach appealing as a support for other more demanding algorithms, e.g., processing images from onboard cameras. We validate the performance of the algorithm with a team of four mobile robots equipped with low-cost commercially available laser scanners., Comment: 6 pages. ICARCV 2018

This paper investigates the stability of distance-based \textit{flexible} undirected formations in the plane. Without rigidity, there exists a set of connected shapes for given distance constraints, which is called the ambit. We show that a flexible formation can lose its flexibility, or equivalently may reduce the degrees of freedom of its ambit, if a small disturbance is introduced in the range sensor of the agents. The stability of the disturbed equilibrium can be characterized by analyzing the eigenvalues of the linearized augmented error system. Unlike infinitesimally rigid formations, the disturbed desired equilibrium can be turned unstable regardless of how small the disturbance is. We finally present two examples of how to exploit these disturbances as design parameters. The first example shows how to combine rigid and flexible formations such that some of the agents can move freely in the desired and locally stable ambit. The second example shows how to achieve a specific shape with fewer edges than the necessary for the standard controller in rigid formations., Comment: To appear CDC 2018, 6 pages

In this paper, we discuss quantization effects in rigid formation control systems when target formations are described by inter-agent distances. Because of practical sensing and measurement constraints, we consider in this paper distance measurements in their quantized forms. We show that under gradient-based formation control, in the case of uniform quantization, the distance errors converge locally to a bounded set whose size depends on the quantization error, while in the case of logarithmic quantization, all distance errors converge locally to zero. A special quantizer involving the signum function is then considered with which all agents can only measure coarse distances in terms of binary information. In this case, the formation converges locally to a target formation within a finite time. Lastly, we discuss the effect of asymmetric uniform quantization on rigid formation control., Comment: 29 pages, International Journal of Robust and Nonlinear Control 2018

In this paper we introduce the usage of guidance vector fields for the coordination and formation flight of fixed-wing aircraft. In particular, we describe in detail the technological implementation of the formation flight control for a fully distributed execution of the algorithm by employing the open-source project Paparazzi. In this context, distributed means that each aircraft executes the algorithm on board, each aircraft only needs information about its neighbors, and the implementation is straightforwardly scalable to an arbitrary number of vehicles, i.e., the needed resources such as memory or computational power not necessarily scale with the number of total aircraft. The coordination is based on commanding the aircraft to track circumferences with different radii but sharing the same center. Consequently, the vehicles will travel different distances but with the same speeds in order to control their relative angles in the circumference, i.e., their orbital velocities. We show the effectiveness of the proposed design with actual formation flights during the drone parade in IMAV2017., Comment: IMAV 2017 Conference, 6 pages

In formation control, triangular formations consisting of three autonomous agents serve as a class of benchmarks that can be used to test and compare the performances of different controllers. We present an algorithm that combines the advantages of both position- and distance-based gradient descent control laws. For example, only two pairs of neighboring agents need to be controlled, agents can work in their own local frame of coordinates and the orientation of the formation with respect to a global frame of coordinates is not prescribed. We first present a novel technique based on adding artificial biases to neighboring agents' range sensors such that their eventual positions correspond to a collinear configuration. Right after, a small modification in the bias terms by introducing a prescribed rotation matrix will allow the control of the bearing of the neighboring agents., Comment: 7 pages, accepted in the 20th World Congress of the International Federation of Automatic Control (IFAC)

This paper presents a distributed algorithm for controlling the deployment of a team of mobile agents in formations whose shapes can be characterized by a broad class of polygons, including regular ones, where each agent occupies a corner of the polygon. The algorithm shares the appealing properties of the popular distance-based rigid formation control, but with the additional advantage of requiring the control of fewer pairs of neighboring agents. Furthermore, the scale of the polygon can be controlled by only one pair of neighboring agents. We also exploit the exponential stability of the controlled formation in order to steer the formation as a whole with translations and rotations in a prescribed way. We provide both theoretical analysis and illustrative simulations., Comment: 6 pages. Accepted in the 2007 IFAC World Congress

In this paper we propose an algorithm for stabilizing circular formations of fixed-wing UAVs with constant speeds. The algorithm is based on the idea of tracking circles with different radii in order to control the inter-vehicle phases with respect to a target circumference. We prove that the desired equilibrium is exponentially stable and thanks to the guidance vector field that guides the vehicles, the algorithm can be extended to other closed trajectories. One of the main advantages of this approach is that the algorithm guarantees the confinement of the team in a specific area, even when communications or sensing among vehicles are lost. We show the effectiveness of the algorithm with an actual formation flight of three aircraft. The algorithm is ready to use for the general public in the open-source Paparazzi autopilot., Comment: 6 pages, submitted to IROS 2017

This paper presents an algorithm for solving the problem of tracking smooth curves by a fixed wing unmanned aerial vehicle travelling with a constant airspeed and under a constant wind disturbance. The algorithm is based on the idea of following a guiding vector field which is constructed from the implicit function that describes the desired (possibly time-varying) trajectory. The output of the algorithm can be directly expressed in terms of the bank angle of the UAV in order to achieve coordinated turns. Furthermore, the algorithm can be tuned offline such that physical constraints of the UAV, e.g. the maximum bank angle, will not be violated in a neighborhood of the desired trajectory. We provide the corresponding theoretical convergence analysis and performance results from actual flights., Comment: 6 pages

A main problem in autonomous vehicles in general, and in \acp{UAV} in particular, is the determination of the attitude angles. A novel method to estimate these angles using off-the-shelf components is presented. This paper introduces an \ac{AHRS} based on the \ac{UKF} using the \ac{TRIAD} algorithm as the observation model. The performance of the method is assessed through simulations and compared to an \ac{AHRS} based on the \ac{EKF}. The paper presents field experiment results using a real fixed-wing \ac{UAV}. The results show good real-time performance with low computational cost in a microcontroller., Comment: 10 pages

Recently it has been reported that biased range-measurements among neighboring agents in the gradient distance-based formation control can lead to predictable collective motion. In this paper we take advantage of this effect and by introducing distributed parameters to the prescribed inter-distances we are able to manipulate the steady-state motion of the formation. This manipulation is in the form of inducing simultaneously the combination of constant translational and angular velocities and a controlled scaling of the rigid formation. While the computation of the distributed parameters for the translational and angular velocities is based on the well-known graph rigidity theory, the parameters responsible for the scaling are based on some recent findings in bearing rigidity theory. We carry out the stability analysis of the modified gradient system and simulations in order to validate the main result., Comment: 6 pages In proceedings 55th Conference on Decision and Control, year 2016

Despite the great success of using gradient-based controllers to stabilize rigid formations of autonomous agents in the past years, surprising yet intriguing undesirable collective motions have been reported recently when inconsistent measurements are used in the agents' local controllers. To make the existing gradient control robust against such measurement inconsistency, we exploit local estimators following the well known internal model principle for robust output regulation control. The new estimator-based gradient control is still distributed in nature and can be constructed systematically even when the number of agents in a rigid formation grows. We prove rigorously that the proposed control is able to guarantee exponential convergence and then demonstrate through robotic experiments and computer simulations that the reported inconsistency-induced orbits of collective movements are effectively eliminated., Comment: 10 pages

Recently it has been reported that range-measurement inconsistency, or equivalently mismatches in prescribed inter-agent distances, may prevent the popular gradient controllers from guiding rigid formations of mobile agents to converge to their desired shape, and even worse from standing still at any location. In this paper, instead of treating mismatches as the source of ill performance, we take them as design parameters and show that by introducing such a pair of parameters per distance constraint, distributed controller achieving simultaneously both formation and motion control can be designed that not only encompasses the popular gradient control, but more importantly allows us to achieve constant collective translation, rotation or their combination while guaranteeing asymptotically no distortion in the formation shape occurs. Such motion control results are then applied to (a) the alignment of formations orientations and (b) enclosing and tracking a moving target. Besides rigorous mathematical proof, experiments using mobile robots are demonstrated to show the satisfying performances of the proposed formation-motion distributed controller., Comment: 14 pages

This paper presents the analysis on the influence of distance mismatches on the standard gradient-based rigid formation control for second-order agents. It is shown that, similar to the first-order case as recently discussed in the literature, these mismatches introduce two undesired group behaviors: a distorted final shape and a steady-state motion of the group formation. We show that such undesired behaviors can be eliminated by combining the standard formation control law with distributed estimators. Finally, we show how the mismatches can be effectively employed as design parameters in order to control a combined translational and rotational motion of the formation., Comment: 14 pages, conditionally accepted in Automatic Control, IEEE Transactions on