Abstract

Target tracking is a fundamental problem in robotics research and has been the subject of detailed studies over the years. In this paper, we generate a data-driven target model from a real-world dataset of taxi motions. This model includes target motion, appearance, and disappearance from the search area. Using this target model, we introduce a new formulation of the mobile target tracking problem based on the mathematical concept of random finite sets. This formulation allows for tracking an unknown and dynamic number of mobile targets with a team of robots. We show how to employ the probability hypothesis density filter to simultaneously estimate the number of targets and their positions. Next, we present a greedy algorithm for assigning trajectories to the robots to allow them to actively track the targets. We prove that the greedy algorithm is a two-approximation for maximizing submodular tracking objective functions. We examine two such functions: the mutual information between the estimated target positions and future measurements from the robots and a new objective that maximizes the expected number of targets detected by the robot team. We provide extensive simulation evaluations to validate the performance of our data-driven motion model and to compare the behavior and tracking performance of robots using our objective functions.

Full Text
Paper version not known

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 call

Disclaimer: 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.