检索结果-内蒙古大学图书馆

User-Centric Joint Admission Control and Resource Allocation for 5G D2D Extreme Mobile Broadband: A sequential convex programming Approach

引用

IEEE COMMUNICATIONS LETTERS 2017年第7期21卷 1641-1644页

作者： Tang, Rui Zhao, Jihong Qu, Hua Zhang, Zhenwei Xi An Jiao Tong Univ Sch Elect & Informat Engn Xian 710049 Peoples R China Xian Univ Posts & Telecommun Sch Commun & Informat Engn Xian 710061 Peoples R China Xi An Jiao Tong Univ Sch Elect & Informat Engn Xian 710049 Peoples R China

Device-to-Device (D2D) communication has been recognized as a promising remedy to offload 5G extreme mobile broadband services by utilizing the favorable channel condition in proximity. In contrast to most literature emphasizing system-centric metrics, we optimize user-centric ones, including the number of admitted D2D links with satisfied quality-of-service requirement and power consumption, by integrating resource allocation with admission control. Due to the intractability of the above problem, we apply the sequential convex programming technique to achieve a reasonable approximation to the original optimum. Simulations verify the advantages of conducting user-centric optimizations and show the efficacy of our scheme.

关键词： 5G D2D user-centric metrics admission control resource allocation sequential convex programming

来源：评论

学校读者我要写书评

暂无评论

Higher-Order Soft-Trust-Region-Based sequential convex programming

引用

JOURNAL OF GUIDANCE CONTROL AND DYNAMICS 2023年第11期46卷 2199-2206页

作者： Xie, Lei Zhou, Xiang Zhang, Hong-Bo Tang, Guo-Jian Natl Univ Def Technol Coll Aerosp Sci & Engn Changsha 410073 Peoples R China

来源：评论

学校读者我要写书评

暂无评论

Average Dwell-Time Minimization of Switched Systems via sequential convex programming

引用

IEEE CONTROL SYSTEMS LETTERS 2022年 6卷 1076-1081页

作者： Liu, Shenyu Martinez, Sonia Cortes, Jorge Univ Calif San Diego Dept Aerosp & Mech Engn La Jolla CA 92093 USA

This work finds a lower bound on the average dwell-time (ADT) of switching signals such that a continuous-time, graph-based, switched system is globally asymptotically stable, input-to-state stable, or integral input-to-state stable. We first formulate the lower bound on the ADT as a nonconvex optimization problem with bilinear matrix inequality constraints. Because this formulation is independent of the choice of Lyapunov functions, its solution gives a less conservative lower bound than previous Lyapunov-function-based approaches. We then design a numerical iterative algorithm to solve the optimization based on sequential convex programming with a convex-concave decomposition of the constraints. We analyze the convergence properties of the proposed algorithm, establishing the monotonic evolution of the estimates of the average dwell-time lower bound. Finally, we demonstrate the benefits of the proposed approach in two examples and compare it against other baseline methods.

关键词： Switches Switched systems Optimization Asymptotic stability Stability criteria Numerical stability Lyapunov methods Stability of switched systems average dwell-time sequential convex programming

来源：评论

学校读者我要写书评

暂无评论

Composite structures optimization using sequential convex programming

引用

ADVANCES IN ENGINEERING SOFTWARE 2002年第7-10期33卷 697-711页

作者： Bruyneel, M Fleury, C Univ Liege Mech Inst B52 LTAS B-4000 Liege Belgium

The design of composite structures is considered here. The approximation concepts approach is used to solve the optimization problem. The convex approximations of the MMA family are briefly described. Several modifications of these approximations are presented. They are now based on gradient information at two successive iterations, avoiding the use of the expensive second-order derivatives. A two-point fitting scheme is also described, where the function value at the preceding design point is used to improve the approximation. Numerical examples compare these new purely non-monotonous schemes to the existing ones for the selection of optimal fibers orientations in laminates. It is shown how these two-point based approximations are well adapted to the problem and can improve the optimization task, leading to reasonable computational efforts. A procedure is also derived for considering simultaneously monotonous and non-monotonous structural behaviors. The resulting generalized approximation scheme is well suited for the optimization of composite structures when both plies thickness and fibers orientations are considered as design variables. It is concluded that the newly developed approximation schemes of the MMA family are reliable for composite structures optimization. All the studied approximations are convex and separable: the optimization problem can then be solved using a dual approach. (C) 2002 Civil-Comp Ltd and Elsevier Science Ltd. All rights reserved.

