On the Intersection of Computational Geometry Algorithms with Mobile Robot Path Planning
In the mathematical discipline of computational geometry (CG), practical algorithms for resolving geometric input and output issues are designed, analyzed, and put into practice. It is sometimes used to refer to pattern recognition and to define the solid modeling methods for manipulating curves and...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2023-10-01
|
| Series: | Algorithms |
| Subjects: | |
| Online Access: | https://www.mdpi.com/1999-4893/16/11/498 |
| _version_ | 1827640833563688960 |
|---|---|
| author | Ehsan Latif Ramviyas Parasuraman |
| author_facet | Ehsan Latif Ramviyas Parasuraman |
| author_sort | Ehsan Latif |
| collection | DOAJ |
| description | In the mathematical discipline of computational geometry (CG), practical algorithms for resolving geometric input and output issues are designed, analyzed, and put into practice. It is sometimes used to refer to pattern recognition and to define the solid modeling methods for manipulating curves and surfaces. CG is a rich field encompassing theories to solve complex optimization problems, such as path planning for mobile robot systems and extension to distributed multi-robot systems. This brief review discusses the fundamentals of CG and its application in solving well-known automated path-planning problems in single- and multi-robot systems. We also discuss three winning algorithms from the CG-SHOP (Computational Geometry: Solving Hard Optimization Problems) 2021 competition to evidence the practicality of CG in multi-robotic systems. We also mention some open problems at the intersection of CG and robotics. This review provides insights into the potential use of CG in robotics and future research directions at their intersection. |
| first_indexed | 2024-03-09T17:05:07Z |
| format | Article |
| id | doaj.art-0a10152f0b494b26b4e79dd030287c16 |
| institution | Directory Open Access Journal |
| issn | 1999-4893 |
| language | English |
| last_indexed | 2024-03-09T17:05:07Z |
| publishDate | 2023-10-01 |
| publisher | MDPI AG |
| record_format | Article |
| series | Algorithms |
| spelling | doaj.art-0a10152f0b494b26b4e79dd030287c162023-11-24T14:24:19ZengMDPI AGAlgorithms1999-48932023-10-01161149810.3390/a16110498On the Intersection of Computational Geometry Algorithms with Mobile Robot Path PlanningEhsan Latif0Ramviyas Parasuraman1School of Computing, University of Georgia, Athens, GA 30602, USASchool of Computing, University of Georgia, Athens, GA 30602, USAIn the mathematical discipline of computational geometry (CG), practical algorithms for resolving geometric input and output issues are designed, analyzed, and put into practice. It is sometimes used to refer to pattern recognition and to define the solid modeling methods for manipulating curves and surfaces. CG is a rich field encompassing theories to solve complex optimization problems, such as path planning for mobile robot systems and extension to distributed multi-robot systems. This brief review discusses the fundamentals of CG and its application in solving well-known automated path-planning problems in single- and multi-robot systems. We also discuss three winning algorithms from the CG-SHOP (Computational Geometry: Solving Hard Optimization Problems) 2021 competition to evidence the practicality of CG in multi-robotic systems. We also mention some open problems at the intersection of CG and robotics. This review provides insights into the potential use of CG in robotics and future research directions at their intersection.https://www.mdpi.com/1999-4893/16/11/498computational geometryroboticsmulti-robot systemspath planningoptimization |
| spellingShingle | Ehsan Latif Ramviyas Parasuraman On the Intersection of Computational Geometry Algorithms with Mobile Robot Path Planning Algorithms computational geometry robotics multi-robot systems path planning optimization |
| title | On the Intersection of Computational Geometry Algorithms with Mobile Robot Path Planning |
| title_full | On the Intersection of Computational Geometry Algorithms with Mobile Robot Path Planning |
| title_fullStr | On the Intersection of Computational Geometry Algorithms with Mobile Robot Path Planning |
| title_full_unstemmed | On the Intersection of Computational Geometry Algorithms with Mobile Robot Path Planning |
| title_short | On the Intersection of Computational Geometry Algorithms with Mobile Robot Path Planning |
| title_sort | on the intersection of computational geometry algorithms with mobile robot path planning |
| topic | computational geometry robotics multi-robot systems path planning optimization |
| url | https://www.mdpi.com/1999-4893/16/11/498 |
| work_keys_str_mv | AT ehsanlatif ontheintersectionofcomputationalgeometryalgorithmswithmobilerobotpathplanning AT ramviyasparasuraman ontheintersectionofcomputationalgeometryalgorithmswithmobilerobotpathplanning |