Category Archives: Robotics

Calibrating a robotic manipulator through photogrammetry, and a nice state-of-the-art in the issue of robot calibration

Alexandre Filion, Ahmed Joubair, Antoine S. Tahan, Ilian A. Bonev, Robot calibration using a portable photogrammetry system, Robotics and Computer-Integrated Manufacturing, Volume 49, 2018, Pages 77-87, DOI: 10.1016/j.rcim.2017.05.004.

This work investigates the potential use of a commercially-available portablephotogrammetry system (the MaxSHOT 3D) in industrial robot calibration. To demonstrate the effectiveness of this system, we take the approach of comparing the device with a laser tracker (the FARO laser tracker) by calibrating an industrial robot, with each device in turn, then comparing the obtained robot position accuracy after calibration. As the use of a portablephotogrammetry system in robot calibration is uncommon, this paper presents how to proceed. It will cover the theory of robot calibration: the robot’s forward and inverse kinematics, the elasto-geometrical model of the robot, the generation and ultimate selection of robot configurations to be measured, and the parameter identification. Furthermore, an experimental comparison of the laser tracker and the MaxSHOT3D is described. The obtained results show that the FARO laser trackerION performs slightly better: The absolute positional accuracy obtained with the laser tracker is 0.365mm and 0.147mm for the maximum and the mean position errors, respectively. Nevertheless, the results obtained by using the MaxSHOT3D are almost as good as those obtained by using the laser tracker: 0.469mm and 0.197mm for the maximum and the mean position errors, respectively. Performances in distance accuracy, after calibration (i.e. maximum errors), are respectively 0.329mm and 0.352mm, for the laser tracker and the MaxSHOT 3D. However, as the validation measurements were acquired with the laser tracker, bias favors this device. Thus, we may conclude that the calibration performances of the two measurement devices are very similar.

Interesting implementation of visual graph SLAM in C++ for educational purposes

Dominik Schlegel, Mirco Colosi, Giorgio Grisetti, ProSLAM: Graph SLAM from a Programmer’s Perspective/strong>, arXiv:1709.04377.

In this paper we present ProSLAM, a lightweight stereo visual SLAM system designed with simplicity in mind. Our work stems from the experience gathered by the authors while teaching SLAM to students and aims at providing a highly modular system that can be easily implemented and understood. Rather than focusing on the well known mathematical aspects of Stereo Visual SLAM, in this work we highlight the data structures and the algorithmic aspects that one needs to tackle during the design of such a system. We implemented ProSLAM using the C++ programming language in combination with a minimal set of well known used external libraries. In addition to an open source implementation, we provide several code snippets that address the core aspects of our approach directly in this paper. The results of a thorough validation performed on standard benchmark datasets show that our approach achieves accuracy comparable to state of the art methods, while requiring substantially less computational resources.

Improving efficiency of decision with POMDPs in high-dimension state spaces

Dmitry Kopitkov and Vadim Indelman, No belief propagation required: Belief space planning in high-dimensional state spaces via factor graphs, the matrix determinant lemma, and re-use of calculation, The International Journal of Robotics Research, Vol 36, Issue 10, pp. 1088 – 1130, DOI: 10.1177/0278364917721629.

We develop a computationally efficient approach for evaluating the information-theoretic term within belief space planning (BSP), where during belief propagation the state vector can be constant or augmented. We consider both unfocused and focused problem settings, whereas uncertainty reduction of the entire system or only of chosen variables is of interest, respectively. State-of-the-art approaches typically propagate the belief state, for each candidate action, through calculation of the posterior information (or covariance) matrix and subsequently compute its determinant (required for entropy). In contrast, our approach reduces runtime complexity by avoiding these calculations. We formulate the problem in terms of factor graphs and show that belief propagation is not needed, requiring instead a one-time calculation that depends on (the increasing with time) state dimensionality, and per-candidate calculations that are independent of the latter. To that end, we develop an augmented version of the matrix determinant lemma, and show that computations can be re-used when evaluating impact of different candidate actions. These two key ingredients and the factor graph representation of the problem result in a computationally efficient (augmented) BSP approach that accounts for different sources of uncertainty and can be used with various sensing modalities. We examine the unfocused and focused instances of our approach, and compare it with the state of the art, in simulation and using real-world data, considering problems such as autonomous navigation in unknown environments, measurement selection and sensor deployment. We show that our approach significantly reduces running time without any compromise in performance.

