Elicit the Best Ways through Identify Congestion Places

Mohammad Alodat, I. Abdullah
{"title":"Elicit the Best Ways through Identify Congestion Places","authors":"Mohammad Alodat, I. Abdullah","doi":"10.1109/ACSAT.2014.25","DOIUrl":null,"url":null,"abstract":"In this paper the exploitation of infrastructure and take advantage of communication techniques wired and wireless to help drivers in finding ways does not contain any obstacles and reach to the target with commitment in speed of assessed road. We use Fusion or Polygamy Technology with Fuzzy Logic, Neural Network and Genetic Algorithm for extract Cut-Node (CN). We use Cut-Node (CN) in order to identify obstacles and avoid them such as changes that occur in the lighting, weather conditions, accidents, congestion and maintenance of roads. Cut-Node (CN) useful in understanding the surrounding environment, supporting safe driving, increases the flow and fastest path to arrive at the designated target (end point). Three models have been proposed to extract Cut-Node (CN) as follows: 1) Intuitionistic Fuzzy Set (IFS). 2) The Intuitionistic Fuzzy Set Data Base is representing imprecise data. 3) Intuitionistic Fuzzy Neural Network with Genetic Algorithm (IFNN-GA).","PeriodicalId":137452,"journal":{"name":"2014 3rd International Conference on Advanced Computer Science Applications and Technologies","volume":"105 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-12-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 3rd International Conference on Advanced Computer Science Applications and Technologies","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ACSAT.2014.25","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

In this paper the exploitation of infrastructure and take advantage of communication techniques wired and wireless to help drivers in finding ways does not contain any obstacles and reach to the target with commitment in speed of assessed road. We use Fusion or Polygamy Technology with Fuzzy Logic, Neural Network and Genetic Algorithm for extract Cut-Node (CN). We use Cut-Node (CN) in order to identify obstacles and avoid them such as changes that occur in the lighting, weather conditions, accidents, congestion and maintenance of roads. Cut-Node (CN) useful in understanding the surrounding environment, supporting safe driving, increases the flow and fastest path to arrive at the designated target (end point). Three models have been proposed to extract Cut-Node (CN) as follows: 1) Intuitionistic Fuzzy Set (IFS). 2) The Intuitionistic Fuzzy Set Data Base is representing imprecise data. 3) Intuitionistic Fuzzy Neural Network with Genetic Algorithm (IFNN-GA).
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
通过确定拥堵地点引出最佳方法
在本文中,利用基础设施,利用有线和无线通信技术,帮助驾驶员找到不包含任何障碍的方法,并以评估道路的速度达到目标。采用模糊逻辑、神经网络和遗传算法相结合的融合或一夫多妻技术提取切割节点(CN)。我们使用Cut-Node (CN)来识别障碍物并避开它们,例如发生在照明、天气条件、事故、拥堵和道路维护中的变化。Cut-Node (CN)有助于了解周围环境,支持安全驾驶,增加流量和到达指定目标(终点)的最快路径。本文提出了三种提取Cut-Node (CN)的模型:1)直觉模糊集(IFS)。2)直觉模糊集数据库表示不精确的数据。3)直觉模糊神经网络遗传算法(IFNN-GA)。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Management Dimension for Assessing Organizations' Readiness toward Business Intelligence Systems Multi-user Searchable Encryption with Fine-Grained Access Control without Key Sharing Mobile Online Services and Measuring User Satisfaction: Study of Kuwait Elicit the Best Ways through Identify Congestion Places Design a New Proposed Route Optimization Scheme Based NEMO-Centric MANEMO (NCM)
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1