In a recent work (Wardi et al. (2019)), we proposed a new approach to output tracking of dynamical systems that appears to be effective while requiring modest computing efforts. Its underscoring technique is based on a standalone integrator with a variable gain, designed for stability and small tracking errors. The integrator is defined by a flow version of the Newton-Raphson method for solving algebraic equations. These equations are defined by attempting to match a predicted system’s output to a predicted value of the reference target. Furthermore, increasing the controller’s rate can stabilize the system, increase its stability margins, and reduce its tracking error even (in some cases) if the plant-subsystem is unstable and not of a minimum phase.
The proposed tracking technique may not be as general or powerful as some of the existing nonlinear regulation techniques like the Byrnes-Isidori regulator (Isidori and Byrnes (1990)), Khalil’s high-gain observers for output regulation (Khalil (1998)), or Model Predictive Control (MPC) (Rawlings et al. (2017)). However, the effectiveness of these methods is partially due to their computational sophistication such as, respectively, nonlinear inversions, the appropriate nonlinear normal form, and real-time optimal control. As for our tracking technique, its controller is defined by an ordinary differential equation which can be solved numerically in real time and hence, as argued in Wardi et al. (2019), may be implementable by simple algorithms.
Thus far, the development of the proposed technique has focused on its fundamental structure, theoretical convergence results, and various examples including an inverted pendulum and motion control in platoons (Wardi et al. (2019)). Presently our main interest is in applications to autonomous vehicles, and especially in trajectory control of swarms and platoons. Such problems often are addressed by MPC or related techniques; see e.g., (Kong et al. (2015); Plessen et al. (2018); Kim and Kumar (2014)) and references therein. Like MPC, our technique is based on predictive control, but it is different from MPC in several ways. It is not based on optimal control nor does it specify a particular framework for computing future target trajectories. Once the target trajectories become available, it uses a fluid-flow version of the Newton-Raphson method for tracking control.
The primary objective of this paper is to investigate how the proposed tracking technique can complement other prediction-based approaches. To this end we consider the trajectory-control technique developed in Malikopoulos et al. (2018) for traffic management of autonomous vehicles in urban road-intersections. This technique is slated to optimize motion-energy consumption of each vehicle while guaranteeing safety constraints. It is in the flavor of MPC in that it solves optimal control problems for computing future trajectories, but unlike MPC it does not consider rolling horizons but a single optimal control program for each vehicle approaching an intersection. A salient feature of this technique is that is uses a simple dynamic model for the vehicles, comprised of a double integrator, thereby enabling closed-form solutions to the optimal control problems. This gives an efficient trajectory-computation for every vehicle, which scales well with traffic loads at the intersections.
Our tracking technique complements the traffic control framework of Malikopoulos et al. (2018) in the following way. We first compute the target-trajectories of the vehicles using the simple model and formula derived in Malikopoulos et al. (2018), then we apply our technique to a more complicated and realistic model for tracking of the target trajectory. To this end we use a dynamic bicycle model for the vehicles’ motion, a sixth-order nonlinear model that has been extensively used in control of autonomous vehicles (see, e.g., Kong et al. (2015); Plessen et al. (2018) and references therein). Furthermore, we extend the applications domain of of Malikopoulos et al. (2018) from a straight road to a curved road. Lastly, we examine the treatment of safety constraints in the tight control loop by incorporating control barrier functions with the tracking technique.
The rest of the paper is organized as follows. Section 2 formulates the problem. Section 3 summarizes the tracking technique that will be used in the sequel. Section 4 presents simulation results, and Section 5 concludes the paper and outlines directions for future research.
Statement of contributions. The contribution of the present paper is twofold. The first contribution extends the framework of prediction-based nonlinear tracking in the context of trajectory control of autonomous vehicles at traffic intersections, while the second is in the incorporation of safety measures through the use of barrier functions. Regarding the first contribution, the tracking technique has been applied to the dynamic bicycle model (Shivam et al. (2019b); Wardi et al. (2019)), and the relevant contribution in this paper is in a proof of concept regarding the way it complements the control framework of Malikopoulos et al. (2018). Regarding safety guarantees, control barrier functions have not been applied to the tracking technique or, to our knowledge, to a dynamic bicycle model.
A reduced version of this paper will appear in the Proc. 21st IFAC World Congress, Berlin, Germany, July 12-17, 2020.
2 Problem Formulation
Our work is concerned with the management and control of vehicle-flows at traffic intersections. Each one of the roads comprising an intersection consists of two zones: a control zone and a merging zone. The merging zone is at the center of the intersection, where lateral accidents are possible. The control zone is a stretch of the road approaching the merging zone, where the scheduling, planning and control of vehicles’ trajectories are performed. Once a vehicle enters the merging zone its speed or lane cannot be changed.
Whenever a vehicle enters the control zone, a scheduler computes the time and speed at which it has to enter the merging zone based on the current and future states (positions and velocities) of all the other vehicles concurrently in the intersection. Subsequently the trajectory of the newly-arrived vehicle is computed by minimizing its projected motion energy while maximizing the throughput at the intersection, subject to safety and operational constraints. The safety constraints include a minimum inter-vehicle distance and a maximum deviation from a lane-center, while the operational constraints include bounds on speed and acceleration. This trajectory-planning problem is formulated as an optimal control problem which is parameterized by the states of all the other vehicles concurrently at the intersection, hence it is different from one vehicle to the next and consequently must be solved in real time.
The contribution of this paper is not in the aforementioned scheduling and trajectory planning-and-control problem, but in a tracking of its computed solution. Thus, the tracking control is at a lower level than the optimal control problem, and for that we use a bicycle model for the vehicles’ dynamics, which is more accurate and detailed than the double-integrator model.
The bicycle model that we use is the six-degree nonlinear system described in Kong et al. (2015). Its state variable is , where and are the planer position-coordinates of the center of gravity of the vehicle, and are the longitudinal and lateral velocities, is the heading of the vehicle and is its angular velocity. The input, , consists of the longitudinal acceleration and steering angle of the front wheels, respectively, and the output, , is the center of gravity of the vehicle. The dynamic equations are (see Kong et al. (2015)):
where is the mass of the vehicle, and are the front and back axles’ distances from the vehicle’s center of mass,
is the yaw moment of inertia, andand are the lateral forces on the front and rear wheels. These forces are approximated by the following equations,
where and are the cornering stiffness of the front and rear tires, respectively.
Our tracking technique will be tested first on a curved road, which does not quite fit in the framework of Malikopoulos et al. (2018) due to its one-dimensional traffic model of motion. Then we make a more careful examination of safety constraints which are addressed in real time by control barrier functions, and for that we use a straight road in order to highlight the effects of the safety controls.
3 Tracking Technique and Control Barrier Functions
This section serves to explain the tracking technique and the salient features of control barrier functions that will be used in the sequel.
3.1 Tracking Technique based on Newton-Raphson Flow
An extension of the material in this subsection can be found in Wardi et al. (2019).
Consider the system depicted in Figure 1, where the reference input , the control signal , and the output are in for a given . The task of the controller is to ensure that
for a given (small) .
To explain the main idea behind the tracking technique, suppose first that the plant is a memoryless nonlinearity of the form
for a continuously differentiable function . The controller that we use is defined by the differential equation
with an initial condition , where is a given speedup parameter (gain). We implicitly assume that the Jacobian is nonsingular throughout the trajectory determined by this equation.
To see the effects of this controller on asymptotic tracking-convergence, define the Lyapunov function
Define . Then some algebra reveals that
see Wardi et al. (2019) for details. Stability is not a concern as long as the Jacobian is nonsingular throughout the trajectory since (7) is guaranteed by (5) and (6). Therefore, in (2) can be made as small as possible by taking large enough in (4).
Suppose next that the plant (in Figure 1) is a dynamical system with the state equation
and the output equation
here the state variable is , is a given initial state, and the input and output are and , respectively. The dynamic response function is , and the output function is . The following assumption, implicitly made in the forthcoming discussion, ensures that for every bounded, piecewise-continuous control function , and for every , there exists a unique continuous, piecewise continuously-differentiable solution to Eq. (8).
1). The function is continuously differentiable, and for every compact set there exists such that, for every and for every ,
2). The function is continuously differentiable.
By Eqs. (8)-(9), and hence are not functions of but rather of and . Therefore Eq. (3) is no longer true, and a controller cannot be defined by (4). To get around this difficulty we use an output predictor and attempt to match it to a future target-reference. Given a fixed time horizon , at every time we compute a predictor of , denoted by . We assume that it is a function of and , hence has the functional form
for a suitable function . We henceforth implicitly assume that is continuously differentiable. The future reference
may have to be estimated as well by a suitable predictor (e.g.,Wardi et al. (2019)), but we assume here that it is known exactly at time in order to simplify the discussion.
The objective of the controller, next defined, is to have track . Thus, in analogy with (4), it is defined by the following equation,
with given and initial condition ; we implicitly assume that the partial Jacobian is nonsingular for every . By (11), it can be seen that this controller attempts to have match .
The output predictor that we use is based on the state equation (8) in the interval with the input control and initial state . Formally, denoting by the variable representing the predicted state, it satisfies the equation
then we define
We typically solve Eq. (13) by the Forward Euler method. The following discussion implicitly assumes that this is the predictor used.
The state equation (8) and control equation (12) together define a dynamical system with input and state variable . Suppose that the initial state is confined to a given compact set . Ref. Wardi et al. (2019) defines the following notion of BIBS stability, called -stability.
The system is -stable if there exist and two class- functions, and such that, for every initial state and an input , for every ,
where is the norm of .
Essentially -stability implies BIBS stability for large gain . Ref. Wardi et al. (2019) derives verifiable sufficient conditions for stability of linear systems, which cover situations where the plant subsystem is neither stable nor of a minimum phase. Simulation and experimental results of various linear and nonlinear systems indicate stability at large gains. Also, a theoretical result guarantees an extension of Eq. (7) from the case where the plant is a memoryless nonlinearity to the present case of a dynamical system. It states that if the system is stable then there exist and such that, for every ,
In this case, speeding up the controller by increasing can serve the dual purpose of stabilizing the closed-loop system and reducing the tracking error. We point out, though, that “tracking” means here that the future target reference, , is approached by the predicted output, , not the actual output, . In fact, defining the asymptotic prediction error by
Eq. (7) is extended to
We see that speeding up the controller does not reduce the effects of the asymptotic prediction error on the asymptotic tracking error. This comes at no surprise since the prediction error is akin to a measurement error in classical control systems.
Finally, a word must be said about the relationship between this tracking-control method and MPC. MPC arguably is the most-commonly used control technique based on prediction. It solves optimal control problems in real time, and these serve the dual purpose of computing the future trajectory and controlling the system. In contrast, our technique does not specify how to compute the future target trajectory. In principle it may be given a-priori, computed once at the start of the control action as in Malikopoulos et al. (2018)
and in this paper, or computed on-line by data interpolation (as inWardi et al. (2019)) or neural nets (see Shivam et al. (2019b)). The control law we use is based on a real-time numerical solution of a differential equation but not on optimal control.
3.2 Control Barrier Functions
The authors of Ames et al. (2014) laid the groundwork for ensuring safety in the design of control systems. The approach combines control barrier functions with control Lyapunov functions to achieve the dual purpose of effective control and satisfying hard safety constraints. Shortly thereafter it was applied to the control of multi-agent systems and networks, with applications to mobile robots and autonomous vehicles; see Wang et al. (2017) for an initial work, and Ames et al. (2019) for a recent survey. The essential elements of this approach are summarized in this subsection, and more-extensive exposés can be found in Ames et al. (2014, 2019); Wang et al. (2017).
Consider a dynamical system defined by Eq. (8), where and , and suppose that Assumption 1 is in force. Let be a closed set called a safe set, and suppose that it is desirable to design a feedback control such that is forward invariant and asymptotically stable for the system. This requirement means that (i) if for some , then for every ; and (ii) the following limit holds,
where is the point-to-set Euclidean distance.
A continuously-differentiable function is said to be a barrier function for if there exists a Lipschitz-continuous, extended class function (monotone increasing, ) such that for every outside , for every in the interior of , and for all in the boundary of ; and for every ,
Now suppose that a control is determined such that, at each time , Eq. (19) is satisfied. Then the set is forward invariant and asymptotically stable for the system. That is, the state trajectory is driven towards , and once entering, cannot escape from it. The main question now is how to design a controller guaranteeing (19) for all .
Let be a state-feedback control law that has been designed for a suitable performance (e.g., tracking) but without regard for safety. For every , denote by the set
Note that . Therefore, if for every , then the requirements for the safety set are met. However, in the event that for some , it is reasonable to modify the control from to , defined as follows:
In other word, is the point in closest to . With the feedback control defined by (21) for all , the requirements of the safety set are met, and it is hoped that the performance according to which was defined is changed in a minimal way.
Observe that this procedure requires an optimization problem to be solved at each . However, if the system’s dynamic equation is control-affine, then this optimization problem is a quadratic program for which there are efficient computational techniques. To see this point, suppose that
for functions and , which means that the plant system is control affine. Then, by (21), given , and , is the solution of the optimization problem
the constraints on are linear hence this is a quadratic-programming problem in .
4 Simulation Results
We consider the control zone of a road approaching an intersection, and as in Malikopoulos et al. (2018), assume that vehicles do not change lanes and hence we focus on a single lane. The motion dynamics of the vehicles follow the bicycle model discussed in Section 2 with the following parameter values as in Shivam et al. (2019a): , , , , , and .
Two experiments are conducted. In the first experiment we consider only tracking without regard to safety constraints in the tight loop. We compute the trajectories of the vehicles by the formula derived in Malikopoulos et al. (2018), then apply the tracking technique to ensure that the computed trajectories are followed. In the second experiment we define safety constraints in terms of minimum inter-vehicle distance and maximum lateral deviations from the lane’s center, and apply Control Barrier Functions (CBF) to ensure that they are satisfied in the face of unexpected changes to traffic conditions.111Safety has been guaranteed in the trajectory-planning stage by the scheduler and the optimal control problem. Here we consider unforeseen situations that may arise in real time.
4.1 Tracking Control
We consider a road (lane) approaching an intersection, consisting of a control zone of m and merging zone of m. It comprises a m-long, segment of a circle defined by the following equation,
where m, and are planer coordinates of points on the circle, , and .
There are 5 vehicles in the experiment. They arrive to the control zone at randomly-drawn times, all at the same initial speed of 13.4 m/s and longitudinal acceleration of 0. The initial heading of all the vehicles is with respect to the direction of the lane, and therefore, if the control gives effective tracking, they are expected to remain close to the lane’s center and maintain a heading of near (with respect to the road) throughout the control zone.
The arrival times of the vehicles to the merging zone and the vehicle’s trajectories in the control zone are computed, respectively, by the scheduling procedure and the optimal control algorithm proposed in Malikopoulos et al. (2018). Now it must be pointed out that that algorithm is applicable to straight roads since it is underscored by a straight-line model of motion. Therefore, we compute the trajectories as if the road is straight, and map the results to the curved road according to the distance travelled. This no-longer results in minimum-energy trajectories since the dynamic vehicle-model is two-dimensional, but the approximation errors are minor.
To test the robustness of the controller with respect to modeling variations, we induce an error of 100% in the vehicles’ mass. Thus, the predictor equation (13) uses twice the “real” weight of the cars which is used in the simulations.
All the differential equations for the simulation and the controller are solved by the Forward Euler method with step-size of for the simulations, and for the controller. The controller speedup factor is set at .
The results are shown in Figures 2-4. Figure 2 depicts the graphs of the distance (arc-length) travelled by the five vehicles through the control zone and merging zone, as functions to time. The color-coded legend indicates the order of the vehicles, where car refers to the th vehicle that arrives to the control zone. The vehicles travel m through the control and merging zones, but we extend the graphs past their departures from the merging zone by holding the Distance-Travelled variables to a constant (m), for ease of a better presentation. Apparently Car 1 moves at a constant velocity. In contrast, subsequent vehicles slow down in order to meet the computed schedule of entering the merging zone, which is more sparse than their arrival schedule to the control zone. These graphs will be used to explain some of the phenomena indicated in the figures below.
The tracking error for each vehicle, defined by the Euclidean distances between its position and target reference as computed by the optimal control program, is depicted in Figure 3. Following an initial error of about cm, the vehicles settle, in about seconds, to a steady-state error of under cm. The initial error is due to transients associated with discrepancies between the vehicles’ initial poise and their corresponding reference points. These transients appear identical for all the vehicles, because their respective initial positions, velocities and steering angles are identical at the respective times they enter the control zone. The asymptotic tracking errors are due to the prediction errors and the curvatures of the road. We tested this hypothesis by trying the following modifications one at a time: (i) Increasing the predictor’s step size in (13) from to , thereby increasing the prediction error. The resulting asymptotic tracking errors are increased by approximately %, and the largest one, from under cm to about cm. (ii) Eliminating the modeling error of the mass. This has the effect of reducing the asymptotic tracking errors, with the largest one from under cm to cm. Since the tracking errors are small relative to the distance travelled, the graphs in Figure 2 are indistinguishable from corresponding graphs of the reference trajectories, which consequently are not presented in the paper.
Figure 4 depicts the graphs of the longitudinal accelerations of the vehicles vs. time, and we observe initial transients of under m/s. The graphs of later vehicles are below the graphs of earlier vehicles. This is due to the fact that all of the vehicles travel the same distance but later ones do it in more time, hence have to decelerate more than earlier vehicles. We also note that each graph reaches zero acceleration at the final point of the control zone, Which is in compliance with the constraint that it must travel at a constant speed at the merging zone.
Finally, we tested the tracking algorithm on a straight road, all other parameters unchanged. The results are not shown here. Those of the distance travelled and longitudinal accelerations are barely distinguishable from the graphs in Figure 2 and Figure 4, respectively. The only noticeable differences are in the asymptotic tracking errors, whose maximum is reduced from around cm as indicated in Figure 3, to cm.
4.2 Incorporation of Safety Constraints
We next extend the simulation setting described in the last subsection to include safety constraints that may have to be addressed in real time, and apply to them control barrier functions. To highlight the role of the CBF we assume that the road is straight and consider only two vehicles in the forthcoming simulations. The first vehicle serves only as a reference for controlling the second vehicle, hence we preset its trajectory and do not control it. The second vehicle has the same dynamic bicycle model as in Subsection 4.1, and it is controlled by the same tracking technique described there.
The first vehicle enters the control zone at time s, and the second vehicle enters it at time . The first vehicle travels along the straight road and its speed profile is shown in the blue graph of Figure 5. The constant velocities in the figure are 2 m/s, 1 m/s, and 2 m/s, respectively, its deceleration commences at time :=50 s, and its acceleration starts at time :=75 m. We do not apply the tracking control or CBF to the first vehicle, and assume that it maintains the above speed profile while moving along the lane without deviations.
At the time the second vehicle enters the control zone (road), , it is 10m behind the first vehicle. Its target reference trajectory is , lying along the horizontal road. However, it enters the road at the initial steering angle of 20, or 0.35 rad from the direction of the road. Therefore initially the second vehicle veers off the lane, but is pulled back to it by the tracking control. Thereafter it stays on the lane while tracking its target trajectory. Without an application of the CBF to the second vehicle, maximum deviation (lateral distance) from the lane’s center is about 1.6m, which practically may be unacceptable. Furthermore, after returning to the lane, it runs into the first vehicle shortly after its slowdown.
To avoid the collision and limit the lateral deviation from the lane, we impose the following two safety constraints: (i) the second vehicle must maintain a distance of at least 5m from the first vehicle, and (ii) the lateral deviation of the second vehicle from the center-lane must not exceed 0.5m. We label these the longitudinal constraint and the lateral constraint. We design two corresponding CBF and apply them jointly with the tracking controller. We point out that the longitudinal dynamics of the second vehicle are control-affine while its lateral dynamics are not control affine; see the state equation (1). Therefore the CFB for the longitudinal constraint can rely on quadratic programming for computing the control defined by Eq. (21), while the lateral-safety control cannot use quadratic programming and has to be ad hoc.222We are aware of a transformation of the system that renders its state equation affine with respect to both input controls (Rajamani (2012)). However, we prefer to work with the current system in order to test the controller in an environment where the state equation is not control affine. The results, presented in Figure 7, below, suggest that the CBF works well. We next explain the two control barrier functions.
Let us denote the position and velocity of the th vehicle, , by and , respectively. Furthermore, define the relative displacement and relative velocity of the second vehicle with respect to the first one by and . The purpose of the CBF is to ensure that for a given (m in our experiments). Therefore it is tempting to define the safe set as , where is the state variable of the dynamic bicycle model defined in Section 2 (recall Eq. (1) for its state equation). However, this can be problematic because if is nearly and projected on the direction of relative displacement is negative, it may be impossible to guarantee the forward invariance of the safe set. Furthermore, according to the definition of the state variable, the position of a vehicle is expressed in terms of its Cartesian coordinates while its velocity is characterized by its longitudinal and lateral components, which can make it complicated to describe the safe set in simple terms.
To get around this difficulty we use an idea, developed in Wang (2018), of defining a CBF in terms of the relative velocity along the relative displacement. Denoted by , it is defined by
Let denote the maximum-possible longitudinal deceleration of the second vehicle, and define . Recall that the longitudinal acceleration is denoted by and it is a part of the input (see (1)). Now, a simple algebra shows that for every interval where the first vehicle has a constant velocity, if then . Therefore, to ensure the forward invariance of the constraint set , we impose the condition that
This leads us to define the barrier function by . As a part of the safety control we enforce the condition , which implies that the set defined by (25) is forward invariant (see Ames et al. (2014, 2017, 2019)). Therefore, we consider the set defined by (25) as the safe set. Finally, we note that the dynamic equation (1) is control affine in the longitudinal acceleration, and hence the input control can be computed by a quadratic program.
To define the lateral CBF, we only need the lateral deviation of the vehicle from the lane’s center and its velocity. Denote by the lateral deviation, and let be the maximum allowed deviation. In analogy to (25), the following condition ensures the maximum deviation constraint,
where with denoting the maximum lateral acceleration. We define the safe set to be the set satisfying the inequality in (26). Correspondingly, we define the barrier function , and define for a constant (we chose ). Taking derivatives and using (1), it can be seen that Eq. (19) is satisfied.
The input involved with the lateral deviation is the steering angle of the front wheels, . Unlike the longitudinal control, the dynamic equation is not control affine in , and hence we cannot compute the control by a quadratic program. Instead, a linear search is performed by a bisection algorithm over a set of admissible , which is the interval , and the closest value to the desired input (computed by the tracking controller) which satisfies the (26) is chosen.
The simulation results are depicted in Figures 5-10. Figure 5 depicts the speeds of the first and second vehicles in blue and red, respectively. The visible initial transient of the red graph is due to the heading of the car when it enters the road. Note the delay in the slowdown of the second vehicle after the first vehicle; it is due to the fact that the second vehicle starts reducing its speed not immediately but when its distance from the first vehicle approaches the minimum of 5 m. In contrast, there is no such delay in the speedup since that would violate the minimum-delay constraints. Figure 6 shows the graph of the inter-vehicle distance, and we clearly see that it retains its minimum value through and following the speedup of the first vehicle.
Figure 7 depicts the graph of the lateral (normal) deviation of the second vehicle from the lane’s center, which is largely due to its initial heading of 20. We mentioned that without the lateral CBF the maximum distance is 1.6 m, and we observe that with the CBF, the maximum distance is about 0.27 m. Figure 8 shows the graph of the distance between the position of the second vehicle and its target trajectory. Following an initial transient the vehicle catches up and tracks its target trajectory until the first vehicle slows down. It then rises during the slowdown period due to the action of the CBF. After the first vehicle speeds up, the second vehicle cannot close down its tracking error since it is forced by the CBF to keep the inter-vehicle distance of 5 m, hence the tracking error assumes a constant value.
The next two figures show the two controls. Figure 9 depicts the longitudinal acceleration, and we notice jumps that are due to initial transients as well as the slowdown and speedup of the first-vehicle. Figure 10 depicts the graph of the steering angle of the second car, and it displays a transient due to the initial heading of the car. Neither figure displays surprising results.
5 Conclusion and Future Work
This work extends the framework of prediction-based nonlinear tracking in the context of trajectory control of autonomous vehicles at traffic intersections. We present results that use a flow version of the Newton-Raphson method for controlling a predicted system-output to a future reference target. Furthermore, we guarantee safety specifications by applying to the tracking technique the framework of control barrier functions.
Future work will focus on developing robustness guarantees will allow for more realistic scenarios, where noise and external disturbances are taken into consideration.
- Control barrier functions: theory and applications. In European Control Conference, Napoli, Italy, June 25-28, Cited by: §3.2, §3.2, §4.2.
- Control barrier function based quadratic programs with application to adaptive cruise control. In IEEE Conf. Decision and Control (CDC), Los Angeles, California, December 15-17, Vol. , pp. 6271–6278. Cited by: §3.2, §3.2, §4.2.
- Control barrier function based quadratic programs for safety critical systems. IEEE Trans. Automatic Control 62, pp. 3861–3876. Cited by: §3.2, §4.2.
- Output regulation of nonlinear systems. IEEE Transactions on Automatic Control 35 (), pp. 131–140. Cited by: §1.
- On the design of robust servomechanisms for minimum phase nonlinear systems. Proc. 37th IEEE Conference on Decision and Control, Tampa, FL (), pp. 3075–3080. Cited by: §1.
- Am mpc-based approach to provable system-wide safety and liveness of autonomous ground traffic. IEEE Transactions on Automatic Control 59 (12), pp. 3341–3356. Cited by: §1.
- Kinematic and dynamic vehicle models for autonomous driving control design. In Proc. IEEE Intelligent Vehicles Symposium (IV), Cited by: §1, §1, §2.
- A decentralized energy-optimal control framework for connected automated vehicles at signal-free intersections. Automatica 93 (), pp. 244–256. Cited by: §1, §1, §1, §2, §3.1, §4.1, §4, §4.
- Spatial-based predictive control and geometric corridor planning for adaptive cruise control coupled with obstacle avoidance. Transactions on Control Systems Technology 26 (4), pp. 38–50. Cited by: §1, §1.
- Vehicle dynamics and control. Springer, New York, New York. Cited by: footnote 2.
- Model predictive control: theory, computation, and design, 2nd edition. Nob Hill, LLC. Cited by: §1.
- Tracking control by the Newton-Raphson flow: applications to autonomous vehicles. In 2019 European Control Conference (ECC 2019), Napoli, Italy, June 25-28, pp. . Cited by: §4.
A predictive deep learning approach to output regulation: the case of collaborative pursuit evasion. In 58th IEEE Conference on Decision and Control, Nice, France, December 11-13, pp. . Cited by: §1, §3.1.
- Safety barrier certificates for collisions-free multi-robot systems. IEEE Transactions on Robotics 33 (3), pp. 661–674. Cited by: §3.2, §3.2.
- Multi-robot coordination and safe learning using barrier certificates. Ph.D. Thesis, Georgia Institute of Technology. Cited by: §4.2.
- Tracking control by the newton-raphson method with output prediction and controller speedup. In arxiv, http://arxiv.org/abs/1910.00693, submitted to Automatica, Vol. , pp. . Cited by: §1, §1, §1, §1, §3.1, §3.1, §3.1, §3.1, §3.1, §3.1.