A practical example of mobile robot long term operation

N. Hawes et al., The STRANDS Project: Long-Term Autonomy in Everyday Environments, IEEE Robotics & Automation Magazine, vol. 24, no. 3, pp. 146-156, DOI: 10.1109/MRA.2016.2636359.

Thanks to the efforts of the robotics and autonomous systems community, the myriad applications and capacities of robots are ever increasing. There is increasing demand from end users for autonomous service robots that can operate in real environments for extended periods. In the Spatiotemporal Representations and Activities for Cognitive Control in Long-Term Scenarios (STRANDS) project (http://strandsproject.eu), we are tackling this demand head-on by integrating state-of-the-art artificial intelligence and robotics research into mobile service robots and deploying these systems for long-term installations in security and care environments. Our robots have been operational for a combined duration of 104 days over four deployments, autonomously performing end-user-defined tasks and traversing 116 km in the process. In this article, we describe the approach we used to enable long-term autonomous operation in everyday environments and how our robots are able to use their long run times to improve their own performance.

An application of POMDPs to robot surveillance

S. Witwicki et al., Autonomous Surveillance Robots: A Decision-Making Framework for Networked Muiltiagent Systems, IEEE Robotics & Automation Magazine, vol. 24, no. 3, pp. 52-64, DOI: 10.1109/MRA.2017.2662222.

This article proposes an architecture for an intelligent surveillance system, where the aim is to mitigate the burden on humans in conventional surveillance systems by incorporating intelligent interfaces, computer vision, and autonomous mobile robots. Central to the intelligent surveillance system is the application of research into planning and decision making in this novel context. In this article, we describe the robot surveillance decision problem and explain how the integration of components in our system supports fully automated decision making. Several concrete scenarios deployed in real surveillance environments exemplify both the flexibility of our system to experiment with different representations and algorithms and the portability of our system into a variety of problem contexts. Moreover, these scenarios demonstrate how planning enables robots to effectively balance surveillance objectives, autonomously performing the job of human patrols and responders.

Interesting approach to learning the sensorimotor behavior of a robot and of its predictive capabilities through NN

R. Santos, R. Ferreira, Â. Cardoso and A. Bernardino, SNet: Co-Developing Artificial Retinas and Predictive Internal Models for Real Robots, IEEE Transactions on Cognitive and Developmental Systems, vol. 9, no. 3, pp. 213-222, DOI: 10.1109/TCDS.2016.2638885.

This paper focuses on a recently developed biologically inspired architecture, here denoted as sensorimotor network (SNet), able to co-develop sensorimotor structures directly from data acquired by a robot interacting with its environment. Such networks learn efficient internal models of the sensorimotor system, developing simultaneously sensor and motor representations as well as predictive models of the sensorimotor relationships adapted to their operating environment. Here, we describe our recent model of sensorimotor development and compare its performance with neural network models in predicting self-induced stimuli. In addition, we illustrate the influence of available resources and environment characteristics in the development of the SNet structures. Finally, an SNet is trained using real data recorded during a quadricopter drone flight.

Chaos theory for modeling behavior of mobile robots that solve tasks evolutionarily

Federico Da Rold, Chaotic analysis of embodied and situated agents, Robotics and Autonomous Systems, Volume 95, 2017, Pages 143-159, DOI: 10.1016/j.robot.2017.06.004.

Embodied and situated view of cognition is a transdisciplinary framework which stresses the importance of real time and dynamical interaction of an agent with the surrounding environment. This article presents a series of evolutionary robotics experiments that operationalize such concept, training miniature two-wheeled mobile robots to autonomously solve a temporal task. In order to provide a numerical description of the robots’ behavior, chaotic measures are estimated on the attractor reconstructed from the recorded positions of the agent. Chaos theory provides a rigorous mathematical framework consistent with an antireductionist approach, useful for understanding embodied and situated systems while avoiding a decomposition of the integrated system brain–body–environment. Time series are analyzed in detail using nonlinear mathematical tools in order to verify the presence of low-dimensional deterministic dynamical systems, a fundamental prerequisite for chaos theory. In particular, the recorded time series are evaluated with nonlinear prediction error to unveil deterministic dynamics, cross-prediction error to determine the stationarity of the signal, and surrogate data testing to verify the existence of nonlinear components in the underlying system. Estimators for quantifying level of chaos and fractal dimension are applied to suitable datasets. Results show that robots governed by a chaotic dynamic are more efficient at adapting to environments never experience during evolution, demonstrating robustness towards novel and unpredictable situations. Furthermore, chaotic measures, in particular fractal dimension, are correlated with the performance if robots exhibit a similar behavioral strategy.

Improving orientation estimation in a mobile robot for doing better odometry

M.T. Sabet, H.R. Mohammadi Daniali, A.R. Fathi, E. Alizadeh, Experimental analysis of a low-cost dead reckoning navigation system for a land vehicle using a robust AHRS, Robotics and Autonomous Systems, Volume 95, 2017, Pages 37-51, DOI: 10.1016/j.robot.2017.05.010.

In navigation and motion control of an autonomous vehicle, estimation of attitude and heading is an important issue especially when the localization sensors such as GPS are not available and the vehicle is navigated by the dead reckoning (DR) strategies. In this paper, based on a new modeling framework an Extended Kalman Filter (EKF) is utilized for estimation of attitude, heading and gyroscope sensor bias using a low-cost MEMS inertial sensor. The algorithm is developed for accurate estimation of attitude and heading in the presence of external disturbances including external body accelerations and magnetic disturbances. In this study using the proposed attitude and heading reference system (AHRS) and an odometer sensor, a low-cost aided DR navigation system has been designed. The proposed algorithm application is evaluated by experimental tests in different acceleration bound and existence of external magnetic disturbances for a land vehicle. The results indicate that the roll, pitch and heading are estimated by mean value errors about 0.83%, 0.68% and 1.13%, respectively. Moreover, they indicate that a relative navigation error about 3% of the traveling distance can be achieved using the developed approach in during GPS outages.

Identification of beacons for localization by using LEDs with light patterns as IDs

G. Simon, G. Zachár and G. Vakulya, Lookup: Robust and Accurate Indoor Localization Using Visible Light Communication, IEEE Transactions on Instrumentation and Measurement, vol. 66, no. 9, pp. 2337-2348, DOI: 10.1109/TIM.2017.2707878.

A novel indoor localization system is presented, where LED beacons are utilized to determine the position of the target sensor, including a camera, an inclinometer, and a magnetometer. The beacons, which can be a part of the existing lighting infrastructure, transmit their identifiers for long distances using visible light communication techniques. The sensor is able to sense and detect the high-frequency (flicker free) code by properly undersampling the transmitted signal. The localization is performed using novel geometric and consensus-based techniques, which tolerate well measurement inaccuracies and sporadic outliers. The performance of the system is analyzed using simulations and real measurements. According to large-scale tests in realistic environments, the accuracy of the proposed system is in the low decimeter range.

Using bad results during policy iteration, and not only good ones, to improve the learning process

A. Colomé and C. Torras, Dual REPS: A Generalization of Relative Entropy Policy Search Exploiting Bad Experiences, IEEE Transactions on Robotics, vol. 33, no. 4, pp. 978-985, DOI: 10.1109/TRO.2017.2679202.

Policy search (PS) algorithms are widely used for their simplicity and effectiveness in finding solutions for robotic problems. However, most current PS algorithms derive policies by statistically fitting the data from the best experiments only. This means that experiments yielding a poor performance are usually discarded or given too little influence on the policy update. In this paper, we propose a generalization of the relative entropy policy search (REPS) algorithm that takes bad experiences into consideration when computing a policy. The proposed approach, named dual REPS (DREPS) following the philosophical interpretation of the duality between good and bad, finds clusters of experimental data yielding a poor behavior and adds them to the optimization problem as a repulsive constraint. Thus, considering that there is a duality between good and bad data samples, both are taken into account in the stochastic search for a policy. Additionally, a cluster with the best samples may be included as an attractor to enforce faster convergence to a single optimal solution in multimodal problems. We first tested our proposed approach in a simulated reinforcement learning setting and found that DREPS considerably speeds up the learning process, especially during the early optimization steps and in cases where other approaches get trapped in between several alternative maxima. Further experiments in which a real robot had to learn a task with a multimodal reward function confirm the advantages of our proposed approach with respect to REPS.