Spelling suggestions: "subject:"cooperative focalization"" "subject:"cooperative 1ocalization""
1 |
Cooperative self-localization in a multi-robot-no-landmark scenario using fuzzy logicSinha, Dhirendra Kumar 17 February 2005 (has links)
In this thesis, we develop a method using fuzzy logic to do cooperative localization. In a group of robots, at a given instant, each robot gives crisp pose estimates for all the other robots. These crisp pose values are converted to fuzzy membership functions based on various physical factors like acceleration of the robot and distance of separation of the two robots. For a given robot, all these fuzzy estimates are taken and fused together using fuzzy fusion techniques to calculate a possibility distribution function of the pose values. Finally, these possibility distributions are defuzzified using fuzzy techniques to find a crisp pose value for each robot. A MATLAB code is written to simulate this fuzzy logic algorithm. A Kalman filter approach is also implemented and then the results are compared qualitatively and quantitatively.
|
2 |
Nonparametric generalized belief propagation based on pseudo-junction tree for cooperative localization in wireless networksSavic, Vladimir, Zazo, Santiago January 2013 (has links)
Non-parametric belief propagation (NBP) is a well-known message passing method for cooperative localization in wireless networks. However, due to the over-counting problem in the networks with loops, NBP’s convergence is not guaranteed, and its estimates are typically less accurate. One solution for this problem is non-parametric generalized belief propagation based on junction tree. However, this method is intractable in large-scale networks due to the high-complexity of the junction tree formation, and the high-dimensionality of the particles. Therefore, in this article, we propose the non-parametric generalized belief propagation based on pseudo-junction tree (NGBP-PJT). The main difference comparing with the standard method is the formation of pseudo-junction tree, which represents the approximated junction tree based on thin graph. In addition, in order to decrease the number of high-dimensional particles, we use more informative importance density function, and reduce the dimensionality of the messages. As by-product, we also propose NBP based on thin graph (NBP-TG), a cheaper variant of NBP, which runs on the same graph as NGBP-PJT. According to our simulation and experimental results, NGBP-PJT method outperforms NBP and NBP-TG in terms of accuracy, computational, and communication cost in reasonably sized networks. / COOPLOC / FP7-ICT WHERE2
|
3 |
Cooperative self-localization in a multi-robot-no-landmark scenario using fuzzy logicSinha, Dhirendra Kumar 17 February 2005 (has links)
In this thesis, we develop a method using fuzzy logic to do cooperative localization. In a group of robots, at a given instant, each robot gives crisp pose estimates for all the other robots. These crisp pose values are converted to fuzzy membership functions based on various physical factors like acceleration of the robot and distance of separation of the two robots. For a given robot, all these fuzzy estimates are taken and fused together using fuzzy fusion techniques to calculate a possibility distribution function of the pose values. Finally, these possibility distributions are defuzzified using fuzzy techniques to find a crisp pose value for each robot. A MATLAB code is written to simulate this fuzzy logic algorithm. A Kalman filter approach is also implemented and then the results are compared qualitatively and quantitatively.
|
4 |
Indoor Cooperative Localization for Ultra Wideband Wireless Sensor NetworksAlsindi, Nayef 23 April 2008 (has links)
In recent years there has been growing interest in ad-hoc and wireless sensor networks (WSNs) for a variety of indoor applications. Localization information in these networks is an enabling technology and in some applications it is the main sought after parameter. The cooperative localization performance of WSNs is ultimately constrained by the behavior of the utilized ranging technology in dense cluttered indoor environments. Recently, ultra-wideband (UWB) Time-of-Arrival (TOA) based ranging has exhibited potential due to its large bandwidth and high time resolution. However, the performance of its ranging and cooperative localization capabilities in dense indoor multipath environments needs to be further investigated. Of main concern is the high probability of non-line of sight (NLOS) and Direct Path (DP) blockage between sensor nodes, which biases the TOA estimation and degrades the localization performance. In this dissertation, we first present the results of measurement and modeling of UWB TOA-based ranging in different indoor multipath environments. We provide detailed characterization of the spatial behavior of ranging, where we focus on the statistics of the ranging error in the presence and absence of the DP and evaluate the pathloss behavior in the former case which is important for indoor geolocation coverage characterization. Parameters of the ranging error probability distributions and pathloss models are provided for different environments: traditional office, modern office, residential and manufacturing floor; and different ranging scenarios: indoor-to-indoor (ITI), outdoor-to-indoor (OTI) and roof-to-indoor (RTI). Based on the developed empirical models of UWB TOA-based OTI and ITI ranging, we derive and analyze cooperative localization bounds for WSNs in the different indoor multipath environments. First, we highlight the need for cooperative localization in indoor applications. Then we provide comprehensive analysis of the factors affecting localization accuracy such as network and ranging model parameters. Finally we introduce a novel distributed cooperative localization algorithm for indoor WSNs. The Cooperative LOcalization with Quality of estimation (CLOQ) algorithm integrates and disseminates the quality of the TOA ranging and position information in order to improve the localization performance for the entire WSN. The algorithm has the ability to reduce the effects of the cluttered indoor environments by identifying and mitigating the associated ranging errors. In addition the information regarding the integrity of the position estimate is further incorporated in the iterative distributed localization process which further reduces error escalation in the network. The simulation results of CLOQ algorithm are then compared against the derived G-CRLB, which shows substantial improvements in the localization performance.
|
5 |
Bounds on RF cooperative localization for video capsule endoscopyYe, Yunxing 29 April 2013 (has links)
Wireless video capsule endoscopy has been in use for over a decade and it uses radio frequency (RF) signals to transmit approximately fifty five thousands clear pictures of inside the GI tract to the body-mounted sensor array. However, physician has no clue on the exact location of the capsule inside the GI tract to associate it with the pictures showing abnormalities such as bleeding or tumors. It is desirable to use the same RF signal for localization of the VCE as it passes through the human GI tract. In this thesis, we address the accuracy limits of RF localization techniques for VCE localization applications. We present an assessment of the accuracy of cooperative localization of VCE using radio frequency (RF) signals with particular emphasis on localization inside the small intestine. We derive the Cramer-Rao Lower Bound (CRLB) for cooperative location estimators using the received signal strength(RSS) or the time of arrival (TOA) of the RF signal. Our derivations are based on a three-dimension human body model, an existing model for RSS propagation from implant organs to body surface and a TOA ranging error model for the effects of non-homogenity of the human body on TOA of the RF signals. Using models for RSS and TOA errors, we first calculate the 3D CRLB bounds for cooperative localization of the VCE in three major digestive organs in the path of GI tract: the stomach, the small intestine and the large intestine. Then we analyze the performance of localization techniques on a typical path inside the small intestine. Our analysis includes the effects of number of external sensors, the external sensor array topology, number of VCE in cooperation and the random variations in transmit power from the capsule.
|
6 |
Nonparametric Message Passing Methods for Cooperative Localization and TrackingSavic, Vladimir January 2012 (has links)
The objective of this thesis is the development of cooperative localization and tracking algorithms using nonparametric message passing techniques. In contrast to the most well-known techniques, the goal is to estimate the posterior probability density function (PDF) of the position of each sensor. This problem can be solved using Bayesian approach, but it is intractable in general case. Nevertheless, the particle-based approximation (via nonparametric representation), and an appropriate factorization of the joint PDFs (using message passing methods), make Bayesian approach acceptable for inference in sensor networks. The well-known method for this problem, nonparametric belief propagation (NBP), can lead to inaccurate beliefs and possible non-convergence in loopy networks. Therefore, we propose four novel algorithms which alleviate these problems: nonparametric generalized belief propagation (NGBP) based on junction tree (NGBP-JT), NGBP based on pseudo-junction tree (NGBP-PJT), NBP based on spanning trees (NBP-ST), and uniformly-reweighted NBP (URW-NBP). We also extend NBP for cooperative localization in mobile networks. In contrast to the previous methods, we use an optional smoothing, provide a novel communication protocol, and increase the efficiency of the sampling techniques. Moreover, we propose novel algorithms for distributed tracking, in which the goal is to track the passive object which cannot locate itself. In particular, we develop distributed particle filtering (DPF) based on three asynchronous belief consensus (BC) algorithms: standard belief consensus (SBC), broadcast gossip (BG), and belief propagation (BP). Finally, the last part of this thesis includes the experimental analysis of some of the proposed algorithms, in which we found that the results based on real measurements are very similar with the results based on theoretical models.
|
7 |
Observability based Optimal Path Planning for Multi-Agent Systems to aid In Relative Pose EstimationBoyinine, Rohith 28 June 2021 (has links)
No description available.
|
8 |
Bearing-based localization and control for multiple quadrotor UAVs / Localisation et commande d'une flottille de quadrirotors à partir de l'observation de leur ligne de vueSchiano, Fabrizio 11 January 2018 (has links)
Le but de cette thèse est d'étendre l'état de l'art par des contributions sur le comportement collectif d'un groupe de robots volants, à savoir des quadrirotors UAV. Afin de pouvoir sûrement naviguer dans un environnement, ces derniers peuvent se reposer uniquement sur leurs capacités à bord et non sur des systèmes centralisés (e.g., Vicon ou GPS). Nous réalisons cet objectif en offrant une possible solution aux problèmes de contrôle en formation et de localisation à partir de mesures à bord et via une communication locale. Nous abordons ces problèmes exploitant différents concepts provenant de la théorie des graphes algébriques et de la théorie de la rigidité. Cela nous permet de résoudre ces problèmes de façon décentralisée et de proposer des algorithmes décentralisés capables de prendre en compte également des limites sensorielles classiques. Les capacités embarquées que nous avons mentionnées plus tôt sont représentées par une caméra monoculaire et une centrale inertielle (IMU) auxquelles s'ajoute la capacité de chaque robot à communiquer (par RF) avec certains de ses voisins. Cela est dû au fait que l'IMU et la caméra représentent une possible configuration économique et légère pour la navigation et la localisation autonome d'un quadrirotor UAV. / The aim of this Thesis is to give contributions to the state of the art on the collective behavior of a group of flying robots, specifically quadrotor UAVs, which can only rely on their onboard capabilities and not on a centralized system (e.g., Vicon or GPS) in order to safely navigate in the environment. We achieve this goal by giving a possible solution to the problems of formation control and localization from onboard sensing and local communication. We tackle these problems exploiting mainly concepts from algebraic graph theory and the so-called theory of rigidity. This allows us to solve these problems in a decentralized fashion, and propose decentralized algorithms able to also take into account some typical sensory limitations. The onboard capabilities we referred to above are represented by an onboard monocular camera and an inertial measurement unit (IMU) in addition to the capability of each robot to communicate (through RF) with some of its neighbors. This is due to the fact that an IMU and a camera represent a possible minimal, lightweight and inexpensive configuration for the autonomous localization and navigation of a quadrotor UAV.
|
9 |
Swarm Localization and Control via On-board Sensing and ComputationRajab, Fat-Hy Omar 07 1900 (has links)
Multi-agent robotic system have been proved to be more superior in undertaking functionalities, arduous or even impossible when performed by single agents. The increased efficiency in multi agent systems is achieved by the execution of the task in cooperative manner. But to achieve cooperation in multi agent systems, a good localization system is an important prerequisite. Currently, most of the multi-agent system rely on the use of the GPS to provide global positioning information which suffers great deterioration in performance in indoor applications, and also all to all communication between the agents will be required which is not efficient especially when the number of agents is large. In this regard, a real-time localization scheme is introduced which makes use of the robot’s on-board sensors and computational capabilities to determine the states of other agents in the multi agent system. This algorithm also takes the advantage of the swarming behaviour of the robots in the estimation of the states. This localization algorithm was found to produce more accurate agent state estimates as compared to a similar localization algorithm that does not take into account the swarming behaviour of the agents in simulations and real experiment involving two Unmanned Aerial Vehicles.
|
10 |
Sensor Fusion with Coordinated Mobile Robots / Sensorfusion med koordinerade mobila robotarHolmberg, Per January 2003 (has links)
<p>Robust localization is a prerequisite for mobile robot autonomy. In many situations the GPS signal is not available and thus an additional localization system is required. A simple approach is to apply localization based on dead reckoning by use of wheel encoders but it results in large estimation errors. With exteroceptive sensors such as a laser range finder natural landmarks in the environment of the robot can be extracted from raw range data. Landmarks are extracted with the Hough transform and a recursive line segment algorithm. By applying data association and Kalman filtering along with process models the landmarks can be used in combination with wheel encoders for estimating the global position of the robot. If several robots can cooperate better position estimates are to be expected because robots can be seen as mobile landmarks and one robot can supervise the movement of another. The centralized Kalman filter presented in this master thesis systematically treats robots and extracted landmarks such that benefits from several robots are utilized. Experiments in different indoor environments with two different robots show that long distances can be traveled while the positional uncertainty is kept low. The benefit from cooperating robots in the sense of reduced positional uncertainty is also shown in an experiment. </p><p>Except for localization algorithms a typical autonomous robot task in the form of change detection is solved. The change detection method, which requires robust localization, is aimed to be used for surveillance. The implemented algorithm accounts for measurement- and positional uncertainty when determining whether something in the environment has changed. Consecutive true changes as well as sporadic false changes are detected in an illustrative experiment.</p>
|
Page generated in 0.1364 seconds