Cover Image

Hidden convexity property of a speed planning problem

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Ardizzoni, Stefano, Consolini, Luca, Laurini, Mattia, Locatelli, Marco
Format:	Preprint
Published:	2025
Subjects:	Optimization and Control
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Speed planning by minimizing travel time and energy consumption
by: Ardizzoni, Stefano, et al.
Published: (2025)

A convex reformulation for speed planning of a vehicle under the travel time and energy consumption objectives
by: Consolini, Luca, et al.
Published: (2025)

Identification of Cyclists' Route Choice Criteria
by: Ardizzoni, Stefano, et al.
Published: (2024)

The Bounded Acceleration Shortest Path problem: complexity and solution algorithms
by: Ardizzoni, Stefano, et al.
Published: (2021)

A Dynamic Programming Approach for Road Traffic Estimation
by: Laurini, Mattia, et al.
Published: (2024)

Local Optimization of MAPF solutions on Directed Graphs
by: Ardizzoni, S., et al.
Published: (2023)

System Realizations by Mammillary Models with an Application to Propofol Pharmacokinetics
by: Beltrami, Veronica, et al.
Published: (2025)

Dynamic Programming based Local Search approaches for Multi-Agent Path Finding problems on Directed Graphs
by: Saccani, Irene, et al.
Published: (2024)

A Branch and Bound method for the exact parameter identification of the PK/PD model for anesthetic drugs
by: Di Credico, Giulia, et al.
Published: (2024)

Constrained Multi-Agent Path Finding on Directed Graphs
by: Ardizzoni, Stefano, et al.
Published: (2022)

Multi-Agent Path Finding on Strongly Connected Digraphs: feasibility and solution algorithms
by: Ardizzoni, Stefano, et al.
Published: (2022)

Fix and Bound: An efficient approach for solving large-scale quadratic programming problems with box constraints
by: Locatelli, Marco, et al.
Published: (2022)

A time-dependent symplectic network for non-convex path planning problems with linear and nonlinear dynamics
by: Zhang, Zhen, et al.
Published: (2024)

Some properties of sets, functions, and multi-objective optimization problems using p-convexity
by: Vera, Cristian
Published: (2026)

Research on the descent direction of prediction correction algorithms for pseudo-convex/convex optimization problems
by: Li, Ting, et al.
Published: (2025)

On a fixed-point continuation method for a convex optimization problem
by: Fest, Jean-Baptiste, et al.
Published: (2022)

On quasi-convex smooth optimization problems by a comparison oracle
by: Gasnikov, A. V., et al.
Published: (2024)

An algorithm with improved complexity for pebble motion/multi-agent path finding on trees
by: Ardizzoni, Stefano, et al.
Published: (2023)

Safe and wind-aware synchronous path planning for a fleet of fixed-wing constant speed aircraft
by: Feurgard, Maël, et al.
Published: (2026)

On the Moreau envelope properties of weakly convex functions
by: Renaud, Marien, et al.
Published: (2025)

Non-convex optimization problems for maximum hands-off control
by: Ikeda, Takuya
Published: (2024)

A convex combination based primal-dual algorithm with linesearch for general convex-concave saddle point problems
by: Chang, Xiaokai, et al.
Published: (2024)

Code generation for solving and differentiating through convex optimization problems
by: Schaller, Maximilian, et al.
Published: (2025)

Random minibatch subgradient algorithms for convex problems with functional constraints
by: Nedich, Angelia, et al.
Published: (2019)

Solution uniqueness of convex optimization problems via the radial cone
by: Fadili, Jalal, et al.
Published: (2024)

Strong duality in infinite convex optimization
by: Hantoute, Abderrahim, et al.
Published: (2025)

A $\sqrt{2}$-accelerated FISTA for composite strongly convex problems
by: Ushiyama, Kansei
Published: (2025)

Proximal bundle methods for hybrid weakly convex composite optimization problems
by: Liang, Jiaming, et al.
Published: (2023)

Approximation analysis for the minimization problem of difference-of-convex functions with Moreau envelopes
by: Tang, Yan, et al.
Published: (2024)

Primal-dual proximal bundle and conditional gradient methods for convex problems
by: Liang, Jiaming
Published: (2024)

Solving separable convex optimization problems: Faster prediction-correction framework
by: Zhang, Tao, et al.
Published: (2023)

Optimization research on shared bicycle route planning problem
by: Luo, Qiwei
Published: (2024)

The robust isolated calmness of spectral norm regularized convex matrix optimization problems
by: Yin, Ziran, et al.
Published: (2024)

Continuous and discrete-time accelerated methods for an inequality constrained convex optimization problem
by: Liu, Juan, et al.
Published: (2024)

New numerical solutions to Newton's problem of least resistance via a convex hull approach
by: Wachsmuth, Gerd
Published: (2025)

Convergence analysis of a regularized Newton method with generalized regularization terms for convex optimization problems
by: Yamakawa, Yuya, et al.
Published: (2024)

SSNCVX: A primal-dual semismooth Newton method for convex composite optimization problem
by: Deng, Zhanwang, et al.
Published: (2025)

A convexity preserving nonconvex regularization for inverse problems under non-Gaussian noise
by: Yata, Wataru, et al.
Published: (2025)

A globalized inexact semismooth Newton method for strongly convex optimal control problems
by: Wachsmuth, Daniel
Published: (2025)

Curvature accelerated decentralized non-convex optimization for high-dimensional machine learning problems
by: Yi, Dingran, et al.
Published: (2025)