The Crash Modification Factor (CMF) clearinghouse can be used to estimate benefits for specific highway safety countermeasures. It assists safety professionals in the allocation of investments. The clearinghouse contains over 7000 entries of which only 446 are categorized as intelligent transportation systems or advanced technology, but none directly address connected or autonomous vehicles (CAVs). Further, the effectiveness of highway safety countermeasures is assumed to remain constant over time, an assumption that is particularly problematic as new technologies are introduced. For example, for the existing fleet of human-driven vehicles, installation of rumble strip can potentially reduce “run-off-road” crashes by 40%. If specific CAV technologies, e.g., lane-tracking, can work without rumble strips, and say, half of all cars are so equipped, only half of the fleet will benefit, reducing the benefits of rumble strips by a commensurate amount. Benefits of the two improvements, e.g., rumble strips and automated vehicles, should not be double-counted. As there will still be human-driven and/or non-connected vehicles in the fleet, conventional countermeasures are still necessary, although returns on conventional safety investments may be significantly overestimated. This is important as safety investments should be optimized and geared to future, not past fleets. Moreover, as CMFs are based on historical events, the types of crashes experienced by human-driven, un-connected cars are likely to be much different in the future. This research presents methods to estimate the safety benefits that autonomous vehicles have to offer and the changes needed in CMFs as a result of their adoption. This will primarily be achieved by modifying and enhancing a tool co-developed by the Fellow that estimates the safety benefits of different levels of autonomy. This tool, ddSAFCAT, estimates CAV safety benefits using real-world data for crashes, market penetration, and effectiveness.

A fast simulated annealing algorithm is developed for automatic object recognition. The normalized correlation coefficient is used as a measure of the match between a hypothesized object and an image. Templates are generated on-line during the search by transforming model images. Simulated annealing reduces the search time by orders of magnitude with respect to an exhaustive search. The algorithm is applied to the problem of how landmarks, for example, traffic signs, can be recognized by an autonomous vehicle or a navigating robot. The algorithm works well in noisy, real-world images of complicated scenes for model images with high information content.

Autonomous mobile robots - both aerial and terrestrial vehicles - have gained immense importance due to the broad spectrum of their potential military and civilian applications. One of the indispensable requirements for the autonomy of a mobile vehicle is the vehicle's capability of planning and executing its motion, that is, finding appropriate control inputs for the vehicle such that the resulting vehicle motion satisfies the requirements of the vehicular task. The motion planning and control problem is inherently complex because it involves two disparate sub-problems: (1) satisfaction of the vehicular task requirements, which requires tools from combinatorics and/or formal methods, and (2) design of the vehicle control laws, which requires tools from dynamical systems and control theory. Accordingly, this problem is usually decomposed and solved over two levels of hierarchy. The higher level, called the geometric path planning level, finds a geometric path that satisfies the vehicular task requirements, e.g., obstacle avoidance. The lower level, called the trajectory planning level, involves sufficient smoothening of this geometric path followed by a suitable time parametrization to obtain a reference trajectory for the vehicle. Although simple and efficient, such hierarchical separation suffers a serious drawback: the geometric path planner has no information of the kinematic and dynamic constraints of the vehicle. Consequently, the geometric planner may produce paths that the trajectory planner cannot transform into a feasible reference trajectory. Two main ideas appear in the literature to remedy this problem: (a) randomized sampling-based planning, which eliminates altogether the geometric planner by planning in the vehicle state space, and (b) geometric planning supported by feedback control laws. The former class of methods suffer from a lack of optimality of the resultant trajectory, while the latter class of methods makes a restrictive assumption concerning the vehicle kinematic model. In this thesis, we propose a hierarchical motion planning framework based on a novel mode of interaction between these two levels of planning. This interaction rests on the solution of a special shortest-path problem on graphs, namely, one using costs defined on multiple edge transitions in the path instead of the usual single edge transition costs. These costs are provided by a local trajectory generation algorithm, which we implement using model predictive control and the concept of effective target sets for simplifying the non-convex constraints involved in the problem. The proposed motion planner ensures "consistency" between the two levels of planning, i.e., a guarantee that the higher level geometric path is always associated with a kinematically and dynamically feasible trajectory. We show that the proposed motion planning approach offers distinct advantages in comparison with the competing approaches of discretization of the state space, of randomized sampling-based motion planning, and of local feedback-based, decoupled hierarchical motion planning. Finally, we propose a multi-resolution implementation of the proposed motion planner, which requires accurate descriptions of the environment and the vehicle only for short-term, local motion planning in the immediate vicinity of the vehicle.

