Search

Nowadays, intelligent industrial aquaculture management has been a more universal demand in digital society. Deep learning-based vision computing technique can provide much potential for such applications. As a result, this paper proposes a deep vision computation-driven realtime multitarget tracking approach for this purpose. It is a two-stage method, in which object detection is used in the first stage and target tracking is used in the second stage. First, the improved YOLOv7 model is utilized to train and identify the preprocessed data set to achieve accurate detection of fish targets. Then, a tracking algorithm, named SORT, is utilized to conduct an in-depth analysis of fish images to achieve continuous tracking of fish targets. Thus, further management affairs can be realized upon the basis of such conditions. Experimental results show that the improved YOLOv7 model achieves a high accuracy of 92% on the target detection task, and the Sort algorithm maintains a high degree of tracking accuracy and low tracking errors between consecutive frames. By combining these two methods, the daily behavior of fishes can be accurately detected and tracked in real time. In addition, the research also explores how to combine tracking results with breeding decisions to promote the development of breeding management in an intelligent direction. [ABSTRACT FROM AUTHOR]

In this study, a collaborative radar selection and transmit resource allocation strategy is proposed for multitarget tracking applications in multiple distributed phased array radar networks with imperfect detection performance. The closed-form expression for the Bayesian Cramér-Rao Lower Bound (BCRLB) with imperfect detection performance is obtained and adopted as the criterion function to characterize the precision of target state estimates. The key concept of the developed strategy is to collaboratively adjust the radar node selection, transmitted power, and effective bandwidth allocation of multiple distributed phased array radar networks to minimize the total transmit power consumption in an imperfect detection environment. This will be achieved under the constraints of the predetermined tracking accuracy requirements of multiple targets and several illumination resource budgets to improve its radio frequency stealth performance. The results revealed that the formulated problem is a mixed-integer programming, nonlinear, and nonconvex optimization model. By incorporating the barrier function approach and cyclic minimization technique, an efficient four-step-based solution methodology is proposed to solve the resulting optimization problem. The numerical simulation examples demonstrate that the proposed strategy can effectively reduce the total power consumption of multiple distributed phased array radar networks by at least 32.3% and improve its radio frequency stealth performance while meeting the given multitarget tracking accuracy requirements compared with other existing algorithms.

Multitarget tracking technology is the core topic in the field of intelligent driving. Multi-target complex manoeuvring, measurement outliers and unknown environmental prior parameters strongly affect the tracking accuracy of the target state. To address the accurate tracking of multitarget under the above complex working conditions, we propose a new multitarget tracking algorithm, named the Multiconstrained Generalized Probabilistic Data Association Filtering (MCGPDAF) algorithm. In this algorithm, we use the target position and heading information to construct constraint parameters to calculate the association probability between each effective measurement combination and the target track. This algorithm can effectively suppress the measurement association anomalies and aprior information errors, as well as enable the robust association of single-sensor multitarget measurements and accurate tracking of target states under complex working conditions. On this basis, a multitarget tracking method based on composite perception fusion is further constructed, and the correlation sequential track association algorithm and covariance cross fusion algorithm are used to enable the track association and the estimation and fusion of target states among multiple sensors, which further enhances the tracking accuracy of the multitarget state. The simulation and real vehicle experiment results reveal that, compared to current advanced algorithms, the RMSE and MAPE of the MCGPDAF algorithm for multitarget tracking are enhanced by an average of 23.97% and 24.35%, respectively. Additionally, the MOTA and MOTP of the MCGPDAF algorithm improve by an average of 14.68% and 15.71%. Moreover, compared to single-sensor multitarget tracking, the RMSE and MAPE of composite perception fusion results based on the MCGPDAF algorithm are further enhanced by 26.43% and 27.15% on average, which reflects the practicality of the tracking method showcased in this research.

Rubber tire gantry (RTG) plays a pivotal role in facilitating efficient container handling within port operations. Conventional RTG, highly depending on human operations, is inefficient, labor-intensive, and also poses safety issues in adverse environments. This article introduces a multitarget detection and tracking (MTDT) algorithm specifically tailored for automated port RTG operations. The approach seamlessly integrates enhanced YOLOX for object detection and improved DeepSORT for object tracking to enhance the MTDT performance in the complex port settings. In particular, Light-YOLOX, an upgraded version of YOLOX incorporating separable convolution and attention mechanism, is introduced to improve real-time capability and small target detection. Subsequently, OSNet-DeepSORT, an enhanced version of DeepSORT, is proposed to mitigate ID switching challenges arising from unreliable data communication or occlusion in real port scenarios. The effectiveness of the proposed method is validated in various real-life port operations. Ablation studies and comparative experiments against typical MTDT algorithms demonstrate noteworthy enhancements in key performance metrics, encompassing small target detection, tracking accuracy, ID switching frequency, and real-time performance.