关键词： structural optimization sequential convex programming dual method composite structures

来源：评论

学校读者我要写书评

暂无评论

sequential convex programming for Nonlinear Optimal Control in UAV Trajectory Planning

引用

ALGORITHMS 2024年第7期17卷 304页

作者： Li, Yong Zhu, Qidan Elahi, Ahsan Harbin Engn Univ Coll Intelligent Syst Sci & Engn Harbin 150001 Peoples R China

In this paper, an algorithm is proposed to solve the non-convex optimization problem using sequential convex programming. An approximation method was used to solve the collision avoidance constraint. An iterative approach was utilized to estimate the non-convex constraints, replacing them with their linear approximations. Through the simulation, we can see that this method allows for quadcopters to take off from a given initial position and fly to the desired final position within a specified flight time. It is guaranteed that the quadcopters will not collide with each other in different scenarios.

关键词： trajectory planning sequential convex programming quadcopter equality constraints inequality constraints

来源：评论

学校读者我要写书评

暂无评论

Fast Monte Carlo Analysis for 6-DoF Powered-Descent Guidance via GPU-Accelerated sequential convex programming

Fast Monte Carlo Analysis for 6-DoF Powered-Descent Guidance...

引用

AIAA SciTech Forum

作者： Chari, Govind M. Kamath, Abhinav G. Elango, Purnanand Acikmese, Behcet Univ Washington William E Boeing Dept Aeronaut & Astronaut Seattle WA 98195 USA

ISBN: (数字)9781624107115

ISBN: (纸本)9781624107115

We introduce a GPU-accelerated Monte Carlo framework for nonconvex, free-final-time trajectory optimization problems. This framework makes use of the prox-linear method, which belongs to the larger family of sequential convex programming (SCP) algorithms, in conjunction with a constraint reformulation that guarantees intersample constraint satisfaction. Key features of this framework are: (1) continuous-time constraint satisfaction;(2) a matrix-inverse-free solution method;(3) the use of the proportional-integral projected gradient (PIPG) method, a first-order convex optimization solver, customized to the convex subproblem at hand;and, (4) an end-to-end, library-free implementation of the algorithm. We demonstrate this GPU-based framework on the 6-DoF powered-descent guidance problem, and show that it is faster than an equivalent serial CPU implementation for Monte Carlo simulations with over 1000 runs. To the best of our knowledge, this is the first GPU-based implementation of a general-purpose nonconvex trajectory optimization solver.

关键词： Monte Carlo Simulation sequential convex programming Nonlinear Dynamics Powered Descent Guidance Graphics Processing Unit Optimal Control Problem Proportional Integral convex Optimization Machine Learning Propellant

来源：评论

学校读者我要写书评

暂无评论

An Optimal Time Reversal Waveform Based on sequential convex programming for Wireless Power Transmission 18

An Optimal Time Reversal Waveform Based on Sequential Convex...

引用

18th IEEE International Conference on Communication Technology (IEEE ICCT)

作者： Lin, Zhi-Wu Hu, Bin-Jie Wei, Zong-Heng Liao, Peng South China Univ Technol Sch Elect & Informat Engn Guangzhou Guangdong Peoples R China

ISBN: (纸本)9781538676356

Time reversal (TR) is one of the novel techniques on wireless power transmission (WPT), which can enhance transmission efficiency. In this paper, we use TR for WPT and propose a sequential convex programming for TR. We take the non-linear rectenna circuit model into consideration and carry out numerical simulations in a rich multipath environment to compare three waveforms: multi-sine, TR, TR-SCP. The results show that our approach can efficiently adapt to the complex multipath channel and the system model by achieving more output power at the receiver.

关键词： Wireless Power Transmission (WPT) time reversal sequential convex programming

来源：评论

