基于拓扑和微分几何的机器人路径规划最新综述--第一部分:静态约束条件下的规划

IF 2.1 Q3 ROBOTICS
Sindhu Radhakrishnan, Wail Gueaieb
{"title":"基于拓扑和微分几何的机器人路径规划最新综述--第一部分:静态约束条件下的规划","authors":"Sindhu Radhakrishnan, Wail Gueaieb","doi":"10.1007/s41315-024-00330-5","DOIUrl":null,"url":null,"abstract":"<p>Autonomous robotics has permeated several industrial, research and consumer robotic applications, of which path planning is an important component. The path planning algorithm of choice is influenced by the application at hand and the history of algorithms used for such applications. The latter is dependent on an extensive conglomeration and classification of path planning literature, which is what this work focuses on. Specifically, we accomplish the following: typical classifications of path planning algorithms are provided. Such classifications rely on differences in knowledge of the environment (known/unknown), robot (model-specific/generic), and constraints (static/dynamic). This classification however, is not comprehensive. Thus, as a resolution, we propose a detailed taxonomy based on a fundamental parameter of the space, i.e. its ability to be characterized as a set of disjoint or connected points. We show that this taxonomy encompasses important attributes of path planning problems, such as connectivity and partitioning of spaces. Consequently, path planning spaces in robotics may be viewed as simply a set of points, or as manifolds. The former can further be divided into unpartitioned and partitioned spaces, of which the former uses variants of sampling algorithms, optimization algorithms, model predictive controls, and evolutionary algorithms, while the latter uses cell decomposition and graph traversal, and sampling-based optimization techniques.This article achieves the following two goals: The first is the introduction of an all-encompassing taxonomy of robotic path planning. The second is to streamline the migration of path planning work from disciplines such as mathematics and computer vision to robotics, into one comprehensive survey. Thus, the main contribution of this work is the review of works for static constraints that fall under the proposed taxonomy, i.e., specifically under topology and manifold-based methods. Additionally, further taxonomy is introduced for manifold-based path planning, based on incremental construction or one-step explicit parametrization of the space.</p>","PeriodicalId":44563,"journal":{"name":"International Journal of Intelligent Robotics and Applications","volume":null,"pages":null},"PeriodicalIF":2.1000,"publicationDate":"2024-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A state-of-the-art review on topology and differential geometry-based robotic path planning—part I: planning under static constraints\",\"authors\":\"Sindhu Radhakrishnan, Wail Gueaieb\",\"doi\":\"10.1007/s41315-024-00330-5\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>Autonomous robotics has permeated several industrial, research and consumer robotic applications, of which path planning is an important component. The path planning algorithm of choice is influenced by the application at hand and the history of algorithms used for such applications. The latter is dependent on an extensive conglomeration and classification of path planning literature, which is what this work focuses on. Specifically, we accomplish the following: typical classifications of path planning algorithms are provided. Such classifications rely on differences in knowledge of the environment (known/unknown), robot (model-specific/generic), and constraints (static/dynamic). This classification however, is not comprehensive. Thus, as a resolution, we propose a detailed taxonomy based on a fundamental parameter of the space, i.e. its ability to be characterized as a set of disjoint or connected points. We show that this taxonomy encompasses important attributes of path planning problems, such as connectivity and partitioning of spaces. Consequently, path planning spaces in robotics may be viewed as simply a set of points, or as manifolds. The former can further be divided into unpartitioned and partitioned spaces, of which the former uses variants of sampling algorithms, optimization algorithms, model predictive controls, and evolutionary algorithms, while the latter uses cell decomposition and graph traversal, and sampling-based optimization techniques.This article achieves the following two goals: The first is the introduction of an all-encompassing taxonomy of robotic path planning. The second is to streamline the migration of path planning work from disciplines such as mathematics and computer vision to robotics, into one comprehensive survey. Thus, the main contribution of this work is the review of works for static constraints that fall under the proposed taxonomy, i.e., specifically under topology and manifold-based methods. Additionally, further taxonomy is introduced for manifold-based path planning, based on incremental construction or one-step explicit parametrization of the space.</p>\",\"PeriodicalId\":44563,\"journal\":{\"name\":\"International Journal of Intelligent Robotics and Applications\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":2.1000,\"publicationDate\":\"2024-03-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Journal of Intelligent Robotics and Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1007/s41315-024-00330-5\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"ROBOTICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Intelligent Robotics and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/s41315-024-00330-5","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"ROBOTICS","Score":null,"Total":0}
引用次数: 0

摘要

