Abstraction and Control for Groups of Robots

This paper addresses the general problem of controlling a large number of robots required to move as a group. We propose an abstraction based on the definition of a map from the configuration space Q of the robots to a lower dimensional manifold A, whose dimension is independent of the number of robots. In this paper, we focus on planar fully actuated robots. We require that the manifold has a product structure A = G x S, where G is a Lie group, which captures the position and orientation of the ensemble in the chosen world coordinate frame, and S is a shape manifold, which is an intrinsic characterization of the team describing the “shape” as the area spanned by the robots. We design decoupled controllers for the group and shape variables. We derive controllers for individual robots that guarantee the desired behavior on A. These controllers can be realized by feedback that depends only on the current state of the robot and the state of the manifold A. This has the practical advantage of reducing the communication and sensing that is required and limiting the complexity of individual robot controllers, even for large numbers of robots

Formation of Multiple Groups of Mobile Robots Using Sliding Mode Control

Formation control of multiple groups of agents finds application in large area navigation by generating different geometric patterns and shapes, and also in carrying large objects. In this paper, Centroid Based Transformation (CBT) \cite{c39}, has been applied to decompose the combined dynamics of wheeled mobile robots (WMRs) into three subsystems: intra and inter group shape dynamics, and the dynamics of the centroid. Separate controllers have been designed for each subsystem. The gains of the controllers are such chosen that the overall system becomes singularly perturbed system. Then sliding mode controllers are designed on the singularly perturbed system to drive the subsystems on sliding surfaces in finite time. Negative gradient of a potential based function has been added to the sliding surface to ensure collision avoidance among the robots in finite time. The efficacy of the proposed controller is established through simulation results.Comment: 8 pages, 5 figure

Reactive Trajectory Generation in an Unknown Environment

Autonomous trajectory generation for unmanned aerial vehicles (UAVs) in unknown environments continues to be an important research area as UAVs become more prolific. We define a trajectory generation algorithm for a vehicle in an unknown environment with wind disturbances, that relies only on the vehicle's on-board distance sensors and communication with other vehicles within a finite region to generate a smooth, collision-free trajectory up to the fourth derivative. The proposed trajectory generation algorithm can be used in conjunction with high-level planners and low-level motion controllers. The algorithm provides guarantees that the trajectory does not violate the vehicle's thrust limitation, sensor constraints, or a user-defined clearance radius around other vehicles and obstacles. Simulation results of a quadrotor moving through an unknown environment with a moving obstacle demonstrates the trajectory generation performance.Comment: Revised version with minor text updates and more representative simulation results for IROS 2017 conferenc

Robust Decentralized Abstractions for Multiple Mobile Manipulators

This paper addresses the problem of decentralized abstractions for multiple mobile manipulators with 2nd order dynamics. In particular, we propose decentralized controllers for the navigation of each agent among predefined regions of interest in the workspace, while guaranteeing at the same time inter-agent collision avoidance and connectivity maintenance for a subset of initially connected agents. In that way, the motion of the coupled multi-agent system is abstracted into multiple finite transition systems for each agent, which are then suitable for the application of temporal logic-based high level plans. The proposed methodology is decentralized, since each agent uses local information based on limited sensing capabilities. Finally, simulation studies verify the validity of the approach.Comment: Accepted for publication in the IEEE Conference on Decision and Control, Melbourne, Australia, 201

Coverage and Field Estimation on Bounded Domains by Diffusive Swarms

