Learning Ground Traversability from Simulations

Mobile ground robots operating on unstructured terrain must predict which areas of the environment they are able to pass in order to plan feasible paths. We address traversability estimation as a heightmap classification problem: we build a convolutional neural network that, given an image representing the heightmap of a terrain patch, predicts whether the robot will be able to traverse such patch from left to right. The classifier is trained for a specific robot model (wheeled, tracked, legged, snake-like) using simulation data on procedurally generated training terrains; the trained classifier can be applied to unseen large heightmaps to yield oriented traversability maps, and then plan traversable paths. We extensively evaluate the approach in simulation on six real-world elevation datasets, and run a real-robot validation in one indoor and one outdoor environment.Comment: Webpage: http://romarcg.xyz/traversability_estimation

A vision-guided parallel parking system for a mobile robot using approximate policy iteration

Reinforcement Learning (RL) methods enable autonomous robots to learn skills from scratch by interacting with the environment. However, reinforcement learning can be very time consuming. This paper focuses on accelerating the reinforcement learning process on a mobile robot in an unknown environment. The presented algorithm is based on approximate policy iteration with a continuous state space and a fixed number of actions. The action-value function is represented by a weighted combination of basis functions. Furthermore, a complexity analysis is provided to show that the implemented approach is guaranteed to converge on an optimal policy with less computational time. A parallel parking task is selected for testing purposes. In the experiments, the efficiency of the proposed approach is demonstrated and analyzed through a set of simulated and real robot experiments, with comparison drawn from two well known algorithms (Dyna-Q and Q-learning)

Navigation control of an automated mobile robot robot using neural network technique

Over recent years, automated mobile robots play a crucial role in various navigation operations. For any mobile device, the capacity to explore in its surroundings is essential. Evading hazardous circumstances, for example, crashes and risky conditions (temperature, radiation, presentation to climate, and so on.) comes in the first place, yet in the event that the robot has a reason that identifies with particular places in its surroundings, it must discover those spots. There is an increment in examination here due to the requisition of mobile robots in a solving issues like investigating natural landscape and assets, transportation tasks, surveillance, or cleaning. We require great moving competencies and a well exactness for moving in a specified track in these requisitions. Notwithstanding, control of these navigation bots get to be exceptionally troublesome because of the exceedingly unsystematic and dynamic aspects of the surrounding world. The intelligent reply to this issue is the provision of sensors to study the earth. As neural networks (NNs) are described by adaptability and a fitness for managing non-linear problems, they are conceived to be useful when utilized on navigation robots. In this exploration our computerized reasoning framework is focused around neural network model for control of an Automated motion robot in eccentric and unsystematic nature. Hence the back propagation algorithm has been utilized for controlling the direction of the mobile robot when it experiences by an obstacle in the left, right and front directions. The recreation of the robot under different deterrent conditions is carried out utilizing Arduino which utilizes C programs for usage

GP-Localize: Persistent Mobile Robot Localization using Online Sparse Gaussian Process Observation Model

Central to robot exploration and mapping is the task of persistent localization in environmental fields characterized by spatially correlated measurements. This paper presents a Gaussian process localization (GP-Localize) algorithm that, in contrast to existing works, can exploit the spatially correlated field measurements taken during a robot's exploration (instead of relying on prior training data) for efficiently and scalably learning the GP observation model online through our proposed novel online sparse GP. As a result, GP-Localize is capable of achieving constant time and memory (i.e., independent of the size of the data) per filtering step, which demonstrates the practical feasibility of using GPs for persistent robot localization and autonomy. Empirical evaluation via simulated experiments with real-world datasets and a real robot experiment shows that GP-Localize outperforms existing GP localization algorithms.Comment: 28th AAAI Conference on Artificial Intelligence (AAAI 2014), Extended version with proofs, 10 page

The Pyro toolkit for AI and robotics

This article introduces Pyro, an open-source Python robotics toolkit for exploring topics in AI and robotics. We present key abstractions that al- low Pyro controllers to run unchanged on a variety of real and simulated robots. We demonstrate Py- ro’s use in a set of curricular modules. We then de- scribe how Pyro can provide a smooth transition for the student from symbolic agents to real-world robots, which significantly reduces the cost of learning to use robots. Finally we show how Pyro has been successfully integrated into existing AI and robotics courses