自主机器人技术已渗透到多个工业、研究和消费机器人应用领域,其中路径规划是一个重要组成部分。路径规划算法的选择受当前应用和此类应用算法历史的影响。后者取决于对路径规划文献的广泛整理和分类,而这正是本研究的重点。具体来说,我们将完成以下工作:提供路径规划算法的典型分类。这种分类依赖于环境知识(已知/未知)、机器人知识(特定模型/通用)和约束条件(静态/动态)的不同。然而,这种分类并不全面。因此,作为一种解决方案,我们提出了一种基于空间基本参数的详细分类法,即把空间表征为一组不相连或相连点的能力。我们的研究表明,这种分类法包含了路径规划问题的重要属性,如空间的连通性和分割。因此,机器人学中的路径规划空间可被视为简单的点集或流形。前者可进一步分为无分割空间和有分割空间,其中前者使用采样算法、优化算法、模型预测控制和进化算法的变体,而后者则使用单元分解和图遍历以及基于采样的优化技术:本文旨在实现以下两个目标:一是介绍一种包罗万象的机器人路径规划分类法。其次是将数学、计算机视觉等学科中的路径规划工作迁移到机器人学中,并将其简化为一份全面的调查报告。因此,这项工作的主要贡献在于回顾了属于拟议分类法范畴的静态约束工作,即特别是基于拓扑和流形的方法。此外,还针对基于流形的路径规划引入了进一步的分类法,其基础是空间的增量构建或一步显式参数化。
本文章由计算机程序翻译,如有差异,请以英文原文为准。

A state-of-the-art review on topology and differential geometry-based robotic path planning—part I: planning under static constraints

A state-of-the-art review on topology and differential geometry-based robotic path planning—part I: planning under static constraints

Autonomous robotics has permeated several industrial, research and consumer robotic applications, of which path planning is an important component. The path planning algorithm of choice is influenced by the application at hand and the history of algorithms used for such applications. The latter is dependent on an extensive conglomeration and classification of path planning literature, which is what this work focuses on. Specifically, we accomplish the following: typical classifications of path planning algorithms are provided. Such classifications rely on differences in knowledge of the environment (known/unknown), robot (model-specific/generic), and constraints (static/dynamic). This classification however, is not comprehensive. Thus, as a resolution, we propose a detailed taxonomy based on a fundamental parameter of the space, i.e. its ability to be characterized as a set of disjoint or connected points. We show that this taxonomy encompasses important attributes of path planning problems, such as connectivity and partitioning of spaces. Consequently, path planning spaces in robotics may be viewed as simply a set of points, or as manifolds. The former can further be divided into unpartitioned and partitioned spaces, of which the former uses variants of sampling algorithms, optimization algorithms, model predictive controls, and evolutionary algorithms, while the latter uses cell decomposition and graph traversal, and sampling-based optimization techniques.This article achieves the following two goals: The first is the introduction of an all-encompassing taxonomy of robotic path planning. The second is to streamline the migration of path planning work from disciplines such as mathematics and computer vision to robotics, into one comprehensive survey. Thus, the main contribution of this work is the review of works for static constraints that fall under the proposed taxonomy, i.e., specifically under topology and manifold-based methods. Additionally, further taxonomy is introduced for manifold-based path planning, based on incremental construction or one-step explicit parametrization of the space.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
3.80
自引率
5.90%
发文量
50
期刊介绍: The International Journal of Intelligent Robotics and Applications (IJIRA) fosters the dissemination of new discoveries and novel technologies that advance developments in robotics and their broad applications. This journal provides a publication and communication platform for all robotics topics, from the theoretical fundamentals and technological advances to various applications including manufacturing, space vehicles, biomedical systems and automobiles, data-storage devices, healthcare systems, home appliances, and intelligent highways. IJIRA welcomes contributions from researchers, professionals and industrial practitioners. It publishes original, high-quality and previously unpublished research papers, brief reports, and critical reviews. Specific areas of interest include, but are not limited to:Advanced actuators and sensorsCollective and social robots Computing, communication and controlDesign, modeling and prototypingHuman and robot interactionMachine learning and intelligenceMobile robots and intelligent autonomous systemsMulti-sensor fusion and perceptionPlanning, navigation and localizationRobot intelligence, learning and linguisticsRobotic vision, recognition and reconstructionBio-mechatronics and roboticsCloud and Swarm roboticsCognitive and neuro roboticsExploration and security roboticsHealthcare, medical and assistive roboticsRobotics for intelligent manufacturingService, social and entertainment roboticsSpace and underwater robotsNovel and emerging applications
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信