This research focuses on the development of a persistent navigation algorithm for a hovering vehicle with a single, downward-facing visible spectrum camera. A successful persistent navigation algorithm allows a vehicle to: * Continuously estimate its location and pose within a local, if not global, coordinate frame. * Continuously align incoming data to both temporally proximal and temporally distant data. For aerial images, this alignment is equivalent to image mosaicking, as is commonly used in aerial photogrammetry to produce broad-scale photomaps from a sequence of discrete images. * Operate relative to, and be commanded relative to the sensor data, rather than relative to an abstract coordinate system. The core application space considered here is moderate-to-high altitude aerial mapping, and a number of sets of high-resolution, high-overlap aerial photographs are used as the core test data set. These images are captured from a sufficient altitude that the apparent perspective shift of objects on the ground is minimized -- the scene is effectively planar. As such, this research focuses heavily on the properties and advantages available when processing such planar images. This research is split into two threads which track the two main challenges in visual persistent navigation: the association and alignment of visual data given significant image change, and the development of an estimation algorithm and data storage structure with bounded computational and storage costs for a fixed map size. Persistent navigation requires the robot to accurately align incoming images against historical data. By its nature, however, visual data contains a high degree of variability despite minimal changes in the scene itself. As a simple example, as the sun moves and weather conditions change, the apparent illumination and shading of objects in the scene can vary significantly. More critically, image alignment must be robust to change in the scene itself, as that change is often a critical output from the robot's re-exploration. This problem is considered in two contexts. First, a set of state-of-the-art feature detection algorithms are evaluated against sample data sets which include both temporally proximal and disparate images of the same location. The capacity of each algorithm to identify repeated point features is measured for a spectrum of algorithm-specific parameter values. Next, the potential of using a prior estimate on the inter-image geometry to improve the robustness of precise image alignment is considered for two phases of the image alignment process: feature matching and robust outlier rejection. A number of geometry-aware algorithms are proposed for both phases, and tested against similar sets of similar and disparate aerial images. While many of the proposed algorithms do improve on the performance of the unguided algorithms, none are vastly superior. The second thread starts by considering the problem of navigation fromdownward-looking aerial images from the perspective of Simultaneous Localization and Mapping (SLAM). This leads to the development of Simultaneous Mosaicking and Resectioning Through Planar Image Graphs (SMARTPIG), an online, iterative mosaicking and SLAM algorithm built on the assumption of a planar scene. A number of samples of SMARTPIG outputs are shown, including mosaics of a 600-meter square airport with approximately 3-meter reprojection errors relative to ground control points. SMARTPIG, like most SLAM algorithms, does not fulfill the criteria for persistent navigation because the computational and storage costs are proportional to the total mission length, not the total area explored. SMARTPIG is evolved towards persistent navigation by the introduction of the featurescape, a storage structure for long-term point-feature data, to produce Planar Image Graphs for PErsistent Navigation (PIGPEN). PIGPEN is demonstrated perfoming robot re-localization onto an existing SMARTPIG mosaic with an accuracy comparable to the original mosaic.

No description available.

Simultaneous Localization and Mapping (SLAM) is a recursive probabilistic inferencing process used for robot navigation when Global Positioning Systems (GPS) are unavailable. SLAM operates by building a map of the robot environment, while concurrently localizing the robot within this map. The ultimate goal of SLAM is to operate anywhere using the environment's natural features as landmarks. Such a goal is difficult to achieve for several reasons. Firstly, different environments contain different types of natural features, each exhibiting large variance in its shape and appearance. Secondly, objects look differently from different viewpoints and it is therefore difficult to always recognize them. Thirdly, in most outdoor environments it is not possible to predict the motion of a vehicle using wheel encoders because of errors caused by slippage. Finally, the design of a SLAM system to operate in a large-scale outdoor setting is in itself a challenge. <br /><br /> The above issues are addressed as follows. Firstly, a camera is used to recognize the environmental context (e. g. , indoor office, outdoor park) by analyzing the holistic spectral content of images of the robot's surroundings. A type of feature (e. g. , trees for a park) is then chosen for SLAM that is likely observable in the recognized setting. A novel tree detection system is introduced, which is based on perceptually organizing the content of images into quasi-vertical structures and marking those structures that intersect ground level as tree trunks. Secondly, a new tree recognition system is proposed, which is based on extracting Scale Invariant Feature Transform (SIFT) features on each tree trunk region and matching trees in feature space. Thirdly, dead-reckoning is performed via an Inertial Navigation System (INS), bounded by non-holonomic constraints. INS are insensitive to slippage and varying ground conditions. Finally, the developed Computer Vision and Inertial systems are integrated within the framework of an Extended Kalman Filter into a working Vision-INS SLAM system, named VisSLAM. <br /><br /> VisSLAM is tested on data collected during a real test run in an outdoor unstructured environment. Three test scenarios are proposed, ranging from semi-automatic detection, recognition, and initialization to a fully automated SLAM system. The first two scenarios are used to verify the presented inertial and Computer Vision algorithms in the context of localization, where results indicate accurate vehicle pose estimation for the majority of its journey. The final scenario evaluates the application of the proposed systems for SLAM, where results indicate successful operation for a long portion of the vehicle journey. Although the scope of this thesis is to operate in an outdoor park setting using tree trunks as landmarks, the developed techniques lend themselves to other environments using different natural objects as landmarks.

