Simultaneous Localization and Mapping (SLAM) algorithms with multiple autonomous robots have received considerable attention in recent years. In general, SLAM algorithms use odometry information and measurements from ...
详细信息
ISBN:
(纸本)9781467324199
Simultaneous Localization and Mapping (SLAM) algorithms with multiple autonomous robots have received considerable attention in recent years. In general, SLAM algorithms use odometry information and measurements from exteroceptive sensors of robots. The accuracy of these measurements and the performance of the corresponding SLAM algorithm directly affect the overall success of the system. This paper presents comparative performance evaluations of three Simultaneous Localization and Mapping (SLAM) algorithms using Extended Kalman Filter (EKF), Compressed Extended Kalman Filter (CEKF) and Unscented Kalman Filter (UKF). Specifically, it focuses on their SLAM performances and processing time requirements. To show the effect of CPU power on the processing time of SLAM algorithms, two notebooks and a netbook with different specifications have been used. Comparative simulation results show that processing time requirements are consistent with the computational complexities of SLAM algorithms. The results we obtained are consistent with the CPU power tests of independent organizations and show that higher processing power decreases processing time accordingly. The results also show that CEKF is more suitable for outdoor SLAM applications where there are a lot of natural and artificial features.
In order to measure the effectiveness of safety protection systems there are several design parameters. Diagnostic coverage factor is one of the most important parameter which influences all architectures. In this sho...
详细信息
In order to measure the effectiveness of safety protection systems there are several design parameters. Diagnostic coverage factor is one of the most important parameter which influences all architectures. In this short paper the relationship between PFD avg , DC and T I are presented. 1oo2 and 1oo2D architectures are considered as examples.
The 15th ACM SIGPLAN International Conference on Functional programming (ICFP) took place on September 27–29, 2010 in Baltimore, Maryland. After the conference, the programme committee, chaired by Stephanie Weirich, ...
The 15th ACM SIGPLAN International Conference on Functional programming (ICFP) took place on September 27–29, 2010 in Baltimore, Maryland. After the conference, the programme committee, chaired by Stephanie Weirich, selected several outstanding papers and invited their authors to submit to this special issue of Journal of Functional programming. Umut A. Acar and James Cheney acted as editors for these submissions. This issue includes the seven accepted papers, each of which provides substantial new material beyond the original conference version. The selected papers reflect a consensus by the program committee that ICFP 2010 had a number of strong papers that link core functional programming ideas with other areas, such as multicore, embedded systems, and data compression.
As parallel programming becomes the mainstream due to multicore processors, dynamic memory allocators used in C and C++ can suppress the performance of multi-threaded applications if they are not scalable. In this pap...
详细信息
Cache coherent Non-Uniform Memory Access (cc-NUMA) architectures have been widely used for chip multiprocessors (CMPs). However, they require complicated hardware to properly handle the cache coherence problem. Moreov...
详细信息
Recently, Intel has introduced a research prototype manycore processor called the Single-chip Cloud computer (SCC). The SCC is an experimental processor created by Intel Labs. It contains 48 cores in a single chip and...
详细信息
The paper is concerned with data transmission via channels composed of a memoryless binary symmetric channel and the erasure channel of Peter Elias. Channels of this type play an important role in modelling different ...
The paper is concerned with data transmission via channels composed of a memoryless binary symmetric channel and the erasure channel of Peter Elias. Channels of this type play an important role in modelling different types of networks especially wireless networks, and have been investigated using, amongst others, the theory of Markov chains. Channel Capacities and network flows have been determined. The authors focus their interest on some aspects of coding theory. They assume the data transmission to be protected by a linear code, a CRC for example, and determine the probability of undetected error of the code. They then consider redundant transmission via two or more channels with bit inversion, and calculate the probability of undetected error. They prove some inequalities that are useful instruments to estimate the rate of transmission errors and to determine safety integrity levels according to the standards. Finally the authors apply their results to Bluetooth channels suffering from different types of noise.
Maximum Distance Separable (MDS) codes are used as diffusion layers in the design of the well known block ciphers like the Advanced Encryption Standard (AES) and Khazad. The reason for the use of MDS codes in the desi...
详细信息
This paper presents a novel approach of using unmanned vehicles for Automated Meter Reading (AMR) applications in rural areas where there are a few consumers scattered around a wide area. The proposed system does not ...
详细信息
This paper presents the communication related design considerations of Wireless Sensor Network (WSN) aided Multi-Robot Simultaneous Localization and Mapping (SLAM). In this approach, multiple robots perform WSN-aided ...
详细信息
暂无评论