商品情報にスキップ
1 1

Diagonal Node-based Path Planning and Path Smoothing for First Responders and Rescue Robots

Diagonal Node-based Path Planning and Path Smoothing for First Responders and Rescue Robots

通常価格 ¥770 JPY
通常価格 セール価格 ¥770 JPY
セール 売り切れ
税込

カテゴリ: 論文誌(論文単位)

グループ名: 【C】電子・情報・システム部門

発行日: 2021/02/01

タイトル(英語): Diagonal Node-based Path Planning and Path Smoothing for First Responders and Rescue Robots

著者名: Shin Nyeong Heo (Graduate School of IPS, Waseda University), Erxiang Xu (Graduate School of IPS, Waseda University), Hee-Hyol Lee (Graduate School of IPS, Waseda University)

著者名(英語): Shin Nyeong Heo (Graduate School of IPS, Waseda University), Erxiang Xu (Graduate School of IPS, Waseda University), Hee-Hyol Lee (Graduate School of IPS, Waseda University)

キーワード: path planning,shortest path problem,collision avoidance,safety management,unmanned aerial vehicles

要約(英語): A key point of reducing injury rates for first responders is spending less time to reach a target in a dangerous area. First responders and rescue robots are applied in previous researches using dangerous areas search and obstacle avoidance. Unmanned aerial vehicles (UAVs) are also started to use for disaster management. Therefore, path planning for the first responders and rescue robots are needed the during dangerous area searching using UAVs. Here, path planning algorithms for the first responders and rescue robots are needed to global path planning and it is better to use different kinds of node-based algorithms depending on a known and a partially known environment. An A* algorithm is suitable in the known environment and a D* lite algorithm is proper in the partially known environment. However, long path calculation time is always an issue of the node-based global path planning. For the long path calculation time, a novel diagonal path planning algorithm is proposed in this paper. The main idea of the diagonal path planning is to use diagonal nodes instead of surrounded nodes from current node selection steps. Also, it causes a zig-zag path issue, so a path smoothing with a bounded curvature is proposed to solve the zig-zag issue. The effectiveness of the proposed algorithm is confirmed through simulations.

本誌: 電気学会論文誌C(電子・情報・システム部門誌) Vol.141 No.2 (2021) 特集I:IoT社会の進歩を促進するワイヤレス技術  特集Ⅱ:ディジタル信号処理のためのシステム技術

本誌掲載ページ: 179-192 p

原稿種別: 論文/英語

電子版へのリンク: https://www.jstage.jst.go.jp/article/ieejeiss/141/2/141_179/_article/-char/ja/

販売タイプ
書籍サイズ
ページ数
詳細を表示する