Joint probabilistic data association (JPDA) filter methods and multiple hypothesis tracking (MHT) methods are widely used for multitarget tracking (MTT). However, they are known to exhibit undesirable behavior in tracking scenarios with targets in close proximity: JPDA filter methods suffer from the track coalescence effect, i.e., the estimated tracks of targets in close proximity tend to merge and can become indistinguishable, while MHT methods suffer from an opposite effect known as track repulsion, i.e., the estimated tracks of targets in close proximity tend to repel each other in the sense that their separation is larger than the actual distance between the targets. In this paper, we review the JPDA filter and MHT methods and discuss the track coalescence and track repulsion effects. We also consider a more recent methodology for MTT that is based on the belief propagation (BP) algorithm. We argue that BP-based MTT does not exhibit track repulsion because it is not based on maximum a posteriori estimation, and that it exhibits significantly reduced track coalescence because certain properties of the BP messages related to data association encourage separation of target state estimates. Our theoretical arguments are confirmed by numerical results for four representative simulation scenarios.

In this paper, we propose a deep reinforcement learning (DRL) based unmanned aerial vehicles (UAV)-assisted trajectory optimization for ultra-dense small cell networks. We assume that each UAV is equipped with a sensing radio to obtain distance information to the UEs and other UAVs in the network which are used to update the UAV’s trajectory. The proposed DRL-based system selects the optimal joint control actions for the UAVs that maximizes the system sum-rate. The simulation results show that the proposed DRL-based UAV controller provides fast UAV placement in the network with a high system performance when compared with the benchmark schemes.

To realize multitarget trajectory tracking under non-Gaussian heavy-tailed noise, we propose a Gaussian–Student t-mixture distribution-based trajectory cardinality probability hypothesis density filter (GSTM-TCPHD). We introduce the multi-sensor GSTM-TCPHD (MS-GSTM-TCPHD) filter to enhance tracking performance. Conventional cardinality probability hypothesis density (CPHD) filters typically assume Gaussian noise and struggle to accurately establish target trajectories when faced with heavy-tailed non-Gaussian distributions. Heavy-tailed noise leads to significant estimation errors and filter dispersion. Moreover, the exact trajectory of the target is crucial for tracking and prediction. Our proposed GSTM-TCPHD filter utilizes the GSTM distribution to model heavy-tailed noise, reducing modeling errors and generating a set of potential target trajectories. Since single sensors have a limited field of view and limited measurement information, we extend the filter to a multi-sensor scenario. To tackle the issue of data explosion from multiple sensors, we employed a greedy approximation method to assess measurements and introduced the MS-GSTM-TCPHD filter. The simulation results demonstrate that our proposed filter outperforms the CPHD/TCPHD filter and Student's t-based TCPHD filter in terms of accurately estimating the trajectories of multiple targets during tracking while also achieving improved accuracy and shorter processing time. [ABSTRACT FROM AUTHOR]

For the resource allocation problem of multitarget tracking in a spectral coexistence environment, this study proposes a joint transmit power and dwell time allocation algorithm for radar networks. First, the predicted Bayesian Cramér-Rao Lower Bound (BCRLB) with the variables of radar node selection, transmit power and dwell time is derived as the performance metric for multi-target tracking accuracy. On this basis, a joint optimization model of transmit power and dwell time allocation for multitarget tracking in radar networks under spectral coexistence is built to collaboratively optimize the radar node selection, transmit power and dwell time of radar networks, This joint optimization model aims to minimize the multitarget tracking BCRLB while satisfying the given transmit resources of radar networks and the predetermined maximum allowable interference energy threshold of the communication base station. Subsequently, for the aforementioned optimization problem, a two-step decomposition method is used to decompose it into multiple subconvex problems, which are solved by combining the Semi-Definite Programming (SDP) and cyclic minimization algorithms. The simulation results showed that, compared with the existing algorithms, the proposed algorithm can effectively improve the multitarget tracking accuracy of radar networks while ensuring that the communication base station works properly.

The proliferation of technologically advanced and mobile devices poses risks to public safety and security. These threats can be mitigated by systems equipped to perform timely identification and tracking of devices and their operators. In pursuit of these capabilities, we propose an automated sensing platform designed specifically for tracking multiple, mobile radio frequency (RF) targets. There are a number of challenges involved with tracking multiple moving RF sources. We formulate the task as an iterative state estimation and path planning process, whereby the sensor platform first estimates the positions of the targets through observation of the RF environment and then plans and executes a movement path. By developing a sensor model informed by RF propagation theory, we construct a particle filter based state estimator with the potential to track multiple targets using only signal strength observations. In addition, we propose a path planning technique rooted in uncertainty minimization and safety based constraints. Finally, we validate the proficiency of the proposed methods with simulated experiments. Through analysis of tracking metrics and localization performance we show the benefits of our proposed active sensing techniques as they apply to tracking multiple RF targets. We demonstrate the robustness of our method to various environmental scenarios by testing with a multitude of realistic and challenging experimental parameters (e.g., speed of the sensor platform, number of targets, speed of targets, level of signal-to-noise ratio (SNR)). The results indicate that our method performs better than other state-of-the-art tracking methods, with significant improvements seen in the most difficult scenarios with higher speed targets. In these and other settings, our method is more often able to localize the targets and with less error and uncertainty in position estimation. We also show that our method is computationally efficient and scales well to an increasing number of targets.

Abstract The Bernoulli filter is a very general, computationally feasible Bayes‐optimal approach for tracking a single disappearing and reappearing target, using a single sensor whose observations are corrupted by missed detections and a known, general point‐clutter process. This paper shows how to generalise it to the dyadic labelled random finite set (DLRFS) filter—that is, a very general, computationally feasible Bayes‐optimal approach for tracking two disappearing and reappearing and possibly correlated targets, using a single sensor whose observations are corrupted by missed detections and a known, general clutter process. It is further shown that, like the Bernoulli filter, the DLRFS filter is an exact special case of the labelled multitarget recursive Bayes filter (LMRBF)—and thus that, given the target and sensor models, there cannot be a theoretically better tracking filter. The paper also describes the relationship between the DLRFS filter and the (unlabelled) Gauss–Poisson filter of Singh, Vo, Baddeley, and Zuyev.

