Pub Date : 2002-07-08DOI: 10.1109/ICIF.2002.1021211
M. Ridley, E. Nettleton, S. Sukkarieh, Hugh Durrant-Whyte
This paper describes the theoretical and practical development of a decentralised air and ground sensing network for target tracking and identification. The theoretical methods employed for studying decentralised data fusion problems are based on the information-filter formulation of the Kalman filter algorithm and on information-theoretic methods derived from the Bayes theorem. The paper particularly focuses on how these methods are applied in very large heterogeneous sensor networks, where there may be a significant amount of data delay or corruption in communication. This paper then describes the development of a practical system aimed at demonstrating some of these principles. The system consists of a number of unmanned air vehicles (UAVs), with radar and vision payloads, able to observe a number of ground targets. The UAV sensor payloads are constructed in a modular fashion, with the ability to communicate in a network with both other air-borne and other ground sensors. The ground sensor system comprises of multiple modular sensing nodes which include vision scanned laser, steerable radar, multiple fixed radar arrays, and combined night vision (IR)-radar.
{"title":"Tracking in decentralised air-ground sensing networks","authors":"M. Ridley, E. Nettleton, S. Sukkarieh, Hugh Durrant-Whyte","doi":"10.1109/ICIF.2002.1021211","DOIUrl":"https://doi.org/10.1109/ICIF.2002.1021211","url":null,"abstract":"This paper describes the theoretical and practical development of a decentralised air and ground sensing network for target tracking and identification. The theoretical methods employed for studying decentralised data fusion problems are based on the information-filter formulation of the Kalman filter algorithm and on information-theoretic methods derived from the Bayes theorem. The paper particularly focuses on how these methods are applied in very large heterogeneous sensor networks, where there may be a significant amount of data delay or corruption in communication. This paper then describes the development of a practical system aimed at demonstrating some of these principles. The system consists of a number of unmanned air vehicles (UAVs), with radar and vision payloads, able to observe a number of ground targets. The UAV sensor payloads are constructed in a modular fashion, with the ability to communicate in a network with both other air-borne and other ground sensors. The ground sensor system comprises of multiple modular sensing nodes which include vision scanned laser, steerable radar, multiple fixed radar arrays, and combined night vision (IR)-radar.","PeriodicalId":399150,"journal":{"name":"Proceedings of the Fifth International Conference on Information Fusion. FUSION 2002. (IEEE Cat.No.02EX5997)","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114259672","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2002-07-08DOI: 10.1109/ICIF.2002.1020941
D. Pillon, N. Giordana, P. Blanc-Benon, S. Sitbon
The problem of track to track association in passive sonar with multiple platforms and/or time interruptions is considered. Typical case is a submarine equipped with a hull array (HA) and a towed array (TA). A few methods are applicable and discussed here, coming from detection and estimation theory. Performance of likelihood ratio test are studied for the binary case to associate one track from measurement platform 1 to one another from platform 2. Then it is generalized to two sets of tracks using either a motion representation of the target state (Target Motion Analysis, TMA) or directly the spectrum of frequency lines. Finally, this is also applied to a single antenna like TA where the two "origins" comes from two different time periods e.g. before/after an ownship maneuver Both applications are supported by a theoretic background and at-sea results.
{"title":"Association of narrow band sources in passive sonar","authors":"D. Pillon, N. Giordana, P. Blanc-Benon, S. Sitbon","doi":"10.1109/ICIF.2002.1020941","DOIUrl":"https://doi.org/10.1109/ICIF.2002.1020941","url":null,"abstract":"The problem of track to track association in passive sonar with multiple platforms and/or time interruptions is considered. Typical case is a submarine equipped with a hull array (HA) and a towed array (TA). A few methods are applicable and discussed here, coming from detection and estimation theory. Performance of likelihood ratio test are studied for the binary case to associate one track from measurement platform 1 to one another from platform 2. Then it is generalized to two sets of tracks using either a motion representation of the target state (Target Motion Analysis, TMA) or directly the spectrum of frequency lines. Finally, this is also applied to a single antenna like TA where the two \"origins\" comes from two different time periods e.g. before/after an ownship maneuver Both applications are supported by a theoretic background and at-sea results.","PeriodicalId":399150,"journal":{"name":"Proceedings of the Fifth International Conference on Information Fusion. FUSION 2002. (IEEE Cat.No.02EX5997)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123271462","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2002-07-08DOI: 10.1109/ICIF.2002.1020911
M. Arulampalam, Neil Gordon, M. R. Orton, Branko Ristic
The problem of tracking ground targets with GMTI sensors has received some attention in the recent past. In addition to standard GMTI sensor measurements, one is interested in using non-standard information such as road maps, and terrain-related visibility conditions to enhance tracker performance. The conventional approach to this problem has been to use the variable structure IMM (VS-IMM), which uses the concept of directional process noise to model motion along particular roads. In this paper, we present a particle filter based approach to this problem which we call variable structure multiple model particle filter (VS-MMPF). Simulation results show that the performance of the VS-MMPF is much superior to that of VS-IMM.
{"title":"A variable structure multiple model particle filter for GMTI tracking","authors":"M. Arulampalam, Neil Gordon, M. R. Orton, Branko Ristic","doi":"10.1109/ICIF.2002.1020911","DOIUrl":"https://doi.org/10.1109/ICIF.2002.1020911","url":null,"abstract":"The problem of tracking ground targets with GMTI sensors has received some attention in the recent past. In addition to standard GMTI sensor measurements, one is interested in using non-standard information such as road maps, and terrain-related visibility conditions to enhance tracker performance. The conventional approach to this problem has been to use the variable structure IMM (VS-IMM), which uses the concept of directional process noise to model motion along particular roads. In this paper, we present a particle filter based approach to this problem which we call variable structure multiple model particle filter (VS-MMPF). Simulation results show that the performance of the VS-MMPF is much superior to that of VS-IMM.","PeriodicalId":399150,"journal":{"name":"Proceedings of the Fifth International Conference on Information Fusion. FUSION 2002. (IEEE Cat.No.02EX5997)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122989437","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2002-07-08DOI: 10.1109/ICIF.2002.1021138
L. Q. Li, K. Tsukada, K. Hanasaki, Zheng Liu
This paper presents a novel scheme to fuse one-dimensional multi-frequency eddy current signals by using multiresolution discrete wavelet analysis method. This technique consists of three steps. First, raw signals are preprocessed and decomposed into approximations and details at different resolution levels. The discrete wavelet transform is adopted at this stage. Then, several fusion processes are implemented in the coefficients domain. Finally, the inverse discrete wavelet transform is achieved to get the fusion result. In this technique, we develop a new mask-signal-modulated fusion algorithm to fuse in coefficients domain. It is performed and compared with other fusion methods based on the criteria of signal-to-noise ratio of the fused result. From our experiments, it demonstrates a better performance and shows a promising application on the two-dimensional multi-frequency eddy current signals.
{"title":"Fusion of multi-frequency eddy current signals-by using wavelet analysis method","authors":"L. Q. Li, K. Tsukada, K. Hanasaki, Zheng Liu","doi":"10.1109/ICIF.2002.1021138","DOIUrl":"https://doi.org/10.1109/ICIF.2002.1021138","url":null,"abstract":"This paper presents a novel scheme to fuse one-dimensional multi-frequency eddy current signals by using multiresolution discrete wavelet analysis method. This technique consists of three steps. First, raw signals are preprocessed and decomposed into approximations and details at different resolution levels. The discrete wavelet transform is adopted at this stage. Then, several fusion processes are implemented in the coefficients domain. Finally, the inverse discrete wavelet transform is achieved to get the fusion result. In this technique, we develop a new mask-signal-modulated fusion algorithm to fuse in coefficients domain. It is performed and compared with other fusion methods based on the criteria of signal-to-noise ratio of the fused result. From our experiments, it demonstrates a better performance and shows a promising application on the two-dimensional multi-frequency eddy current signals.","PeriodicalId":399150,"journal":{"name":"Proceedings of the Fifth International Conference on Information Fusion. FUSION 2002. (IEEE Cat.No.02EX5997)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115265180","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2002-07-08DOI: 10.1109/ICIF.2002.1020913
L. Lin, T. Kirubarajan, Y. Bar-Shalom
In this paper we present a new assignment-based algorithm for data association in tracking ground targets employing evasive move-stop-move maneuvers using moving target indicator (MTI) reports obtained from an airborne sensor. To avoid detection by the MTI sensor, the targets deliberately stop for some time before moving again. The sensor does not detect a target when the latter's radial velocity (along the line-of-sight from the sensor) falls below a certain minimum detectable velocity (MDV). Even in the absence of move-stop-move maneuvers, the detection has a less-than-unity probability (P/sub D/ < 1) due to obscuration and thresholding. Then, it is of interest, when a target is not detected, to develop a systematic technique that can distinguish between lack of detection due to P/sub D/ < 1 and lack of detection due to a stop (or a near stop). In this paper, we develop a novel "two-dummy" assignment approach for move-stop-move targets that consider the problem in data association as well as in filtering. Typically, in assignment-based data association a "dummy" measurement is used to denote the nondetection event. The use of the standard single-dummy assignment, which does not handle move-stop-move motion explicitly, can result in broken tracks. The new algorithm proposed in this paper handles the evasive move-stop-move motion by introducing a second dummy measurement to represent non-detection due to the MDV. Using this two-dummy data association algorithm, the track corresponding to a move-stop-move target is kept "alive" even during missed detections due to MDV.
{"title":"New assignment-based data association for tracking move-stop-move targets","authors":"L. Lin, T. Kirubarajan, Y. Bar-Shalom","doi":"10.1109/ICIF.2002.1020913","DOIUrl":"https://doi.org/10.1109/ICIF.2002.1020913","url":null,"abstract":"In this paper we present a new assignment-based algorithm for data association in tracking ground targets employing evasive move-stop-move maneuvers using moving target indicator (MTI) reports obtained from an airborne sensor. To avoid detection by the MTI sensor, the targets deliberately stop for some time before moving again. The sensor does not detect a target when the latter's radial velocity (along the line-of-sight from the sensor) falls below a certain minimum detectable velocity (MDV). Even in the absence of move-stop-move maneuvers, the detection has a less-than-unity probability (P/sub D/ < 1) due to obscuration and thresholding. Then, it is of interest, when a target is not detected, to develop a systematic technique that can distinguish between lack of detection due to P/sub D/ < 1 and lack of detection due to a stop (or a near stop). In this paper, we develop a novel \"two-dummy\" assignment approach for move-stop-move targets that consider the problem in data association as well as in filtering. Typically, in assignment-based data association a \"dummy\" measurement is used to denote the nondetection event. The use of the standard single-dummy assignment, which does not handle move-stop-move motion explicitly, can result in broken tracks. The new algorithm proposed in this paper handles the evasive move-stop-move motion by introducing a second dummy measurement to represent non-detection due to the MDV. Using this two-dummy data association algorithm, the track corresponding to a move-stop-move target is kept \"alive\" even during missed detections due to MDV.","PeriodicalId":399150,"journal":{"name":"Proceedings of the Fifth International Conference on Information Fusion. FUSION 2002. (IEEE Cat.No.02EX5997)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132072448","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2002-07-08DOI: 10.1109/ICIF.2002.1020990
G. Fountain, S. Drager
There currently exists the need for fusion systems that can provide an accurate and comprehensive assessment of military situations in real-time. The objective of this effort was to define, prototype, and demonstrate an affordable next-generation JDL Level 2 fusion and exploitation architecture. The scope of this effort included the identification of the limiting criteria in current Level 2 fusion assessment systems that inhibit them from providing real-time assessment. Using this criterion and assessment of the hardware requirements trade space, solutions were proposed consisting of both hardware and software approaches including an assessment of cost impact. The validity of the solutions were then validated by applying them to an existing state-of-the-art Level 2 fusion system, the Nodal Exploitation Application Toolkit developed by Sterling Software; Rome, NY. The effort succeeded in providing a demonstration of the prototype on a Linux Cluster at the Air Force Research Laboratorys' Rome Research Site, in Rome, NY. Performance improvements were not limited to parallelizing existing algorithms across multiple processors. The sequential algorithmic processing was optimized as well. Compared to the original software running on a Linux PC, results show 30 times speed improvement on a single processor, 63 times speed improvement when run in parallel across 4 processors.
目前,我们需要能够实时对军事形势进行准确、全面评估的融合系统。这项工作的目标是定义、原型开发和演示经济实惠的下一代 JDL 2 级融合和利用架构。这项工作的范围包括确定当前 2 级融合评估系统中阻碍其提供实时评估的限制性标准。利用这一标准和对硬件要求贸易空间的评估,提出了由硬件和软件方法组成的解决方案,包括对成本影响的评估。然后,将这些解决方案应用于现有的最先进的 2 级融合系统,即纽约州罗马市斯特林软件公司开发的节点开发应用工具包,从而验证了这些解决方案的有效性。这项工作成功地在纽约州罗马市空军研究实验室罗马研究基地的 Linux 集群上演示了原型。性能改进不仅限于在多个处理器上并行处理现有算法。顺序算法处理也得到了优化。与在 Linux PC 上运行的原始软件相比,结果显示在单个处理器上速度提高了 30 倍,在 4 个处理器上并行运行时速度提高了 63 倍。
{"title":"High performance real-time fusion architecture","authors":"G. Fountain, S. Drager","doi":"10.1109/ICIF.2002.1020990","DOIUrl":"https://doi.org/10.1109/ICIF.2002.1020990","url":null,"abstract":"There currently exists the need for fusion systems that can provide an accurate and comprehensive assessment of military situations in real-time. The objective of this effort was to define, prototype, and demonstrate an affordable next-generation JDL Level 2 fusion and exploitation architecture. The scope of this effort included the identification of the limiting criteria in current Level 2 fusion assessment systems that inhibit them from providing real-time assessment. Using this criterion and assessment of the hardware requirements trade space, solutions were proposed consisting of both hardware and software approaches including an assessment of cost impact. The validity of the solutions were then validated by applying them to an existing state-of-the-art Level 2 fusion system, the Nodal Exploitation Application Toolkit developed by Sterling Software; Rome, NY. The effort succeeded in providing a demonstration of the prototype on a Linux Cluster at the Air Force Research Laboratorys' Rome Research Site, in Rome, NY. Performance improvements were not limited to parallelizing existing algorithms across multiple processors. The sequential algorithmic processing was optimized as well. Compared to the original software running on a Linux PC, results show 30 times speed improvement on a single processor, 63 times speed improvement when run in parallel across 4 processors.","PeriodicalId":399150,"journal":{"name":"Proceedings of the Fifth International Conference on Information Fusion. FUSION 2002. (IEEE Cat.No.02EX5997)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128479835","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2002-07-08DOI: 10.1109/ICIF.2002.1020908
Lingji Chen, P. Arambel, Raman K. Mehra
This paper addresses the problem of fusing several random variables (RVs) with unknown correlations. A family of upper bounds on the resulting covariance matrix is given, and is shown to contain the upper bound offered by the covariance intersection (CI) algorithm proposed by Julier and Uhlmann (2000). For trace minimization, the optimal one in this family is better than the one obtained by CI except in some cases where they are equal. It is further proved that the best pair of combination gains that minimizes the above optimal-trace-in-the-family coincides with the one associated with the best value of omega in CL. Thus, the CI Algorithm provides a convenient one-dimensional parameterization for the optimal solution in the n-square dimensional space. The results are also extended to multiple RVs and partial estimates.
{"title":"Fusion under unknown correlation - covariance intersection as a special case","authors":"Lingji Chen, P. Arambel, Raman K. Mehra","doi":"10.1109/ICIF.2002.1020908","DOIUrl":"https://doi.org/10.1109/ICIF.2002.1020908","url":null,"abstract":"This paper addresses the problem of fusing several random variables (RVs) with unknown correlations. A family of upper bounds on the resulting covariance matrix is given, and is shown to contain the upper bound offered by the covariance intersection (CI) algorithm proposed by Julier and Uhlmann (2000). For trace minimization, the optimal one in this family is better than the one obtained by CI except in some cases where they are equal. It is further proved that the best pair of combination gains that minimizes the above optimal-trace-in-the-family coincides with the one associated with the best value of omega in CL. Thus, the CI Algorithm provides a convenient one-dimensional parameterization for the optimal solution in the n-square dimensional space. The results are also extended to multiple RVs and partial estimates.","PeriodicalId":399150,"journal":{"name":"Proceedings of the Fifth International Conference on Information Fusion. FUSION 2002. (IEEE Cat.No.02EX5997)","volume":"137 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131235815","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2002-07-08DOI: 10.1109/ICIF.2002.1021162
F. Roli, G. Fumera, Josef Kittler
In the past decade, several rules for fusion of pattern classifiers' outputs have been proposed. Although imbalanced classifiers, that is, classifiers exhibiting very different accuracy, are used in many practical applications (e.g., multimodal biometrics for personal identity verification), the conditions of classifiers' imbalance under which a given rule can significantly outperform another one are not completely clear. In this paper, we experimentally compare various fixed and trained rules for fusion of imbalanced classifiers. The experiments are guided by the results of a previous theoretical analysis of the authors. Linear, order statistics-based, and trained combiners are compared by experiments on remote-sensing image data and on the X2M2VTS multimodal biometrics data base.
{"title":"Fixed and trained combiners for fusion of imbalanced pattern classifiers","authors":"F. Roli, G. Fumera, Josef Kittler","doi":"10.1109/ICIF.2002.1021162","DOIUrl":"https://doi.org/10.1109/ICIF.2002.1021162","url":null,"abstract":"In the past decade, several rules for fusion of pattern classifiers' outputs have been proposed. Although imbalanced classifiers, that is, classifiers exhibiting very different accuracy, are used in many practical applications (e.g., multimodal biometrics for personal identity verification), the conditions of classifiers' imbalance under which a given rule can significantly outperform another one are not completely clear. In this paper, we experimentally compare various fixed and trained rules for fusion of imbalanced classifiers. The experiments are guided by the results of a previous theoretical analysis of the authors. Linear, order statistics-based, and trained combiners are compared by experiments on remote-sensing image data and on the X2M2VTS multimodal biometrics data base.","PeriodicalId":399150,"journal":{"name":"Proceedings of the Fifth International Conference on Information Fusion. FUSION 2002. (IEEE Cat.No.02EX5997)","volume":"126 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126702771","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2002-07-08DOI: 10.1109/ICIF.2002.1020959
N. Batrancourt, S. Bonnevay, M. Lamure, R. Levy
This study proposes the elaboration of a fusion model into two kinds of data for patients presenting sequelae of focal brain damage : anatomical and functional. The aim of our model is to merge these two kinds of information to help diagnosis and to contribute to the comprehension of the neural basis of cognitive functions. On one hand, interrelationships between anatomic elements constitute an anatomical graph. On the other, each elementary cognitive function and its relationships correspond to a functional graph. From these two graphs, the construction of an intergraph is developed based on some anatomofunctional rules. These rules allow the expression of anatomofunctional knowledge. This model has been implemented in software which will soon be used by clinician and researchers.
{"title":"An anatomofunctional brain knowledge","authors":"N. Batrancourt, S. Bonnevay, M. Lamure, R. Levy","doi":"10.1109/ICIF.2002.1020959","DOIUrl":"https://doi.org/10.1109/ICIF.2002.1020959","url":null,"abstract":"This study proposes the elaboration of a fusion model into two kinds of data for patients presenting sequelae of focal brain damage : anatomical and functional. The aim of our model is to merge these two kinds of information to help diagnosis and to contribute to the comprehension of the neural basis of cognitive functions. On one hand, interrelationships between anatomic elements constitute an anatomical graph. On the other, each elementary cognitive function and its relationships correspond to a functional graph. From these two graphs, the construction of an intergraph is developed based on some anatomofunctional rules. These rules allow the expression of anatomofunctional knowledge. This model has been implemented in software which will soon be used by clinician and researchers.","PeriodicalId":399150,"journal":{"name":"Proceedings of the Fifth International Conference on Information Fusion. FUSION 2002. (IEEE Cat.No.02EX5997)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116953275","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2002-07-08DOI: 10.1109/ICIF.2002.1021210
R. B. Washburn, M. Schneider, J. fox, Ma, bob. washburn, M. Schneider, J. fox
This paper describes a stochastic dynamic programming based approach to solve sensor resource management (SRM) problems such as occur in tracking multiple targets with electronically scanned, multi-mode radar Specifically, it formulates the SRM problem as a stochastic scheduling problem and develops approximate solutions based on the Gittins index rule. Novel results include a hybrid state stochastic model for the information dynamics of tracked targets, an exact index rule solution of the SRM problem for a simplified tracking model, and use of approximate dynamic programming to extend the index rule solution to more realistic models.
{"title":"Stochastic dynamic programming based approaches to sensor resource management","authors":"R. B. Washburn, M. Schneider, J. fox, Ma, bob. washburn, M. Schneider, J. fox","doi":"10.1109/ICIF.2002.1021210","DOIUrl":"https://doi.org/10.1109/ICIF.2002.1021210","url":null,"abstract":"This paper describes a stochastic dynamic programming based approach to solve sensor resource management (SRM) problems such as occur in tracking multiple targets with electronically scanned, multi-mode radar Specifically, it formulates the SRM problem as a stochastic scheduling problem and develops approximate solutions based on the Gittins index rule. Novel results include a hybrid state stochastic model for the information dynamics of tracked targets, an exact index rule solution of the SRM problem for a simplified tracking model, and use of approximate dynamic programming to extend the index rule solution to more realistic models.","PeriodicalId":399150,"journal":{"name":"Proceedings of the Fifth International Conference on Information Fusion. FUSION 2002. (IEEE Cat.No.02EX5997)","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114115959","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}