{"title":"Online Motion Generation via Tangential Sampling-Based MPC Around Nonconvex Obstacles","authors":"Guangbao Zhao;Ninglong Jin;Jianhua Wu;Zhenhua Xiong","doi":"10.1109/LRA.2025.3560885","DOIUrl":null,"url":null,"abstract":"Collision-free motion planning has a well-established research history, but the majority of studies have been centered around Euclidean space and conducted offline. The primary challenge in online motion planning lies in circumventing local minima, which become more pronounced in configuration space. We propose an online method for generating collision-free motion in configuration space that effectively avoids local minima. Our approach decomposes the optimal velocity into nominal and tangential components, with the tangential velocity optimized to facilitate escape from local minima. The tangential velocity is defined in the tangential space, with its normal direction determined by the gradient of the nearest distance between the robot and obstacles, relative to the robot's states. Direct optimization of the tangential velocity is challenging due to its dependence on varying tangent spaces. To address this, we represent the tangential velocity using the orthogonal basis of the tangent space, decoupling it from the varying tangent space. This allows explicit optimization of the tangential velocity by optimizing its components. Additionally, we introduce a warm-start operator in the tangent space to ensure the consistency and convergence. Furthermore, we propose a dynamic weight based on proximity to local minima to balance the tangential and nominal velocities, forming the optimal velocity. The effectiveness of our approach in avoiding local minima is validated through simulations and physical experiments.","PeriodicalId":13241,"journal":{"name":"IEEE Robotics and Automation Letters","volume":"10 6","pages":"5537-5544"},"PeriodicalIF":4.6000,"publicationDate":"2025-04-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Robotics and Automation Letters","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10964844/","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"ROBOTICS","Score":null,"Total":0}
引用次数: 0
Abstract
Collision-free motion planning has a well-established research history, but the majority of studies have been centered around Euclidean space and conducted offline. The primary challenge in online motion planning lies in circumventing local minima, which become more pronounced in configuration space. We propose an online method for generating collision-free motion in configuration space that effectively avoids local minima. Our approach decomposes the optimal velocity into nominal and tangential components, with the tangential velocity optimized to facilitate escape from local minima. The tangential velocity is defined in the tangential space, with its normal direction determined by the gradient of the nearest distance between the robot and obstacles, relative to the robot's states. Direct optimization of the tangential velocity is challenging due to its dependence on varying tangent spaces. To address this, we represent the tangential velocity using the orthogonal basis of the tangent space, decoupling it from the varying tangent space. This allows explicit optimization of the tangential velocity by optimizing its components. Additionally, we introduce a warm-start operator in the tangent space to ensure the consistency and convergence. Furthermore, we propose a dynamic weight based on proximity to local minima to balance the tangential and nominal velocities, forming the optimal velocity. The effectiveness of our approach in avoiding local minima is validated through simulations and physical experiments.
期刊介绍:
The scope of this journal is to publish peer-reviewed articles that provide a timely and concise account of innovative research ideas and application results, reporting significant theoretical findings and application case studies in areas of robotics and automation.