Copyright of Telecommunication Engineering is the property of Telecommunication Engineering and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Multitarget tracking based on multisensor fusion perception is one of the key technologies to realize the intelligent driving of automobiles and has become a research hotspot in the field of intelligent driving. However, most current autonomous-vehicle target-tracking methods based on the fusion of millimeter-wave radar and lidar information struggle to guarantee accuracy and reliability in the measured data, and cannot effectively solve the multitarget-tracking problem in complex scenes. In view of this, based on the distributed multisensor multitarget tracking (DMMT) system, this paper proposes a multitarget-tracking method for autonomous vehicles that comprehensively considers key technologies such as target tracking, sensor registration, track association, and data fusion based on millimeter-wave radar and lidar. First, a single-sensor multitarget-tracking method suitable for millimeter-wave radar and lidar is proposed to form the respective target tracks; second, the Kalman filter temporal registration method and the residual bias estimation spatial registration method are used to realize the temporal and spatial registration of millimeter-wave radar and lidar data; third, use the sequential m-best method based on the new target density to find the track the correlation of different sensors; and finally, the IF heterogeneous sensor fusion algorithm is used to optimally combine the track information provided by millimeter-wave radar and lidar, and finally form a stable and high-precision global track. In order to verify the proposed method, a multitarget-tracking simulation verification in a high-speed scene is carried out. The results show that the multitarget-tracking method proposed in this paper can realize the track tracking of multiple target vehicles in high-speed driving scenarios. Compared with a single-radar tracker, the position, velocity, size, and direction estimation errors of the track fusion tracker are reduced by 85.5%, 64.6%, 75.3%, and 9.5% respectively, and the average value of GOSPA indicators is reduced by 19.8%; more accurate target state information can be obtained than a single-radar tracker. [ABSTRACT FROM AUTHOR]

Abstract To solve multitarget tracking (MTT) problems with coloured measurement noise, this study proposes a Poisson multi‐Bernoulli mixture filter with coloured measurement noise (PMBM‐CMN) and a robust PMBM‐CMN filter. By using the measurement differencing method and state augmentation approach, the proposed PMBM‐CMN filter transforms a state estimation problem with coloured measurement noise into a problem with white measurement noise. However, covariances of the true process and measurement noise in the proposed PMBM‐CMN filter are time‐varying and unknown, which may degrade the filtering performance. Therefore, a robust PMBM‐CMN filter is proposed for estimating the augmented state, including the kinematic state, the predicted state covariance, and the white measurement noise covariance. For linear Gaussian systems, the augmented state is modelled as a Gaussian inverse Wishart inverse Wishart (GIWIW) distribution. The variational Bayesian method is also employed to guarantee the conjugacy of the GIWIW density. Simulation results demonstrate the ability of the PMBM‐CMN filter to solve MTT problems with coloured measurement noise and show that the robust PMBM‐CMN filter based on the GIWIW model (GIWIW‐PMBM‐CMN) has the best overall performance in comparison with existing state‐of‐the‐art filters.

This paper considers the problem of multitarget tracking (MT) under situations where sensors have limited resolution, which leads to the presence of merged measurements (MMs). In general, an algorithm for MT under MMs can be derived by extending its standard MT counterpart which assumes that each measurement can come from at most one target. However, such an extension is by no means trivial due to the fact that one must consider data association between target groups to measurements, which results in exponential computational increasing along with the number of targets. In order to address such a difficulty, this paper proposes to adopt the message passing (MP) algorithm, and a new factor graph is constructed for MT under MMs. Then the sum–product algorithm (SPA) and max-sum algorithm (MSA) is jointly exploited for belief propagation, where the SPA is adopted for calculating the messages used for prediction and update, and the MSA is employed for efficiently perform data association. The analytical Gaussian mixture (GM) implementation is also devised for the proposed algorithm. Computational burden analyses show that the computational complexity of proposed algorithm scales linearly with respect to the number of targets and measurements. The performance of proposed algorithm is demonstrated via simulations. [Display omitted] • Multitarget tracking under measurements merging is practically common but it is challenging. • Data association under measurements merging allows a measurement to be simultaneously produced by multiple targets. • The message passing approach can be exploited for efficient multitarget tracking under measurement merging. • Gaussian mixture based implementation further promotes the computational efficiency. [ABSTRACT FROM AUTHOR]

The Fields of Views (FoVs) of radars in a distributed network partially overlap due to detecting capability, waveform design, and antenna orientation constraints, resulting in observed discrepancies between radars and a significant obstacle to future information fusion. In this paper, we propose a distributed multitarget tracking method under the scene of partially overlapping radar FoVs, based on the Gaussian Mixture Cardinalized Probability Hypothesis Density (GM-CPHD) filter. First, we employ the product of the multitarget densities to split the PHD functions and find the part that characterizes the information of the targets commonly observed by multiple radars. Then, a standard distributed fusion (arithmetic average or geometric average fusion) acts on the splitting information to improve tracking performance, and a compensation fusion acts on the remaining information to expand the observation FoV. The proposed method does not require prior knowledge of the radar’s FoV and may adapt to the scene of distributed multitarget tracking while the FoVs are unknown. Simulations are provided to verify the effectiveness of the proposed approach under the scene of unknown and time-varying radar FoVs, and show that the proposed method has better performance than that of the cluster method based on Gaussian matching.

