The increasing application of voltage source converter (VSC) based high voltage direct current (VSC-HVDC) technology in power grids has raised the importance of incorporating DC grids and converters into the existing ...
The increasing application of voltage source converter (VSC) based high voltage direct current (VSC-HVDC) technology in power grids has raised the importance of incorporating DC grids and converters into the existing transmission network. This poses significant challenges in dealing with the resulting optimal power flow (OPF) problem. In this paper, a recently proposed nonconvex distributed optimization algorithm — Augmented Lagrangian based Alternating Direction Inexact Newton method (ALADIN), is tailored to solve the nonconvex AC/DC OPF problem for emerging voltage source converter (VSC) based multiterminal high voltage direct current (VSC-MTDC) meshed AC/DC hybrid systems. The proposed scheme decomposes this AC/DC hybrid OPF problem and handles it in a fully distributed way. Compared to the existing state-of-art Alternating Direction Method of Multipliers (ADMM), which is in general, not applicable for nonconvex problems, ALADIN has a theoretical convergence guarantee. Applying these two approaches to VSC-MTDC coupled with an IEEE benchmark AC power system illustrates that the tailored ALADIN outperforms ADMM in convergence speed and numerical robustness.
This paper considers distributed nonconvex op-timization for minimizing the average of local cost functions, by using local information exchange over undirected communication networks. Since the communication channels...
详细信息
ISBN:
(数字)9781665467612
ISBN:
(纸本)9781665467629
This paper considers distributed nonconvex op-timization for minimizing the average of local cost functions, by using local information exchange over undirected communication networks. Since the communication channels often have limited bandwidth or capacity, we first introduce a quantization rule and an encoder/decoder scheme to reduce the transmission bits. By integrating them with a distributed algorithm, we then propose a distributed quantized nonconvex optimization algorithm. Assuming the global cost function satisfies the Polyak– Łojasiewicz condition, which does not require the global cost function to be convex and the global minimizer is not necessarily unique, we show that the proposed algorithm linearly converges to a global optimal point. Moreover, a low data rate is shown to be sufficient to ensure linear convergence when the algorithm parameters are properly chosen. The theoretical results are illustrated by numerical simulation examples.
This article investigates the distributed control problem for nonlinear multiagent systems (MASs) with unknown system models. A novel distributed model-free adaptive learning algorithm is developed to learn a controll...
详细信息
In this paper, we study the distributed nonconvex optimization problem, aiming to minimize the average value of the local nonconvex cost functions using local information exchange. To reduce the communication overhead...
详细信息
Challenged by urbanization and increasing travel needs, existing transportation systems need new mobility paradigms. In this article, we present the emerging concept of autonomous mobility-on-demand, whereby centrally...
详细信息
This paper investigates the cooperative output regulation (COR) of nonlinear multi-agent systems (MASs) with long input delay based on periodic event-triggered mechanism. Compared with other mechanisms, periodic event...
详细信息
Simultaneous localization and mapping(SLAM) plays an important role in autonomous navigation for mobile *** of the visual SLAM approaches use keypoints for tracking, whose performance however suffers from the unstab...
详细信息
Simultaneous localization and mapping(SLAM) plays an important role in autonomous navigation for mobile *** of the visual SLAM approaches use keypoints for tracking, whose performance however suffers from the unstable landmarks during task due to uncertain light condition and frequently changeable viewpoint. The situation even becomes worse for visual SLAM in low texture environment especially in indoor buildings, where the supplementary artificial markers can be used to improve the robust detection under a wider range of circumstances. Inspired by this thought, this paper developed a visual SLAM system integrated with keypoints and artificial markers. A graph optimization problem is constructed to optimize the trajectory by taking both the reprojection error of keypoints and the influence of markers into consideration. The experimental results on SPM dataset demonstrate the superior accuracy of the proposed graph optimization algorithm compared with the start-of-the-art ORB-SLAM2.
In this paper, a method of distributionally robust fault detection (FD) is proposed for stochastic linear discrete-time systems by using the kernel density estimation (KDE) technique. For this purpose, an H 2 optimiza...
详细信息
In this paper, a method of distributionally robust fault detection (FD) is proposed for stochastic linear discrete-time systems by using the kernel density estimation (KDE) technique. For this purpose, an H 2 optimization-based fault detection filter is constructed for residual generation. Towards maximizing the fault detection rate (FDR) for a prescribed false alarm rate (FAR), the residual evaluation issue regarding the design of residual evaluation function and threshold is formulated as a distributionally robust optimization problem, wherein the so-called confidence sets are constituted to model the ambiguity of distribution knowledge of residuals in fault-free and faulty cases. A KDE based solution, robust to the estimation errors in probability distribution of residual caused by the finite number of samples, is further developed to address the targeting problem such that the residual evaluation function, threshold as well as the lower bound of FDR can be achieved simultaneously. A case study on a vehicle lateral control system demonstrates the applicability of the proposed FD method.
This paper considers distributed nonconvex optimization with the cost functions being distributed over agents. Noting that information compression is a key tool to reduce the heavy communication load for distributed a...
详细信息
This paper proposes a distributed nonsingular cooperative guidance law for multiple flight vehicles with Field-of-View (FOV) constraints. First, a novel time-to-go estimation is developed based on a FOV-constrained Pr...
详细信息
This paper proposes a distributed nonsingular cooperative guidance law for multiple flight vehicles with Field-of-View (FOV) constraints. First, a novel time-to-go estimation is developed based on a FOV-constrained Proportional Navigation Guidance (FPNG) law. Then, the FPNG law is augmented with a cooperative guidance term to achieve consensus of time-to-go with predefined-time convergence prior to the impact time. A continuous auxiliary function is introduced in the bias term to avoid the singularity of guidance command. Moreover, the proposed guidance law is extended to the three-dimensional guidance scenarios and the moving target with the help of a predicted interception point. Finally, several numerical simulations are conducted, and the results verify the effectiveness, robustness, and advantages of the proposed cooperative guidance law.
暂无评论