Two novel distributed particle filters with Gaussian Mixer approximation are proposed to localize and track multiple moving targets in a wireless sensor network. The distributed particle filters run on a set of uncorr...
详细信息
Classical Configuration Space (C-space) is often used in such a assumption that obstacles are static and robots have global knowledge of environment. Recently, there has been much more attention in Multi-Robot systems...
详细信息
ISBN:
(纸本)0780394356
Classical Configuration Space (C-space) is often used in such a assumption that obstacles are static and robots have global knowledge of environment. Recently, there has been much more attention in Multi-Robot systems (MRS), unfortunately a MRS which have local sensing cannot meet the assumption. If it can be solved, the motion planning of the MRS will benefit from previous motion planning algorithms in C-space. Toward resolving aforementioned problems, in the first place, we model the environment and robots as some sets of polygons, robots are Unmanned Ground Vehicles (UGVs) with limited sensing range and can communicate with each other. Then a decentralized method is introduced by which two autonomous robots search environment and build C-space obstacles, while exchange and merge partial C-space generated by another robot every certain time interval until the whole C-space obstacles are established, it is similar to Concurrent Mapping and Localization (CML), but we mainly focus on the algorithm of generating and merging C-space. Finally a simulated implementation demonstrates validity of our algorithm.
We address the problem of highly transient populations in unstructured and loosely-structured peer-to-peer systems. We propose a number of illustrative query-related strategies and organizational protocols that, by ta...
详细信息
ISBN:
(纸本)0769523765
We address the problem of highly transient populations in unstructured and loosely-structured peer-to-peer systems. We propose a number of illustrative query-related strategies and organizational protocols that, by taking into consideration the expected session times of peers (their lifespans), yield systems with performance characteristics more resilient to the natural instability of their environments. We first demonstrate the benefits of lifespan-based organizational protocols in terms of end-application performance and in the context of dynamic and heterogeneous Internet environments. We do this using a number of currently adopted and proposed query-related strategies, including methods for query distribution, caching and replication. We then show, through trace-driven simulation and wide-area experimentation, the performance advantages of lifespan-based, query-related strategies when layered over currently employed and lifespan-based organizational protocols. While merely illustrative, the evaluated strategies and protocols clearly demonstrate the advantages of considering peers' session time in designing widely-deployed peer-to-peer systems.
Localization is an important issue in wireless sensor networks (WSNs). Several applications in WSNs can tolerate the diverse levels of accuracy in geographic information such as physical location. Besides, direction i...
详细信息
We introduce FLAMA (FLow-Aware Medium Access), an energy-efficient medium-access control (MAC) protocol designed for wireless sensor networks. FLAMA achieves energy efficiency by preventing idle listening, data collis...
详细信息
The key issue of Peer Data Management systems (PDMSs) is how to efficiently organize and manage distributed resources in P2P networks to accurately route queries from the peer initiating the query to appropriate peers...
详细信息
An algorithm for time division multiple access (TDMA) is found to be applicable in converting existing distributed algorithms into a model that is consistent with sensor networks. Such a TDMA service needs to be self-...
详细信息
In this paper, we propose four general queueing models based on input and server distributions, to analyze a special Grid system, VEGA grid system version 1.1 (VEGA1.1). The mean queue lengths and mean waiting times o...
详细信息
It has been shown that, in a network computing platform, the arrival order of input data has serious impact on the performance of a computing server. In a multi-client environment, each client competes with the others...
详细信息
We present our parallel plasma Particle-In-Cell Simulation experiment based on a Computation Grid system on the high performance network SuperSINET This Computation Grid system consists of three supercomputer nodes on...
详细信息
ISBN:
(纸本)0769524869
We present our parallel plasma Particle-In-Cell Simulation experiment based on a Computation Grid system on the high performance network SuperSINET This Computation Grid system consists of three supercomputer nodes on SuperSINET configured with the Globus Toolkits and MPICH-G2. In our experiments, we first confirm the scalability of the parallel PIC simulation code on this Computational Grid After we analyze the results and find that the bottleneck point exist on communication across the network, we successfully make use of some useful features of Globus and MPICH-G2 architecture to improve communication efficiency across the network.
暂无评论