Pub Date : 2005-03-19DOI: 10.1109/ICNSC.2005.1461197
Zhenhua Yu, Zhiwu Li
Multi-agent systems are studied from the software architecture point of view. As traditional architecture description languages (ADLs) are difficult to describe the semantics of multi-agent systems, a novel architecture description language for multi-agent systems (ADLMAS) rooted in BDI model is proposed, which adopts object-oriented Petri nets presented in this paper as a formal theory basis. ADLMAS can visually and intuitively depict a formal framework for multi-agent system from the agent level and society level, describe the static and dynamic semantics, and analyze the dynamic behaviors of multi-agent systems and interactions among agents with formal methods. Moreover, ADLMAS is very suitable for representing concurrent, distributed and synchronous multi-agent systems. Finally, to illustrate the favorable representation capability of ADLMAS, an example of multi-agent systems in electronic marketplace is provided.
{"title":"Architecture description language based on object-oriented Petri nets for multi-agent systems","authors":"Zhenhua Yu, Zhiwu Li","doi":"10.1109/ICNSC.2005.1461197","DOIUrl":"https://doi.org/10.1109/ICNSC.2005.1461197","url":null,"abstract":"Multi-agent systems are studied from the software architecture point of view. As traditional architecture description languages (ADLs) are difficult to describe the semantics of multi-agent systems, a novel architecture description language for multi-agent systems (ADLMAS) rooted in BDI model is proposed, which adopts object-oriented Petri nets presented in this paper as a formal theory basis. ADLMAS can visually and intuitively depict a formal framework for multi-agent system from the agent level and society level, describe the static and dynamic semantics, and analyze the dynamic behaviors of multi-agent systems and interactions among agents with formal methods. Moreover, ADLMAS is very suitable for representing concurrent, distributed and synchronous multi-agent systems. Finally, to illustrate the favorable representation capability of ADLMAS, an example of multi-agent systems in electronic marketplace is provided.","PeriodicalId":313251,"journal":{"name":"Proceedings. 2005 IEEE Networking, Sensing and Control, 2005.","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115999905","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 : 2005-03-19DOI: 10.1109/ICNSC.2005.1461279
Li Li, Guanpi Lai, Feiyue Wang
With increasing demands on driving safety, vehicle steering control attracts significant interests during the last two decades. One important problem is that drivers may overestimate the maximum speed they can adopt or choose a wrong trajectory profile (steering guideline) during steering. This often leads the vehicle run out of the road. To avoid such accidents, this paper analyzes the relationship between navigation speed and the corresponding cruise offset with given steering curvature, and provides an estimation method for maximum safe speed regarding a curve or a lane change trajectory. To improve ride comfort, an optimal guideline planning framework considering different driver/passenger requirement is proposed. Besides, how to choose graphical user interface for steering guidance is also discussed.
{"title":"Safe steering speed estimation and optimal trajectory planning for intelligent vehicles","authors":"Li Li, Guanpi Lai, Feiyue Wang","doi":"10.1109/ICNSC.2005.1461279","DOIUrl":"https://doi.org/10.1109/ICNSC.2005.1461279","url":null,"abstract":"With increasing demands on driving safety, vehicle steering control attracts significant interests during the last two decades. One important problem is that drivers may overestimate the maximum speed they can adopt or choose a wrong trajectory profile (steering guideline) during steering. This often leads the vehicle run out of the road. To avoid such accidents, this paper analyzes the relationship between navigation speed and the corresponding cruise offset with given steering curvature, and provides an estimation method for maximum safe speed regarding a curve or a lane change trajectory. To improve ride comfort, an optimal guideline planning framework considering different driver/passenger requirement is proposed. Besides, how to choose graphical user interface for steering guidance is also discussed.","PeriodicalId":313251,"journal":{"name":"Proceedings. 2005 IEEE Networking, Sensing and Control, 2005.","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114986398","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 : 2005-03-19DOI: 10.1109/ICNSC.2005.1461185
Chung-Kuo Chang, J. Overhage, J. Huang
Since the inception of sensor networks, it is recognized that the foremost application of such a network is on monitoring environmental activities. Due to the extreme resource constraints, a critical feature of such a network is to conserve energy to extend the lifetime of the sensors. A variety of energy aware algorithms have been developed for these networks by aggregating or filtering of data being transmitted. Energy can also be saved by selecting a subgroup of sensors to activate each time. Uncertainties are introduced due to the inaccuracy in sensor readings, noise or failure of sensors, or the omissions of data transmission following those energy aware algorithms. On the other hand, there usually are uncertainties inherited in the application where these sensor networks are built. Its usefulness depends on whether we can find a strategy to reduce uncertainties and at the same time conserve energy in such a system. We discuss the application of sensor networks in the problem of syndromic surveillance. The aggregated action of the sensors would provide early evidence for screening and identification of outbreaks of diseases or bio-agents. We study the effects of using the Bayesian methods to reduce uncertainties in sensor networks for medical decision-making. Experimental results obtained using operational data are used to verify our assumptions. A lot of study has been done on applying sensor networks to tasks such as tracking of a moving object, which is mapping an estimation task over a network of sensors. This project is the first case to map a medical decision, which is essentially an uncertainty refinement problem to sensor networks.
{"title":"An application of sensor networks for syndromic surveillance","authors":"Chung-Kuo Chang, J. Overhage, J. Huang","doi":"10.1109/ICNSC.2005.1461185","DOIUrl":"https://doi.org/10.1109/ICNSC.2005.1461185","url":null,"abstract":"Since the inception of sensor networks, it is recognized that the foremost application of such a network is on monitoring environmental activities. Due to the extreme resource constraints, a critical feature of such a network is to conserve energy to extend the lifetime of the sensors. A variety of energy aware algorithms have been developed for these networks by aggregating or filtering of data being transmitted. Energy can also be saved by selecting a subgroup of sensors to activate each time. Uncertainties are introduced due to the inaccuracy in sensor readings, noise or failure of sensors, or the omissions of data transmission following those energy aware algorithms. On the other hand, there usually are uncertainties inherited in the application where these sensor networks are built. Its usefulness depends on whether we can find a strategy to reduce uncertainties and at the same time conserve energy in such a system. We discuss the application of sensor networks in the problem of syndromic surveillance. The aggregated action of the sensors would provide early evidence for screening and identification of outbreaks of diseases or bio-agents. We study the effects of using the Bayesian methods to reduce uncertainties in sensor networks for medical decision-making. Experimental results obtained using operational data are used to verify our assumptions. A lot of study has been done on applying sensor networks to tasks such as tracking of a moving object, which is mapping an estimation task over a network of sensors. This project is the first case to map a medical decision, which is essentially an uncertainty refinement problem to sensor networks.","PeriodicalId":313251,"journal":{"name":"Proceedings. 2005 IEEE Networking, Sensing and Control, 2005.","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115310512","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 : 2005-03-19DOI: 10.1109/ICNSC.2005.1461169
Wen-Bing Horng, Jian-Wen Peng, Chih-Yuan Chen
A new image-based real-time flame detection method is proposed in this paper. First, fire flame features based on the HSI color model are extracted by analyzing 70 flame images. Then, based on these flame features, regions with fire-like colors are roughly separated from an image. Besides segmenting fire flame regions, background objects with similar fire colors or caused by color shift resulted from the reflection of fire flames are also separated from the image. In order to get rid of these spurious fire-like regions, the image difference method and the invented color masking technique are applied. Finally, a simple method is devised to estimate the burning degree of fire flames so that users could be informed with a proper warning alarm. The proposed method is tested with seven diverse fire flame video clips on a Pentium II 350 processor with 128 MB RAM at the process speed of thirty frames per second. The experimental results are quite encouraging. The proposed method can achieve more than 96.97% detection rate on average. In addition, the system can correctly recognize fire flames within one second on the initial combustion from the test video clips, which seems very promising.
提出了一种新的基于图像的火焰实时检测方法。首先,通过对70幅火焰图像的分析,提取基于HSI颜色模型的火焰火焰特征;然后,基于这些火焰特征,从图像中大致分离出具有类似火焰颜色的区域。除了分割火焰区域外,还将与火焰颜色相似或因火焰反射而产生色移的背景物体从图像中分离出来。为了消除这些虚假的火状区域,应用了图像差分法和发明的颜色掩蔽技术。最后,设计了一种简单的方法来估计火焰的燃烧程度,以便向用户发出适当的警告警报。该方法在Pentium II 350处理器上以每秒30帧的处理速度对7个不同的火焰视频片段进行了测试。实验结果相当令人鼓舞。该方法的平均检出率达到96.97%以上。此外,从测试视频片段来看,该系统可以在一秒钟内正确识别出最初燃烧的火焰,这似乎很有前景。
{"title":"A new image-based real-time flame detection method using color analysis","authors":"Wen-Bing Horng, Jian-Wen Peng, Chih-Yuan Chen","doi":"10.1109/ICNSC.2005.1461169","DOIUrl":"https://doi.org/10.1109/ICNSC.2005.1461169","url":null,"abstract":"A new image-based real-time flame detection method is proposed in this paper. First, fire flame features based on the HSI color model are extracted by analyzing 70 flame images. Then, based on these flame features, regions with fire-like colors are roughly separated from an image. Besides segmenting fire flame regions, background objects with similar fire colors or caused by color shift resulted from the reflection of fire flames are also separated from the image. In order to get rid of these spurious fire-like regions, the image difference method and the invented color masking technique are applied. Finally, a simple method is devised to estimate the burning degree of fire flames so that users could be informed with a proper warning alarm. The proposed method is tested with seven diverse fire flame video clips on a Pentium II 350 processor with 128 MB RAM at the process speed of thirty frames per second. The experimental results are quite encouraging. The proposed method can achieve more than 96.97% detection rate on average. In addition, the system can correctly recognize fire flames within one second on the initial combustion from the test video clips, which seems very promising.","PeriodicalId":313251,"journal":{"name":"Proceedings. 2005 IEEE Networking, Sensing and Control, 2005.","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121125818","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 : 2005-03-19DOI: 10.1109/ICNSC.2005.1461246
Yu-Cheng Lin, Ji-Chang Lo
This paper studies an H/sub /spl infin// output feedback control problem for continuous-time T-S fuzzy systems with time-varying delays both in state variables and forced input. Unlike the existing results need the information on derivative of delay time, we propose two delay-dependent sufficient conditions free from derivative information on delay time, which means a fast-varying delay time is allowed. Based on Lyapunov theory, the sufficient conditions are expressed in terms of LMIs. Lastly, an example is demonstrated using the proposed design methodology.
{"title":"H/sub /spl infin// output feedback control for delay Takagi-Sugeno fuzzy systems","authors":"Yu-Cheng Lin, Ji-Chang Lo","doi":"10.1109/ICNSC.2005.1461246","DOIUrl":"https://doi.org/10.1109/ICNSC.2005.1461246","url":null,"abstract":"This paper studies an H/sub /spl infin// output feedback control problem for continuous-time T-S fuzzy systems with time-varying delays both in state variables and forced input. Unlike the existing results need the information on derivative of delay time, we propose two delay-dependent sufficient conditions free from derivative information on delay time, which means a fast-varying delay time is allowed. Based on Lyapunov theory, the sufficient conditions are expressed in terms of LMIs. Lastly, an example is demonstrated using the proposed design methodology.","PeriodicalId":313251,"journal":{"name":"Proceedings. 2005 IEEE Networking, Sensing and Control, 2005.","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123883506","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 : 2005-03-19DOI: 10.1109/ICNSC.2005.1461170
Ruifan Li, Cong Wang, Xuyan Tu
Natural immune system has many features for inspirations to computer security. From this paradigm, a new multi-agent model for network-based intrusion detection system is presented. We briefly summarize the main mechanisms of immunology from information processing perspective and concisely review the related works. Moreover, some mechanisms, including cloning with hyper-mutation, affinity maturation, and stigmergy are incorporated to this new model for network intrusion detection. Its conceptual view and working mechanism are described, and its characteristics, autonomous, robust, adaptable, and lightweight, are discussed.
{"title":"A new immunity-based model for network intrusion detection","authors":"Ruifan Li, Cong Wang, Xuyan Tu","doi":"10.1109/ICNSC.2005.1461170","DOIUrl":"https://doi.org/10.1109/ICNSC.2005.1461170","url":null,"abstract":"Natural immune system has many features for inspirations to computer security. From this paradigm, a new multi-agent model for network-based intrusion detection system is presented. We briefly summarize the main mechanisms of immunology from information processing perspective and concisely review the related works. Moreover, some mechanisms, including cloning with hyper-mutation, affinity maturation, and stigmergy are incorporated to this new model for network intrusion detection. Its conceptual view and working mechanism are described, and its characteristics, autonomous, robust, adaptable, and lightweight, are discussed.","PeriodicalId":313251,"journal":{"name":"Proceedings. 2005 IEEE Networking, Sensing and Control, 2005.","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125291706","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 : 2005-03-19DOI: 10.1109/ICNSC.2005.1461313
Lu Qingling, Zeng Guangping, Zhang Wei, Tu Xuyan
SoftMan is a new concept based on the production of distributed technique, intelligent robot and artificial life. SoftMan is the development of a mobile agent and is a virtual robot in the network environment. It inherited many research fruits of robot and agent. Therefore, it has the essential features of the intelligent robot and agent, and at the same time has life features. Comparing with the agent, SoftMan not only has more all-around humanized intelligence, humanized behavior and function, but also has the ability of environment identification, self-determination and free will. SoftMan has some digital life features which agent has none, such as activity, learning and evolution, inheritance, variation and emotion. The corresponding theory and technology fruits provided a good foundation and reference for studying SoftMan. At first, this paper introduces the technology of SoftMan and agent, and then discusses the relationship between SoftMan and agent from the viewpoint of structure model, function, implementation technique, and application example.
{"title":"SoftMan and agent","authors":"Lu Qingling, Zeng Guangping, Zhang Wei, Tu Xuyan","doi":"10.1109/ICNSC.2005.1461313","DOIUrl":"https://doi.org/10.1109/ICNSC.2005.1461313","url":null,"abstract":"SoftMan is a new concept based on the production of distributed technique, intelligent robot and artificial life. SoftMan is the development of a mobile agent and is a virtual robot in the network environment. It inherited many research fruits of robot and agent. Therefore, it has the essential features of the intelligent robot and agent, and at the same time has life features. Comparing with the agent, SoftMan not only has more all-around humanized intelligence, humanized behavior and function, but also has the ability of environment identification, self-determination and free will. SoftMan has some digital life features which agent has none, such as activity, learning and evolution, inheritance, variation and emotion. The corresponding theory and technology fruits provided a good foundation and reference for studying SoftMan. At first, this paper introduces the technology of SoftMan and agent, and then discusses the relationship between SoftMan and agent from the viewpoint of structure model, function, implementation technique, and application example.","PeriodicalId":313251,"journal":{"name":"Proceedings. 2005 IEEE Networking, Sensing and Control, 2005.","volume":"46 11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123266844","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 : 2005-03-19DOI: 10.1109/ICNSC.2005.1461245
Yuh-Horng Wen, Tsu-Tian Lee, Hsun-Jung Cho
This paper develops a data processing with hybrid models toward data treatment and data fusion for traffic detector data on freeways. hybrid grey-theory-based pseudo-nearest neighbor method and grey time-series model are developed to recover spatial and temporal data failures. Both spatial and temporal patterns of traffic data are also considered in travel time data fusion. Two travel time data fusion models are presented using a speed-based link travel time extrapolation model for analytical travel time estimation and a recurrent neural network with grey-models for real-time travel time prediction. Field data from the Taiwan national freeway no. 1 were used as a case study for testing the proposed models. Study results shown that the data treatment models for faulty data recovery were accurate. The data fusion models were capable of accurately predicting travel times. The results indicated that the proposed hybrid data processing approaches can ensure the accuracy of travel time estimation with incomplete data sets.
{"title":"Hybrid models toward traffic detector data treatment and data fusion","authors":"Yuh-Horng Wen, Tsu-Tian Lee, Hsun-Jung Cho","doi":"10.1109/ICNSC.2005.1461245","DOIUrl":"https://doi.org/10.1109/ICNSC.2005.1461245","url":null,"abstract":"This paper develops a data processing with hybrid models toward data treatment and data fusion for traffic detector data on freeways. hybrid grey-theory-based pseudo-nearest neighbor method and grey time-series model are developed to recover spatial and temporal data failures. Both spatial and temporal patterns of traffic data are also considered in travel time data fusion. Two travel time data fusion models are presented using a speed-based link travel time extrapolation model for analytical travel time estimation and a recurrent neural network with grey-models for real-time travel time prediction. Field data from the Taiwan national freeway no. 1 were used as a case study for testing the proposed models. Study results shown that the data treatment models for faulty data recovery were accurate. The data fusion models were capable of accurately predicting travel times. The results indicated that the proposed hybrid data processing approaches can ensure the accuracy of travel time estimation with incomplete data sets.","PeriodicalId":313251,"journal":{"name":"Proceedings. 2005 IEEE Networking, Sensing and Control, 2005.","volume":"134 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129393382","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 : 2005-03-19DOI: 10.1109/ICNSC.2005.1461283
F. Velasco, Félix Ramos
Web services have become very popular over the past few years. However, users are facing the problem of the perceived QoS. Practical approaches to address this issue are based on service replication at multiple locations and on allocation mechanisms to dispatch requests in such a way that the QoS perceived by the user is improved. In this paper we compare user perceived QoS performance of three dynamic request placement techniques. One technique randomly allocates Web requests while the other two techniques implement a market-based mechanism for QoS negotiation and request allocation. The analysis is conducted via simulation with SIDE using a behavioral model of Web traffic to simulate accurate traffic conditions and determine the limitations or validity of these techniques.
{"title":"Performance evaluation of quality of service aware request placement techniques","authors":"F. Velasco, Félix Ramos","doi":"10.1109/ICNSC.2005.1461283","DOIUrl":"https://doi.org/10.1109/ICNSC.2005.1461283","url":null,"abstract":"Web services have become very popular over the past few years. However, users are facing the problem of the perceived QoS. Practical approaches to address this issue are based on service replication at multiple locations and on allocation mechanisms to dispatch requests in such a way that the QoS perceived by the user is improved. In this paper we compare user perceived QoS performance of three dynamic request placement techniques. One technique randomly allocates Web requests while the other two techniques implement a market-based mechanism for QoS negotiation and request allocation. The analysis is conducted via simulation with SIDE using a behavioral model of Web traffic to simulate accurate traffic conditions and determine the limitations or validity of these techniques.","PeriodicalId":313251,"journal":{"name":"Proceedings. 2005 IEEE Networking, Sensing and Control, 2005.","volume":"94 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130927190","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 : 2005-03-19DOI: 10.1109/ICNSC.2005.1461206
G. York, D. Pack
In this paper, we evaluate two different methods to search, detect, and locate mobile radio frequency (RF) targets using multiple cooperative unmanned aerial vehicles (VAVs). The primary difference between the two methods is the target localization technique used: the Kalman estimation technique and the triangulation technique. We compare the two methods on the basis of the total task completion time and the total average target location accuracy. The qualitative results generated by a graphical simulator are presented as a part of our comparison study.
{"title":"Comparative study on time-varying target localization methods using multiple unmanned aerial vehicles: Kalman estimation and triangulation techniques","authors":"G. York, D. Pack","doi":"10.1109/ICNSC.2005.1461206","DOIUrl":"https://doi.org/10.1109/ICNSC.2005.1461206","url":null,"abstract":"In this paper, we evaluate two different methods to search, detect, and locate mobile radio frequency (RF) targets using multiple cooperative unmanned aerial vehicles (VAVs). The primary difference between the two methods is the target localization technique used: the Kalman estimation technique and the triangulation technique. We compare the two methods on the basis of the total task completion time and the total average target location accuracy. The qualitative results generated by a graphical simulator are presented as a part of our comparison study.","PeriodicalId":313251,"journal":{"name":"Proceedings. 2005 IEEE Networking, Sensing and Control, 2005.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129515685","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}