System of Terrain Analysis, Energy Estimation and Path Planning for Planetary Exploration by Robot Teams

NASA’s long term plans involve a return to manned moon missions, and eventually sending humans to mars. The focus of this project is the use of autonomous mobile robotics to enhance these endeavors. This research details the creation of a system of terrain classification, energy of traversal estimation and low cost path planning for teams of inexpensive and potentially expendable robots. The first stage of this project was the creation of a model which estimates the energy requirements of the traversal of varying terrain types for a six wheel rocker-bogie rover. The wheel/soil interaction model uses Shibly’s modified Bekker equations and incorporates a new simplified rocker-bogie model for estimating wheel loads. In all but a single trial the relative energy requirements for each soil type were correctly predicted by the model. A path planner for complete coverage intended to minimize energy consumption was designed and tested. It accepts as input terrain maps detailing the energy consumption required to move to each adjacent location. Exploration is performed via a cost function which determines the robot’s next move. This system was successfully tested for multiple robots by means of a shared exploration map. At peak efficiency, the energy consumed by our path planner was only 56% that used by the best case back and forth coverage pattern. After performing a sensitivity analysis of Shibly’s equations to determine which soil parameters most affected energy consumption, a neural network terrain classifier was designed and tested. The terrain classifier defines all traversable terrain as one of three soil types and then assigns an assumed set of soil parameters. The classifier performed well over all, but had some difficulty distinguishing large rocks from sand. This work presents a system which successfully classifies terrain imagery into one of three soil types, assesses the energy requirements of terrain traversal for these soil types and plans efficient paths of complete coverage for the imaged area. While there are further efforts that can be made in all areas, the work achieves its stated goals

Advancing Embedded and Extrinsic Solutions for Optimal Control and Efficiency of Energy Systems in Buildings

Buildings account for approximately 40% of all U.S. energy usage and carbon emissions. Reducing energy usage and improving efficiency in buildings has the potential for significant environmental and economic impacts. To do so, reoccurring identification of hardware and operational opportunities is needed to maintain building efficiency. Additionally, the development of controls that continually operate building systems and equipment at energy optimal conditions is required. This dissertation provides contributions to both of the aforementioned areas, which can be divided into two distinct portions. The first presents the framework for the development of an automated energy audit process, termed Autonomous Robotic Assessments of Energy (AuRAE). The automation of energy audits would decrease the cost of audits to customers, reduce the time auditors need to invest in an audit, and provide repeatable audit processes with enhanced data collection. In this framework of AuRAE, novel, audit-centric navigational strategies are presented that enable the complete exploration of a previously unknown space in a building while identifying and navigating to objects of interest in real-time as well as navigation around external building perimeters. Simulations of the navigational strategies show success in a variety of building layouts and size of objects of interest. Additionally, prototypes of robotic audit capabilities are demonstrated in the form of a lighting identification and analysis package on a ground vehicle and an environmental baseline measurement package on an aerial vehicle. The second portion presents the development and simulation of two advanced economic building energy controllers: one utilizes steady-state relationships for optimizing control setpoints while the other is an economic MPC method using dynamic models to optimize the same control setpoints. Both control methods balance the minimization of utility cost from energy usage with the cost of lost productivity due to occupant discomfort, differing from standard building optimal control that generally addresses occupant comfort through setpoint limits or comfort measure constraints. This is accomplished through the development of component-level economic objective functions for each subsystem in the modeled building. The results show that utility cost and the cost of occupant productivity from optimal comfort can be successfully balanced, and even improved over current control methods. The relative magnitude of the cost of lost productivity is shown to be significantly higher than the cost of utilities, suggesting that building operators, technicians, and researchers should make maintaining occupant comfort a top priority to achieve the greatest economic savings. Furthermore, the results demonstrate that by using steady-state predictions, the majority of the performance gains produced with a fully dynamic MPC solution can be recovered

A New Approach towards Non-holonomic Path Planning of Car-like Robots using Rapidly Random Tree Fixed Nodes(RRT*FN)

