Technical report on Optimization-Based Bearing-Only Visual Homing with Applications to a 2-D Unicycle Model

We consider the problem of bearing-based visual homing: Given a mobile robot which can measure bearing directions with respect to known landmarks, the goal is to guide the robot toward a desired "home" location. We propose a control law based on the gradient field of a Lyapunov function, and give sufficient conditions for global convergence. We show that the well-known Average Landmark Vector method (for which no convergence proof was known) can be obtained as a particular case of our framework. We then derive a sliding mode control law for a unicycle model which follows this gradient field. Both controllers do not depend on range information. Finally, we also show how our framework can be used to characterize the sensitivity of a home location with respect to noise in the specified bearings. This is an extended version of the conference paper [1].Comment: This is an extender version of R. Tron and K. Daniilidis, "An optimization approach to bearing-only visual homing with applications to a 2-D unicycle model," in IEEE International Conference on Robotics and Automation, 2014, containing additional proof

An optimization approach to bearing-only visual homing with applications to a 2-D unicycle model

Abstract-We consider the problem of bearing-based visual homing: Given a mobile robot which can measure bearing directions corresponding to known landmarks, the goal is to guide the robot toward a desired "home" location. We propose a control law based on the gradient field of a Lyapunov function, and give sufficient conditions for global convergence. We show that the well-known Average Landmark Vector method (for which no convergence proof was known) can be obtained as a particular case of our framework. We then derive a sliding mode control law for a unicycle model which follows this gradient field. Both controllers do not depend on range information. Finally, we also show how our framework can be used to characterize the sensitivity of a home location with respect to noise in the specified bearings

Learning cognitive maps: Finding useful structure in an uncertain world

In this chapter we will describe the central mechanisms that influence how people learn about large-scale space. We will focus particularly on how these mechanisms enable people to effectively cope with both the uncertainty inherent in a constantly changing world and also with the high information content of natural environments. The major lessons are that humans get by with a less is more approach to building structure, and that they are able to quickly adapt to environmental changes thanks to a range of general purpose mechanisms. By looking at abstract principles, instead of concrete implementation details, it is shown that the study of human learning can provide valuable lessons for robotics. Finally, these issues are discussed in the context of an implementation on a mobile robot. © 2007 Springer-Verlag Berlin Heidelberg

Visual Homing in Dynamic Indoor Environments

Institute of Perception, Action and BehaviourOur dissertation concerns robotic navigation in dynamic indoor environments using image-based visual homing. Image-based visual homing infers the direction to a goal location S from the navigator’s current location C using the similarity between panoramic images IS and IC captured at those locations. There are several ways to compute this similarity. One of the contributions of our dissertation is to identify a robust image similarity measure – mutual image information – to use in dynamic indoor environments. We crafted novel methods to speed the computation of mutual image information with both parallel and serial processors and demonstrated that these time-savers had little negative effect on homing success. Image-based visual homing requires a homing agent tomove so as to optimise themutual image information signal. As the mutual information signal is corrupted by sensor noise we turned to the stochastic optimisation literature for appropriate optimisation algorithms. We tested a number of these algorithms in both simulated and real dynamic laboratory environments and found that gradient descent (with gradients computed by one-sided differences) works best

Underwater Vehicles

For the latest twenty to thirty years, a significant number of AUVs has been created for the solving of wide spectrum of scientific and applied tasks of ocean development and research. For the short time period the AUVs have shown the efficiency at performance of complex search and inspection works and opened a number of new important applications. Initially the information about AUVs had mainly review-advertising character but now more attention is paid to practical achievements, problems and systems technologies. AUVs are losing their prototype status and have become a fully operational, reliable and effective tool and modern multi-purpose AUVs represent the new class of underwater robotic objects with inherent tasks and practical applications, particular features of technology, systems structure and functional properties

Search and restore: a study of cooperative multi-robot systems

