システム制御情報学会論文誌
Online ISSN : 2185-811X
Print ISSN : 1342-5668
ISSN-L : 1342-5668
論文
均平機の経路計画問題のための貪欲法に基づく近似解法
小島 一穂伊達 央
著者情報
ジャーナル オープンアクセス

2020 年 33 巻 6 号 p. 182-190

詳細
抄録

This study proposes a greedy-based approximation algorithm to determine the route of a land leveler, which is a type of agricultural machine for leveling and flattening the surfaces of fields. First, we describe the definition and the formulation of the land leveler problem (LLP) and show the exact solution based on dynamic programming for solving the LLP. Second, we propose the approximation algorithm and compare three visit functions which are used in the algorithm. Third, the comparison between the approximation algorithm and the exact solution is shown. Fourth, we apply the approximation algorithm to measurement data of a real field. Finally, we verify the validity of the movement constraint which is assumed for computing the route.

著者関連情報
© 2020 一般社団法人 システム制御情報学会
前の記事 次の記事
feedback
Top