This thesis considers the Simultaneous Localization and Mapping (SLAM) problem using a set of perspective cameras arranged such that there is no overlap in their fields-of-view. With the known and fixed extrinsic calibration of each camera within the cluster, a novel real-time pose estimation system is presented that is able to accurately track the motion of a camera cluster relative to an unknown target object or environment and concurrently generate a model of the structure, using only image-space measurements. A new parameterization for point feature position using a spherical coordinate update is presented which isolates system parameters dependent on global scale, allowing the shape parameters of the system to converge despite the scale parameters remaining uncertain. Furthermore, a flexible initialization scheme is proposed which allows the optimization to converge accurately using only the measurements from the cameras at the first time step. An analysis is presented identifying the configurations of the cluster motions and target structure geometry for which the optimization solution becomes degenerate and the global scale is ambiguous. Results are presented that not only confirm the previously known critical motions for a two-camera cluster, but also provide a complete description of the degeneracies related to the point feature constellations. The proposed algorithms are implemented and verified in experiments with a camera cluster constructed using multiple perspective cameras mounted on a quadrotor vehicle and augmented with tracking markers to collect high-precision ground-truth motion measurements from an optical indoor positioning system. The accuracy and performance of the proposed pose estimation system are confirmed for various motion profiles in both indoor and challenging outdoor environments.

Förutsättningarna för att Umeå Energi ska kunna torka rötat avloppsslam från UMEVA med bland annat överskottsvärme från Dåva 1 har undersökts. Genom att beräkna hur mycket energi som finns tillgängligt och vilka slammängder som kan torkas har kostnaden för att installera och driva en slamtork uppskattats. Två modeller på slamtorkar (en bandtork från Hydropress Huber AB och en trumtork från AB Torkapparater) och fyra tänkbara driftscenarion, med avseende på torkperiod och slammängd, har undersökts.När slamtorkning sker under hela året och dagens produktion av slam (ca 7500 ton/år med 32 % TS) ska torkas till 90 % TS har ett intäktskrav på 215 kr/ton slam (våtvikt) beräknats för trumtorken och 255 kr/ton för bandtorken. Dessa värden representerar intäkten slammet måste ge för att torklösningen ska vara lönsam. Beräkningarna baseras på slammängder för de senaste fem åren och produktionsdata från Umeå Energis anläggningar för 2012-2013. Inget undersökt scenario kunde nyttja mer än 16 % av värmeöverskottet.Bandtorkens värden anses vara mest korrekta och användes för beräkna vilken intäkt som krävs för lönsamhet. Torkkostnaderna kan täckas om UMEVA betalar 100 kr/ton våtvikt och värmen från slamförbränning ger 180 kr/MWh. Om dubbla dagens slammängd ska torkas behöver värmen, med samma bidrag från UMEVA, bara ge 132 kr/MWh för att täcka torkkostnaderna. Utöver det kvarstår möjligheten till intäkt från fosforutvinning av aska att utredas.Torkning till 90 % TS kan vara onödigt högt och litteraturstudien visar att torkning till 70 % TS troligen skulle räcka för ändamålet. Detta skulle minska intäktskravet och bör därför utredas. / The requirements to dry activated sewage sludge with heat from a combined heat and power plant belonging to Umeå Energi AB have been investigated. The available amounts of heat and sludge have been estimated and calculations have been performed to determine the required size of a potential dryer. Two types of sludge dryers have been investigated and four possible scenarios with differing drying periods and sludge amounts.If all the sludge (7500 ton/annually) is to be dried continually over a year from 32 % DS (dry weight) to 90 % DS the results show that the sludge would need to bring an income between 215 and 255 SEK/ton sludge (32 % DS) for the drying to be considered profitable. This income could be covered by the waste water treatment company (UMEVA) paying 100 SEK/ton to handle the sludge and the heat from incineration bringing an income of 180 SEK/MWh. If the double amount of sludge is to be dried, and UMEVA pays 100 SEK/ton, the heat would need to bring an income of g 132 SEK/MWh. Another possible income that has yet to be investigated is the value of recycling the phosphorus from the sludge ash.It is likely that the sludge does not need to be dried as far as to 90 % DS. Studies have shown that 70 % would be enough for the intended use. Lowering the dry substance output would lower the costs and therefore make it easier to achieve the intended profit.None of the studied scenarios reached a utilization level of more than 16 % of the excess heat.

