561 research outputs found
An Optimal Coordination Framework for Connected and Automated Vehicles in two Interconnected Intersections
In this paper, we provide a decentralized optimal control framework for
coordinating connected and automated vehicles (CAVs) in two interconnected
intersections. We formulate a control problem and provide a solution that can
be implemented in real time. The solution yields the optimal
acceleration/deceleration of each CAV under the safety constraint at "conflict
zones," where there is a chance of potential collision. Our objective is to
minimize travel time for each CAV. If no such solution exists, then each CAV
solves an energy-optimal control problem. We evaluate the effectiveness of the
efficiency of the proposed framework through simulation.Comment: 8 pages, 5 figures, IEEE CONFERENCE ON CONTROL TECHNOLOGY AND
APPLICATIONS 201
Semi-autonomous Intersection Collision Avoidance through Job-shop Scheduling
In this paper, we design a supervisor to prevent vehicle collisions at
intersections. An intersection is modeled as an area containing multiple
conflict points where vehicle paths cross in the future. At every time step,
the supervisor determines whether there will be more than one vehicle in the
vicinity of a conflict point at the same time. If there is, then an impending
collision is detected, and the supervisor overrides the drivers to avoid
collision. A major challenge in the design of a supervisor as opposed to an
autonomous vehicle controller is to verify whether future collisions will occur
based on the current drivers choices. This verification problem is particularly
hard due to the large number of vehicles often involved in intersection
collision, to the multitude of conflict points, and to the vehicles dynamics.
In order to solve the verification problem, we translate the problem to a
job-shop scheduling problem that yields equivalent answers. The job-shop
scheduling problem can, in turn, be transformed into a mixed-integer linear
program when the vehicle dynamics are first-order dynamics, and can thus be
solved by using a commercial solver.Comment: Submitted to Hybrid Systems: Computation and Control (HSCC) 201
Making overtaking cyclists safer: Driver intention models in threat assessment and decision-making of advanced driver assistance system
Introduction: The number of cyclist fatalities makes up 3% of all fatalities globally and 7.8% in the European Union. Cars overtaking cyclists on rural roads are complex situations. Miscommunication and misunderstandings between road users may lead to crashes and severe injuries, particularly to cyclists, due to lack of protection. When making a car overtaking a cyclist safer, it is important to understand the interaction between road users and use in the development of an Advanced Driver Assistance System (ADAS). Methods: First, a literature review was carried out on driver and interaction modeling. A Unified Modeling Language (UML) framework was introduced to operationalize the interaction definition to be used in the development of ADAS. Second, the threat assessment and decision-making algorithm were developed that included the driver intention model. The counterfactual simulation was carried out on artificial crash data and field data to understand the intention-based ADAS\u27s performance and crash avoidance compared to a conventional system. The method focused on cars overtaking cyclists when an oncoming vehicle was present. Results: An operationalized definition of interaction was proposed to highlight the interaction between road users. The framework proposed uses UML diagrams to include interaction in the existing driver modeling approaches. The intention-based ADAS results showed that using the intention model, earlier warning or emergency braking intervention can be activated to avoid a potential rear-end collision with a cyclist without increasing more false activations than a conventional system. Conclusion: The approach used to integrate the driver intention model in developing an intention-based ADAS can improve the system\u27s effectiveness without compromising its acceptance. The intention-based ADAS has implications towards reducing worldwide road fatalities and in achieving sustainable development goals and car assessment program
Discrete Event System Methods for Control Problems Arising in Cyber-physical Systems.
We consider two problems in cyber-physical systems. The first is that of dynamic fault diagnosis. Specifically, we assume that a plant model is available in the form of a discrete event system (DES) containing special fault events whose occurrences are to be diagnosed. Furthermore, it is assumed that there exist sensors that can be turned on or off and are capable of detecting some subset of the system’s non-faulty events. The problem to be solved consists of constructing a compact structure, called the most permissive observer (MPO), containing the set of all sequences of sensor activations that ensure the timely diagnosis of any fault event’s occurrence. We solve this problem by defining an appropriate notion of information state summarizing the information obtained from the past sequence of observations and sensor activations. The resulting MPO has a better space complexity than that of the previous approach in the literature.
The second problem considered in this thesis is that of controlling vehicles through an intersection. Specifically, we wish to obtain a supervisor for the vehicles that is safe, non-deadlocking, and maximally permissive. Furthermore, we solve this problem in the presence of uncontrolled vehicles, bounded disturbances in the dynamics, and measurement uncertainty. Our approach consists of discretizing the system in time and space, obtaining a DES abstraction, solving for maximally permissive supervisors in the abstracted domain, and refining the supervisor to one for the original, continuous, problem domain. We provide general results under which this approach yields maximally permissive memoryless supervisors for the original system and show that, under certain conditions, the resulting supervisor will be maximally permissive over the class of all supervisors, not merely memoryless ones. Our contributions are as follows. First, by constructing DES abstractions from continuous systems, we can leverage the supervisory control theory of DES, which is well-suited to finding maximally permissive supervisors under safety and non-blocking constraints. Second, we define different types of relations between transition systems and their abstractions and, for each relation, characterize the class of supervisors over which the supervisors obtained under our approach are maximally permissive.PHDElectrical Engineering: SystemsUniversity of Michigan, Horace H. Rackham School of Graduate Studieshttp://deepblue.lib.umich.edu/bitstream/2027.42/108720/1/edallal_1.pd
- …