اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدTrajectory Generation by Chance Constrained Nonlinear MPC with Probabilistic Prediction
176
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Continued great efforts have been dedicated towards high-quality trajectory generation based on optimization methods, however, most of them do not suitably and effectively consider the situation with moving obstacles; and more particularly, the future position of these moving obstacles in the presence of uncertainty within some possible prescribed prediction horizon. To cater to this rather major shortcoming, this work shows how a variational Bayesian Gaussian mixture model (vBGMM) framework can be employed to predict the future trajectory of moving obstacles; and then with this methodology, a trajectory generation framework is proposed which will efficiently and effectively address trajectory generation in the presence of moving obstacles, and also incorporating presence of uncertainty within a prediction horizon. In this work, the full predictive conditional probability density function (PDF) with mean and covariance is obtained, and thus a future trajectory with uncertainty is formulated as a collision region represented by a confidence ellipsoid. To avoid the collision region, chance constraints are imposed to restrict the collision probability, and subsequently a nonlinear MPC problem is constructed with these chance constraints. It is shown that the proposed approach is able to predict the future position of the moving obstacles effectively; and thus based on the environmental information of the probabilistic prediction, it is also shown that the timing of collision avoidance can be earlier than the method without prediction. The tracking error and distance to obstacles of the trajectory with prediction are smaller compared with the method without prediction.
قيم البحث
اقرأ أيضاً
In this paper, a sample-based procedure for obtaining simple and computable approximations of chance-constrained sets is proposed. The procedure allows to control the complexity of the approximating set, by defining families of simple-approximating s
ets of given complexity. A probabilistic scaling procedure then allows to rescale these sets to obtain the desired probabilistic guarantees. The proposed approach is shown to be applicable in several problem in systems and control, such as the design of Stochastic Model Predictive Control schemes or the solution of probabilistic set membership estimation problems.
Iterative trajectory optimization techniques for non-linear dynamical systems are among the most powerful and sample-efficient methods of model-based reinforcement learning and approximate optimal control. By leveraging time-variant local linear-quad
ratic approximations of system dynamics and reward, such methods can find both a target-optimal trajectory and time-variant optimal feedback controllers. However, the local linear-quadratic assumptions are a major source of optimization bias that leads to catastrophic greedy updates, raising the issue of proper regularization. Moreover, the approximate models disregard for any physical state-action limits of the system causes further aggravation of the problem, as the optimization moves towards unreachable areas of the state-action space. In this paper, we address the issue of constrained systems in the scenario of online-fitted stochastic linear dynamics. We propose modeling state and action physical limits as probabilistic chance constraints linear in both state and action and introduce a new trajectory optimization technique that integrates these probabilistic constraints by optimizing a relaxed quadratic program. Our empirical evaluations show a significant improvement in learning robustness, which enables our approach to perform more effective updates and avoid premature convergence observed in state-of-the-art algorithms.
This paper introduces network flexibility into the chance constrained economic dispatch (CCED). In the proposed model, both power generations and line susceptances become variables to minimize the expected generation cost and guarantee a low probabil
ity of constraint violation in terms of generations and line flows under renewable uncertainties. We figure out the mechanism of network flexibility against uncertainties from the analytical form of CCED. On one hand, renewable uncertainties shrink the usable line capacities in the line flow constraints and aggravate transmission congestion. On the other hand, network flexibility significantly mitigates congestion by regulating the base-case line flows and reducing the line capacity shrinkage caused by uncertainties. Further, we propose an alternate iteration solver for this problem, which is efficient. With duality theory, we propose two convex subproblems with respect to generation-related variables and network-related variables, respectively. A satisfactory solution can be obtained by alternately solving these two subproblems. The case studies on the IEEE 14-bus system and IEEE 118-bus system suggest that network flexibility contributes much to operational economy under renewable uncertainties.
High penetration of renewable generation poses great challenge to power system operation due to its uncertain nature. In droop-controlled microgrids, the voltage volatility induced by renewable uncertainties is aggravated by the high droop gains. Thi
s paper proposes a chance-constrained optimal power flow (CC-OPF) problem with power flow routers (PFRs) to better regulate the voltage profile in microgrids. PFR refer to a general type of network-side controller that brings more flexibility to the power network. Comparing with the normal CC-OPF that relies on power injection flexibility only, the proposed model introduces a new dimension of control from power network to enhance system performance under renewable uncertainties. Since the inclusion of PFRs complicates the problem and makes common solvers no longer apply directly, we design an iterative solution algorithm. For the subproblem in each iteration, chance constraints are transformed into equivalent deterministic ones via sensitivity analysis, so that the subproblem can be efficiently solved by the convex relaxation method. The proposed method is verified on the modified IEEE 33-bus system and the results show that PFRs make a significant contribution to mitigating the voltage volatility and make the system operate in a more economic and secure way.
Chance-constrained optimization (CCO) has been widely used for uncertainty management in power system operation. With the prevalence of wind energy, it becomes possible to consider the wind curtailment as a dispatch variable in CCO. However, the wind
curtailment will cause impulse for the uncertainty distribution, yielding challenges for the chance constraints modeling. To deal with that, a data-driven framework is developed. By modeling the wind curtailment as a cap enforced on the wind power output, the proposed framework constructs a Gaussian process (GP) surrogate to describe the relationship between wind curtailment and the chance constraints. This allows us to reformulate the CCO with wind curtailment as a mixed-integer second-order cone programming (MI-SOCP) problem. An error correction strategy is developed by solving a convex linear programming (LP) to improve the modeling accuracy. Case studies performed on the PJM 5-bus and IEEE 118-bus systems demonstrate that the proposed method is capable of accurately accounting the influence of wind curtailment dispatch in CCO.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
