Navigation in cluttered environments with feasibility guarantees - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2020

Navigation in cluttered environments with feasibility guarantees

Abstract

This paper addresses the navigation problem in a multi-obstacle environment and makes use of convex lifting in trajectory planning problems with anti-collision constraints. The design problem is commonly stated in the literature in terms of a constrained optimization problem over a non-convex domain. In our framework, the convex lifting approach plays an instrumental role in the partitioning of the feasible space in accordance with the distribution of obstacles and in the subsequent generation of corridors in cluttered environments. We consider an adaptation of the generic MPC (Model Predictive Control) trajectory tracking problem, aiming to guarantee the feasibility and the convergence. Simulation results and proof of concepts illustrations prove the effectiveness of the proposed approach.

Domains

Automatic
Fichier principal
Vignette du fichier
S2405896320321509.pdf (519.94 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03108514 , version 1 (24-04-2023)

Licence

Attribution - NonCommercial

Identifiers

Cite

Daniel Ioan, Ionela Prodan, Sorin Olaru, Florin Stoican, Silviu-Iulian Niculescu. Navigation in cluttered environments with feasibility guarantees. IFAC 2020 - 21st IFAC World Congress, IFAC, Jul 2020, Berlin / Virtual, Germany. pp.5487-5492, ⟨10.1016/j.ifacol.2020.12.1554⟩. ⟨hal-03108514⟩
50 View
16 Download

Altmetric

Share

Gmail Facebook X LinkedIn More