Abstract
In this paper, we propose a computationally efficient sensor selection approach for maneuvering target tracking using a sensor network with communication bandwidth constraints, given limited prior information on the target maneuvering models. We formulate the stochastic sensor selection problem as a linear programming problem which consists of two easily implementable steps. First, the Cramér–Rao lower bound corresponding to the sensor subset is derived as the objective function of the proposed sensor selection method based on a partially observable Markov decision process. Second, the target trajectory is modeled by a function of time to enable online target tracking which is free of the conventional, a priori Markov modeling of the target dynamics. We demonstrate the effectiveness of our method through several numerical examples.
Sign-in/Register to access full text options 
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.
