In this paper, we address the problem of decentralized visibility-based target tracking for a team of mobile observers trying to track a team of mobile targets. Based on the results of previous work, we address the problem when the graph that models the communication network within the team of the obsrevers is not complete. We propose a hierarchical approach. At the upper level, each observer is allocated to a target through a local minimum cost matching. At the lower level, each observer computes its navigation strategy based on the results of the single observer-single target problem, thereby, decomposing a large multi-agent problem into several 2- agent problems. Finally, we evaluate the performance of the proposed strategy in simulations and experiments.
Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks.
You are receiving this notice because your organization may not have SPIE eBooks access.*
*Shibboleth/Open Athens users─please
sign in
to access your institution's subscriptions.
To obtain this item, you may purchase the complete book in print or electronic format on
SPIE.org.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
PERSONAL Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.