<p>This Master’s thesis is a pilot study that investigates different systems to drive autonomous and non-autonomous vehicles simultaneously on test tracks. The thesis includes studies of communication, positioning, collision avoidance, and techniques for surveillance of vehicles which are suitable for implementation. The investigation results in a suggested system outline.</p><p>Differential GPS combined with laser scanner vision is used for vehicle state estimation (position, heading, velocity, etc.). The state information is transmitted with IEEE 802.11 to all surrounding vehicles and surveillance center. With this information a Kalman prediction of the future position for all vehicles can be estimated and used for collision avoidance.</p>

This Master’s thesis is a pilot study that investigates different systems to drive autonomous and non-autonomous vehicles simultaneously on test tracks. The thesis includes studies of communication, positioning, collision avoidance, and techniques for surveillance of vehicles which are suitable for implementation. The investigation results in a suggested system outline. Differential GPS combined with laser scanner vision is used for vehicle state estimation (position, heading, velocity, etc.). The state information is transmitted with IEEE 802.11 to all surrounding vehicles and surveillance center. With this information a Kalman prediction of the future position for all vehicles can be estimated and used for collision avoidance.

L'objectif principal de ce projet doctoral a été le développement de méthodologies qui permettent à des systèmes mobiles robotisés de naviguer de manière autonome dans un environnement inconnu ou partiellement connu, basées sur la perception visuelle fournie par un système de vision monoculaire embarqué. Un véhicule robotisé qui doit effectuer des tâches précises dans un environnement inconnu, doit avoir la faculté de percevoir son environnement proche et avoir un degré minimum d'interaction avec celui-ci. Nous avons proposé un système de vision embarquée préliminaire, où le temps de traitement de l'information (point critique dans des systèmes de vision utilisés en temps-réel) est optimisé par une méthode d'identification et de rejet d'informations redondantes. Suite à ces résultats, on a proposé une étude innovante par rapport à l'état de l'art en ce qui concerne la gestion énergétique du système de vision embarqué, également pour le calcul du temps de collision à partir d'images monoculaires. Ainsi, nous proposons le développement des travaux en étudiant une méthodologie robuste et efficace (utile en temps-réel) pour la détection de la route et l'extraction de primitives d'intérêts appliquée à la navigation autonome des véhicules terrestres. Nous présentons des résultats dans un environnement réel, dynamique et inconnu. Afin d'évaluer la performance de l'algorithme proposé, nous avons utilisé un banc d'essai urbain et réel. Pour la détection de la route et afin d'éviter les obstacles, les résultats sont présents en utilisant un véhicule réel afin d'évaluer la performance de l'algorithme dans un déplacement autonome. Cette Thèse de Doctorat a été réalisée à partir d'un accord de cotutelle entre l' Université de Campinas (UNICAMP) et l'Université de Technologie de Compiègne (UTC), sous la direction du Professeur Docteur Douglas Eduardo ZAMPIERI, Faculté de Génie Mécanique, UNICAMP, Campinas, Brésil, et Docteur Isabelle FANTONI-COICHOT du Laboratoire HEUDIASYC UTC, Compiègne, France. Cette thèse a été soutenue le 26 août 2011 à la Faculté de Génie Mécanique, UNICAMP.

