Abstract

Multiple-target tracking algorithms generally operate in the local frame of the sensor and have difficulty with track reallocation when targets move in and out of the sensor field-of-view. This poses a problem when an unmanned aerial vehicle (UAV) is tracking multiple ground targets on a road network larger than its field-of-view. To address this problem, we propose a Rao-Blackwellized Particle Filter (RBPF) to maintain individual target tracks and to perform probabilistic data association when the targets are constrained to a road network. This is particularly useful when a target leaves and then re-enters the UAV’s field-of-view. The RBPF is structured as a particle filter of particle filters. The top level filter handles data association and each of its particles maintains a bank of particle filters to handle target tracking. The tracking particle filters incorporate both positive and negative information when a measurement is received. We implement two path planning controllers, receding horizon and deep reinforcement learning, and compare their ability to improve the certainty for multiple target location estimates. The controllers prioritize paths that reduce each target’s entropy. In addition, we develop an algorithm that computes the upper bound on the filter’s performance, thus facilitating an estimate of the number of UAVs needed to achieve a desired performance threshold.

Highlights

  • Multiple-target tracking has a wide array of applications ranging from air traffic control (Li and BarShalom (1993)) to following shoppers in a store (Liu et al (2007))

  • By knowing the upper bound on the target location certainty for a given number of unmanned aerial vehicle (UAV), we can predict the number of UAVs needed to achieve a defined performance threshold for any given scenario

  • The current paper expands on those results, providing novel contributions that include 1) the application of the Rao-Blackwellized Particle Filter (RBPF) with negative update information to tracking multiple targets along road networks, 2) a theorem for computing the particle filter’s lower bound of the average entropy, and 3) path planning algorithms, including a new neural net path planner trained with deep reinforcement learning, 4) extensive simulation and hardware experiments of end-to-end framework

Read more

Summary

INTRODUCTION

Multiple-target tracking has a wide array of applications ranging from air traffic control (Li and BarShalom (1993)) to following shoppers in a store (Liu et al (2007)). We develop a method for incorporating road map information as well as a negative update to track multiple vehicles in an area larger than the UAV’s sensing field-of-view in the presence of clutter and missed detections. The current paper expands on those results, providing novel contributions that include 1) the application of the RBPF with negative update information to tracking multiple targets along road networks, 2) a theorem for computing the particle filter’s lower bound of the average entropy, and 3) path planning algorithms, including a new neural net path planner trained with deep reinforcement learning (deep-RL), 4) extensive simulation and hardware experiments of end-to-end framework.

TARGET TRACKING
Single-Target Particle Filter
Road Constraint
Target Motion Model
Measurement Model
Negative Update
DATA ASSOCIATION
Known Data Correspondence
Rao-Blackwellized Particle Filter
Data Association Sampling
SINGLE UAV PREDICTIVE PATH PLANNING
Dijkstra’s Algorithm
Exhaustive Receeding Horizon Control
Deep-RL
LOWER BOUND FOR AVERAGE ENTROPY OF RBPF
Minimum Time to All Targets
Single Mode Entropy
Estimated Number of Modes
Theorem for Lower Bound of Average
SIMULATION RESULTS
HARDWARE RESULTS
DATA AVAILABILITY STATEMENT
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.