Autonomous car driving is gaining attention in industry and is also an ongoing research in scientific community. Assuming that the cars moving on the road are all autonomous, this thesis introduces an elegant approach to generate non-holonomic collision-free motion of a car connecting any two poses (configurations) set by the user. Particularly this thesis focusses research on "path-planning" of car-like robots in the presence of static obstacles. Path planning of car-like robots can be done using RRT and RRT*. Instead of generating the non-holonomic path between two sampled configurations in RRT, our approach finds a small incremental step towards the next random configuration. Since the incremental step can be in any direction we use RRT to guide the robot from start configuration to end configuration. This "easy-to-implement" mechanism provides flexibility for enabling standard plan- ners to solve for non-holonomic robots without much modifications. Thus, strength of such planners for car path planning can be easily realized. This thesis demon- strates this point by applying this mechanism for an effective variant of RRT called as RRT - Fixed Nodes (RRT*FN). Experiments are conducted by incorporating our mechanism into RRT*FN (termed as RRT*FN-NH) to show the effectiveness and quality of non-holonomic path gener- ated. The experiments are conducted for typical benchmark static environments and the results indicate that RRT*FN-NH is mostly finding the feasible non-holonomic solutions with a fixed number of nodes (satisfying memory requirements) at the cost of increased number of iterations in multiples of 10k. Thus, this thesis proves the applicability of mechanism for a highly constrained planner like RRT*-FN, where the path needs to be found with a fixed number of nodes. Although, comparing the algorithm (RRT*FN-NH) with other existing planners is not the focus of this thesis there are considerable advantages of the mechanism when applied to a planner. They are a) instantaneous non-holonomoic path generation using the strengths of that particular planner, b) ability to modify on-the-fly non-holomic paths, and c) simple to integrate with most of the existing planners. Moreover, applicability of this mechanism using RRT*-FN for non-holonomic path generation of a car is shown for a more realistic urban environments that have typical narrow curved roads. The experiments were done for actual road map obtained from google maps and the feasibility of non-holonomic path generation was shown for such environments. The typical number of iterations needed for finding such feasible solutions were also in multiple of 10k. Increasing speed profiles of the car was tested by limiting max speed and acceleration to see the effect on the number of iterations

Near-Optimal Motion Planning Algorithms Via A Topological and Geometric Perspective

Motion planning is a fundamental problem in robotics, which involves finding a path for an autonomous system, such as a robot, from a given source to a destination while avoiding collisions with obstacles. The properties of the planning space heavily influence the performance of existing motion planning algorithms, which can pose significant challenges in handling complex regions, such as narrow passages or cluttered environments, even for simple objects. The problem of motion planning becomes deterministic if the details of the space are fully known, which is often difficult to achieve in constantly changing environments. Sampling-based algorithms are widely used among motion planning paradigms because they capture the topology of space into a roadmap. These planners have successfully solved high-dimensional planning problems with a probabilistic-complete guarantee, i.e., it guarantees to find a path if one exists as the number of vertices goes to infinity. Despite their progress, these methods have failed to optimize the sub-region information of the environment for reuse by other planners. This results in re-planning overhead at each execution, affecting the performance complexity for computation time and memory space usage. In this research, we address the problem by focusing on the theoretical foundation of the algorithmic approach that leverages the strengths of sampling-based motion planners and the Topological Data Analysis methods to extract intricate properties of the environment. The work contributes a novel algorithm to overcome the performance shortcomings of existing motion planners by capturing and preserving the essential topological and geometric features to generate a homotopy-equivalent roadmap of the environment. This roadmap provides a mathematically rich representation of the environment, including an approximate measure of the collision-free space. In addition, the roadmap graph vertices sampled close to the obstacles exhibit advantages when navigating through narrow passages and cluttered environments, making obstacle-avoidance path planning significantly more efficient. The application of the proposed algorithms solves motion planning problems, such as sub-optimal planning, diverse path planning, and fault-tolerant planning, by demonstrating the improvement in computational performance and path quality. Furthermore, we explore the potential of these algorithms in solving computational biology problems, particularly in finding optimal binding positions for protein-ligand or protein-protein interactions. Overall, our work contributes a new way to classify routes in higher dimensional space and shows promising results for high-dimensional robots, such as articulated linkage robots. The findings of this research provide a comprehensive solution to motion planning problems and offer a new perspective on solving computational biology problems

A hybrid approach to simultaneous localization and mapping in indoors environment

This thesis will present SLAM in the current literature to benefit from then it will present the investigation results for a hybrid approach used where different algorithms using laser, sonar, and camera sensors were tested and compared. The contribution of this thesis is the development of a hybrid approach for SLAM that uses different sensors and where different factors are taken into consideration such as dynamic objects, and the development of a scalable grid map model with new sensors models for real time update of the map.The thesis will show the success found, difficulties faced and limitations of the algorithms developed which were simulated and experimentally tested in an indoors environment

Cochlear imaging in the era of cochlear implantation : from silence to sound

