Jinglai Shen

Jinglai Shen

Auto-generated profile, based on publicly available information

Jinglai Shen

Department of Mathematics and Statistics, University of Maryland Baltimore County, Baltimore, MD, USA

Research Focus & Metrics

Academic Career Length

26Years (2001-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
9 August 2007 in International Journal of Robust and Nonlinear Control
Verified
Journal Article
Closed access
PDF file
JSJinglai Shen
Jinglai Shen
DSDavid A. Schneider
David A. Schneider
ABAnthony M. Bloch
Anthony M. Bloch

30 August 2013 in Biometrika
Verified
Journal Article
Closed access
PDF file
XWXiao Wang
Xiao Wang
PDPang Du
Pang Du
JSJinglai Shen
Jinglai Shen
This paper considers the development of spatially adaptive smoothing splines for the estimation of a regression function with nonhomogeneous smoothness across the domain. Two challenging issues arising in this context are the evaluation of the equivalent kernel and the determination of a local penalty. The penalty is a function of the design points in order to accommodate local behaviour of the regression function. We show that the spatially adaptive smoothing spline estimator is approximately a kernel estimator, and that the equivalent kernel is spatially dependent. The equivalent kernels for traditional smoothing splines are a special case of this general solution. With the aid of the Green’s function for a two-point boundary value problem, explicit forms of the asymptotic mean and variance are obtained for any interior point. Thus, the optimal roughness penalty function is obtained by approximately minimizing the asymptotic integrated mean squared error. Simulation results and an application illustrate the performance of the proposed estimator.

1 March 2022 in Transportation Science
Verified
Journal Article
Closed access
JSJinglai Shen
Jinglai Shen
EKEswar Kumar H. Kammara
Eswar Kumar H. Kammara
Lili DuLili Du
Lili Du
This paper develops distributed optimization-based, platoon-centered connected and autonomous vehicle (CAV) car-following schemes, motivated by the recent interest in CAV platooning technologies. Various distributed optimization or control schemes have been developed for CAV platooning. However, most existing distributed schemes for platoon centered CAV control require either centralized data processing or centralized computation in at least one step of their schemes, referred to as partially distributed schemes. In this paper, we develop fully distributed optimization based, platoon centered CAV platooning control under the linear vehicle dynamics via the model predictive control approach with a general prediction horizon. These fully distributed schemes do not require centralized data processing or centralized computation through the entire schemes. To develop these schemes, we propose a new formulation of an objective function and a decomposition method that decomposes a densely coupled central objective function into the sum of multiple locally coupled functions whose coupling satisfies the network topology constraint. We then exploit locally coupled optimization and operator splitting methods to develop fully distributed schemes. Control design and stability analysis is carried out to achieve desired traffic transient performance and asymptotic stability. Numerical tests demonstrate the effectiveness of the proposed fully distributed schemes and CAV platooning control.

25 October 2019 in ESAIM: Control, Optimisation and Calculus of Variations
Verified
Journal Article
Closed access
SMSeyedahmad Mousavi
Seyedahmad Mousavi
JSJinglai Shen
Jinglai Shen
In this paper, we study the solution uniqueness of an individual feasible vector of a class of convex optimization problems involving convex piecewise affine functions and subject to general polyhedral constraints. This class of problems incorporates many important polyhedral constrained ℓ1 recovery problems arising from sparse optimization, such as basis pursuit, LASSO, and basis pursuit denoising, as well as polyhedral gauge recovery. By leveraging the max-formulation of convex piecewise affine functions and convex analysis tools, we develop dual variables based necessary and sufficient uniqueness conditions via simple and yet unifying approaches; these conditions are applied to a wide range of ℓ1 minimization problems under possible polyhedral constraints. An effective linear program based scheme is proposed to verify solution uniqueness conditions. The results obtained in this paper not only recover the known solution uniqueness conditions in the literature by removing restrictive assumptions but also yield new uniqueness conditions for much broader constrained ℓ1-minimization problems.

1 January 2004
Verified
Conference Paper
Closed access
JSJinglai Shen
Jinglai Shen
ASAmit K Sanyal
Amit K Sanyal
NCN.A. Chaturvedi
N.A. Chaturvedi
DBD. Bernstein
D. Bernstein
HMH. McClamroch
H. McClamroch
New pendulum models are introduced and studied. The pendulum consists of a rigid body, supported at a fixed pivot, with three rotational degrees of freedom. The pendulum is acted on by a gravitational force and control forces and moments. Several different pendulum models are developed to analyze properties of the uncontrolled pendulum. Symmetry assumptions are shown to lead to the planar 1D pendulum and to the spherical 2D pendulum models as special cases. The case where the rigid body is asymmetric and the center of mass is distinct from the pivot location leads to the 3D pendulum. Rigid pendulum and multi-body pendulum control problems are proposed. The 3D pendulum models provide a rich source of examples for nonlinear dynamics and control, some of which are similar to simpler pendulum models and some of which are completely new.

24 May 2022 in IEEE Transactions on Intelligent Transportation Systems
Verified
Journal Article
Closed access
JSJinglai Shen
Jinglai Shen
EKEswar Kumar Hathibelagal Kammara
Eswar Kumar Hathibelagal Kammara
Lili DuLili Du
Lili Du
CAV platooning technology has received considerable attention, driven by the next generation smart transportation systems. This paper considers nonlinear vehicle dynamics and develops fully distributed optimization based CAV platooning control schemes via the platoon centered MPC approach for a possibly heterogeneous CAV platoon. The nonlinear vehicle dynamics leads to major difficulties in distributed algorithm development and control analysis. Specifically, the underlying MPC optimization problem is nonconvex and densely coupled. Further, the closed loop dynamics becomes a time-varying nonlinear system with non-vanishing external perturbations, making stability analysis rather complicated. To overcome these difficulties, we formulate the underlying MPC optimization problem as a locally coupled, albeit nonconvex, optimization problem and develop a sequential convex programming based fully distributed scheme for a general MPC horizon. Such a scheme can be effectively implemented for real-time computing using operator splitting methods. To analyze the closed loop stability, we apply various tools from global implicit function theorems, stability of linear time-varying systems, and Lyapunov theory for input-to-state stability to show that the closed loop system is locally input-to-state stable uniformly in all small coefficients pertaining to the nonlinear dynamic effects. Numerical tests on a heterogeneous CAV platoon in a real traffic condition illustrate the effectiveness of the proposed method.