1,550 research outputs found

    Dynamic Control of Mobile Multirobot Systems: The Cluster Space Formulation

    Get PDF
    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

    Coordinated Robot Navigation via Hierarchical Clustering

    Get PDF
    We introduce the use of hierarchical clustering for relaxed, deterministic coordination and control of multiple robots. Traditionally an unsupervised learning method, hierarchical clustering offers a formalism for identifying and representing spatially cohesive and segregated robot groups at different resolutions by relating the continuous space of configurations to the combinatorial space of trees. We formalize and exploit this relation, developing computationally effective reactive algorithms for navigating through the combinatorial space in concert with geometric realizations for a particular choice of hierarchical clustering method. These constructions yield computationally effective vector field planners for both hierarchically invariant as well as transitional navigation in the configuration space. We apply these methods to the centralized coordination and control of nn perfectly sensed and actuated Euclidean spheres in a dd-dimensional ambient space (for arbitrary nn and dd). Given a desired configuration supporting a desired hierarchy, we construct a hybrid controller which is quadratic in nn and algebraic in dd and prove that its execution brings all but a measure zero set of initial configurations to the desired goal with the guarantee of no collisions along the way.Comment: 29 pages, 13 figures, 8 tables, extended version of a paper in preparation for submission to a journa

    Fast multipole networks

    Full text link
    Two prerequisites for robotic multiagent systems are mobility and communication. Fast multipole networks (FMNs) enable both ends within a unified framework. FMNs can be organized very efficiently in a distributed way from local information and are ideally suited for motion planning using artificial potentials. We compare FMNs to conventional communication topologies, and find that FMNs offer competitive communication performance (including higher network efficiency per edge at marginal energy cost) in addition to advantages for mobility

    Coordination of several robots based on temporal synchronization

    Get PDF
    © 2016. This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativecommons.org/licenses/by-nc-nd/4.0/This paper proposes an approach to deal with the problem of coordinating multi-robot systems, in which each robot executes individually planned tasks in a shared workspace. The approach is a decoupled method that can coordinate the participating robots in on-line mode. The coordination is achieved through the adjustment of the time evolution of each robot along its original planned geometric path according to the movements of the other robots to assure a collision-free execution of their respective tasks. To assess the proposed approach different tests were performed in graphical simulations and real experiments.Postprint (published version
    corecore