Abstract
This paper focuses on the structure identification problem for a class of networked systems, where the interaction among components or agents is described through logical maps. In particular, agents are heterogeneous cooperating systems, i.e. they may have different individual dynamics and different interaction rules depending on input events. While we assume that the individual agents' dynamics are known, each agent has partial knowledge of the logical map encoding the interaction of another agent with its neighbors. Based on the so-called algebraic normal form for binary functions, we present a technique by which the network structure described by a logical function can be dynamically estimated as its truth table is observed. The estimated map is a lower approximation of the real one, which coincides with it as soon as the truth table is entirely observed. Application of the proposed technique to a real system, where agents are mobile robots whose motion depends on logical conditions on their neighborhood, is finally presented.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