The Bernoulli filter is a very general, computationally feasible Bayes‐optimal approach for tracking a single disappearing and reappearing target, using a single sensor whose observations are corrupted by missed detections and a known, general point‐clutter process. This paper shows how to generalise it to the dyadic labelled random finite set (DLRFS) filter—that is, a very general, computationally feasible Bayes‐optimal approach for tracking two disappearing and reappearing and possibly correlated targets, using a single sensor whose observations are corrupted by missed detections and a known, general clutter process. It is further shown that, like the Bernoulli filter, the DLRFS filter is an exact special case of the labelled multitarget recursive Bayes filter (LMRBF)—and thus that, given the target and sensor models, there cannot be a theoretically better tracking filter. The paper also describes the relationship between the DLRFS filter and the (unlabelled) Gauss–Poisson filter of Singh, Vo, Baddeley, and Zuyev. [ABSTRACT FROM AUTHOR]

Compared with conventional monostatic or bistatic radar, multistatic radar has wider coverage, better performance of localization and higher tracking accuracy. However, the multistatic radar architecture poses challenges to the implementation for multitarget tracking in coping with highly uncertainty of data association for the fusion of multisource information. In this paper, the theoretically rigorous formulas for the multisource multi-Bernoulli (MeMBer) filter are derived by using the Finite set statistics (FISST) calculus built on the standard MeMBer filter. The multisource MeMBer filter propagates a set of MeMBer parameters approximately characterizing the multisource corrected posterior multitarget random finite set (RFS). Since the equations for the proposed filter multisource corrector are computationally intractable, we go further to develop an analytic Sequential Monte Carlo (SMC) implementation of multisource MeMBer recursion. The theoretical analysis and simulations show that the proposed filter performs well and accommodates nonlinear multistatic radar tracking scenario with a single transmitter and two receivers under the approximate conditions.

Radar is an important tool for aiding in bird strike mitigation as part of overall safety management systems at civilian and military airfields. However, the diverse movement trajectories and irregular echo power fluctuations cause existing multitarget tracking algorithms to face many challenges such as detection uncertainty and maneuver uncertainty. Therefore, this paper proposes a robust tracking method focusing on target fluctuation and maneuver characteristics. Firstly, a tracking information feedback mechanism based on the fluctuation model of bird targets is established, and the measurement set in the predicted gate is reconstructed to solve the problem of track breakages caused by the echo power fluctuation. Secondly, an adaptive parameter filter model is designed to enhance maneuver adaptability. Finally, simulation and experimental data verification show that the proposed method is more adaptive to bird target characteristics and can effectively improve the tracking performance without significantly increasing computation. [ABSTRACT FROM AUTHOR]

Device-free localization (DFL) enables several new applications in various sectors including smart cities, intelligent transportation, and public safety. DFL relies on a network of sensor radars that transmit, receive, and process reflected signals propagating in a monitored environment. The accuracy of DFL degrades in cluttered environments, due to the presence of undesired objects that reflect the signal. Indeed, the multiple reflections of the signal overlap at the receiver and make the inference of targets' positions challenging. This article presents a theoretical foundation of DFL in cluttered environments by deriving the fundamental limits on DFL accuracy. In particular, we propose a system model that takes into account multiple reflections, nonline-of-sight conditions, and the presence of multiple targets. Building on such a model, we derive the Cramér-Rao bound on the inference accuracy of targets' positions by applying equivalent Fisher information analysis. The proposed bound provides guidelines for the design and analysis of DFL systems operating in cluttered environments. Then, the article presents a case study compliant with the 5G New Radio numerology and channel modeling. Results show how the minimum achievable error is affected by multiple reflections and multiple targets and to which extent the employment of a signal with larger bandwidth and a network with a higher number of receivers can lower the achievable error toward submeter accuracy. [ABSTRACT FROM AUTHOR]

This article investigates the multitarget tracking problem for multiple Lagrangian plants (MLPs) in the presence of sampled-data interactions, uncertain dynamic terms, and input-to-output redundancy. Two classes of impulsive estimator-based control (IEC) algorithms, including the first- and higher-order IEC algorithms, are newly designed to observe the dynamic uncertain terms, estimate the states of the multiple targets, and finally solve the above-mentioned problem. Based on the properties of the small-value norms, Lyapunov stability theory, Schur stability theory, and Hurwitz criterion, some sufficient conditions and the convergence radius are derived for guaranteeing the convergence of these IEC algorithms. Finally, numerical simulations are performed on networked heterogeneous manipulators to verify the effectiveness of the proposed algorithms. [ABSTRACT FROM AUTHOR]