Cochlear implants (CIs) are a well accepted treatment for hearing impaired people. In pre- and postoperative assessment of CI-candidates imaging plays an important role to analyze anatomy, rule out pathology and determine intracochlear positioning and integrity of the implant. Developments in CI-design, differences in surgical approach and broadening of treatment indications have raised new questions to radiologists, which were the subject of several studies described in this thesis. For optimal, a-traumatic positioning of a CI precise information about the inner ear anatomy is mandatory. We describe the development, validation and application of a method for 3-dimensional medical image exploration of the inner ear. This renders a tool to obtain cochlear dimensions on clinical computer tomography (CT) images. This will be useful for patientspecific implantplanning. It also shows an anatomical substrate for cochlear trauma during insertion. For postoperative imaging we studied the value of multislice-CT for optimal visualization of the implant within the cochlea. Its role to evaluate operation technique and electrode design, to study frequency mapping and to assess cochlear trauma is discussed. Moreover an international consensus for an objective cochlear framework is presented, forming a common ground for clear and easy exchange of findings in scientific and clinical studies.AB, de Nationale Hoorstichting/Sponsor Bingo Loterij, Foundation Imago, Bontius Stichting inz. Doelfonds BeeldverwerkingUBL - phd migration 201

Advances in Reinforcement Learning

Reinforcement Learning (RL) is a very dynamic area in terms of theory and application. This book brings together many different aspects of the current research on several fields associated to RL which has been growing rapidly, producing a wide variety of learning algorithms for different applications. Based on 24 Chapters, it covers a very broad variety of topics in RL and their application in autonomous systems. A set of chapters in this book provide a general overview of RL while other chapters focus mostly on the applications of RL paradigms: Game Theory, Multi-Agent Theory, Robotic, Networking Technologies, Vehicular Navigation, Medicine and Industrial Logistic

Robotic Crop Interaction in Agriculture for Soft Fruit Harvesting

Autonomous tree crop harvesting has been a seemingly attainable, but elusive, robotics goal for the past several decades. Limiting grower reliance on uncertain seasonal labour is an economic driver of this, but the ability of robotic systems to treat each plant individually also has environmental benefits, such as reduced emissions and fertiliser use. Over the same time period, effective grasping and manipulation (G&M) solutions to warehouse product handling, and more general robotic interaction, have been demonstrated. Despite research progress in general robotic interaction and harvesting of some specific crop types, a commercially successful robotic harvester has yet to be demonstrated. Most crop varieties, including soft-skinned fruit, have not yet been addressed. Soft fruit, such as plums, present problems for many of the techniques employed for their more robust relatives and require special focus when developing autonomous harvesters. Adapting existing robotics tools and techniques to new fruit types, including soft skinned varieties, is not well explored. This thesis aims to bridge that gap by examining the challenges of autonomous crop interaction for the harvesting of soft fruit. Aspects which are known to be challenging include mixed obstacle planning with both hard and soft obstacles present, poor outdoor sensing conditions, and the lack of proven picking motion strategies. Positioning an actuator for harvesting requires solving these problems and others specific to soft skinned fruit. Doing so effectively means addressing these in the sensing, planning and actuation areas of a robotic system. Such areas are also highly interdependent for grasping and manipulation tasks, so solutions need to be developed at the system level. In this thesis, soft robotics actuators, with simplifying assumptions about hard obstacle planes, are used to solve mixed obstacle planning. Persistent target tracking and filtering is used to overcome challenging object detection conditions, while multiple stages of object detection are applied to refine these initial position estimates. Several picking motions are developed and tested for plums, with varying degrees of effectiveness. These various techniques are integrated into a prototype system which is validated in lab testing and extensive field trials on a commercial plum crop. Key contributions of this thesis include I. The examination of grasping & manipulation tools, algorithms, techniques and challenges for harvesting soft skinned fruit II. Design, development and field-trial evaluation of a harvester prototype to validate these concepts in practice, with specific design studies of the gripper type, object detector architecture and picking motion for this III. Investigation of specific G&M module improvements including: o Application of the autocovariance least squares (ALS) method to noise covariance matrix estimation for visual servoing tasks, where both simulated and real experiments demonstrated a 30% improvement in state estimation error using this technique. o Theory and experimentation showing that a single range measurement is sufficient for disambiguating scene scale in monocular depth estimation for some datasets. o Preliminary investigations of stochastic object completion and sampling for grasping, active perception for visual servoing based harvesting, and multi-stage fruit localisation from RGB-Depth data. Several field trials were carried out with the plum harvesting prototype. Testing on an unmodified commercial plum crop, in all weather conditions, showed promising results with a harvest success rate of 42%. While a significant gap between prototype performance and commercial viability remains, the use of soft robotics with carefully chosen sensing and planning approaches allows for robust grasping & manipulation under challenging conditions, with both hard and soft obstacles