Search results

The purpose of this research is to provide the necessarily and resourceful information regarding range sensors to select the best fit sensor for robust autonomous navigation. Autonomous navigation is an emerging segment in the field of mobile robot in which the mobile robot navigates in the environment with high level of autonomy by lacking human interactions. Sensor-based perception is a prevailing aspect in the autonomous navigation of mobile robot along with localization and path planning. Various range sensors are used to get the efficient perception of the environment, but selecting the best-fit sensor to solve the navigation problem is still a vital assignment.

Autonomous navigation relies on the sensory information of various sensors, and each sensor relies on various operational parameters/characteristic for the reliable functioning. A simple strategy shown in this proposed study to select the best-fit sensor based on various parameters such as environment, 2 D/3D navigation, accuracy, speed, environmental conditions, etc. for the reliable autonomous navigation of a mobile robot.

This paper provides a comparative analysis for the diverse range sensors used in mobile robotics with respect to various aspects such as accuracy, computational load, 2D/3D navigation, environmental conditions, etc. to opt the best-fit sensors for achieving robust navigation of autonomous mobile robot.

This paper provides a straightforward platform for the researchers to select the best range sensor for the diverse robotics application.

Robot localization in dynamic, cluttered environments is a challenging problem because it is impractical to have enough knowledge to be able to accurately model the robot’s environment in such a manner. This study aims to develop a novel probabilistic method equipped with function approximation techniques which is able to appropriately model the data distribution in Markov localization by using the maximum statistical power, thereby making a sensibly accurate estimation of robot’s pose in extremely dynamic, cluttered indoors environments.

The parameter vector of the statistical model is in the form of positions of easily detectable artificial landmarks in omnidirectional images. First, using probabilistic principal component analysis, the most likely set of parameters of the environmental model are extracted from the sensor data set consisting of missing values. Next, we use these parameters to approximate a probability density function, using support vector regression that is able to calculate the robot’s pose vector in each state of the Markov localization. At the end, using this density function, a good approximation of conditional density associated with the observation model is made which leads to a sensibly accurate estimation of robot’s pose in extremely dynamic, cluttered indoors environment.

The authors validate their method in an indoor office environment with 34 unique artificial landmarks. Further, they show that the accuracy remains high, even when they significantly increase the dynamics of the environment. They also show that compared to those appearance-based localization methods that rely on image pixels, the proposed localization strategy is superior in terms of accuracy and speed of convergence to a global minima.

By using easily detectable, and rotation, scale invariant artificial landmarks and the maximum statistical power which is provided through the concept of missing data, the authors have succeeded in determining precise pose updates without requiring too many computational resources to analyze the omnidirectional images. In addition, the proposed approach significantly reduces the risk of getting stuck in a local minimum by eliminating the possibility of having similar states.

The purpose of this paper is to address the online localization of mobile (service) robots in real world dynamic environments. Most of the techniques developed so far have been designed for static environments. What is presented here is a novel technique for mobile robot localization in quasi‐dynamic environments.

The proposed approach employs a probability grid map and Baye's filtering techniques. The former is used for representing the possible changes in the surrounding environment which a robot might have to face.

Simulation and experimental results show that this approach has a high degree of robustness by taking into account both sensor and world uncertainty. The methodology has been tested under different environment scenarios where diverse complex objects having different sizes and shapes were used to represent movable and non‐movable entities.

The results can be applied to diverse robotic systems that need to move in changing indoor environments such as hospitals and places where people might require assistance from autonomous robotic devices. The methodology is fast, efficient and can be used in fast‐moving robots, allowing them to perform complex operations such as path planning and navigation in real time.

What is proposed here is a novel mobile robot localization approach that enables unmanned vehicles to effectively move in real time and know their current location in dynamic environments. Such an approach consists of two steps: a generation of the probability grid map; and a recursive position estimation methodology employing a variant of the Baye's filter.

Robot localization technology has been widely studied for decades and a lot of remarkable approaches have been developed. However, in practice, this technology has hardly been applied to common day-to-day deployment scenarios. The purpose of this paper is to present a novel approach that focuses on improving the localization robustness in complicated environment.

The localization robustness is improved by dynamically switching the localization components (such as the environmental camera, the laser range finder and the depth camera). As the components are highly heterogeneous, they are developed under the robotic technology component (RTC) framework. This simplifies the developing process by increasing the potential for reusability and future expansion. To realize this switching, the localization reliability for each component is modeled, and a configuration method for dynamically selecting dependable components at run-time is presented.

The experimental results show that this approach significantly decreases robot lost situation in the complicated environment. The robustness is further enhanced through the cooperation of heterogeneous localization components.

A multi-component automatic switching approach for robot localization system is developed and described in this paper. The reliability of this system is proved to be a substantial improvement over single-component localization techniques.

The purpose of this paper is to propose a localizability-based particle filtering localization algorithm for mobile robots to maintain localization accuracy in the high-occluded and dynamic environments with moving people.

