中文
相关论文

相关论文: Autonomous Parking by Successive Convexification a…

200 篇论文

Motivated by the application of using model predictive control (MPC) for motion planning of autonomous mobile robots, a form of output tracking MPC for non-holonomic systems and with non-convex constraints is studied. Although the…

机器人学 · 计算机科学 2025-10-22 Matthias Lorenzen , Teodoro Alamo , Martina Mammarella , Fabrizio Dabbene

Sampling-based motion planning is an effective tool to compute safe trajectories for automated vehicles in complex environments. However, a fast convergence to the optimal solution can only be ensured with the use of problem-specific…

机器人学 · 计算机科学 2019-02-04 Holger Banzhaf , Paul Sanzenbacher , Ulrich Baumann , J. Marius Zöllner

Two optimization algorithms are proposed for solving a stochastic programming problem for which the objective function is given in the form of the expectation of convex functions and the constraint set is defined by the intersection of…

最优化与控制 · 数学 2017-10-09 Hideaki Iiduka

In this paper, we propose a uniform semismooth Newton-based algorithmic framework called SSNCVX for solving a broad class of convex composite optimization problems. By exploiting the augmented Lagrangian duality, we reformulate the original…

最优化与控制 · 数学 2025-09-16 Zhanwang Deng , Tao Wei , Jirui Ma , Zaiwen Wen

In this paper, we present a task space-based local motion planner that incorporates collision avoidance and constraints on end-effector motion during the execution of a task. Our key technical contribution is the development of a novel…

机器人学 · 计算机科学 2021-04-19 Anirban Sinha , Anik Sarker , Nilanjan Chakraborty

This paper presents a novel synthesis method for designing an optimal and robust guidance law for a non-throttleable upper stage of a launch vehicle, using a convex approach. In the unperturbed scenario, a combination of lossless and…

最优化与控制 · 数学 2022-12-14 Boris Benedikter , Alessandro Zavoli , Guido Colasurdo , Simone Pizzurro , Enrico Cavallini

We propose a successive convex approximation based off-policy optimization (SCAOPO) algorithm to solve the general constrained reinforcement learning problem, which is formulated as a constrained Markov decision process (CMDP) in the…

机器学习 · 计算机科学 2022-04-20 Chang Tian , An Liu , Guang Huang , Wu Luo

As the trend of moving away from high-precision maps gradually emerges in the autonomous driving industry,traditional planning algorithms are gradually exposing some problems. To address the high real-time, high precision, and high…

人工智能 · 计算机科学 2024-06-25 Yuxuan Zhao

This work introduces Transformer-based Successive Convexification (T-SCvx), an extension of Transformer-based Powered Descent Guidance (T-PDG), generalizable for efficient six-degree-of-freedom (DoF) fuel-optimal powered descent trajectory…

最优化与控制 · 数学 2025-01-03 Julia Briden , Trey Gurga , Breanna Johnson , Abhishek Cauligi , Richard Linares

Reinforcement Learning (RL) algorithms have shown tremendous success in simulation environments, but their application to real-world problems faces significant challenges, with safety being a major concern. In particular, enforcing…

机器学习 · 计算机科学 2024-06-19 Weiye Zhao , Rui Chen , Yifan Sun , Tianhao Wei , Changliu Liu

Stochastic nonconvex optimization problems with nonlinear constraints have a broad range of applications in intelligent transportation, cyber-security, and smart grids. In this paper, first, we propose an inexact-proximal accelerated…

最优化与控制 · 数学 2021-07-08 Morteza Boroun , Afrooz Jalilzadeh

Path planning for autonomous driving with dynamic obstacles poses a challenge because it needs to perform a higher-dimensional search (with time-dimension) while still meeting real-time constraints. This paper proposes an algorithm-hardware…

机器人学 · 计算机科学 2022-05-30 Mulong Luo , G. Edward Suh

In this work, we consider constrained stochastic optimization problems under hidden convexity, i.e., those that admit a convex reformulation via non-linear (but invertible) map $c(\cdot)$. A number of non-convex problems ranging from…

最优化与控制 · 数学 2024-11-12 Ilyas Fatkhullin , Niao He , Yifan Hu

We address the problem of optimal path planning for a simple nonholonomic vehicle in the presence of obstacles. Most current approaches are either split hierarchically into global path planning and local collision avoidance, or neglect some…

最优化与控制 · 数学 2020-05-08 Christian Parkinson , Andrea L. Bertozzi , Stanley Osher

In this two-part paper, we propose a general algorithmic framework for the minimization of a nonconvex smooth function subject to nonconvex smooth constraints. The algorithm solves a sequence of (separable) strongly convex problems and…

多智能体系统 · 计算机科学 2016-01-18 Gesualdo Scutari , Francisco Facchinei , Lorenzo Lampariello , Peiran Song

We propose a new asynchronous parallel block-descent algorithmic framework for the minimization of the sum of a smooth nonconvex function and a nonsmooth convex one, subject to both convex and nonconvex constraints. The proposed framework…

最优化与控制 · 数学 2018-04-02 Loris Cannelli , Francisco Facchinei , Vyacheslav Kungurtsev , Gesualdo Scutari

Electric vehicles with multiple motors provide a flexibility in meeting the driver torque demand, which calls for minimizing the battery energy consumption through torque allocation. In this paper, we present an approach to this problem…

系统与控制 · 电气工程与系统科学 2026-03-20 Josip Kir Hromatko , Šandor Ileš , Branimir Škugor , Joško Deur

With rapid population growth and urban development, traffic congestion has become an inescapable issue, especially in large cities. Many congestion reduction strategies have been proposed in the past, ranging from roadway extension to…

最优化与控制 · 数学 2022-04-18 Ali Ghafelebashi , Meisam Razaviyayn , Maged Dessouky

A stochastic-gradient-based interior-point algorithm for minimizing a continuously differentiable objective function (that may be nonconvex) subject to bound constraints is presented, analyzed, and demonstrated through experimental results.…

最优化与控制 · 数学 2024-03-15 Frank E. Curtis , Vyacheslav Kungurtsev , Daniel P. Robinson , Qi Wang

In this paper, we propose and analyze zeroth-order stochastic approximation algorithms for nonconvex and convex optimization, with a focus on addressing constrained optimization, high-dimensional setting and saddle-point avoiding. To handle…

最优化与控制 · 数学 2019-01-16 Krishnakumar Balasubramanian , Saeed Ghadimi