Alexander James Becoy, Kseniia Khomenko, Luka Peternel, Raj Thilak Rajan
{"title":"Autonomous navigation of quadrupeds using coverage path planning with morphological skeleton maps.","authors":"Alexander James Becoy, Kseniia Khomenko, Luka Peternel, Raj Thilak Rajan","doi":"10.3389/frobt.2025.1601862","DOIUrl":null,"url":null,"abstract":"<p><p>This article proposes a novel method of coverage path planning for the purpose of scanning an unstructured environment autonomously. The method uses the morphological skeleton of a prior 2D navigation map via SLAM to generate a sequence of points of interest (POIs). This sequence is then ordered to create an optimal path based on the robot's current position. To control the high-level operation, a finite state machine (FSM) is used to switch between two modes: navigating toward a POI using Nav2 and scanning the local surroundings. We validate the method in a leveled, indoor, obstacle-free, non-convex environment, evaluating time efficiency and reachability over five trials. The map reader and path planner can quickly process maps of widths and heights ranging between [196,225] <math><mrow><mi>p</mi> <mi>i</mi> <mi>x</mi> <mi>e</mi> <mi>l</mi> <mi>s</mi></mrow> </math> and [185,231] <math><mrow><mi>p</mi> <mi>i</mi> <mi>x</mi> <mi>e</mi> <mi>l</mi> <mi>s</mi></mrow> </math> in <math><mrow><mn>2.52</mn> <mtext> </mtext> <mi>m</mi> <mi>s</mi></mrow> </math> and <math><mrow><mn>1.7</mn> <mtext> </mtext> <mi>m</mi> <mi>s</mi></mrow> </math> , respectively. Their computation time increases with <math><mrow><mn>22.0</mn> <mtext> </mtext> <mi>n</mi> <mi>s</mi> <mo>/</mo> <mi>p</mi> <mi>i</mi> <mi>x</mi> <mi>e</mi> <mi>l</mi></mrow> </math> and 8.17 μs/pixel, respectively. The robot managed to reach 86.5% of all waypoints across the five runs. The proposed method suffers from drift occurring in the 2D navigation map.</p>","PeriodicalId":47597,"journal":{"name":"Frontiers in Robotics and AI","volume":"12 ","pages":"1601862"},"PeriodicalIF":3.0000,"publicationDate":"2025-07-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC12351651/pdf/","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Frontiers in Robotics and AI","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.3389/frobt.2025.1601862","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2025/1/1 0:00:00","PubModel":"eCollection","JCR":"Q2","JCRName":"ROBOTICS","Score":null,"Total":0}
引用次数: 0
Abstract
This article proposes a novel method of coverage path planning for the purpose of scanning an unstructured environment autonomously. The method uses the morphological skeleton of a prior 2D navigation map via SLAM to generate a sequence of points of interest (POIs). This sequence is then ordered to create an optimal path based on the robot's current position. To control the high-level operation, a finite state machine (FSM) is used to switch between two modes: navigating toward a POI using Nav2 and scanning the local surroundings. We validate the method in a leveled, indoor, obstacle-free, non-convex environment, evaluating time efficiency and reachability over five trials. The map reader and path planner can quickly process maps of widths and heights ranging between [196,225] and [185,231] in and , respectively. Their computation time increases with and 8.17 μs/pixel, respectively. The robot managed to reach 86.5% of all waypoints across the five runs. The proposed method suffers from drift occurring in the 2D navigation map.
针对非结构化环境的自动扫描,提出了一种新的覆盖路径规划方法。该方法利用已有二维导航地图的形态骨架,通过SLAM生成兴趣点序列。然后,根据机器人的当前位置,对这个序列进行排序,以创建一个最优路径。为了控制高级操作,使用有限状态机(FSM)在两种模式之间切换:使用Nav2向POI导航和扫描局部环境。我们在一个水平的、室内的、无障碍的、非凸的环境中验证了该方法,在五次试验中评估了时间效率和可达性。地图阅读器和路径规划器可以在2.52 m s和1.7 m s内快速处理宽度和高度分别在[196,225]和[185,231]之间的地图。计算时间分别增加了22.0 μs/p / l和8.17 μs/pixel。机器人成功到达了五次飞行中86.5%的航路点。该方法存在二维导航地图漂移的问题。
期刊介绍:
Frontiers in Robotics and AI publishes rigorously peer-reviewed research covering all theory and applications of robotics, technology, and artificial intelligence, from biomedical to space robotics.