{"title":"Development of a motion planning system for an agricultural mobile robot","authors":"T. Makino, H. Yokoi, Y. Kakazu","doi":"10.1109/SICE.1999.788679","DOIUrl":null,"url":null,"abstract":"Describes the development of a motion planning system which plans an optimal work path for an autonomous agricultural vehicle on farm land. The system consists of two parts: a global path planning component and a local motion planning component. The global path planning component works to acquire an optimal work path for a whole field. In this case, the optimal work path is the lowest traveling cost from a start point to a goal point. The local motion planning component acquires the optimal path and plans an optimal control policy on a headland. In this motion planning, an optimal solution is a path with a low traveling cost and soil compaction. These components are implemented with the following algorithms: simulated annealing, Tabu search, genetic algorithm, and reinforcement learning. We solve the optimal path problems on a headland using computer simulation.","PeriodicalId":103164,"journal":{"name":"SICE '99. Proceedings of the 38th SICE Annual Conference. International Session Papers (IEEE Cat. No.99TH8456)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1999-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"12","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"SICE '99. Proceedings of the 38th SICE Annual Conference. International Session Papers (IEEE Cat. No.99TH8456)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SICE.1999.788679","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 12
Abstract
Describes the development of a motion planning system which plans an optimal work path for an autonomous agricultural vehicle on farm land. The system consists of two parts: a global path planning component and a local motion planning component. The global path planning component works to acquire an optimal work path for a whole field. In this case, the optimal work path is the lowest traveling cost from a start point to a goal point. The local motion planning component acquires the optimal path and plans an optimal control policy on a headland. In this motion planning, an optimal solution is a path with a low traveling cost and soil compaction. These components are implemented with the following algorithms: simulated annealing, Tabu search, genetic algorithm, and reinforcement learning. We solve the optimal path problems on a headland using computer simulation.