Thesis (MScEng)--Stellenbosch University, 2013. / ENGLISH ABSTRACT: In order to navigate dynamic, cluttered environments safely, fully autonomous Unmanned Aerial Vehicles (UAVs) are required to plan conflict-free trajectories between two states in position-time space efficiently and reliably. Kinodynamic planning for vehicles with non-holonomic dynamic constraints is an NP-hard problem which is usually addressed using sampling-based, probabilistically complete motion planning algorithms. These algorithms are often applied in conjunction with a finite set of simple geometric motion primitives which encapsulate the dynamic constraints of the vehicle. This ensures that composite trajectories generated by the planning algorithm adhere to the vehicle dynamics. For many vehicles, accurate tracking of position-based trajectories is a non-trivial problem which demands complicated control techniques with high energy requirements. In an effort to reduce control complexity and thus also energy consumption, a generic Local Planning Method (LPM), able to plan trajectories based on implicitly-defined motion primitives, is developed in this project. This allows the planning algorithm to construct trajectories which are based on simulated results of vehicle motion under the control of a rudimentary auto-pilot, as opposed to a more complicated position-tracking system. The LPM abstracts motion primitives in such a way that it may theoretically be made applicable to various vehicles and control systems through simple substitution of the motion primitive set. The LPM, which is based on a variation of the Levenberg-Marquardt Algorithm (LMA), is integrated into a well-known Probabilistic Roadmap (PRM) kinodynamic planning algorithm which is known to work well in dynamic and cluttered environments. The complete motion planning algorithm is tested thoroughly in various simulated environments, using a vehicle model and controllers which have been previously verified against a real UAV during practical flight tests. / AFRIKAANSE OPSOMMING: Ten einde dinamiese, voorwerpryke omgewings veilig te navigeer, word daar vereis dat volledig-outonome onbemande lugvoertuie konflikvrye trajekte tussen twee posisie-tydtoestande doeltreffend en betroubaar kan beplan. Kinodinamiese beplanning is ’n NPmoeilike probleem wat gewoonlik deur middel van probabilisties-volledige beplanningsalgoritmes aangespreek word . Hierdie algoritmes word dikwels in kombinasie met ’n eindige stel eenvoudige geometriese maneuvers, wat die dinamiese beperkings van die voertuig omvat, ingespan. Sodanig word daar verseker dat trajekte wat deur die beplaningsalgoritme saamgestel is aan die dinamiese beperkings van die voertuig voldoen. Vir baie voertuie, is die akkurate volging van posisie-gebaseerde trajekte ’n nie-triviale probleem wat die gebruik van ingewikkelde, energie-intensiewe beheertegnieke vereis. In ’n poging om beheer-kompleksiteit, en dus energie-verbruik, te verminder, word ’n generiese plaaslike-beplanner voorgestel. Hierdie algoritme stel die groter kinodinamiese beplanner in staat daartoe om trajekte saam te stel wat op empiriese waarnemings van voertuig-trajekte gebaseer is. ’n Eenvoudige beheerstelsel kan dus gebruik word, in teenstelling met die meer ingewikkelde padvolgingsbeheerders wat benodig word om eenvoudige geometriese trajekte akkuraat te volg. Die plaaslike-beplanner abstraeer maneuvers in so ’n mate dat dit teoreties op verskeie voertuie en beheerstelsels van toepassing gemaak kan word deur eenvoudig die maneuver-stel te vervang. Die plaaslike-beplanner, wat afgelei is van die Levenberg-Marquardt-Algoritme (LMA), word in ’n welbekende “Probabilistic Roadmap” (PRM) kinodinamiese-beplanningsalgoritme geïntegreer. Dit word algemeen aanvaar dat die PRM effektief werk in dinamiese, voorwerpryke omgewings. Die volledige beplanningsalgoritme word deeglik in verskeie, gesimuleerde omgewings getoets op ’n voertuig-model en -beheerders wat voorheen vir akkuraatheid teenoor ’n werklike voertuig gekontroleer is tydens praktiese vlugtoetse.