In this paper, we consider stochastic coverage of bounded domains by a diffusing swarm of robots that take local measurements of an underlying scalar field. We introduce three control methodologies with diffusion, advection, and reaction as independent control inputs. We analyze the diffusion-based control strategy using standard operator semigroup-theoretic arguments. We show that the diffusion coefficient can be chosen to be dependent only on the robots' local measurements to ensure that the swarm density converges to a function proportional to the scalar field. The boundedness of the domain precludes the need to impose assumptions on decaying properties of the scalar field at infinity. Moreover, exponential convergence of the swarm density to the equilibrium follows from properties of the spectrum of the semigroup generator. In addition, we use the proposed coverage method to construct a time-inhomogenous diffusion process and apply the observability of the heat equation to reconstruct the scalar field over the entire domain from observations of the robots' random motion over a small subset of the domain. We verify our results through simulations of the coverage scenario on a 2D domain and the field estimation scenario on a 1D domain.Comment: To appear in the proceedings of the 55th IEEE Conference on Decision and Control (CDC 2016

Dynamic Control of Mobile Multirobot Systems: The Cluster Space Formulation

The formation control technique called cluster space control promotes simplified specification and monitoring of the motion of mobile multirobot systems of limited size. Previous paper has established the conceptual foundation of this approach and has experimentally verified and validated its use for various systems implementing kinematic controllers. In this paper, we briefly review the definition of the cluster space framework and introduce a new cluster space dynamic model. This model represents the dynamics of the formation as a whole as a function of the dynamics of the member robots. Given this model, generalized cluster space forces can be applied to the formation, and a Jacobian transpose controller can be implemented to transform cluster space compensation forces into robot-level forces to be applied to the robots in the formation. Then, a nonlinear model-based partition controller is proposed. This controller cancels out the formation dynamics and effectively decouples the cluster space variables. Computer simulations and experimental results using three autonomous surface vessels and four land rovers show the effectiveness of the approach. Finally, sensitivity to errors in the estimation of cluster model parameters is analyzed.Fil: Mas, Ignacio Agustin. Instituto Tecnológico de Buenos Aires; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; ArgentinaFil: Kitts, Christopher. Santa Clara University; Estados Unido

Optimal scheduling for refueling multiple autonomous aerial vehicles

The scheduling, for autonomous refueling, of multiple unmanned aerial vehicles (UAVs) is posed as a combinatorial optimization problem. An efficient dynamic programming (DP) algorithm is introduced for finding the optimal initial refueling sequence. The optimal sequence needs to be recalculated when conditions change, such as when UAVs join or leave the queue unexpectedly. We develop a systematic shuffle scheme to reconfigure the UAV sequence using the least amount of shuffle steps. A similarity metric over UAV sequences is introduced to quantify the reconfiguration effort which is treated as an additional cost and is integrated into the DP algorithm. Feasibility and limitations of this novel approach are also discussed

Experiments in the coordination of large groups of robots

The use of large groups of robots, generally called swarms, has gained increased attention in recent years. In this paper, we present and experimentally validate an algorithm that allows a swarm of robots to navigate in an environment containing unknown obstacles. A coordination mechanism based on dynamic role assignment and local communication is used to help robots that may get stuck in regions of local minima. Experiments were performed using both a realistic simulator and a group of real robots and the obtained results showed the feasibility of the proposed approach

Clustering-Based Robot Navigation and Control

In robotics, it is essential to model and understand the topologies of configuration spaces in order to design provably correct motion planners. The common practice in motion planning for modelling configuration spaces requires either a global, explicit representation of a configuration space in terms of standard geometric and topological models, or an asymptotically dense collection of sample configurations connected by simple paths. In this short note, we present an overview of our recent results that utilize clustering for closing the gap between these two complementary approaches. Traditionally an unsupervised learning method, clustering offers automated tools to discover hidden intrinsic structures in generally complex-shaped and high-dimensional configuration spaces of robotic systems. We demonstrate some potential applications of such clustering tools to the problem of feedback motion planning and control. In particular, we briefly present our use of hierarchical clustering for provably correct, computationally efficient coordinated multirobot motion design, and we briefly describe how robot-centric Voronoi diagrams can be used for provably correct safe robot navigation in forest-like cluttered environments, and for provably correct collision-free coverage and congestion control of heterogeneous disk-shaped robots.For more information: Kod*la