The Free Path Planner Based on Windmill Decomposition

Gene Eu Jan, Chaomin Luo, Ming Che Lee, Hui Ching Hsieh

研究成果: 書貢獻/報告類型會議貢獻

1 引文 斯高帕斯(Scopus)

摘要

In this article, a new obstacle-Avoidance path planner is proposed based on the windmill decomposition to find the shortest path in the Euclidean plane with rectangle obstacles. Using the Dijkstra's shortest path algorithm in a connected graph, this study constructs a windmill decomposition of the free space (obstacle avoidance space), and uses their centroids to plan the shortest free path from the start point to the end point. The advantage of this research is that, compared with other traditional algorithms, the time complexity of this algorithm is O(n {log}\ n), and the free path for obstacle avoidance can be planned in a short time, where n is the number of obstacles.
原文英語
主出版物標題2022 3rd International Conference on Artificial Intelligence, Robotics and Control, AIRC 2022
發行者Institute of Electrical and Electronics Engineers Inc.
頁面35-39
頁數5
ISBN(電子)9781665459471
DOIs
出版狀態已發佈 - 2022
事件3rd International Conference on Artificial Intelligence, Robotics and Control, AIRC 2022 - Cairo, 埃及
持續時間: 5月 20 20225月 22 2022

出版系列

名字2022 3rd International Conference on Artificial Intelligence, Robotics and Control, AIRC 2022

會議

會議3rd International Conference on Artificial Intelligence, Robotics and Control, AIRC 2022
國家/地區埃及
城市Cairo
期間5/20/225/22/22

ASJC Scopus subject areas

  • 人工智慧
  • 電腦科學應用
  • 控制和優化

指紋

深入研究「The Free Path Planner Based on Windmill Decomposition」主題。共同形成了獨特的指紋。

引用此