Swarm intelligence is the study of natural biological systems with the ability to transform simple local interactions into complex global behaviours. Swarm robotics takes these principles and applies them to multi-robot systems with the aim of achieving the same level of complex behaviour which can result in more robust, scalable and flexible robotic solutions than singular robot systems. This research concerns how cooperative multi-robot systems can be utilised to solve real world challenges and outperform existing techniques. The majority of this research is focused around an emergency ship hull repair scenario where a ship has taken damage and sea water is flowing into the hull, decreasing the stability of the ship. A bespoke team of simulated robots using novel algorithms enable the robots to perform a coordinated ship hull inspection, allowing the robots to locate the damage faster than a similarly sized uncoordinated team of robots. Following this investigation, a method is presented by which the same team of robots can use self-assembly to form a structure, using their own bodies as material, to cover and repair the hole in the ship hull, halting the ingress of sea water. The results from a collaborative nature-inspired scenario are also presented in which a swarm of simple robots are tasked with foraging within an initially unexplored bounded arena. Many of the behaviours implemented in swarm robotics are inspired by biological swarms including their goals such as optimal distribution within environments. In this scenario, there are multiple items of varying quality which can be collected from different sources in the area to be returned to a central depot. The aim of this study is to imbue the robot swarm with a behaviour that will allow them to achieve the most optimal foraging strategy similar to those observed in more complex biological systems such as ants. The author’s main contribution to this study is the implementation of an obstacle avoidance behaviour which allows the swarm of robots to behave more similarly to systems of higher complexity

Navigation autonome sans collision pour robots mobiles nonholonomes

Cette thèse traite de la navigation autonome en environnement encombré pour des véhicules à roues soumis à des contraintes cinématiques de type nonholonome. Les applications de ces travaux sont par exemple l'automatisation de véhicules ou l'assistance au parking. Notre contribution porte sur le développement de méthodes qui réalisent certaines des fonctionnalités de la navigation autonome et sur l'intégration de ces différentes fonctionnalités au sein d'une architecture générique, en tenant compte des spécificités des systèmes considérés. Nous présentons une méthode d'évitement réactif d'obstacles pour systèmes nonholonomes et nous proposons une méthode de parking référencé sur des amers pour de tels systèmes. Ensuite nous présentons une architecture générique pour l'intégration des fonctionnalités de localisation, d'évitement d'obstacles et de suivi de trajectoire. Enfin nous illustrons l'ensemble de ces travaux par des résultatsexpérimentaux obtenus avec plusieurs robots. ABSTRACT : This work deals with autonomous navigation in cluttered environments for wheeled mobile robots subject to nonholonomic kinematic constraints. The potential applications of this work are for instance the development of autonomous cars and of parking assistance systems. Our contribution lies in the development of original methods to solve some of the functionalities of autonomous navigation and in their integration into a generic software architecture, while taking into account the specificities of the systems we deal with. We present an obstacle avoidance method for nonholonomic systems and we propose a landmark-based parking method for such systems. Then, we present a generic architecture for the integration of the functionalities of localisation, obstacle avoidance and trajectory following. Eventually, we illustrate this work with some experimental results obtained with several robots

Using MapReduce Streaming for Distributed Life Simulation on the Cloud

Distributed software simulations are indispensable in the study of large-scale life models but often require the use of technically complex lower-level distributed computing frameworks, such as MPI. We propose to overcome the complexity challenge by applying the emerging MapReduce (MR) model to distributed life simulations and by running such simulations on the cloud. Technically, we design optimized MR streaming algorithms for discrete and continuous versions of Conway’s life according to a general MR streaming pattern. We chose life because it is simple enough as a testbed for MR’s applicability to a-life simulations and general enough to make our results applicable to various lattice-based a-life models. We implement and empirically evaluate our algorithms’ performance on Amazon’s Elastic MR cloud. Our experiments demonstrate that a single MR optimization technique called strip partitioning can reduce the execution time of continuous life simulations by 64%. To the best of our knowledge, we are the first to propose and evaluate MR streaming algorithms for lattice-based simulations. Our algorithms can serve as prototypes in the development of novel MR simulation algorithms for large-scale lattice-based a-life models.https://digitalcommons.chapman.edu/scs_books/1014/thumbnail.jp