To solve multitarget tracking (MTT) problems with coloured measurement noise, this study proposes a Poisson multi‐Bernoulli mixture filter with coloured measurement noise (PMBM‐CMN) and a robust PMBM‐CMN filter. By using the measurement differencing method and state augmentation approach, the proposed PMBM‐CMN filter transforms a state estimation problem with coloured measurement noise into a problem with white measurement noise. However, covariances of the true process and measurement noise in the proposed PMBM‐CMN filter are time‐varying and unknown, which may degrade the filtering performance. Therefore, a robust PMBM‐CMN filter is proposed for estimating the augmented state, including the kinematic state, the predicted state covariance, and the white measurement noise covariance. For linear Gaussian systems, the augmented state is modelled as a Gaussian inverse Wishart inverse Wishart (GIWIW) distribution. The variational Bayesian method is also employed to guarantee the conjugacy of the GIWIW density. Simulation results demonstrate the ability of the PMBM‐CMN filter to solve MTT problems with coloured measurement noise and show that the robust PMBM‐CMN filter based on the GIWIW model (GIWIW‐PMBM‐CMN) has the best overall performance in comparison with existing state‐of‐the‐art filters. [ABSTRACT FROM AUTHOR]

This study focuses on the problem of multitarget tracking. To address the existing problems of current tracking algorithms, as manifested by the time consumption of subgroup separation and the uneven group size of unmanned aerial vehicles (UAVs) for target tracking, a multitarget tracking control algorithm under local information selection interaction is proposed. First, on the basis of location, number, and perceived target information of neighboring UAVs, a temporary leader selection strategy is designed to realize the local follow-up movement of UAVs when the UAVs cannot fully perceive the target. Second, in combination with the basic rules of cluster movement and target information perception factors, distributed control equations are designed to achieve a rapid gathering of UAVs and consistent tracking of multiple targets. Lastly, the simulation experiments are conducted in two- and three-dimensional spaces. Under a certain number of UAVs, clustering speed of the proposed algorithm is less than 3 s, and the equal probability of the UAV subgroup size after group separation is over 78%.

The sequential Monte Carlo probability hypothesis density (SMC-PHD) filter is an effective multitarget tracking algorithm in nonlinear and non-Gaussian conditions, but its states-estimation accuracy depends on the state extraction method. In order to extract multitarget states, an intelligent self-optimization SMC-PHD filter is proposed in this paper. The main framework of the intelligent SMC-PHD filter, which transforms the clustering problem into an optimization problem, is constructed. To solve this optimization problem, a self-optimization bat algorithm (SBA) is proposed to extract multitarget states of the SMC-PHD filter, which has the ability to search for a better solution by designing global search and local search strategies. The simulation results show that the performance of the SBA is better than that of the k-means algorithm for extracting multitarget states when the targets are close to each other or even overlapping. [ABSTRACT FROM AUTHOR]

With the advancements in 5G network and mobile edge computing technology, autonomous vehicle technology has gained new development opportunities. Multitarget tracking becomes the research hotspots in autonomous vehicles. Since many factors such as motion blur, partial occlusion, and illumination changes affect the performance of target tracking, the problem of target tracking is still an open topic. In this article, inspired by the strong discriminative ability of dictionary learning, the discriminative dictionary learning with embedded auto‐encoder (DDLEA) algorithm is developed for the multitarget tracking system. The DDLEA algorithm integrates the auto‐encoder into the dictionary learning framework and learns sparse representations while preserving the local structure and discriminative information of data. The learned dictionary model has the strong recognition ability. Further, a multitarget tracking system is developed based on the proposed DDLEA algorithm and the hierarchical data association scheme. Based on the target confidence in the STKSVD model, the hierarchical data association method first uses the Hungarian algorithm to complete the preliminary matching of high confidence targets, and then further tracks the low confidence targets to improve the tracking ability. Experiments are carried out the public MOT 2015 dataset. Compared with several popular multitarget tracking algorithms, the tracking performance of our system is satisfactory. [ABSTRACT FROM AUTHOR]

In multisensor systems, the signal processing delay, measurement acquisition delay, and other factors will lead to imprecisely time-stamped measurements, namely, the problem of time-offset. To deal with the measurement time offsets in distributed multisensor systems, a distributed multisensor multitarget tracking algorithm with time-offset registration is proposed. The local processors track multiple targets in the presence of false alarms and missed detections based on the joint probabilistic data association (JPDA) algorithm and the extended Kalman filter (EKF), providing the time-biased local tracks. In the global processor, in allusion to the global track accuracy degradation introduced by the time offsets of local tracks, the equivalent measurements are firstly constructed based on local tracks by using the inverse Kalman filter. The pseudo-measurement equation of time offset for constant velocity targets is derived and the pseudo-measurement calculation method is presented. Then, the pseudo-measurement based relative time-offset estimation algorithm is presented, by using the recursive least squares estimation (RLSE) and the Kalman filter (KF) to jointly estimate the state in space and time domains, respectively. Finally, a framework of distributed multisensor multitarget tracking with time-offset registration is presented, where the time-varying relative time-offset estimation and compensation, 'equivalent measurement to global track' association, and global track update are included. Simulations for multisensor multitarget tracking in the presence of false alarms and missed detections are conducted, demonstrating that the present algorithm effectively improves the accuracy of fused global tracks.

