No description available.

No description available.

No description available.

No description available.

No description available.

The development of connected vehicle (CV) technologies enables advanced management of individual vehicles and traffic signals to improve urban mobility and energy efficiency. In this thesis, a cooperative vehicle-signal control system will be developed to integrate an Eco-driving system and a proactive signal control system under a mixed connected environment with both connected vehicles (CVs) and human-driven vehicles (HDVs). The system utilizes CVs to conduct an accurate prediction of queue length and delay at different approaches of intersections. Then, a queue-based optimal control strategy is established to minimize the fuel usage of individual CVs and the travel time delay of entire intersections. The system applies the model predictive control to search for the optimal signal timing plan for each intersection and the most-fuel efficient speed profiles for each CV to gain the global optimum of the intersection. In this thesis, a simulation platform is designed to verify the effectiveness of the proposed system under different traffic scenarios. The comparison with the eco-driving only and signal control only algorithms verifies that the cooperative system has a much more extensive reduction range of the trip delay in the case of medium and high saturation. At low saturation, the effect of the system is not much different from that of the eco-driving algorithm, but it is still better than the signal control. Results show that the benefits of CVs are significant at all different market penetration rates of CVs. It also demonstrates the drawback of the system at high congestion levels. / Thesis / Master of Applied Science (MASc)

This thesis work presents a model predictive control (MPC) based trajectory planner forhigh speed lane change and low speed parking scenarios of autonomous four wheel steering(4WS) vehicle. A four wheel steering vehicle has better low speed maneuverabilityand high speed stability compared with normal front wheel steering(FWS) vehicles. TheMPC optimal trajectory planner is formulated in a curvilinear coordinate frame (Frenetframe) minimizing the lateral deviation, heading error and velocity error in a kinematicdouble track model of a four wheel steering vehicle. Using the proposed trajectory planner,simulations show that a four wheel steering vehicle is able to track different type ofpath with lower lateral deviations, less heading error and shorter longitudinal distance. / I detta avhandlingsarbete presenteras en modellbaserad prediktiv kontroll (MPC) -baseradbanplaneringsplan f¨or h¨oghastighetsbanan och l°aghastighetsparametrar f¨or autonomtfyrhjulsdrift (4WS). Ett fyrhjulsdrivna fordon har b¨attre man¨ovrerbarhet med l°ag hastighetoch h¨oghastighetsstabilitet j¨amf¨ort med vanliga fr¨amre hjulstyrningar (FWS). MPC-optimalbanplanerare ¨ar formulerad i en kr¨okt koordinatram (Frenet-ram) som minimerar sidof¨orl¨angningen,kursfel och hastighetsfel i en kinematisk dubbelsp°armodell av ett fyrhjulsstyrda fordon.Med hj¨alp av den f¨oreslagna banaplaneraren visar simuleringar att ett fyrhjulsstyrfordonkan sp°ara olika typer av banor med l¨agre sidof¨orl¨angningar, mindre kursfel ochkortare l¨angsg°aende avst°and.

