Pub Date : 2001-10-30DOI: 10.1109/ICCIMA.2001.970477
D. Vranic
The topic of this paper is content-based 3D-object retrieval. The approach is based on feature vectors, which capture 3D-shape of a model represented as a triangle mesh. The feature vectors are invariant with respect to translation, rotation, scaling, and reflection and robust with respect to level-of-detail. Before the feature extraction, each 3D-object is transformed (normalized) into a canonical position and orientation. The search is performed in the feature vector space in which the feature vector of a query model is used as a key. Original normalization steps and feature vectors are presented in this communication.
{"title":"Content-based search for 3D-objects","authors":"D. Vranic","doi":"10.1109/ICCIMA.2001.970477","DOIUrl":"https://doi.org/10.1109/ICCIMA.2001.970477","url":null,"abstract":"The topic of this paper is content-based 3D-object retrieval. The approach is based on feature vectors, which capture 3D-shape of a model represented as a triangle mesh. The feature vectors are invariant with respect to translation, rotation, scaling, and reflection and robust with respect to level-of-detail. Before the feature extraction, each 3D-object is transformed (normalized) into a canonical position and orientation. The search is performed in the feature vector space in which the feature vector of a query model is used as a key. Original normalization steps and feature vectors are presented in this communication.","PeriodicalId":232504,"journal":{"name":"Proceedings Fourth International Conference on Computational Intelligence and Multimedia Applications. ICCIMA 2001","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124476584","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 : 2001-10-30DOI: 10.1109/ICCIMA.2001.970475
Xialong Fan, B. Verma
This paper compares segmentation-based and non-segmentation based techniques for cursive word recognition. In our segmentation based technique, every word is segmented into characters, the chain code features are extracted from segmented characters, the features are fed to neural network classifier and finally the words are constructed using a string compare algorithm. In our non-segmentation based technique, the chain code features are extracted directly from words and the words are fed to a neural network classifier to classify them into word classes. To make fair comparison, CEDAR benchmark database is used, and the parameters such as the number of words, thresholding, resizing, feature extraction techniques, etc., are kept same for both the techniques. Experimental results show that the non-segmentation technique achieves much higher recognition rate than the segmentation based technique.
{"title":"Segmentation vs. non-segmentation based neural techniques for cursive word recognition: an experimental analysis","authors":"Xialong Fan, B. Verma","doi":"10.1109/ICCIMA.2001.970475","DOIUrl":"https://doi.org/10.1109/ICCIMA.2001.970475","url":null,"abstract":"This paper compares segmentation-based and non-segmentation based techniques for cursive word recognition. In our segmentation based technique, every word is segmented into characters, the chain code features are extracted from segmented characters, the features are fed to neural network classifier and finally the words are constructed using a string compare algorithm. In our non-segmentation based technique, the chain code features are extracted directly from words and the words are fed to a neural network classifier to classify them into word classes. To make fair comparison, CEDAR benchmark database is used, and the parameters such as the number of words, thresholding, resizing, feature extraction techniques, etc., are kept same for both the techniques. Experimental results show that the non-segmentation technique achieves much higher recognition rate than the segmentation based technique.","PeriodicalId":232504,"journal":{"name":"Proceedings Fourth International Conference on Computational Intelligence and Multimedia Applications. ICCIMA 2001","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124133429","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 : 2001-10-30DOI: 10.1109/ICCIMA.2001.970502
Katti Faceli, A.C.P.L.F. de Carvalho, S. Rezende
Mobile robots rely on sensor data to have a representation of their environment. However the sensors usually provide incomplete, inconsistent or inaccurate information. Sensor fusion has been successfully employed to enhance the accuracy of sensor measures. This article proposes and investigates the use of artificial intelligence techniques for sensor fusion to improve the accuracy and reliability of a distance between a robot and an object in its work environment.
{"title":"Experiments on machine learning techniques for sensor fusion","authors":"Katti Faceli, A.C.P.L.F. de Carvalho, S. Rezende","doi":"10.1109/ICCIMA.2001.970502","DOIUrl":"https://doi.org/10.1109/ICCIMA.2001.970502","url":null,"abstract":"Mobile robots rely on sensor data to have a representation of their environment. However the sensors usually provide incomplete, inconsistent or inaccurate information. Sensor fusion has been successfully employed to enhance the accuracy of sensor measures. This article proposes and investigates the use of artificial intelligence techniques for sensor fusion to improve the accuracy and reliability of a distance between a robot and an object in its work environment.","PeriodicalId":232504,"journal":{"name":"Proceedings Fourth International Conference on Computational Intelligence and Multimedia Applications. ICCIMA 2001","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128842975","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 : 2001-10-30DOI: 10.1109/ICCIMA.2001.970479
B. Kusumoputro, A. Saptawijaya, A. Murni
This report proposes an adaptive recognition system, which is based on Kohonen self-organization network (KSOM). As the goals in the research on artificial neural network are to improve the recognition capability of the network and at the same time minimize the time needed for learning the patterns, these goals could be achieved by combining two types of learning, i.e. supervised learning and unsupervised learning. We have developed a new kind of hybrid neural learning system, combining unsupervised KSOM and supervised back-propagation learning rules. This hybrid neural system will henceforth be referred to as hybrid adaptive SOM with winning probability function and supervised BP or KSOM(WPF)-BP. This hybrid neural system could estimate the cluster distribution of given data, and directed it into predefined number of cluster neurons through creation and deletion mechanism. Comparison with other developed hybrid neural system is done for determination of various odors from Martha Tilaar Cosmetics product in an artificial odor recognition system. The performance of our developed learning system in term of its recognition ability and its learning time is explored in this report.
{"title":"Comparison of hybrid neural systems of KSOM-BP learning in artificial odor recognition system","authors":"B. Kusumoputro, A. Saptawijaya, A. Murni","doi":"10.1109/ICCIMA.2001.970479","DOIUrl":"https://doi.org/10.1109/ICCIMA.2001.970479","url":null,"abstract":"This report proposes an adaptive recognition system, which is based on Kohonen self-organization network (KSOM). As the goals in the research on artificial neural network are to improve the recognition capability of the network and at the same time minimize the time needed for learning the patterns, these goals could be achieved by combining two types of learning, i.e. supervised learning and unsupervised learning. We have developed a new kind of hybrid neural learning system, combining unsupervised KSOM and supervised back-propagation learning rules. This hybrid neural system will henceforth be referred to as hybrid adaptive SOM with winning probability function and supervised BP or KSOM(WPF)-BP. This hybrid neural system could estimate the cluster distribution of given data, and directed it into predefined number of cluster neurons through creation and deletion mechanism. Comparison with other developed hybrid neural system is done for determination of various odors from Martha Tilaar Cosmetics product in an artificial odor recognition system. The performance of our developed learning system in term of its recognition ability and its learning time is explored in this report.","PeriodicalId":232504,"journal":{"name":"Proceedings Fourth International Conference on Computational Intelligence and Multimedia Applications. ICCIMA 2001","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116515311","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 : 2001-10-30DOI: 10.1109/ICCIMA.2001.970471
T. Ichinoseki, K. Kayama
For pt.1. see IEEE Fall SIW, p. 333-40 (2000). This paper describes a modeling process and the federation results of the simulation of helicopter formation flight federation SAF (semi-automated forces) based on HLA/RTI. We also have realized an enemy entity that can move autonomously, thus, making this federation appear more realistic. The characteristics of this study are as follows. I) This formation flight model can conduct federation autonomously by applying artificial intelligence (AI) theory and a basic model of the human-decision process for helicopter flight. 2) We have developed a fundamental human-decision-process model for our helicopter formation flight based on insights gained,from responses to a questionnaire we used to get information from helicopter pilots about how they make decisions. This model can realize a federation that is more realistic than any other federation model. 3) In this model, if the command helicopter goes out of service, the other helicopter entities can carry on the mission autonomously. We demonstrated by a simulation that the result of a search mission does not change even if the command helicopter goes out of service. 4) An enemy can move in the battlefield and elude helicopter pursuit by using AI (which is like the constant satisfaction problem (CSP)) theory. 5) We have clarified the relation among the number of entities, the intricacy of a simulation scenario, and the network load on HLA/RTI. 6) We developed a more precise knowledge database that is based on the data culled from the pilot questionnaires. 7) To scrutinize the formation flying pattern, we can conduct a complicated simulation by using simpler rules for the helicopter flight pattern. As the result of a practice simulation, we found a way to conduct a simulation that is more complicated and realistic than any other existing model.
pt.1。参见IEEE Fall SIW，第333-40页(2000)。本文描述了基于HLA/RTI的直升机编队飞行联合半自动化部队仿真的建模过程和联合结果。我们还实现了一个可以自主移动的敌人实体，从而使这个联盟看起来更加现实。本研究的特点如下:1)该编队飞行模型运用人工智能理论和直升机飞行人类决策过程的基本模型，能够自主进行联邦。2)我们已经为直升机编队飞行开发了一个基本的人类决策过程模型，该模型基于我们从直升机飞行员那里获得的关于他们如何做出决策的问卷调查中获得的见解。此模型可以实现比任何其他联邦模型更现实的联邦。3)在该模型中，当指挥直升机停止服务时，其他直升机实体可以自主执行任务。我们通过模拟证明，即使指挥直升机停止服务，搜索任务的结果也不会改变。4)敌人可以在战场上移动，并通过使用AI(类似于恒定满意度问题(CSP))理论来躲避直升机的追捕。5)我们明确了实体数量、模拟场景的复杂性和HLA/RTI网络负载之间的关系。6)基于从试点问卷中收集的数据，我们开发了一个更精确的知识库。7)为了仔细研究编队飞行模式，我们可以使用更简单的规则对直升机飞行模式进行复杂的模拟。作为一个实践模拟的结果，我们发现了一种比任何其他现有模型更复杂和真实的模拟方法。
{"title":"Applying artificial intelligence theory to helicopter SAF simulation based on HLA/RTI. 2","authors":"T. Ichinoseki, K. Kayama","doi":"10.1109/ICCIMA.2001.970471","DOIUrl":"https://doi.org/10.1109/ICCIMA.2001.970471","url":null,"abstract":"For pt.1. see IEEE Fall SIW, p. 333-40 (2000). This paper describes a modeling process and the federation results of the simulation of helicopter formation flight federation SAF (semi-automated forces) based on HLA/RTI. We also have realized an enemy entity that can move autonomously, thus, making this federation appear more realistic. The characteristics of this study are as follows. I) This formation flight model can conduct federation autonomously by applying artificial intelligence (AI) theory and a basic model of the human-decision process for helicopter flight. 2) We have developed a fundamental human-decision-process model for our helicopter formation flight based on insights gained,from responses to a questionnaire we used to get information from helicopter pilots about how they make decisions. This model can realize a federation that is more realistic than any other federation model. 3) In this model, if the command helicopter goes out of service, the other helicopter entities can carry on the mission autonomously. We demonstrated by a simulation that the result of a search mission does not change even if the command helicopter goes out of service. 4) An enemy can move in the battlefield and elude helicopter pursuit by using AI (which is like the constant satisfaction problem (CSP)) theory. 5) We have clarified the relation among the number of entities, the intricacy of a simulation scenario, and the network load on HLA/RTI. 6) We developed a more precise knowledge database that is based on the data culled from the pilot questionnaires. 7) To scrutinize the formation flying pattern, we can conduct a complicated simulation by using simpler rules for the helicopter flight pattern. As the result of a practice simulation, we found a way to conduct a simulation that is more complicated and realistic than any other existing model.","PeriodicalId":232504,"journal":{"name":"Proceedings Fourth International Conference on Computational Intelligence and Multimedia Applications. ICCIMA 2001","volume":"136 8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126696557","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 : 2001-10-30DOI: 10.1109/ICCIMA.2001.970498
R. Sovat, A. de Carvalho
This article presents the main features of a new environment for case-based reasoning systems development, RaBeCa. The software, developed to run under Windows, aims to have an architecture open enough to accept external contributions and comprehend tests including several Artificial Intelligence common approaches. A small introduction to the case-based reasoning paradigm and a brief description of existing analogous systems are shown.
{"title":"A case-based reasoning development environment","authors":"R. Sovat, A. de Carvalho","doi":"10.1109/ICCIMA.2001.970498","DOIUrl":"https://doi.org/10.1109/ICCIMA.2001.970498","url":null,"abstract":"This article presents the main features of a new environment for case-based reasoning systems development, RaBeCa. The software, developed to run under Windows, aims to have an architecture open enough to accept external contributions and comprehend tests including several Artificial Intelligence common approaches. A small introduction to the case-based reasoning paradigm and a brief description of existing analogous systems are shown.","PeriodicalId":232504,"journal":{"name":"Proceedings Fourth International Conference on Computational Intelligence and Multimedia Applications. ICCIMA 2001","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127047271","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 : 2001-10-30DOI: 10.1109/ICCIMA.2001.970437
Hiwon Yoon, T. Tanahashi
The paper proposes a self-organization model for bid-ask spread transition in markets. In market microstructure theory, bid-ask spread has been explained as the result of an overall market players' intention. We focus on bid-ask spread transition after market opening and forward to closing, and interpret it by information effect. Our approach is based on a modeling methodology for viscoelastic material, that can consider the memory effect of information for a market system. Under the modeling process, we suggest 2 parameters that are related to a sensitivity effect and relaxation time effect of information into a market. Lastly, we empirically show the model explained as bid-ask spread transition in the Japanese equity market.
{"title":"Self-organization and information effect in financial market","authors":"Hiwon Yoon, T. Tanahashi","doi":"10.1109/ICCIMA.2001.970437","DOIUrl":"https://doi.org/10.1109/ICCIMA.2001.970437","url":null,"abstract":"The paper proposes a self-organization model for bid-ask spread transition in markets. In market microstructure theory, bid-ask spread has been explained as the result of an overall market players' intention. We focus on bid-ask spread transition after market opening and forward to closing, and interpret it by information effect. Our approach is based on a modeling methodology for viscoelastic material, that can consider the memory effect of information for a market system. Under the modeling process, we suggest 2 parameters that are related to a sensitivity effect and relaxation time effect of information into a market. Lastly, we empirically show the model explained as bid-ask spread transition in the Japanese equity market.","PeriodicalId":232504,"journal":{"name":"Proceedings Fourth International Conference on Computational Intelligence and Multimedia Applications. ICCIMA 2001","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127982815","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 : 2001-10-30DOI: 10.1109/ICCIMA.2001.970470
K. Uchiyama, Y. Iwai, T. Ichinoseki, K. Kayama
The paper describes a helicopter SAF simulation model based on HLA/RTI. Helicopter SAF requires complicated behavior in three dimensional space. The authors have developed a helicopter SAF model in Japan and have confirmed the effectiveness of the model. The characteristics of study are as follows. 1) This helicopter has "intention" by applying artificial intelligence (AI) theory, so it will behave autonomically and judge by itself. 2) Applying rule based reasoning (RBR) and case based reasoning (CBR), we can reflect proficient pilot behavior on our developed model. As a result, the helicopter conducts complicated flying patterns such as terrain avoidance. 3) The operator has a set mission to search for the enemy whose location is unknown. 4) The algorithm for enemy detection is based on searching pattern data. 5) The enemy can also detect the helicopter by using radar and watchman, as well as assaulting the helicopter by missile. 6) Regarding environmental federation, we use a digital map data and input weather data for visibility, ceiling, cloudy status, wind velocity, wind direction etc. 7) To scrutinize helicopter flying pattern, we can conduct complicated simulation by using simpler rules for the helicopter flight pattern than normal.
{"title":"Applying artificial intelligence theory to helicopter SAF simulation based on HLA/RTI (1)","authors":"K. Uchiyama, Y. Iwai, T. Ichinoseki, K. Kayama","doi":"10.1109/ICCIMA.2001.970470","DOIUrl":"https://doi.org/10.1109/ICCIMA.2001.970470","url":null,"abstract":"The paper describes a helicopter SAF simulation model based on HLA/RTI. Helicopter SAF requires complicated behavior in three dimensional space. The authors have developed a helicopter SAF model in Japan and have confirmed the effectiveness of the model. The characteristics of study are as follows. 1) This helicopter has \"intention\" by applying artificial intelligence (AI) theory, so it will behave autonomically and judge by itself. 2) Applying rule based reasoning (RBR) and case based reasoning (CBR), we can reflect proficient pilot behavior on our developed model. As a result, the helicopter conducts complicated flying patterns such as terrain avoidance. 3) The operator has a set mission to search for the enemy whose location is unknown. 4) The algorithm for enemy detection is based on searching pattern data. 5) The enemy can also detect the helicopter by using radar and watchman, as well as assaulting the helicopter by missile. 6) Regarding environmental federation, we use a digital map data and input weather data for visibility, ceiling, cloudy status, wind velocity, wind direction etc. 7) To scrutinize helicopter flying pattern, we can conduct complicated simulation by using simpler rules for the helicopter flight pattern than normal.","PeriodicalId":232504,"journal":{"name":"Proceedings Fourth International Conference on Computational Intelligence and Multimedia Applications. ICCIMA 2001","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127564315","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 : 2001-10-30DOI: 10.1109/ICCIMA.2001.970500
C. R. Milaré, A. de Carvalho, M. C. Monard
Although Artificial Neural Networks (ANNs) have been satisfactorily employed in several problems, such as clustering, pattern recognition, dynamic systems control and prediction, they still suffer from significant limitations. One of them is that the induced concept representation is not usually comprehensible to humans. Several techniques have been suggested to extract meaningful knowledge from trained ANNs. This paper proposes the use of symbolic learning algorithms, commonly used by the Machine Learning community, to extract symbolic representations from trained ANNs. The procedure proposed is similar to that used by the Trepan algorithm (Craven, 1996), which extracts comprehensible, symbolic representations (decision trees) from trained ANNs.
{"title":"Extracting rules from neural networks using symbolic algorithms: preliminary results","authors":"C. R. Milaré, A. de Carvalho, M. C. Monard","doi":"10.1109/ICCIMA.2001.970500","DOIUrl":"https://doi.org/10.1109/ICCIMA.2001.970500","url":null,"abstract":"Although Artificial Neural Networks (ANNs) have been satisfactorily employed in several problems, such as clustering, pattern recognition, dynamic systems control and prediction, they still suffer from significant limitations. One of them is that the induced concept representation is not usually comprehensible to humans. Several techniques have been suggested to extract meaningful knowledge from trained ANNs. This paper proposes the use of symbolic learning algorithms, commonly used by the Machine Learning community, to extract symbolic representations from trained ANNs. The procedure proposed is similar to that used by the Trepan algorithm (Craven, 1996), which extracts comprehensible, symbolic representations (decision trees) from trained ANNs.","PeriodicalId":232504,"journal":{"name":"Proceedings Fourth International Conference on Computational Intelligence and Multimedia Applications. ICCIMA 2001","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132060459","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 : 2001-10-30DOI: 10.1109/ICCIMA.2001.970457
T. Shiose, T. Onitsuka, T. Taura
An indirect control method is a useful tool for guiding group dynamics to the desired one without ignoring each individual's decision, and information provision is one such indirect control method. However, there are few discussions regarding systematic ways to provide such information. The main purpose of this paper is to investigate effective ways to provide information for relieving traffic congestion. An agent-based simulation for representing complex traffic phenomena is introduced and some ways to provide information are discussed. The results of this study are then summarized.
{"title":"Effective information provision for relieving traffic congestion","authors":"T. Shiose, T. Onitsuka, T. Taura","doi":"10.1109/ICCIMA.2001.970457","DOIUrl":"https://doi.org/10.1109/ICCIMA.2001.970457","url":null,"abstract":"An indirect control method is a useful tool for guiding group dynamics to the desired one without ignoring each individual's decision, and information provision is one such indirect control method. However, there are few discussions regarding systematic ways to provide such information. The main purpose of this paper is to investigate effective ways to provide information for relieving traffic congestion. An agent-based simulation for representing complex traffic phenomena is introduced and some ways to provide information are discussed. The results of this study are then summarized.","PeriodicalId":232504,"journal":{"name":"Proceedings Fourth International Conference on Computational Intelligence and Multimedia Applications. ICCIMA 2001","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133699291","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：