Grâce aux progrès réalisés dans les domaines de la robotique et des systèmes de transport intelligents (ITS), les véhicules autonomes du futur sont en train de devenir une réalité. Comme les véhicules autonomes devront se comporter en toute sécurité en présence d’autres véhicules, de piétions et d’autres objets fixes ou en mouvement, une des choses les plus importantes qu’ils doivent faire est de percevoir efficacement à la fois leur mouvement et l’environnement autour d’eux. Dans cette thèse, nous avons d’abord étudié comment des capteurs visuels bio-inspirés, qui mesurent le flux optique en 1-D en utilisant seulement quelques pixels sur la base du système visuel de la mouche, pourraient être utilisés pour améliorer les manœuvres de stationnement automatiques. Nous avons ensuite travaillé sur une nouvelle rétine de silicium bio-inspirée, en montrant que le nouveau pixel, appelé M²APIX, est capable de s’auto-adapter dans une gamme de 7 décades et de répondre de manière appropriée à des changements de luminosité rapides jusqu’à ±3 décades, tout en conservant une sensibilité aux contrastes aussi bas que 2%. Nous avons enfin développé et testé un nouveau capteur de flux optique basé sur cette rétine auto-adaptative et sur une nouvelle méthode robuste pour le calcul du flux optique, qui est robuste aux variations de lumière, textures et vibrations que l’on retrouve en milieu routier. Nous avons également construit un robot de type voiture, appelé BioCarBot, qui estime sa vitesse et son angle de braquage au moyen d’un filtre de Kalman étendu (EKF), en utilisant uniquement les mesures de flux optique délivrées par deux capteurs de ce type regardant vers le sol. / Thanks to the advances in the fields of robotics and intelligent transportation systems (ITS), the autonomous vehicles of the future are gradually becoming a reality. As autonomous vehicles will have to behave safely in presence of other vehicles, pedestrians and other fixed and moving objects, one of the most important things they need to do is to effectively perceive both their motion and the environment around them. In this thesis, we first investigated how bio-inspired visual sensors, giving 1-D optic flow using a few pixels based on the findings on the fly’s visual system, could be used to improve automatic parking maneuvers. We subsequently tested a novel bio-inspired silicon retina, showing that the novel pixel, called M2APix, can auto-adapt in a 7-decade range and respond appropriately to step changes up to ±3 decades, while keeping sensitivity to contrasts as low as 2%. We lastly developed and tested a novel optic flow sensor based on this auto-adaptive retina and a new robust method for computing the optic flow, which is robust to the light levels, textures and vibrations that can be found while operating on the road. We also constructed a car-like robot, called BioCarBot, which estimates its velocity and steering angle by means of an extended Kalman filter (EKF) using only the optic flow measurements delivered by two downward-facing sensors of this kind.

201 pages / Ensuring algorithms work accurately is crucial, especially when they drive safety critical systems like self-driving cars. We formally model a published distributed algorithm for autonomous vehicles to collaborate and pass thorough an intersection. Models are built and validated using the “Labelled Transition System Analyser” (LTSA). Our models reveal situations leading to deadlocks and crashes in the algorithm. We demonstrate two approaches to gain insight about a large and complex system without modeling the entire system: Modeling a sub system - If the sub system has issues, the super system too. Modeling a fast-forwarded state - Reveals problems that can arise later in a process. Some productivity tools developed for distributed system development are also presented. Manulator, our distributed system simulator, enables quick prototyping and debugging on a single workstation. LTSA-O, extension to LTSA, listens to messages exchanged in an execution of a distributed system and validates it against a model.

This is a thesis on outdoor monocular visual SLAM in natural environments. The techniques proposed herein aim at estimating camera pose and 3D geometrical structure of the surrounding environment. This problem statement was motivated by the GPS-denied scenario for a sea-surface vehicle developed at Plymouth University named Springer. The algorithms proposed in this thesis are mainly adapted for the Springer’s environmental conditions, so that the vehicle can navigate on a vision based localization system when GPS is not available; such environments include estuarine areas, forests and the occasional semi-urban territories. The research objectives are constrained versions of the ever-abiding problems in the fields of multiple view geometry and mobile robotics. The research is proposing new techniques or improving existing ones for problems such as scene reconstruction, relative camera pose recovery and filtering, always in the context of the aforementioned landscapes (i.e., rivers, forests, etc.). Although visual tracking is paramount for the generation of data point correspondences, this thesis focuses primarily on the geometric aspect of the problem as well as with the probabilistic framework in which the optimization of pose and structure estimates takes place. Besides algorithms, the deliverables of this research should include the respective implementations and test data for these algorithms in the form of a software library and a dataset containing footage of estuarine regions taken from a boat, along with synchronized sensor logs. This thesis is not the final analysis on vision based navigation. It merely proposes various solutions for the localization problem of a vehicle navigating in natural environments either on land or on the surface of the water. Although these solutions can be used to provide position and orientation estimates when GPS is not available, they have limitations and there is still a vast new world of ideas to be explored.