One of the biggest challenges associated with optimization based methods forrobotic motion planning is their extreme sensitivity to a good initial guess,especially in the presence of local minima in the cost function landscape.Additional challenges may also arise due to operational constraints, robotcontrollers sometimes have very little time to plan a trajectory to perform adesired function. To work around these limitations, a common solution is tosplit the motion planner into an offline phase and an online phase. The offlinephase entails computing reference trajectories for varying parameterizationsof the task space in the form of a lookup table. During the online phase,a stripped down version of the optimizer is supplied with a suitable initialguess from the lookup table using the current state estimate of the robot andits surrounding bodies. This method helps in alleviating problems related toboth local minima and operational time constraints, by seeding the optimizerwith a suitable initial guess that allows it to converge to the global minimummuch faster.The problem however, shifts to the computational complexity of computinga lookup table of reference trajectories for a fine enough discreti- zation ofthe input state space. For many robotic scenarios of interest, it is oftenimpractical and sometimes computationally infeasible to compute a look uptable using a serial, single core implementation of the offline phase of a motionplanner. The main contribution of this work is to develop and evaluate amethod for reducing the time spent on computing a lookup table of referencetrajectories during the offline phase of motion planners based on optimalcontrol. We implement a method to offload the computation of collisionavoidance constraints during trajectory optimization on a Graphics ProcessingUnit (GPU), while simultaneously benefiting from a task based approach todistribute lookup table computations for independent subsets of the input statespace across multiple processes on a cluster of machines. We demonstrate theefficacy of the proposed method in a practical setting by implementing andevaluating it within a representative motion planner based on optimal control.We observe that the implemented method is 115x faster than the originalserial version of the planner, using 86 processes on 5 machines with standardserver grade hardware and 5 Graphics Processing Units in total. Additionally,we observe that the implemented method results in solutions identical to theoriginal serial version in 96.6% of cases, lending credibility for its use inrobotic motion planning. / En av de största utmaningarna med optimeringsbaserade metoder för rörelseplaneringinom robotik är deras extrema känslighet för en bra initial gissning,särskilt i närvaro av lokala minima i kostnadsfunktionslandskapet. Ytterligareutmaningar kan också uppstå på grund av operativa begränsningar. Robotkontrollerhar ibland väldigt lite tid att planera en väg för att utföra en önskadfunktion. För att kringgå dessa begränsningar är en vanlig lösning att dela upprörelseplaneraren i en offline-fas och en online-fas. Offlinefasen inkluderarberäkning av referensvägar för olika punkter i ingångstillståndsutrymmet iform av en uppslagstabell. Under online-fasen levereras en avskalad versionav optimeraren med en lämplig initial gissning från uppslagstabellen medden aktuella uppskattningen av roboten och dess omgivande kroppar. Dennametod hjälper till att lindra problem relaterade till både lokala minima ochdriftstidsbegränsningar genom att sådd optimeraren med en lämplig initialgissning som gör att den kan konvergera till det globala minimumet mycketsnabbare.Problemet flyttas emellertid nu till beräkningskomplexiteten för att beräknaen uppslagstabell över referensvägar för ett tillräckligt fint utrymme för ingångstillståndsutrymmet.För många robotscenarier av intresse är det ofta opraktisktoch ibland beräkningsmässigt omöjligt att beräkna en uppslagstabell med hjälpav en seriell, enda kärnimplementering av offline-fasen i en rörelseplanner.Huvudbidraget till detta arbete är att utveckla och utvärdera en metod för attminska tiden som används för att beräkna en uppslagstabell över referensvägarunder offline-fasen för rörelsesplanerare baserat på optimal kontroll. Vi implementeraren metod för att utföra en kollision undvika en grafikbehandlingsenhet(GPU), medan du använder en uppgiftsbaserad metod för att distribuerauppslagningsberäkningar för oberoende delmängder av inmatningsutrymmeöver flera processer i ett kluster av maskiner. Vi demonstrerar effektivitetenav den föreslagna metoden i en praktisk miljö genom att implementeraoch utvärdera den inom en representativ rörelseplanner baserat på optimalkontroll. Vi noterar att den implementerade metoden är 115 gånger snabbareän den ursprungliga serieversionen av schemaläggaren, med 86 processer på 5maskiner med standardhårdvara och totalt 5 GPU: er. Dessutom observerarvi att den implementerade metoden resulterar i lösningar som är identiskamed den ursprungliga serieversionen i mer än 96,6 % av fallen, vilket gertrovärdighet för dess användning i robotrörelse planering.

This thesis studies real-time reference ramping of human input for remotely operated vehicles and its effect on system control, power usage, and user experience. The implementation, testing, and evaluation were done on the remotely operated Blueye Pioneer underwater drone. The developed method uses minimum jerk trajectories for transitioning between varying target velocities with a constant end jerk target. It has a low computational cost and runs in real-time on the Blueye Pioneer underwater drone. The presented method produces a well-defined reference with continuous position, velocity, and acceleration states that can be used in the feedback loop. Experiments and simulations show that the method produces a smoother and more predictable motion path for the user. The motions are better suited for video recordings and remote navigation, compared to the direct usage of human input velocity. The smoother reference reduces the controller tracking error, the peak control input, and the energy usage. The introduced acceleration reference state is used for feedforward control on the system. It improves the feeling of controlling the drone by reducing the system lag, the position tracking error, and the rise time for velocity changes.

This thesis consists of four chapters. In Chapter 1, we focus on a class of transportation inequalities known as the transportation-information inequalities. These inequalities bound optimal transportation costs in terms of relative Fisher information, and are known to characterize certain concentration properties of Markov processes around their invariant measures. We provide a characterization of the quadratic transportation-information inequality in terms of a dimension-free concentration property for i.i.d. copies of the underlying Markov process, identifying the precise high-dimensional concentration property encoded by this inequality. We also illustrate how this result is an instance of a general convex-analytic tensorization principle. In Chapter 2, we study the entropic gradient flow property of McKean--Vlasov diffusions via a stochastic analysis approach. We formulate a trajectorial version of the relative entropy dissipation identity for these interacting diffusions, which describes the rate of relative entropy dissipation along every path of the diffusive motion. As a first application, we obtain a new interpretation of the gradient flow structure for the granular media equation. Secondly, we show how the trajectorial approach leads to a new derivation of the HWBI inequality. In Chapter 3, we further extend the trajectorial approach to a class of degenerate diffusion equations that includes the porous medium equation. These equations are posed on a bounded domain and are subject to no-flux boundary conditions, so that their corresponding probabilistic representations are stochastic differential equations with normal reflection on the boundary. Our stochastic analysis approach again leads to a new derivation of the Wasserstein gradient flow property for these nonlinear diffusions, as well as to a simple proof of the HWI inequality in the present context. Finally, in Chapter 4, we turn our attention to mean field approximation -- a method widely used to study the behavior of large stochastic systems of interacting particles. We propose a new approach to deriving quantitative mean field approximations for any strongly log-concave probability measure. Our framework is inspired by the recent theory of nonlinear large deviations, for which we offer an efficient non-asymptotic perspective in log-concave settings based on functional inequalities. We discuss three implications, in the contexts of continuous Gibbs measures on large graphs, high-dimensional Bayesian linear regression, and the construction of decentralized near-optimizers in high-dimensional stochastic control problems.