This paper presents an efficient information-theoretic sensor management method to maximize the performance of the passive multi-sensor system for multi-target tracking. We model the multi-target state as a generalized labeled multi-Bernoulli (GLMB) random finite set and formulate the dynamic sensor selection process as a partially observable Markov decision process (POMDP). The optimization objective is to maximum the information gain obtained from the observed data, which is measured by the Cauchy-Schwarz divergence. This is accomplished with two main technical innovations. The first is a tractable decomposed POMDP based sensor selection solution, in which the informative sensors are selected sequentially from the candidates based on the Cauchy-Schwarz divergence. The second is a novel dual-stage multi-sensor fusion strategy based on the iterated-corrector GLMB filter. Since the uncertainty of the passive multi-sensor system is generally large, the performance of the iterated-corrector scheme can be greatly influenced by the order of sensor updates. To fix this problem, the selected sensors are ranked in order of the Cauchy-Schwarz divergence obtained in sensor selection, followed by the iterated-corrector update. For the multi-sensor fusion, the effect of poor performance sensors is weakened and that of better performance sensors is enhanced. Simulation studies demonstrate the effectiveness and efficiency of the proposed method in challenging passive multi-target tracking scenarios. [ABSTRACT FROM AUTHOR]

This article introduces a Poisson multi-Bernoulli mixture (PMBM) filter in which the intensities of target birth and undetected targets are grid-based. A simplified version of the Rao-Blackwellized point mass filter is used to predict the intensity of undetected targets and to initialize tracks of targets detected for the first time. The grid approximation can efficiently represents intensities with abrupt changes with relatively few grid points compared to the number of Gaussian components needed in conventional PMBM implementations. This is beneficial in scenarios where the sensor’s field of view is limited. The proposed method is illustrated in a sensor management setting, where trajectories of sensors with limited fields of view are controlled to search for and track the targets in a region of interest. [ABSTRACT FROM AUTHOR]

Tracking multiple time-varying states based on heterogeneous observations is a key problem in many applications. Here, we develop a statistical model and algorithm for tracking an unknown number of targets based on the probabilistic fusion of observations from two classes of data sources. The first class, referred to as target-independent perception systems (TIPSs), consists of sensors that periodically produce noisy measurements of targets without requiring target cooperation. The second class, referred to as target-dependent reporting systems (TDRSs), relies on cooperative targets that report noisy measurements of their state and their identity. We present a joint TIPS–TDRS observation model that accounts for observation-origin uncertainty, missed detections, false alarms, and asynchronicity. We then establish a factor graph that represents this observation model along with a state evolution model including target identities. Finally, by executing the sum-product algorithm on that factor graph, we obtain a scalable multitarget tracking algorithm with inherent TIPS–TDRS fusion. The performance of the proposed algorithm is evaluated using simulated data as well as real data from a maritime surveillance experiment. [ABSTRACT FROM AUTHOR]

This paper studies the multitarget tracking problem based on an asynchronous network of sensors with different sampling rates, where each sensor runs a cardinalized probability hypothesis density (CPHD) filter. To fuse the filter estimates obtained at different sensors conditioned on asynchronous measurements, an arithmetic averaging approach is recursively carried out in a timely manner according to the network-wide sampling time sequence. The intersensor communication is conducted by a so-called partial flooding scheme, in which either cardinality distributions or intensity functions pertinent to local posteriors are disseminated among sensors. The fused results may not feedback to the filter, which will avoid communication delay to the local filters cased by intersensor fusion at the expense of reduced information gain. Furthermore, an extension of the proposed multi-sensor CPHD filter based on the bootstrap filtering algorithm is given to accommodate unknown clutter rate and detection profile. Numerical simulations are performed to test the proposed approaches. [ABSTRACT FROM AUTHOR]

This article describes the development and testing of a passive sonar, multitarget tracker, and adaptive behavior that enable an autonomous underwater vehicle (AUV) to detect and actively track nearby surface vessels. A planar hull-mounted hydrophone array, originally designed for active sonar, is repurposed for passive sonar use and provides acoustic data to a time-delay-and-sum beamformer that generates multiple angle-only contacts. A particle filter tracker assimilates these contacts with a single-hypothesis data association strategy to estimate the position and velocity of targets. Summary statistics of each track are periodically reported to an onboard database along with qualitative labels. To improve tracking performance, detections trigger an adaptive behavior that maneuvers the AUV to maintain multiple targets in the field of view by minimizing the worst case aspect angle deviation from broadside (across all targets). The tracking system is demonstrated through at-sea experiments in which a Bluefin-21 AUV adaptively tracks multiple surface vessels, including another autonomous platform, in the approaches to Boston Harbor. [ABSTRACT FROM AUTHOR]

This paper presents a new algorithm for autonomous multitarget tracking of resident space objects using optical angles-only measurements from a spaceborne observer. To enable autonomous angles-only navigation of spacecraft swarms, observers must identify and track multiple known or unknown target space objects in view, without reliance on a-priori relative orbit knowledge. Extremely high tracking precision is necessary despite low measurement frequencies and limited computational resources. The new 'Spacecraft Angles-only MUltitarget tracking System' (SAMUS) algorithm has been developed to meet these objectives and constraints. It combines domain-specific modeling of target kinematics with multi-hypothesis techniques to autonomously track multiple unknown targets using only sequential camera images. A measurement transform ensures that target motion in the observer reference frame follows a consistent parametric model; curve fitting is used to predict track behavior; and kinematic track gating and scoring criteria improve the efficiency and accuracy of the multi-hypothesis approach. Monte Carlo testing with high-fidelity simulations demonstrates close to 100% data association precision and high recall across a range of multi-spacecraft formations, in both near-circular and eccentric orbits. Tracking is maintained in the presence of eclipse periods, significant measurement noise, and partially known swarm maneuvers. A comparison to other tracking algorithms reveals strong advantages in precision, robustness and computation time, crucial for spaceborne angles-only navigation. • Angles-only navigation for spacecraft swarms requires multitarget tracking. • A novel tracking algorithm is developed to meet the constraints of in-orbit use. • Domain-specific kinematic modeling is combined with a multi-hypothesis approach. • Tracking is agnostic to orbit eccentricity, swarm geometry, and swarm maneuvers. • Close to 100% measurement assignment precision is achieved. [ABSTRACT FROM AUTHOR]

