Full Coverage of Confined Irregular Polygon Area for Marine Survey
This paper considers the coverage path planning (CPP) problem for marine surveys, where the survey vehicles’ movements are confined in the irregular polygon search area. So this is a sort of milling problem with the minimum number of turns in order for improvement of the acquired sonar im...
| Main Authors: | , , , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
IEEE
2023-01-01
|
| Series: | IEEE Access |
| Subjects: | |
| Online Access: | https://ieeexplore.ieee.org/document/10229114/ |
| _version_ | 1797692215798005760 |
|---|---|
| author | Ji-Hong Li Hyungjoo Kang Min-Gyu Kim Hansol Jin Mun-Jik Lee Gun Rae Cho Chulhee Bae |
| author_facet | Ji-Hong Li Hyungjoo Kang Min-Gyu Kim Hansol Jin Mun-Jik Lee Gun Rae Cho Chulhee Bae |
| author_sort | Ji-Hong Li |
| collection | DOAJ |
| description | This paper considers the coverage path planning (CPP) problem for marine surveys, where the survey vehicles’ movements are confined in the irregular polygon search area. So this is a sort of milling problem with the minimum number of turns in order for improvement of the acquired sonar image quality. For this purpose, this paper proposes a novel method called CbSPSA (calculation based shortest path search algorithm). Especially in the irregular corner area, this algorithm can easily calculate a kind of shortest path for its full coverage of this irregular area. For any given polygon, it can always be partitioned into convex polygon(s). In this paper, we only consider the case where these divided convex polygons are all connected one by one. In this case, the shortest path with minimum turns in each convex polygon can be easily searched by CbSPSA. And further by simply linking all of these pieces, the total coverage path for any given polygon area can be constructed. On the other hand, for a given polygon, usually there are several different cases of partition. Among the searched coverage paths for each of these different partitions, the final optimal coverage path is determined through a predefined criteria. Numerical simulation and analyses are carried out to demonstrate the effectiveness of the proposed method. |
| first_indexed | 2024-03-12T02:24:25Z |
| format | Article |
| id | doaj.art-c447bd66c1714f75841f76c97affb570 |
| institution | Directory Open Access Journal |
| issn | 2169-3536 |
| language | English |
| last_indexed | 2024-03-12T02:24:25Z |
| publishDate | 2023-01-01 |
| publisher | IEEE |
| record_format | Article |
| series | IEEE Access |
| spelling | doaj.art-c447bd66c1714f75841f76c97affb5702023-09-05T23:00:58ZengIEEEIEEE Access2169-35362023-01-0111922009220810.1109/ACCESS.2023.330814510229114Full Coverage of Confined Irregular Polygon Area for Marine SurveyJi-Hong Li0https://orcid.org/0000-0002-5162-2737Hyungjoo Kang1Min-Gyu Kim2Hansol Jin3Mun-Jik Lee4Gun Rae Cho5https://orcid.org/0000-0002-8536-4844Chulhee Bae6Autonomous Systems Research and Development Division, Korea Institute of Robotics and Technology Convergence, Pohang, Republic of KoreaAutonomous Systems Research and Development Division, Korea Institute of Robotics and Technology Convergence, Pohang, Republic of KoreaAutonomous Systems Research and Development Division, Korea Institute of Robotics and Technology Convergence, Pohang, Republic of KoreaAutonomous Systems Research and Development Division, Korea Institute of Robotics and Technology Convergence, Pohang, Republic of KoreaAutonomous Systems Research and Development Division, Korea Institute of Robotics and Technology Convergence, Pohang, Republic of KoreaAutonomous Systems Research and Development Division, Korea Institute of Robotics and Technology Convergence, Pohang, Republic of KoreaAutonomous Systems Research and Development Division, Korea Institute of Robotics and Technology Convergence, Pohang, Republic of KoreaThis paper considers the coverage path planning (CPP) problem for marine surveys, where the survey vehicles’ movements are confined in the irregular polygon search area. So this is a sort of milling problem with the minimum number of turns in order for improvement of the acquired sonar image quality. For this purpose, this paper proposes a novel method called CbSPSA (calculation based shortest path search algorithm). Especially in the irregular corner area, this algorithm can easily calculate a kind of shortest path for its full coverage of this irregular area. For any given polygon, it can always be partitioned into convex polygon(s). In this paper, we only consider the case where these divided convex polygons are all connected one by one. In this case, the shortest path with minimum turns in each convex polygon can be easily searched by CbSPSA. And further by simply linking all of these pieces, the total coverage path for any given polygon area can be constructed. On the other hand, for a given polygon, usually there are several different cases of partition. Among the searched coverage paths for each of these different partitions, the final optimal coverage path is determined through a predefined criteria. Numerical simulation and analyses are carried out to demonstrate the effectiveness of the proposed method.https://ieeexplore.ieee.org/document/10229114/Coverage path planning (CPP)marine surveyslawn mowingmillingconvex polygon |
| spellingShingle | Ji-Hong Li Hyungjoo Kang Min-Gyu Kim Hansol Jin Mun-Jik Lee Gun Rae Cho Chulhee Bae Full Coverage of Confined Irregular Polygon Area for Marine Survey IEEE Access Coverage path planning (CPP) marine surveys lawn mowing milling convex polygon |
| title | Full Coverage of Confined Irregular Polygon Area for Marine Survey |
| title_full | Full Coverage of Confined Irregular Polygon Area for Marine Survey |
| title_fullStr | Full Coverage of Confined Irregular Polygon Area for Marine Survey |
| title_full_unstemmed | Full Coverage of Confined Irregular Polygon Area for Marine Survey |
| title_short | Full Coverage of Confined Irregular Polygon Area for Marine Survey |
| title_sort | full coverage of confined irregular polygon area for marine survey |
| topic | Coverage path planning (CPP) marine surveys lawn mowing milling convex polygon |
| url | https://ieeexplore.ieee.org/document/10229114/ |
| work_keys_str_mv | AT jihongli fullcoverageofconfinedirregularpolygonareaformarinesurvey AT hyungjookang fullcoverageofconfinedirregularpolygonareaformarinesurvey AT mingyukim fullcoverageofconfinedirregularpolygonareaformarinesurvey AT hansoljin fullcoverageofconfinedirregularpolygonareaformarinesurvey AT munjiklee fullcoverageofconfinedirregularpolygonareaformarinesurvey AT gunraecho fullcoverageofconfinedirregularpolygonareaformarinesurvey AT chulheebae fullcoverageofconfinedirregularpolygonareaformarinesurvey |