61 |
Motion planning for autonomous highway driving : a unified architecture for decision-maker and trajectory generator / Architecture unifiée de prise de décision et génération de trajectoires pour un véhicule autonome sur autorouteClaussmann, Laurene 27 September 2019 (has links)
Ce travail de thèse s'inscrit dans le développement d'un véhicule autonome en milieu autoroutier. Plus précisément, il s'agit de proposer une architecture unifiée de génération de trajectoires avec une prise de décision prenant en compte les limitations de l'environnement et des informations disponibles actuellement sur un véhicule automatisé.La méthode propose d'une part de générer des trajectoires sous forme de sigmoı̈de dans une représentation spatiotemporelle continue de l'espace de navigation, préalablement réduit par la modélisation d'intervalles sans collision en conditionnominale de conduite. Les paramètres de la sigmoı̈de sont ensuite optimisés par une stratégie de recuit simulé utilisant l'algorithme de prise de décision comme fonction d'évaluation de la trajectoire générée. De cette manière, les problèmes de discrétisation et de découplage position/vitesse sont évités. D'autre part, l'agrégation des théories de logique floue etdes croyances permet une prise de décision sur des critères hétérogènes et des données incertaines. Le formalisme présenté offre la possibilité d'adapter le comportement du véhicule aux passagers, notamment selon leur perception du risque et leur souhait d'une conduite souple ou sportive.L'approche développée a finalement été évaluée et validée en environnement de simulation puis sur un véhicule de test. La brique de planification a alors été intégrée à l'architecture existante du véhicule, en aval des briques de localisation et de perception des obstacles et en amont de la brique de contrôle. / This thesis work is part of the development of a self-driving car in highway environments. More precisely, it aims to propose a unified architecture of trajectory planner and decision-maker taking into account the limitations of the environment and the available data within the current development of sensors technologies (distance limitations, uncertainties).On the one hand, the method generates sigmoid trajectories in a continuous spatiotemporal representation of the evolution space, which is reduced beforehand by modeling collision-free intervals in nominal conditions of driving. The sigmoid parameters are subsequently optimized with a simulated annealing approach that uses the decision-maker algorithm as the evaluation function for the generated trajectory. It thus makes it possible to elude both the discretization and position/speed decoupling problems. On the other hand, the aggregation of fuzzy logic and belief theory allows decision making on heterogeneous criteria and uncertain data. The proposed framework also handles personalization of the vehicle's behavior, depending on the passengers' risk perception and an aggressive or conservative driving style.The presented approach was finally evaluated and validated in a simulation environment, and then in a test vehicle. The planning block was integrated into the existing vehicle's architecture, interfaced with the localization, obstacles' perception and control blocks.
|
62 |
Learning High-Dimensional Critical Regions for Efficient Robot PlanningJanuary 2020 (has links)
abstract: Robot motion planning requires computing a sequence of waypoints from an initial configuration of the robot to the goal configuration. Solving a motion planning problem optimally is proven to be NP-Complete. Sampling-based motion planners efficiently compute an approximation of the optimal solution. They sample the configuration space uniformly and hence fail to sample regions of the environment that have narrow passages or pinch points. These critical regions are analogous to landmarks from planning literature as the robot is required to pass through them to reach the goal.
This work proposes a deep learning approach that identifies critical regions in the environment and learns a sampling distribution to effectively sample them in high dimensional configuration spaces.
A classification-based approach is used to learn the distributions. The robot degrees of freedom (DOF) limits are binned and a distribution is generated from sampling motion plan solutions. Conditional information like goal configuration and robot location encoded in the network inputs showcase the network learning to bias the identified critical regions towards the goal configuration. Empirical evaluations are performed against the state of the art sampling-based motion planners on a variety of tasks requiring the robot to pass through critical regions. An empirical analysis of robotic systems with three to eight degrees of freedom indicates that this approach effectively improves planning performance. / Dissertation/Thesis / Masters Thesis Computer Science 2020
|
63 |
Uncertainty Discretization for Motion Planning Under Uncertainty / Osäkerhetsdiskretisering för användning i rörelseplannering under osäkerhetWillquist, André January 2020 (has links)
In this thesis, the problem of motion planning under uncertainty is explored. Motion planning under uncertainty is important since even with noise during the execution of the plan, it is desirable to keep the collision risk low. However, for the motion planning to be useful it needs to be possible to perform it in a reasonable time. The introduction of state uncertainty leads to a substantial increase in search time due to the additional dimensions it adds to the search space. In order to alleviate this problem, different approaches to pruning of the search space are explored. The initial approach is to prune states based on having strictly worse uncertainty and path cost than other found states. Having performed this initial pruning, an alternate approach to comparing uncertainties is examined in order to explore if it is possible to achieve a lower search time. The approach taken in order to lower the search time further is to discretize the covariance of a state by using a number of buckets. However, this discretization results in giving up the completeness and optimality of the algorithm. Having implemented these different ways of pruning, their performance is tested on a number of different scenarios. This is done by evaluating the planner using the pruning in several different scenarios including uncertainty and one without uncertainty. It is found that all of the pruning approaches reduce the overall search time compared to when no additional pruning based on the uncertainty is done. Additionally, it is indicated that the bucket-based approach reduce the search time to a greater extent than the strict pruning approach. Furthermore, the extensions made results in no increase in cost or a very small increase in cost for the explored scenarios. Based on these results, it is likely that the bucket pruning approach has some potential. However more studies, particularly with additional scenarios, needs to be made before any definitive conclusions can be made.
|
64 |
Exploiting structure in humanoid motion planning / Exploiter la structure pour la planification de mouvement humanoïdeOrthey, Andreas 24 September 2015 (has links)
Afin que les robots humanoïdes puissent travailler avec les humains et être en mesure de résoudre des tâches répétitives, nous devons leur permettre de planifier leurs mouvements de façon autonome. La planification de mouvement est un problème de longue date en robotique, et tandis que sa fondation algorithmique a été étudiée en profondeur, la planification de mouvement est encore un problème NP-difficile et qui manque de solutions efficaces. Nous souhaitons ouvrir une nouvelle perspective sur le problème en mettant en évidence sa structure: le comportement du robot, le système mécanique du robot et l’environnement du robot. Nous allons nous intéresser à l’hypothèse que chaque composante structurelle peut être exploitée pour créer des algorithmes de planification de mouvement plus efficaces. Nous présentons trois algorithmes exploitant la structure, basés sur des arguments géométriques et topologiques: d’abord, nous exploitons le comportement d’un robot de marche en étudiant la faisabilité des transitions des traces de pas. L’algorithme qui en résulte est capable de planifier des traces de pas tout en évitant jusqu’à 60 objets situés sur une surface plane 6 mètres carrés. Deuxièmement, nous exploitons le système mécanique d’un robot humanoïde en étudiant les structures des liaisons linéaires de ses bras et de ses jambes. Nous introduisons le concept d’une trajectoire irréductible, qui est une technique de réduction de dimension préservant la complétude. L’algorithme résultant est capable de trouver des mouvements dans des environnements étroits, où les méthodes d’échantillonnage ne pouvaient pas être appliquées. Troisièmement, nous exploitons l’environnement en raisonnant sur la structure topologique des transitions de contact. Nous montrons que l’analyse de l’environnement est une méthode efficace pour pré-calculer les informations pertinentes pour une planification de mouvement efficace. En s’appuyant sur ces résultats, nous arrivons à la conclusion que l’exploitation de la structure est une composante essentielle de la planification de mouvement efficace. Il en résulte que tout robot humanoïde, qui veut agir efficacement dans le monde réel, doit être capable de comprendre et d’exploiter la structure. / If humanoid robots should work along with humans and should be able to solve repetitive tasks, we need to enable them with a skill to autonomously plan motions. Motion planning is a longstanding core problem in robotics, and while its algorithmic foundation has been studied in depth, motion planning is still an NP-hard problem lacking efficient solutions. We want to open up a new perspective on the problem by highlighting its structure: the behavior of the robot, the mechanical system of the robot, and the environment of the robot. We will investigate the hypothesis that each structural component can be exploited to create more efficient motion planning algorithms. We present three algorithms exploiting structure, based on geometrical and topological arguments: first, we exploit the behavior of a walking robot by studying the feasibility of footstep transitions. The resulting algorithm is able to plan footsteps avoiding up to 60 objects on a 6 square meters planar surface. Second, we exploit the mechanical system of a humanoid robot by studying the linear linkage structures of its arms and legs. We introduce the concept of an irreducible motion, which is a completeness-preserving dimensionality reduction technique. The resulting algorithm is able to find motions in narrow environments, where previous sampling-based methods could not be applied. Third, we exploit the environment by reasoning about the topological structure of contact transitions. We show that analyzing the environment is an efficient method to precompute relevant information for efficient motion planning. Based on those results, we come to the conclusion that exploiting structure is an essential component of efficient motion planning. It follows that any humanoid robot, who wants to act efficiently in the real world, needs to be able to understand and to exploit structure.
|
65 |
Adaptive sampling-based motion planning with control barrier functionsAhmad, Ahmad Ghandi 27 September 2021 (has links)
In this thesis we modified a sampling-based motion planning algorithm to improve sampling efficiency. First, we modify the RRT* motion planning algorithm with a local motion planner that guarantees collision-free state trajectories without explicitly checking for collision with obstacles. The control trajectories are generated by solving a sequence of quadratic programs with Control Barrier Functions (CBF) constraints. If the control trajectories satisfy the CBF constraints, the state trajectories are guaranteed to stay in the free subset of the state space. Second, we use a stochastic optimization algorithm to adapt the sampling density function of RRT* to increase the probability of sampling in promising regions in the configuration space. In our approach, we use the nonparametric generalized cross-entropy (GCE) method is used for importance sampling, where a subset of the sampled RRT* trajectories is incrementally exploited to adapt the density function.
The modified algorithms, the Adaptive CBF-RRT* and the CBF-RRT*, are demonstrated with numerical examples using the unicycle dynamics. The Adaptive CBF-RRT* has been shown to yield paths with lower cost with fewer tree vertexes than the CBF-RRT*. / 2022-03-27T00:00:00Z
|
66 |
Motion Planning For Autonomous Vehicles In Non-Signalized IntersectionsPatel, Darshit Satishkumar 25 July 2023 (has links)
Real-time path generation, including collision checks, is vital in critical driving scenarios such as navigating non-signalized intersections. These intersections lack organized traffic flow, which raises the risk of accidents. Rapidly Exploring Random Trees (RRT) is a widely adopted algorithm in robotics for motion planning due to its simplicity and probabilistic completeness. Over the years, researchers have made modifications to the basic RRT algorithm to improve its performance in dynamic environments, making it a favored planning algorithm for autonomous driving. Among these variants, probabilistic RRT (pRRT) demonstrates promising capabilities for efficient online replanning. The first part of the thesis thoroughly studies the pRRT algorithm and compares its performance to the standard RRT and RRT* algorithms through Python simulations. The pRRT algorithm outperformed the RRT and RRT* algorithms in terms of success rate and time to find a safe trajectory. The algorithm was implemented experimentally on scaled cars for the validation of its feasibility. The experimental results show good sim-to-real transfer for this algorithm.
The second part of the thesis proposes a novel algorithm for path planning. The algorithm outperforms the standard RRT and pRRT techniques in terms of optimality and conformance to human instincts. The generated paths are much smoother and easier for the controller to track. The AV implementation combines the probabilistic RRT with the RRT-Connect algorithm to mitigate the problem of parameter tuning of the standard pRRT algorithm. The idea is to generate intermediate critical points around the obstacles to grow multiple trees between these points, which are then eventually connected if a safe trajectory is found. The algorithm was tested in simulation and showed comparatively better performance in handling obstacles. / Master of Science / Due to uncontrolled traffic flow, non-signalized intersections are critical for autonomous driving. Motion planning is responsible for the vehicle's decision-making and generating actions based on its surroundings. Rapidly Exploring Random Trees (RRT) is one of the most widely used algorithms for motion planning in robotics due to its simplicity and a guarantee of finding a collision-free path if it exists. Due to the randomness of the algorithm, the time to find a collision-free path increases rapidly as the surrounding environment complicates.
In this thesis, we thoroughly study a modified version of RRT called the probabilistic RRT (pRRT) for motion planning of autonomous vehicles. The pRRT algorithm reduces the randomness of the standard RRT algorithm and takes into account the destination location and the positions of the obstacles to find a path around the obstacles and toward the destination point. The algorithm was experimentally validated and confirmed the simplistic transfer from simulations to reality.
In the second part of the thesis, we propose a novel algorithm that combines the properties of pRRT and another well-known algorithm called RRT-Connect. This algorithm plans collision-free paths from the start, and the goal points towards free space around the obstacles simultaneously and then combines these fragmented paths. This reduces the overall planning time and was found to be better at providing smooth paths.
|
67 |
Motion Planning and Robust Control for Nonholonomic Mobile Robots under UncertaintiesKanarat, Amnart 26 July 2004 (has links)
This dissertation addresses the problem of motion planning and control for nonholonomic mobile robots, particularly wheeled and tracked mobile robots, working in extreme environments, for example, desert, forest, and mine. In such environments, the mobile robots are highly subject to external disturbances (e.g., slippery terrain, dusty air, etc.), which essentially introduce uncertainties to the robot systems. The complexity of the motion planning problem is due to taking both nonholonomic and uncertainty constraints into account simultaneously. As a result, none of the conventional nonholonomic motion planning can be directly applied. The control problem is even more challenging since state constraints posed by obstacles in the environments must also be considered along with the nonholonomic and uncertainty constraints.
In this research, we systematically develop a new type of motion planning technique that determines an optimal path for a mobile robot in a given environment. This motion planning technique is based on the idea of a maximum allowable uncertainty, which is a number assigned to each free configuration in the environment. The optimal path is a path connecting given initial and goal configurations through a series of configurations respecting the nonholonomic constraint and possessing the highest maximum allowable uncertainty. Both linear and quadratic approximations of the maximum allowable uncertainty, including their corresponding motion planners, have been studied. Additionally, we develop the first real-time robust control algorithm for the mobile robot under uncertainty to follow given paths safely and accurately in cluttered environments. The control algorithm also utilizes the concept of the maximum allowable uncertainty as well as the robust control theory. The simulation results have shown the effectiveness and robustness of the control algorithm in steering the mobile robot along a given path amidst obstacles without collisions even when the level of robot uncertainty is high. / Ph. D.
|
68 |
Inference and synthesis of temporal logic properties for autonomous systemsAasi, Erfan 17 January 2024 (has links)
Recently, formal methods have gained significant traction for describing, checking, and synthesizing the behaviors of cyber-physical systems. Among these methods, temporal logics stand out as they offer concise mathematical formulas to express desired system properties. In this thesis, our focus revolves around two primary applications of temporal logics in describing the behavior of autonomous system. The first involves integrating temporal logics with machine learning techniques to deduce a temporal logic specification based on the system's execution traces. The second application concerns using temporal logics to define traffic rules and develop a control scheme that guarantees compliance with these rules for autonomous vehicles. Ultimately, our objective is to combine these approaches, infer a specification that characterizes the desired behaviors of autonomous vehicles, and ensure that these behaviors are upheld during runtime.
In the first study of this thesis, our focus is on learning Signal Temporal Logic (STL) specifications from system execution traces. Our approach involves two main phases. Initially, we address an offline supervised learning problem, leveraging the availability of system traces and their corresponding labels. Subsequently, we introduce a time-incremental learning framework. This framework is designed for a dataset containing labeled signal traces with a common time horizon. It provides a method to predict the label of a signal as it is received incrementally over time. To tackle both problems, we propose two decision tree-based approaches, with the aim of enhancing the interpretability and classification performance of existing methods. The simulation results demonstrate the efficiency of our proposed approaches.
In the next study, we address the challenge of guaranteeing compliance with traffic rules expressed as STL specifications within the domain of autonomous driving. Our focus is on developing control frameworks for a fully autonomous vehicle operating in a deterministic or stochastic environment. Our frameworks effectively translate the traffic rules into high-level decisions and accomplish low-level vehicle control with good real-time performance. Compared to existing literature, our approaches demonstrate significant enhancements in terms of runtime performance. / 2025-01-17T00:00:00Z
|
69 |
A Multi Axis Real Time Control From PLC With ROSShipei, Tian 01 February 2018 (has links)
No description available.
|
70 |
Motion Planning and Control of Differential Drive RobotKothandaraman, Kaamesh January 2016 (has links)
No description available.
|
Page generated in 0.1192 seconds