Traditional networked radar systems for target tracking usually suffer from a heavy data processing burden, and do not consider the sensor location uncertainties (SLUs), by assuming that radar locations are known perfectly, which is applicable only for static platforms. In this paper, considering sensors mounted on moving platforms, we propose a joint power allocation and measurement selection (JPAMS) strategy for multitarget tracking and data reduction in radar networks with the SLUs. The mechanism is to optimize the transmitted power and select the propagation paths with informative measurements, simultaneously. First, we adopt a distributed fusion architecture to estimate both states of targets and radars in clutter. Based on the distributed fusion architecture, the predicted conditional Cramér-Rao lower bound (PC-CRLB) considering the SLU and the measurement origin uncertainty is derived. Second, the JPAMS strategy is formulated as a bi-objective optimization problem, where the sum of weighted PC-CRLBs and the number of selected propagation paths are used as the performance metrics with respect to tracking and data reduction. The corresponding optimization is a NP-hard problem containing both continuous and binary variables. Third, to solve this nonconvex problem, we propose a sparsity-enhancing sequential convex programming algorithm. Finally, numerical simulations demonstrate the superiority of the proposed JPAMS strategy over the traditional allocation strategies. [ABSTRACT FROM AUTHOR]

In multitarget tracking systems, it is usually assumed that each measurement is generated with respect to a single target. This is not always true for generating relative state measurements or cross-target information in a coupled fashion. This note is concerned with the problem of distributed filtering for multitarget tracking systems with coupled measurements. By representing the coupling features of the target states in the measurements as a directed graph, a modified Kalman consensus filter (KCF) is proposed for a target-dependent augmented system whose state vector consists of in-going neighborhood targets. To analyze the performance of the modified KCF in a directed graph, a sufficient condition is derived to guarantee the boundedness of the estimation errors in the mean square sense. Numerical studies are provided to verify the applicability of the KCF. [ABSTRACT FROM AUTHOR]

A sensor management method for joint multitarget search and track problems is proposed, where a single user-defined parameter allows for a tradeoff between the two objectives. The multitarget density is propagated using the Poisson multi-Bernoulli mixture filter, which eliminates the need for a separate handling of undiscovered targets and provides the theoretical foundation for a unified search and track method. Monte Carlo simulations of two scenarios are used to evaluate the performance of the proposed method. [ABSTRACT FROM AUTHOR]

In this letter, a joint radar scheduling and beampattern design (JRSBD) strategy is proposed to track multiple targets by a netted colocated multiple-input multiple-output (C-MIMO) radar system in clutter. The mechanism is to jointly optimize the radar scheduling and the waveform correlation matrix of each C-MIMO radar to maximize the tracking performance. First, we develop the deterministic covariance, as the performance metric, to quantify the actual target state estimate accuracy. Second, the JRSBD strategy is formulated as an optimization problem with some system constraints. The resulting optimization problem contains both binary and continuous variables and is nonconvex. Finally, we propose a sequential convex programming method to solve it. Numerical simulations demonstrate that the JRSBD strategy can effectively improve the target tracking accuracy. [ABSTRACT FROM AUTHOR]

In this article, a joint target assignment and resource optimization (JTARO) strategy is proposed for the application of multitarget tracking in phased array radar network system. The key mechanism of our proposed JTARO strategy is to employ the optimization technique to jointly optimize the target-to-radar assignment, revisit time control, bandwidth, and dwell time allocation subject to several resource constraints, while achieving better tracking accuracies of multiple targets and low probability of intercept (LPI) performance of phased array radar network. The analytical expression for Bayesian Cramér–Rao lower bound with the aforementioned adaptable parameters is calculated and subsequently adopted as the performance metric for multitarget tracking. After problem partition and reformulation, an efficient three-stage solution methodology is developed to resolve the underlying mixed-integer, nonlinear, and nonconvex optimization problem. To be specific, in Step 1, the revisit time for each target is determined. In Step 2, we implement the joint signal bandwidth and dwell time allocation for fixed target-to-radar assignments, which combine the cyclic minimization algorithm and interior point method. In Step 3, the optimal target-to-radar assignments are obtained, which results in the minimization of both the tracking accuracy for multiple targets and the total dwell time consumption of the network system. Simulation results are provided to demonstrate the advantages of the presented JTARO strategy, in terms of the achievable multitarget tracking accuracy and LPI performance of phased array radar network. [ABSTRACT FROM AUTHOR]