First, the localizability of mobile robots is defined to evaluate the influences of both the dynamic obstacles and prior-map on localization. Second, based on the classical two-sensor track fusion algorithm, the odometer-based proposal distribution function (PDF) is corrected, taking account of the localizability. Then, the corrected PDF is introduced into the classical PF with “roulette” re-sampling. Finally, the robot pose is estimated according to all the particles.

The experimental results show that, first, it is necessary to consider the influence of the prior-map during the localization in the high-occluded and dynamic environments. Second, the proposed algorithm can maintain an accurate and robust robot pose in the high-occluded and dynamic environments. Third, its real timing is acceptable.

When the odometer error and occlusion caused by the dynamic obstacles are both serious, the proposed algorithm also has a probability evolving into the kidnap problem. But fortunately, such serious situations are not common in practice.

To check the ability of real application, we have implemented the proposed algorithm in the campus cafeteria and metro station using an intelligent wheelchair. To better help the elderly and disabled people during their daily lives, the proposed algorithm will be tested in a social welfare home in the future.

The localizability of mobile robots is defined to evaluate the influences of both the dynamic obstacles and prior-map on localization. Based on the localizability, the odometer-based PDF is corrected properly.

In this paper, an attempt has been made to develop an algorithm equipped with geometric pattern registration techniques to perform exact, robust and fast robot localization purely based on laser range data.

The expected pose of the robot on a pre-calculated map is in the form of simulated sensor readings. To obtain the exact pose of the robot, segmentation of both real laser range and simulated laser range readings is performed. Critical points on two scan sets are extracted from the segmented range data and thereby the pose difference is computed by matching similar parts of the scans and calculating the relative translation.

In contrast to other self-localization algorithms based on particle filters and scan matching, the proposed method, in common positioning scenarios, provides a linear cost with respect to the number of sensor particles, making it applicable to real-time resource-limited embedded robots. The proposed method is able to obtain a sensibly accurate estimate of the relative pose of the robot even in non-occluded but partially visible segments conditions.

A comparison of state-of-the-art localization techniques has shown that geometrical scan registration algorithm is superior to the other localization methods based on scan matching in accuracy, processing speed and robustness to large positioning errors. Effectiveness of the proposed method has been demonstrated by conducting a series of real-world experiments.

Image‐based localisation has been widely investigated in mobile robotics. However, traditional image‐based localisation approaches do not work when the environment appearance changes. The purpose of this paper is to propose a new system for image‐based localisation, which enables the approach to work also in highly dynamic environments.

The proposed technique is based on the use of a distributed vision system (DVS) composed of a set of cameras installed in the environment and of a camera mounted on a mobile robot. The localisation of the robot is achieved by comparing the current image grabbed by the robot with the images grabbed, at the same time, by the DVS. Finding the DVS's image, most similar to the robot's image, gives a topological localisation of the robot.

Experiments reported in the paper proved the system to be effective, even exploiting a pre‐existent DVS not designed for this application.

Whilst, aware that DVSs, as the one used in this work, are not diffuse nowadays, this work is significant because a novel idea is proposed for dealing with dynamic environments in the image‐based localisation approach and the idea is validated with experiments. Camera Sensor networks currently are an emerging technology and they may be introduced in several daily environments in the future.

One difficult problem in robotics is localization: the ability of a mobile robot to determine its position in the environment. Roboticists around the globe have been working to find a solution to localization for more than 20 years; however, only in the past 4‐5 years we have seen some promising results. In this work, we describe a first‐of‐a‐kind, breakthrough technology for localization that requires only one low‐cost camera (less than 50USD) and odometry to provide localization. Because of its low‐cost and robust performance in realistic environments, this technology is particularly well‐suited for use in consumer and commercial applications.

“It should also be noted that the objective of convergence and equal distribution, including across under-performing areas, can hinder efforts to generate growth. Contrariwise, the objective of competitiveness can exacerbate regional and social inequalities, by targeting efforts on zones of excellence where projects achieve greater returns (dynamic major cities, higher levels of general education, the most advanced projects, infrastructures with the heaviest traffic, and so on). If cohesion policy and the Lisbon Strategy come into conflict, it must be borne in mind that the former, for the moment, is founded on a rather more solid legal foundation than the latter” European Commission (2005, p. 9)Adaptation of Cohesion Policy to the Enlarged Europe and the Lisbon and Gothenburg Objectives.

The purpose of this paper is to describe a general purpose localization system, GRAIL. GRAIL provides real‐time, adaptable, indoor localization for wireless devices.

In order to localize as diverse a set of devices as possible, GRAIL utilizes a centralized, anchor‐based approach. GRAIL defines an abstract data model for various system components to support different physical modalities. The scalable architecture of GRAIL provides maximum flexibility to integrate various localization algorithms.

The authors show through real deployments that GRAIL functions over a variety of physical modalities, networks, and algorithms. Further, the authors found that a centralized solution has critical advantages over distributed implementations for handling privacy concerns.

A key contribution of this system is its universal approach: it can integrate different hardware and software capabilities within a single localization framework. The deployment of such a system in academic and research environments allows researchers to explore issues beyond algorithms and investigate effects in real deployments.