Powered by OpenAIRE graph
Found an issue? Give us feedback
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/ ZENODOarrow_drop_down
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/
ZENODO
Conference object . 2017
License: CC BY
Data sources: Datacite
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/
ZENODO
Other literature type . 2017
License: CC BY
Data sources: ZENODO
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/
ZENODO
Conference object . 2017
License: CC BY
Data sources: Datacite
versions View all 2 versions
addClaim

Simulation Of Optimal Path Planning Using Modified Minimum Spanning Tree For Autonomous Agricultural Mobile Robots

Authors: Baek, S W; Na, I S; Resa, M D; Lee, K-H; Choi, Y-S;

Simulation Of Optimal Path Planning Using Modified Minimum Spanning Tree For Autonomous Agricultural Mobile Robots

Abstract

Background: Autonomous driving is a major issue for precision agriculture. One of important technic is a generate optimum path for autonomous driving. Up to now, autonomous driving technology generated a path that created a least-cost path using only the distance cost. However, in real field large driving radius cause lateral deviation error of mobile robot. Therefore, in this paper, we propose a path planning algorithm base on modified Minimum Spanning Tree (mMST) that takes weight of vehicle radius of gyration into account. Methods: In this paper we generate optimal path using mMST. First, randomly create nodes in virtual test field. Calculate distance cost, radius of gyration cost between each node. Second, from starting node select next node by considering distance and gyration. Sometime Minimum Spanning Tree (MST) algorithm generate more than 31ink on one node. In this case, path is terminating the driving. The path should be trail or circuit. Repeat the above sequence until all nodes are connected. Before field test simulation was conduct for each path. Results: In this paper, we applied and simulated MST and mMST algorithms. The cost efficiency according to the turning radius was experimented. Two paths (weight: distance, distance and radius) were generated by each algorithm and the results were compared. Experimental results show that mMST is more superior compared with MST. Discussions: Future challenges remain to apply this research to real fields. Real field has difficulty to driving because ground condition are uneven and crop damage must be minimized. Conclusion: The proposed mMST method may resolved that sudden change of direction between the path point causes a large error in the driving of the vehicle. And satisfactory results have been obtained.

Related Organizations
  • BIP!
    Impact byBIP!
    selected citations
    These citations are derived from selected sources.
    This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    0
    popularity
    This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
    Average
    influence
    This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    Average
    impulse
    This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
    Average
    OpenAIRE UsageCounts
    Usage byUsageCounts
    visibility views 8
    download downloads 5
  • 8
    views
    5
    downloads
    Powered byOpenAIRE UsageCounts
Powered by OpenAIRE graph
Found an issue? Give us feedback
visibility
download
selected citations
These citations are derived from selected sources.
This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Citations provided by BIP!
popularity
This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
BIP!Popularity provided by BIP!
influence
This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Influence provided by BIP!
impulse
This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
BIP!Impulse provided by BIP!
views
OpenAIRE UsageCountsViews provided by UsageCounts
downloads
OpenAIRE UsageCountsDownloads provided by UsageCounts
0
Average
Average
Average
8
5
Green