学校读者我要写书评

暂无评论

Online Reentry Trajectory Optimization for Hypersonic Vehicles Using Radau Pseudospectral sequential convex programming 43

Online Reentry Trajectory Optimization for Hypersonic Vehicl...

引用

43rd Chinese Control Conference (CCC)

作者： Song, Zhifei Liu, Junjie Ji, Yuehui Zhang, Haobo Wang, Junchi Gao, Qiang Tianjin Univ Technol Sch Elect Engn & Automat Tianjin 300384 Peoples R China Tianjin Univ Technol Maritime Coll Tianjin 300384 Peoples R China Tianjin Key Lab Control Theory & Applicat Complex Tianjin 300384 Peoples R China

ISBN: (纸本)9798350366907;9789887581581

In this paper, an online trajectory optimization scheme is proposed to address the uncertainties and mission changes in hypersonic vehicle reentry trajectory optimization. By combining Radau pseudospectral method and sequential convex programming (SCP), the discretization accuracy and solution speed of the trajectory optimization algorithm are improved. Next, the downrange angle is used as the independent variable in the equations of motion to implement the free time trajectory optimization problem. An initial trajectory generation method is proposed, which makes the trajectory's terminal state close to the terminal position and thus reduces the number of algorithm optimization iterations. Moreover, the compensation and regularization terms are used, respectively, to maintain the feasibility of the trajectory optimization problem and to improve the convergence rate of the algorithm. In the end, the proper trajectory optimization period is set, and the interior-point method is used to solve the reentry trajectory optimization problem. Numerical simulations demonstrate the validity of the algorithm and online reentry trajectory optimization scheme proposed in this paper.

关键词： Radau pseudospectral method Hypersonic vehicle sequential convex programming Online reentry trajectory optimization

来源：评论

学校读者我要写书评

暂无评论

Online Trajectory Planning of Morphing Vehicle Based on sequential convex programming

Online Trajectory Planning of Morphing Vehicle Based on Sequ...

引用

Asia-Pacific International Symposium on Aerospace Technology (APISAT)

作者： Cai, Guodong Qin, Jiankai Luo, Kai Liu, Zhe China Acad Aerosp Aerodynam Beijing Peoples R China

ISBN: (纸本)9789819740123;9789819740109;9789819740093

Compared to traditional fixed wing aircraft, morphing vehicle can choose the best performance shape based on different mission requirements and flight conditions with morphing mechanisms. Therefore, the demand for trajectory planning for morphing vehicle is becoming increasingly strong. In this paper, a trajectory planning algorithm based on sequence convex programming with compensation factors is proposed to address the high nonlinearity of the aerodynamic model, the large computational load, and the difficulty in convergence during the trajectory planning process of morphing vehicle. Firstly, the rate of attack angle, the rate of back angle, and the rate of sweep angle are introduced as new control variables to decouple the original motion equation and smooth the angle state variables. Then, compensation factors are added to the motion equation and terminal constraints during the convexification process, and a penalty function with compensation factors is added to the objective function. The planning problem is then transformed into a convex optimization problem, which is solved using a sequential convex programming algorithm to achieve the goal of solving the strong nonlinearity caused by morphing, the difficult convergence problem caused by discretization, and the final convergence accuracy. Finally, the design method is compared and verified with the simulation results based on the pseudospectral trajectory planning algorithm. The simulation results show that compared with the pseudospectral method, the proposed algorithm can achieve fast online trajectory planning of morphing vehicle, with a reduction in computational time to 1/6 and high solution accuracy, resulting in higher overall efficiency.

关键词： Morphing vehicle Variable-sweep-wing Trajectory planning sequential convex programming Compensation factor

来源：评论

学校读者我要写书评

暂无评论

Composite structures optimization using sequential convex programming

Composite structures optimization using sequential convex pr...

引用

2nd International Conference on Engineering Computational Technology/5th International Conference on Computational Structures Technology

作者： Bruyneel, M Fleury, C Univ Liege Mech Inst B52 LTAS B-4000 Liege Belgium

ISBN: (纸本)0948749695

关键词： structural optimization sequential convex programming dual method composite structures

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：