• Login
    View Item 
    •   JScholarship Home
    • Electrical and Computer Engineering, Dept. of
    • Technical Reports
    • View Item
    •   JScholarship Home
    • Electrical and Computer Engineering, Dept. of
    • Technical Reports
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Results on an Intrinsic Consensus Algorithm on SO(3) with Almost-Global Convergence

    Thumbnail
    View/Open
    CDC12-AlmostGlobalConsensus-TR.pdf (408.6Kb)
    Date
    2012
    Author
    Vidal, René
    Asfari, Bijan
    Tron, Roberto
    Metadata
    Show full item record
    Abstract
    In this paper we propose a discrete time protocol to align the states of a network of agents evolving in the space of rotations SO(3). The starting point of our work is Riemannian consensus, a general and intrinsic extension of classical consensus algorithms to Riemannian manifolds. Unfortunately, this algorithm is guaranteed to align the states only when the initial states are not too far apart. We show how to modify this algorithm so that the states of the agents can be aligned, in practice, from almost any initial condition. While we focus on the specific case of SO(3), we hope that this work will represent the first step toward more general results.
    URI
    http://jhir.library.jhu.edu/handle/1774.2/36139
    Collections
    • Technical Reports

    DSpace software copyright © 2002-2016  DuraSpace
    Policies | Contact Us | Send Feedback
    Theme by 
    Atmire NV
     

     

    Browse

    All of JScholarshipCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

    My Account

    LoginRegister

    DSpace software copyright © 2002-2016  DuraSpace
    Policies | Contact Us | Send Feedback
    Theme by 
    Atmire NV