A classic Computer Vision task is the estimation of a 3D map from a collection of images. This thesis explores the online simultaneous estimation of camera poses and map points, often called Visual Simultaneous Localisation and Mapping [VSLAM]. In the near future the use of visual information by autonomous cars is likely, since driving is a vision dominated process. For example, VSLAM could be used to estimate the position of the car in relation to objects of interest, such as the road, other cars and pedestrians. Aimed at the creation of a real-time, robust, loop closing, single camera SLAM system, the properties of several state-of-the-art VSLAM systems and related techniques are studied. The system goals cover several important, if difficult, problems, which makes a solution widely applicable. This thesis makes two contributions: A rigorous qualitative analysis of VSLAM methods and a system designed accordingly. A novel tracking by matching scheme is proposed, which, unlike the trackers used by many similar systems, is able to deal better with forward camera motion. The system estimates general motion with loop closure in real time. The system is compared to a state-of-the-art monocular VSLAM algorithm and found to be similar in speed and performance.

Although the theory of Simultaneous Localization and Map Building (SLAM) is well developed, there are many challenges to overcome when incorporating vision sensors into SLAM systems. Visual sensors have different properties when compared to range finding sensors and therefore require different considerations. Existing vision-based SLAM algorithms extract point landmarks, which are required for SLAM algorithms such as the Kalman filter. Under this restriction, the types of image features that can be used are limited and the full advantages of vision not realized. This thesis examines the theoretical formulation of the SLAM problem and the characteristics of visual information in the SLAM domain. It also examines different representations of uncertainty, features and environments. It identifies the necessity to develop a suitable framework for vision-based SLAM systems and proposes a framework called VisionSLAM, which utilizes an appearance-based landmark representation and topological map structure to model metric relations between landmarks. A set of Haar feature filters are used to extract image structure statistics, which are robust against illumination changes, have good uniqueness property and can be computed in real time. The algorithm is able to resolve and correct false data associations and is robust against random correlation resulting from perceptual aliasing. The algorithm has been tested extensively in a natural outdoor environment.

In a mobile robotic system, the interaction with the surrounding environment is essential in order to complete tasks such as localisation and mapping. This interaction can only be conducted by means of sensors that permit the accumulation of a large amount of information from several sources. However, this information is useless without adequate interpretation; thus, in order to accurately determine the positioning of the robot, it is necessary to identify and characterise landmarks in the environment required to serve as anchoring points for both localisation and mapping. Having constructed the map, an accurate analysis of the information gathered is vital. In this manner, this work is focused on two main aspects of any mobile robotic system: first, the detection and characterisation of highly descriptive landmarks by using image and point cloud processing techniques; and second, the geometrical and spatial analysis of the information gathered from the environment. For the former, two novel techniques based on image processing and geometrical analysis are presented; for the latter, a guaranteed technique for the parameter estimation of primitive shapes using interval analysis is proposed.

The mapping problem is a major player in mobile robotics, and it is essential for many real applications such as disaster response or nuclear decommissioning. Generally, the robotic mapping is addressed under the umbrella of simultaneous localization and mapping (SLAM). Several probabilistic techniques were developed in the literature to approach the SLAM problem, and despite the good performance, their convergence proof is only limited to linear Gaussian models. This thesis proposes an interval SLAM (i-SLAM) algorithm as a new approach that addresses the robotic mapping problem in the context of interval methods. The noise of the robot sensor is assumed bounded, and without any prior knowledge of its distribution, we specify soft conditions that guarantee the convergence of robotic mapping for the case of nonlinear models with non-Gaussian noise. A new theory about compact sets is developed in the context of real analysis to conclude such conditions. Then, a case study is presented where the performance of i-SLAM is compared to the probabilistic counterparts in terms of accuracy and efficiency. Moreover, this work presents an application for i-SLAM using an RGB-D sensor that operates in unknown environments. Interval methods and computer vision techniques are employed to extract planar landmarks in the environment. Then, a new hybrid data association approach is developed using a modified version of bag-of-features method to uniquely identify different landmarks across timesteps. Finally, the results obtained using the proposed data association approach are compared to the typical least-squares approaches, thus demonstrating the consistency and accuracy of the proposed approach.

The problem of constructing high quality point clouds based on measurements from a moving and rotating single-photon counting lidar is considered in this report. The movement is along a straight rail while the lidar sensor rotates side to side. The point clouds are constructed in three steps, which are all studied in this master’s thesis. First, point clouds are constructed from raw lidar measurements from single sweeps with the lidar. In the second step, the sensor transformation between the point clouds constructed in the first step are obtained in a registration step using iterative closest point (ICP). In the third step the point clouds are combined to a coherent point cloud, using the full measurement. A method using simultaneous localization and mapping (SLAM) is developed for the third step. It is then compared to two other methods, constructing the final point cloud only using the registration, and to utilize odometric information in the combination step. It is also investigated which voxel discretization that should be used when extracting the point clouds. The methods developed are evaluated using experimental data from a prototype photon counting lidar system. The results show that the voxel discretization need to be at least as large as the range quantization in the lidar. No significant difference between using registration and SLAM in the third step is observed, but both methods outperform the odometric method.