From Obstacle-Based Space Partitioning to Corridors and Path Planning. A Convex Lifting Approach

Abstract : This letter proposes a novel methodology for path generation in known and congested multi-obstacle environments. Our aim is to solve an open problem in navigation within such environments the feasible space partitioning in accordance with the distribution of obstacles. It is shown that such a partitioning is a key concept toward the generation of a corridor in cluttered environments. Once a corridor between an initial and a final position is generated, the selection of a path is considerably simplified in comparison with the methods which explore the original non-convex feasible regions of the environment. The core of the methodology presented here is the construction of a convex lifting which boils down to a convex optimization. This letter covers both the mathematical foundations and the computational details of the implementation and aims to illustrate the concepts with geometrical examples. © 2017 IEEE.
Document type :
Journal articles
Complete list of metadatas

https://hal-centralesupelec.archives-ouvertes.fr/hal-02328848
Contributor : Delphine Le Piolet <>
Submitted on : Wednesday, October 23, 2019 - 12:59:18 PM
Last modification on : Wednesday, October 30, 2019 - 10:42:39 AM

Identifiers

Citation

Daniel Ioan, Sorin Olaru, Ionela Prodan, Florin Stoican, Silviu-Iulian Niculescu. From Obstacle-Based Space Partitioning to Corridors and Path Planning. A Convex Lifting Approach. IEEE Control Systems Letters, IEEE, 2020, 4 (1), pp.79-84. ⟨10.1109/LCSYS.2019.2922414⟩. ⟨hal-02328848⟩

Share

Metrics

Record views

37