2015 54th IEEE Conference on Decision and Control (CDC) 2015
DOI: 10.1109/cdc.2015.7402456
|View full text |Cite
|
Sign up to set email alerts
|

Optimal and least restrictive supervisory control: Safety verification methods for human-driven vehicles at traffic intersections

Abstract: We consider a cooperative conflict resolution problem at traffic intersections. Our goal is to design a least restrictive supervisor able to identify the optimal corrections to a human-decided input with respect to a given performance index, while keeping the system safe. Here, safety is formulated in terms of a maximal safe controlled invariant set. Leveraging results from scheduling theory, we characterize the preorder of the optimal solution set and propose an efficient optimization algorithm providing Pare… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
24
0

Year Published

2016
2016
2022
2022

Publication Types

Select...
4
2

Relationship

0
6

Authors

Journals

citations
Cited by 20 publications
(24 citation statements)
references
References 26 publications
0
24
0
Order By: Relevance
“…Miculescu and Karaman [17] used queueing theory and modeled the problem as a polling system with two queues and one server that determines the sequence of times assigned to the vehicles on each road. Other research efforts have employed scheduling theory based on which the vehicles can make a decision about the appropriate schedule of crossing an intersection [18], [19]. Colombo and Del Vecchio [20] constructed the invariant set for the control inputs that ensure lateral collision avoidance.…”
Section: A Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…Miculescu and Karaman [17] used queueing theory and modeled the problem as a polling system with two queues and one server that determines the sequence of times assigned to the vehicles on each road. Other research efforts have employed scheduling theory based on which the vehicles can make a decision about the appropriate schedule of crossing an intersection [18], [19]. Colombo and Del Vecchio [20] constructed the invariant set for the control inputs that ensure lateral collision avoidance.…”
Section: A Related Workmentioning
confidence: 99%
“…Moreover, we augment the double integrator model representing a CAV with an additional state corresponding to the distance from its preceding CAV, thus we are able to address the lateral colision constraint in the low-level optimization. Second, in several efforts reported in the literature to date, the upper-level optimization either (a) was implemented with centralized approaches [14], [15], [17]- [19]; or (b) was considered given [35], [38]; or (c) was implemented using a strict first-in-first-out queueing structure [27], [29], [32], [36]. In our proposed framework, the upper-level optimization yields, in a decentralized fashion, the optimal time for each CAV to pass a given traffic scenario along with the appropriate lane that needs to occupy.…”
Section: Comparison With Related Workmentioning
confidence: 99%
“…However, this scheme is rather intrusive as drivers completely relinquish control for a time, and handing back controls to a potentially distracted driver poses problems by itself. Colombo et al [7], [8] introduced the idea of a supervisory instance (called supervisor) tasked with preventing the system of vehicles from entering undesirable states by overriding the controls of one or several vehicles. In this more human-friendly approach, overriding only occurs when necessary, i.e.…”
Section: Related Workmentioning
confidence: 99%
“…Reference [25] leverages job-shop scheduling to develop a supervisor that considers several possible conflict points inside the intersection; however, vehicle dynamics are only modeled as first-order integrators, which is not realistic in a real-world setting. Campos et al [8] proposed a Pareto-optimal supervisor leading to a minimally deviating formulation by recursively finding the most constrained vehicle, reserving its optimal crossing time, and scheduling the crossing of the remaining vehicles using the previous schedule as constraints. This method allows to minimize the deviation between the overridden and desired controls, but may be computationally intensive.…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation