This paper presents a problem of finding collisionfree paths for multiple robots with individual start configurations and goal configurations. With the decoupled method, we try to find the collision-free paths if the solutions exist. The proposed algorithm consists of two phases. In the first phase, the path is obtained from the path planner for a single robot ignoring the existence of the other robots. To avoid mutual collisions, we assign temporarily either changed goal configurations to the robots which can be regarded as the obstacles or changed start configuration of the robot trying to move. We show that the proposed algorithm solves path planning problem in various scenarios. Keywords-path planning; multiple robot; centralized decoupled algorithm
{"title":"Centralized Decoupled Path Planning Algorithm for Multiple Robots Using the Temporary Goal Configurations","authors":"Jun-Han Oh, Joonyoung Park, Jong-Tae Lim","doi":"10.1109/CIMSIM.2011.43","DOIUrl":"https://doi.org/10.1109/CIMSIM.2011.43","url":null,"abstract":"This paper presents a problem of finding collisionfree paths for multiple robots with individual start configurations and goal configurations. With the decoupled method, we try to find the collision-free paths if the solutions exist. The proposed algorithm consists of two phases. In the first phase, the path is obtained from the path planner for a single robot ignoring the existence of the other robots. To avoid mutual collisions, we assign temporarily either changed goal configurations to the robots which can be regarded as the obstacles or changed start configuration of the robot trying to move. We show that the proposed algorithm solves path planning problem in various scenarios. Keywords-path planning; multiple robot; centralized decoupled algorithm","PeriodicalId":125671,"journal":{"name":"2011 Third International Conference on Computational Intelligence, Modelling & Simulation","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127182734","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}
A. Harun, A. Shakaff, A. Zakaria, L. Kamarudin, M. N. Jaafar, D. Ndzi
For deployment of Wireless Sensor Network in precision farming to be successful, a study of the performance of wireless systems from a network coverage and link quality perspectives must be conducted to ensure a reliable, optimized and cost effective deployment of the network. This paper reports on sets of measurements conducted in a potential precision farming site where there are mixed types of crops which would affect signal strength and link quality of WSNs. We observed insignificant differences in signal strength between antenna heights of 0.5 m and 1m for a flat open grass field. However a significant reduction in signal strength was observed in the presence of thick vegetation on the farmland which limited coverage to only 10 m range. In addition the range of WSN coverage is also reduced to about 16 m for measurements in a greenhouse with grape trellis canopy. This is contrary to enhancements of received signal strength by lateral waves propagating along the canopy reported by other researchers [8]. The paper also provides a comparison in network coverage for the same type of vegetation in greenhouse and outdoor environment.
{"title":"Wireless Sensor Networks Mapping and Deployment in Tropical Precision Farming","authors":"A. Harun, A. Shakaff, A. Zakaria, L. Kamarudin, M. N. Jaafar, D. Ndzi","doi":"10.1109/CIMSIM.2011.69","DOIUrl":"https://doi.org/10.1109/CIMSIM.2011.69","url":null,"abstract":"For deployment of Wireless Sensor Network in precision farming to be successful, a study of the performance of wireless systems from a network coverage and link quality perspectives must be conducted to ensure a reliable, optimized and cost effective deployment of the network. This paper reports on sets of measurements conducted in a potential precision farming site where there are mixed types of crops which would affect signal strength and link quality of WSNs. We observed insignificant differences in signal strength between antenna heights of 0.5 m and 1m for a flat open grass field. However a significant reduction in signal strength was observed in the presence of thick vegetation on the farmland which limited coverage to only 10 m range. In addition the range of WSN coverage is also reduced to about 16 m for measurements in a greenhouse with grape trellis canopy. This is contrary to enhancements of received signal strength by lateral waves propagating along the canopy reported by other researchers [8]. The paper also provides a comparison in network coverage for the same type of vegetation in greenhouse and outdoor environment.","PeriodicalId":125671,"journal":{"name":"2011 Third International Conference on Computational Intelligence, Modelling & Simulation","volume":"100 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133049503","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}
{"title":"Immobilizer Engine Control Unit (ECU) Using Radio Frequency Module","authors":"Noor Hafizah Abdul Aziz, S. S. Sarnin, Mohd Tahir","doi":"10.1109/CIMSIM.2011.65","DOIUrl":"https://doi.org/10.1109/CIMSIM.2011.65","url":null,"abstract":"","PeriodicalId":125671,"journal":{"name":"2011 Third International Conference on Computational Intelligence, Modelling & Simulation","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115758579","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}
The fundamental building block of semantic web documents is the ontology. Having different ontologies to support different semantic web documents leads to the problem of ontology integration in a broader sense. This brings about the need for ontology mapping. The problem with current ontology mapping approaches is that they are only able to solve specific areas of ontology mapping. In this paper, we propose a hybrid approach based on genetic algorithm that determines the best combination of algorithms to map the ontologies. A hybrid approach looks into different aspect of the ontology, resulting in an overall optimized ontology mapping result.
{"title":"A Hybrid Approach for Ontology Mapping via Genetic Algorithm","authors":"Shailendra Singh, Y. Cheah","doi":"10.1109/CIMSIM.2011.84","DOIUrl":"https://doi.org/10.1109/CIMSIM.2011.84","url":null,"abstract":"The fundamental building block of semantic web documents is the ontology. Having different ontologies to support different semantic web documents leads to the problem of ontology integration in a broader sense. This brings about the need for ontology mapping. The problem with current ontology mapping approaches is that they are only able to solve specific areas of ontology mapping. In this paper, we propose a hybrid approach based on genetic algorithm that determines the best combination of algorithms to map the ontologies. A hybrid approach looks into different aspect of the ontology, resulting in an overall optimized ontology mapping result.","PeriodicalId":125671,"journal":{"name":"2011 Third International Conference on Computational Intelligence, Modelling & Simulation","volume":"81 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122073439","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}
Recent developments in wireless communication and embedded computing technologies have led to the advent of wireless sensor network technology. Hundreds of thousands of these micro sensors can be deployed in many areas including health, environment and battlefield in order to monitor the domain with desired level of accuracy. When wireless sensors are deployed in an area, the lifetime of the network should last as long as possible according to the original amount of energy. Therefore, reducing energy consumption in WSNs is of primary concern. In this work, we have presented a protocol to maintain coverage and connectivity in wireless sensor networks, while switching off sensing or communication subsystem of some nodes to increase the network lifetime. The protocol presented here is a type of cluster based approach in which only a special set of nodes -- coordinators -- participate in packet routing but still each node decide independently to remain sensor, goes to sleep or become a coordinator. All nodes of the network generate a local coverage bitmap and based on this bitmap they decide to remain sensor or go to sleep. Using this local bitmap, the network will be capable of producing desired percentage of coverage. By using a local asynchronous scheduling, we have devised a mechanism to reduce interference between coordinator message broadcasts.
{"title":"SOCCP: Self Organize Coverage and Connectivity Protocol","authors":"H. Khosravi, Levon Aslanyan","doi":"10.1109/CIMSIM.2011.64","DOIUrl":"https://doi.org/10.1109/CIMSIM.2011.64","url":null,"abstract":"Recent developments in wireless communication and embedded computing technologies have led to the advent of wireless sensor network technology. Hundreds of thousands of these micro sensors can be deployed in many areas including health, environment and battlefield in order to monitor the domain with desired level of accuracy. When wireless sensors are deployed in an area, the lifetime of the network should last as long as possible according to the original amount of energy. Therefore, reducing energy consumption in WSNs is of primary concern. In this work, we have presented a protocol to maintain coverage and connectivity in wireless sensor networks, while switching off sensing or communication subsystem of some nodes to increase the network lifetime. The protocol presented here is a type of cluster based approach in which only a special set of nodes -- coordinators -- participate in packet routing but still each node decide independently to remain sensor, goes to sleep or become a coordinator. All nodes of the network generate a local coverage bitmap and based on this bitmap they decide to remain sensor or go to sleep. Using this local bitmap, the network will be capable of producing desired percentage of coverage. By using a local asynchronous scheduling, we have devised a mechanism to reduce interference between coordinator message broadcasts.","PeriodicalId":125671,"journal":{"name":"2011 Third International Conference on Computational Intelligence, Modelling & Simulation","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114685230","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}
M. Schapranow, Cindy Faehnrich, A. Zeier, H. Plattner
Integrating RFID technology in current supply chains involves the development and testing of various IT systems, such as event repositories. Their development requires excessive real-world event data to verify architecture designs, access control, response time behavior, etc. Due to lack of industry-wide adoption of RFID technology, real-world event data for global implementations is not available, today. In this work, we present a configurable simulator for RFID-aided supply chains that is capable to create consistent and realistic event data. We used our generated event data as the basis for getting real-world event data to define requirements, develop, and test RFID systems with concrete industry-specific event data before the industrial adoption of RFID technology succeeded. As a result, we were able to verify IT components in EPC global networks with real-world data long before concrete industry data is available.
{"title":"Simulation of RFID-aided Supply Chains: Case Study of the Pharmaceutical Supply Chain","authors":"M. Schapranow, Cindy Faehnrich, A. Zeier, H. Plattner","doi":"10.1109/CIMSIM.2011.68","DOIUrl":"https://doi.org/10.1109/CIMSIM.2011.68","url":null,"abstract":"Integrating RFID technology in current supply chains involves the development and testing of various IT systems, such as event repositories. Their development requires excessive real-world event data to verify architecture designs, access control, response time behavior, etc. Due to lack of industry-wide adoption of RFID technology, real-world event data for global implementations is not available, today. In this work, we present a configurable simulator for RFID-aided supply chains that is capable to create consistent and realistic event data. We used our generated event data as the basis for getting real-world event data to define requirements, develop, and test RFID systems with concrete industry-specific event data before the industrial adoption of RFID technology succeeded. As a result, we were able to verify IT components in EPC global networks with real-world data long before concrete industry data is available.","PeriodicalId":125671,"journal":{"name":"2011 Third International Conference on Computational Intelligence, Modelling & Simulation","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127640264","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}
Z. Vahidpoor, K. Forooraghi, Z. Atlasbaf, Ali Ahmadi
Fast, accurate and efficient sensing is of important aspects in cognitive radio technology. A new sensing circuit is proposed using a phase frequency detector for cognitive radio applications. Using this method, spectral sensing can be done in a very short time by a low cost, low power circuit, compared with available implemented methods. The PFD circuit resolves different frequencies without the need of variable filter bandwidth or the banks of filters. Also it accelerates sensing procedure because of short time needed to detect the signal. Simulations show the accurate operation of this method and comparison with other methods shows faster sweep rates.
{"title":"A New Spectrum Sensing Circuit for Cognitive Radio Applications","authors":"Z. Vahidpoor, K. Forooraghi, Z. Atlasbaf, Ali Ahmadi","doi":"10.1109/CIMSIM.2011.80","DOIUrl":"https://doi.org/10.1109/CIMSIM.2011.80","url":null,"abstract":"Fast, accurate and efficient sensing is of important aspects in cognitive radio technology. A new sensing circuit is proposed using a phase frequency detector for cognitive radio applications. Using this method, spectral sensing can be done in a very short time by a low cost, low power circuit, compared with available implemented methods. The PFD circuit resolves different frequencies without the need of variable filter bandwidth or the banks of filters. Also it accelerates sensing procedure because of short time needed to detect the signal. Simulations show the accurate operation of this method and comparison with other methods shows faster sweep rates.","PeriodicalId":125671,"journal":{"name":"2011 Third International Conference on Computational Intelligence, Modelling & Simulation","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131574894","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}
Floating point multiplication has became a common element in signal processing, image processing, filters and real time data processing digital circuits. This element highly influence the performance of the whole design in the form of area and power used. This paper presents a asynchronous reconfigurable approach to design a floating point multiplier for IEEE 754 double precision or two single precision numbers in parallel. The proposed design is a better solution in terms of area and power efficiency. The design is synthesized on XST of Xilinx ISE tool for vertex 2pro FPGA board and simulated on ModelSim. The proposed multiplier comprises of two units (i) Multiply-Add unit and (ii) Aligner-normalizing unit. This design can work up to 229.106 MHz and uses 1369 Slices of Virtex 2 Pro FPGA. Keywords-component, Asynchronous, Reconfigurable, Floating point, FPGA, pipelining and parallel Architecture.
浮点乘法已经成为信号处理、图像处理、滤波器和实时数据处理等数字电路中常用的元素。这个元素以面积和功率的形式高度影响整个设计的性能。本文提出了一种异步可重构的方法，用于ieee754双精度或两个单精度数并行设计浮点乘法器。该设计在面积和功率效率方面是一个更好的解决方案。该设计在Xilinx ISE工具的XST上进行合成，并在ModelSim上进行仿真。所建议的乘法器由两个单元组成(i)乘加单元和(ii)对齐归一化单元。本设计工作频率高达229.106 MHz，使用1369片Virtex 2 Pro FPGA。关键词:组件，异步，可重构，浮点，FPGA，流水线和并行架构。
{"title":"Clock-less Design for Reconfigurable Floating Point Multiplier","authors":"Y. Kumar, R.K. Sharma","doi":"10.1109/CIMSIM.2011.46","DOIUrl":"https://doi.org/10.1109/CIMSIM.2011.46","url":null,"abstract":"Floating point multiplication has became a common element in signal processing, image processing, filters and real time data processing digital circuits. This element highly influence the performance of the whole design in the form of area and power used. This paper presents a asynchronous reconfigurable approach to design a floating point multiplier for IEEE 754 double precision or two single precision numbers in parallel. The proposed design is a better solution in terms of area and power efficiency. The design is synthesized on XST of Xilinx ISE tool for vertex 2pro FPGA board and simulated on ModelSim. The proposed multiplier comprises of two units (i) Multiply-Add unit and (ii) Aligner-normalizing unit. This design can work up to 229.106 MHz and uses 1369 Slices of Virtex 2 Pro FPGA. Keywords-component, Asynchronous, Reconfigurable, Floating point, FPGA, pipelining and parallel Architecture.","PeriodicalId":125671,"journal":{"name":"2011 Third International Conference on Computational Intelligence, Modelling & Simulation","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134080363","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}
Today, we are very much concerned about our environment. Energy conservation has became the posit everywhere. Many disciplines try to solve this problem in their own way. This paper focuses on optimizing the energy consumption by electronic and electrical applications which employ battery grid network. The paper presented here proves helpful especially for electric vehicles, Industries and portable electric gadgets. The technique employed assembly is called as Grid Network Assembly (GNA). GNA uses a cheaply available processor such as 8086, 8085 etc to mechanically choose the best batteries in a grid network and mechanically brings them in series which can be used for power exaction, on the other hand we can also charge only the required batteries in a given grid network. The circuitry employed in designing the assembly is economically affordable. The Battery Management System which is available in the market is found to be expensive for a lay person. So GNA could be the best substitute as far as economic reasons are concerned. This system can also be used in laptops, portable DVD players and other portable electric gadgets to maintain the health of the batteries.
{"title":"Processor Enabled Power Management System by Mechanically Choosing the Best Batteries from a Grid Network","authors":"Aditya Warnulkar, A. Dhishan, M. Naveen","doi":"10.1109/CIMSIM.2011.56","DOIUrl":"https://doi.org/10.1109/CIMSIM.2011.56","url":null,"abstract":"Today, we are very much concerned about our environment. Energy conservation has became the posit everywhere. Many disciplines try to solve this problem in their own way. This paper focuses on optimizing the energy consumption by electronic and electrical applications which employ battery grid network. The paper presented here proves helpful especially for electric vehicles, Industries and portable electric gadgets. The technique employed assembly is called as Grid Network Assembly (GNA). GNA uses a cheaply available processor such as 8086, 8085 etc to mechanically choose the best batteries in a grid network and mechanically brings them in series which can be used for power exaction, on the other hand we can also charge only the required batteries in a given grid network. The circuitry employed in designing the assembly is economically affordable. The Battery Management System which is available in the market is found to be expensive for a lay person. So GNA could be the best substitute as far as economic reasons are concerned. This system can also be used in laptops, portable DVD players and other portable electric gadgets to maintain the health of the batteries.","PeriodicalId":125671,"journal":{"name":"2011 Third International Conference on Computational Intelligence, Modelling & Simulation","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130950472","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}
In this research the influence of wire electrical discharge machining on surface roughness and volumetric material removal rate is conducted. With use of experimental result analysis, design of experiments method and mathematical modeling, the correlation between corresponding parameters and process output characterization are studied. The investigated input parameters include electrical current, pulse-off time, open- circuit voltage and gap voltage. With use of experimental results and, subsequently, with exploitation of variance analysis, importance and effective percentages of each parameter are studied. In order to find optimal conditions, outputs extracted from Non-dominated Sorting Genetic and Tabu search algorithms compared with each other led in achieving appropriate models. Tabu search algorithm and Non-dominated Sorting Genetic Algorithm were compared with each other proving the superiority of Non-dominated Sorting Genetic Algorithm over Tabu search algorithm in optimizing machining parameters.
{"title":"Comparison of Intelligent Optimization Algorithms for Wire Electrical Discharge Machining Parameters","authors":"A. Golshan, S. Gohari, A. Ayob","doi":"10.1109/CIMSIM.2011.32","DOIUrl":"https://doi.org/10.1109/CIMSIM.2011.32","url":null,"abstract":"In this research the influence of wire electrical discharge machining on surface roughness and volumetric material removal rate is conducted. With use of experimental result analysis, design of experiments method and mathematical modeling, the correlation between corresponding parameters and process output characterization are studied. The investigated input parameters include electrical current, pulse-off time, open- circuit voltage and gap voltage. With use of experimental results and, subsequently, with exploitation of variance analysis, importance and effective percentages of each parameter are studied. In order to find optimal conditions, outputs extracted from Non-dominated Sorting Genetic and Tabu search algorithms compared with each other led in achieving appropriate models. Tabu search algorithm and Non-dominated Sorting Genetic Algorithm were compared with each other proving the superiority of Non-dominated Sorting Genetic Algorithm over Tabu search algorithm in optimizing machining parameters.","PeriodicalId":125671,"journal":{"name":"2011 Third International Conference on Computational Intelligence, Modelling & Simulation","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123209186","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
扫码关注我们
求助内容：
应助结果提醒方式：