A prior knowledge of the background parameters such as clutter rate and detection profile is of critical importance in the tracking algorithms under the theory of random finite sets for extended objects which would lead to restrictions in the application. To accommodate this problem, a multiple extended target tracking algorithm based on the generalized labelled multi-Bernoulli (GLMB) filter under the circumstance of unknown clutter rate and detection profile is proposed in this article. After introducing a clutter generator, this new algorithm establishes augmented state space model for targets and clutter and propagates them in parallel by applying multi-class GLMB theory. We then employ Beta to describe detection probability. Target extension is modelled as an ellipse by using gamma Gaussian inverse Wishart distribution. Simulation results indicate that the proposed algorithm has better performance in estimating trajectories and extended shapes compared with the conventional filter having prior knowledge.

A decentralized Poisson multi-Bernoulli filter is proposed to track multiple vehicles using multiple high-resolution sensors. Independent filters estimate the vehicles' presence, state, and shape using a Gaussian process extent model; a decentralized filter is realized through fusion of the filters posterior densities. An efficient implementation is achieved by parametric state representation, utilization of single hypothesis tracks, and fusion of vehicle information based on a fusion mapping. Numerical results demonstrate the performance.

Aiming at improving the tracking performance of the delta-generalized labeled multi-Bernoulli (δ-GLMB) filter, we present a one time step lagged δ-GLMB smoother in this work, which also inherently outputs targets trajectories and differs from the Probability hypothesis density (PHD), Multi-Bernoulli (MB), and Cardinalized probability hypothesis density (CPHD) smoothers that are incapable of generating target trajectories directly. Under the standard multitarget measurement likelihood and state transition kernel, we show that a δ-GLMB distributed multitarget filtering density would result in a same distributed one time step lagged multitarget smoothing density. An efficient implementation of the proposed smoothing algorithm using the standard ranked assignment technique is also given. Numerical results show that the proposed smoother is capable of tracking a time-varying number of targets, in the presence of measurement origin uncertainty, target detection uncertainty, and clutter, and show that the proposed smoother outperforms the δ-GLMB filter, and the PHD, MB, and CPHD smoothers of the same time lag on both the estimates of target number and state and it also outperforms the LMB and the approximated δ-GLMB smoothers of the same time lag on target number estimate.

We propose a novel algorithm, state propagation based dynamic compressed sensing (SP-DCS), that uses a target dynamic model in dynamic compressed sensing (DCS) to track a fixed number of targets. To track a time-varying number of targets using raw measurements from a Doppler radar, we also propose a novel hybrid particle filter based dynamic compressed sensing (HPF-DCS) algorithm. We calculate the support set in a Bayesian framework and a particle filter approximates the posterior probability mass function (pmf) of the support set. HPF-DCS is a combination of random and deterministic sampling. In random sampling, a number of predicted existing sub-particles are sampled from the prior pmf of the existing support set to handle the scenario when targets disappear randomly at a scan time. In deterministic sampling, the new support set corresponding to newly appearing targets is calculated by solving a sparsity promoting optimization problem. Our simulation results show that the proposed algorithm can track a time-varying number of targets successfully. It also outperforms the sequential Monte Carlo based probability hypothesis density (SMC-PHD) filter, as well as the multi-mode, multi-target track before detect (MM-MT-TBD) filter.

Modern tracking problems require fast, scalable, and robust solutions for tracking multiple targets from noisy sensor data. In this article, an algorithm that has linear computational complexity with respect to the number of targets and measurements is presented. The method is based on the propagation of the first two factorial cumulants of a point process. The algorithm is demonstrated for tracking a million targets in cluttered environments in the fastest time yet for any such solution. A low-computational-complexity solution to the problem of joint multitarget tracking and parameter estimation is also presented. The multitarget filtering approach utilizes a single-cluster point process method for joint multiobject estimation and parameter estimation and is shown to be more computationally efficient and robust than previous implementations. [ABSTRACT FROM AUTHOR]

The resource-aware design is of great importance for the distributed multiple-input multiple-output (MIMO) radar in military applications, where multiple missions need to be fully and simultaneously performed constrained by the resource budget. Aiming at the joint of tracking existing targets and detecting new threats, a sensor scheduling integrated with power and bandwidth allocation strategy is put forward. The predicted posterior Cramer-Rao lower bound (PCRLB) in the worst case and the probability of detection are integrated as the optimization metric. Since such a problem is NP-hard, a modified particle swarm optimization (MPSO) for the sensor selection; embed with the greedy idea for the power and bandwidth allocation, is proposed for the solution exploration. The numerical simulations demonstrate that the MPSO is capable of providing close performance to the exhaustive search based method. More importantly, it possesses a lower computational burden and achieves better results compared with multi-start local search (MSLS)-based method.

Joint detection and tracking weak target is a challenging problem whose complexity is intensified when there are multiple targets present at the same time. Some Probability Hypothesis Density (PHD) based track-before-detect (TBD) particle filters (PHD-TBD) are proposed to solve this issue; however, the performance is unsatisfactory especially when the number of targets is large because some assumptions in PHD are violated. We propose to modify the general PHD-TBD filter in two aspects to make the PHD processing available for TBD scenarios. First, the distribution of false alarms is approximated as the Poisson distribution through a threshold method, and then a clustering technique is proposed to solve the overestimation of the target number. A typical TBD scenario is used to test the effectiveness of the proposed method. Simulation results indicate that the proposed method outperforms the general method in terms of estimation accuracy and computational complexity.