An entry-exit path planner for an autonomous tractor in a paddy field
A field boundary with a single entrance as well as the entry and exit paths of the tractor based on the entrance location are key design requirements that must be considered when planning an effective path for an autonomous tractor operating in a paddy field to avoid collisions with the embankments...
Ausführliche Beschreibung
Autor*in: |
Jeon, Chan-Woo [verfasserIn] Kim, Hak-Jin [verfasserIn] Yun, Changho [verfasserIn] Gang, MinSeok [verfasserIn] Han, Xiongzhe [verfasserIn] |
---|
Format: |
E-Artikel |
---|---|
Sprache: |
Englisch |
Erschienen: |
2021 |
---|
Schlagwörter: |
---|
Übergeordnetes Werk: |
Enthalten in: Computers and electronics in agriculture - Amsterdam [u.a.] : Elsevier Science, 1985, 191 |
---|---|
Übergeordnetes Werk: |
volume:191 |
DOI / URN: |
10.1016/j.compag.2021.106548 |
---|
Katalog-ID: |
ELV007020910 |
---|
LEADER | 01000caa a22002652 4500 | ||
---|---|---|---|
001 | ELV007020910 | ||
003 | DE-627 | ||
005 | 20230524123714.0 | ||
007 | cr uuu---uuuuu | ||
008 | 230506s2021 xx |||||o 00| ||eng c | ||
024 | 7 | |a 10.1016/j.compag.2021.106548 |2 doi | |
035 | |a (DE-627)ELV007020910 | ||
035 | |a (ELSEVIER)S0168-1699(21)00565-2 | ||
040 | |a DE-627 |b ger |c DE-627 |e rda | ||
041 | |a eng | ||
082 | 0 | 4 | |a 620 |a 630 |a 640 |a 004 |q DE-600 |
084 | |a 48.03 |2 bkl | ||
100 | 1 | |a Jeon, Chan-Woo |e verfasserin |4 aut | |
245 | 1 | 0 | |a An entry-exit path planner for an autonomous tractor in a paddy field |
264 | 1 | |c 2021 | |
336 | |a nicht spezifiziert |b zzz |2 rdacontent | ||
337 | |a Computermedien |b c |2 rdamedia | ||
338 | |a Online-Ressource |b cr |2 rdacarrier | ||
520 | |a A field boundary with a single entrance as well as the entry and exit paths of the tractor based on the entrance location are key design requirements that must be considered when planning an effective path for an autonomous tractor operating in a paddy field to avoid collisions with the embankments that hold floodwater. In creating a complete in-field coverage path, an entry-exit path planner that generates paths to/from the start/end points of the auto-traveled path is needed to achieve effective field operations for a fully autonomous tractor. In this study, a novel path planner for the entry and exit operations of an autonomous tractor was developed using the A* algorithm to enable the tractor located at the entrance to automatically go to the start point of an agricultural task and return to the entrance after completing the agricultural task. An occupancy grid map with virtual obstacles was designed and the A* algorithm was applied to it to create a path for the tractor to reach its destination via the entry-exit path accurately in terms of positioning and heading. Two path-smoothing processes, a line-of-sight path smoother (LOPS) and a collinear-node path smoother (CNS), were performed to reduce redundant turning and control waypoints derived by the A* algorithm. The feasibility of using the developed algorithms was investigated via computer simulations followed by field tests with a 60-kW autonomous tractor. The simulation results confirm that the entry and exit paths generated by the proposed planner effectively guided the tractor to reach the given target points in terms of location and direction under the various entry, start, and end conditions by reducing the lateral and heading errors compared with those obtained without using the proposed search space and smoothers. For validation testing in two real paddy fields, the entry-exit paths were successfully generated in response to different entrance locations and the tractor followed the entry path and started the operation at the start point of the work path with a lateral deviation of ≤8.5 cm. In addition, the tractor navigated the exit path automatically and reached the destination with a lateral deviation of <12 cm and a heading error of <22° to the entrance and the operator was then able to drive the tractor to exit the field easily without backward navigation. | ||
650 | 4 | |a Path planning | |
650 | 4 | |a A* algorithm | |
650 | 4 | |a Entry-exit path | |
650 | 4 | |a Paddy field | |
650 | 4 | |a Autonomous tractor | |
700 | 1 | |a Kim, Hak-Jin |e verfasserin |4 aut | |
700 | 1 | |a Yun, Changho |e verfasserin |4 aut | |
700 | 1 | |a Gang, MinSeok |e verfasserin |4 aut | |
700 | 1 | |a Han, Xiongzhe |e verfasserin |4 aut | |
773 | 0 | 8 | |i Enthalten in |t Computers and electronics in agriculture |d Amsterdam [u.a.] : Elsevier Science, 1985 |g 191 |h Online-Ressource |w (DE-627)320567826 |w (DE-600)2016151-7 |w (DE-576)090955684 |x 1872-7107 |7 nnns |
773 | 1 | 8 | |g volume:191 |
912 | |a GBV_USEFLAG_U | ||
912 | |a SYSFLAG_U | ||
912 | |a GBV_ELV | ||
912 | |a SSG-OPC-FOR | ||
912 | |a GBV_ILN_20 | ||
912 | |a GBV_ILN_22 | ||
912 | |a GBV_ILN_23 | ||
912 | |a GBV_ILN_24 | ||
912 | |a GBV_ILN_31 | ||
912 | |a GBV_ILN_32 | ||
912 | |a GBV_ILN_40 | ||
912 | |a GBV_ILN_60 | ||
912 | |a GBV_ILN_62 | ||
912 | |a GBV_ILN_63 | ||
912 | |a GBV_ILN_65 | ||
912 | |a GBV_ILN_69 | ||
912 | |a GBV_ILN_70 | ||
912 | |a GBV_ILN_73 | ||
912 | |a GBV_ILN_74 | ||
912 | |a GBV_ILN_90 | ||
912 | |a GBV_ILN_95 | ||
912 | |a GBV_ILN_100 | ||
912 | |a GBV_ILN_101 | ||
912 | |a GBV_ILN_105 | ||
912 | |a GBV_ILN_110 | ||
912 | |a GBV_ILN_150 | ||
912 | |a GBV_ILN_151 | ||
912 | |a GBV_ILN_224 | ||
912 | |a GBV_ILN_370 | ||
912 | |a GBV_ILN_602 | ||
912 | |a GBV_ILN_702 | ||
912 | |a GBV_ILN_2003 | ||
912 | |a GBV_ILN_2004 | ||
912 | |a GBV_ILN_2005 | ||
912 | |a GBV_ILN_2011 | ||
912 | |a GBV_ILN_2014 | ||
912 | |a GBV_ILN_2015 | ||
912 | |a GBV_ILN_2020 | ||
912 | |a GBV_ILN_2021 | ||
912 | |a GBV_ILN_2025 | ||
912 | |a GBV_ILN_2027 | ||
912 | |a GBV_ILN_2034 | ||
912 | |a GBV_ILN_2038 | ||
912 | |a GBV_ILN_2044 | ||
912 | |a GBV_ILN_2048 | ||
912 | |a GBV_ILN_2049 | ||
912 | |a GBV_ILN_2050 | ||
912 | |a GBV_ILN_2056 | ||
912 | |a GBV_ILN_2059 | ||
912 | |a GBV_ILN_2061 | ||
912 | |a GBV_ILN_2064 | ||
912 | |a GBV_ILN_2065 | ||
912 | |a GBV_ILN_2068 | ||
912 | |a GBV_ILN_2111 | ||
912 | |a GBV_ILN_2112 | ||
912 | |a GBV_ILN_2113 | ||
912 | |a GBV_ILN_2118 | ||
912 | |a GBV_ILN_2122 | ||
912 | |a GBV_ILN_2129 | ||
912 | |a GBV_ILN_2143 | ||
912 | |a GBV_ILN_2147 | ||
912 | |a GBV_ILN_2148 | ||
912 | |a GBV_ILN_2152 | ||
912 | |a GBV_ILN_2153 | ||
912 | |a GBV_ILN_2190 | ||
912 | |a GBV_ILN_2336 | ||
912 | |a GBV_ILN_2507 | ||
912 | |a GBV_ILN_2522 | ||
912 | |a GBV_ILN_4035 | ||
912 | |a GBV_ILN_4037 | ||
912 | |a GBV_ILN_4112 | ||
912 | |a GBV_ILN_4125 | ||
912 | |a GBV_ILN_4126 | ||
912 | |a GBV_ILN_4242 | ||
912 | |a GBV_ILN_4251 | ||
912 | |a GBV_ILN_4305 | ||
912 | |a GBV_ILN_4313 | ||
912 | |a GBV_ILN_4323 | ||
912 | |a GBV_ILN_4324 | ||
912 | |a GBV_ILN_4326 | ||
912 | |a GBV_ILN_4333 | ||
912 | |a GBV_ILN_4334 | ||
912 | |a GBV_ILN_4335 | ||
912 | |a GBV_ILN_4338 | ||
912 | |a GBV_ILN_4393 | ||
936 | b | k | |a 48.03 |j Methoden und Techniken der Land- und Forstwirtschaft |
951 | |a AR | ||
952 | |d 191 |
author_variant |
c w j cwj h j k hjk c y cy m g mg x h xh |
---|---|
matchkey_str |
article:18727107:2021----::nnreiptpanroaatnmutat |
hierarchy_sort_str |
2021 |
bklnumber |
48.03 |
publishDate |
2021 |
allfields |
10.1016/j.compag.2021.106548 doi (DE-627)ELV007020910 (ELSEVIER)S0168-1699(21)00565-2 DE-627 ger DE-627 rda eng 620 630 640 004 DE-600 48.03 bkl Jeon, Chan-Woo verfasserin aut An entry-exit path planner for an autonomous tractor in a paddy field 2021 nicht spezifiziert zzz rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier A field boundary with a single entrance as well as the entry and exit paths of the tractor based on the entrance location are key design requirements that must be considered when planning an effective path for an autonomous tractor operating in a paddy field to avoid collisions with the embankments that hold floodwater. In creating a complete in-field coverage path, an entry-exit path planner that generates paths to/from the start/end points of the auto-traveled path is needed to achieve effective field operations for a fully autonomous tractor. In this study, a novel path planner for the entry and exit operations of an autonomous tractor was developed using the A* algorithm to enable the tractor located at the entrance to automatically go to the start point of an agricultural task and return to the entrance after completing the agricultural task. An occupancy grid map with virtual obstacles was designed and the A* algorithm was applied to it to create a path for the tractor to reach its destination via the entry-exit path accurately in terms of positioning and heading. Two path-smoothing processes, a line-of-sight path smoother (LOPS) and a collinear-node path smoother (CNS), were performed to reduce redundant turning and control waypoints derived by the A* algorithm. The feasibility of using the developed algorithms was investigated via computer simulations followed by field tests with a 60-kW autonomous tractor. The simulation results confirm that the entry and exit paths generated by the proposed planner effectively guided the tractor to reach the given target points in terms of location and direction under the various entry, start, and end conditions by reducing the lateral and heading errors compared with those obtained without using the proposed search space and smoothers. For validation testing in two real paddy fields, the entry-exit paths were successfully generated in response to different entrance locations and the tractor followed the entry path and started the operation at the start point of the work path with a lateral deviation of ≤8.5 cm. In addition, the tractor navigated the exit path automatically and reached the destination with a lateral deviation of <12 cm and a heading error of <22° to the entrance and the operator was then able to drive the tractor to exit the field easily without backward navigation. Path planning A* algorithm Entry-exit path Paddy field Autonomous tractor Kim, Hak-Jin verfasserin aut Yun, Changho verfasserin aut Gang, MinSeok verfasserin aut Han, Xiongzhe verfasserin aut Enthalten in Computers and electronics in agriculture Amsterdam [u.a.] : Elsevier Science, 1985 191 Online-Ressource (DE-627)320567826 (DE-600)2016151-7 (DE-576)090955684 1872-7107 nnns volume:191 GBV_USEFLAG_U SYSFLAG_U GBV_ELV SSG-OPC-FOR GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_32 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_74 GBV_ILN_90 GBV_ILN_95 GBV_ILN_100 GBV_ILN_101 GBV_ILN_105 GBV_ILN_110 GBV_ILN_150 GBV_ILN_151 GBV_ILN_224 GBV_ILN_370 GBV_ILN_602 GBV_ILN_702 GBV_ILN_2003 GBV_ILN_2004 GBV_ILN_2005 GBV_ILN_2011 GBV_ILN_2014 GBV_ILN_2015 GBV_ILN_2020 GBV_ILN_2021 GBV_ILN_2025 GBV_ILN_2027 GBV_ILN_2034 GBV_ILN_2038 GBV_ILN_2044 GBV_ILN_2048 GBV_ILN_2049 GBV_ILN_2050 GBV_ILN_2056 GBV_ILN_2059 GBV_ILN_2061 GBV_ILN_2064 GBV_ILN_2065 GBV_ILN_2068 GBV_ILN_2111 GBV_ILN_2112 GBV_ILN_2113 GBV_ILN_2118 GBV_ILN_2122 GBV_ILN_2129 GBV_ILN_2143 GBV_ILN_2147 GBV_ILN_2148 GBV_ILN_2152 GBV_ILN_2153 GBV_ILN_2190 GBV_ILN_2336 GBV_ILN_2507 GBV_ILN_2522 GBV_ILN_4035 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4242 GBV_ILN_4251 GBV_ILN_4305 GBV_ILN_4313 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4326 GBV_ILN_4333 GBV_ILN_4334 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4393 48.03 Methoden und Techniken der Land- und Forstwirtschaft AR 191 |
spelling |
10.1016/j.compag.2021.106548 doi (DE-627)ELV007020910 (ELSEVIER)S0168-1699(21)00565-2 DE-627 ger DE-627 rda eng 620 630 640 004 DE-600 48.03 bkl Jeon, Chan-Woo verfasserin aut An entry-exit path planner for an autonomous tractor in a paddy field 2021 nicht spezifiziert zzz rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier A field boundary with a single entrance as well as the entry and exit paths of the tractor based on the entrance location are key design requirements that must be considered when planning an effective path for an autonomous tractor operating in a paddy field to avoid collisions with the embankments that hold floodwater. In creating a complete in-field coverage path, an entry-exit path planner that generates paths to/from the start/end points of the auto-traveled path is needed to achieve effective field operations for a fully autonomous tractor. In this study, a novel path planner for the entry and exit operations of an autonomous tractor was developed using the A* algorithm to enable the tractor located at the entrance to automatically go to the start point of an agricultural task and return to the entrance after completing the agricultural task. An occupancy grid map with virtual obstacles was designed and the A* algorithm was applied to it to create a path for the tractor to reach its destination via the entry-exit path accurately in terms of positioning and heading. Two path-smoothing processes, a line-of-sight path smoother (LOPS) and a collinear-node path smoother (CNS), were performed to reduce redundant turning and control waypoints derived by the A* algorithm. The feasibility of using the developed algorithms was investigated via computer simulations followed by field tests with a 60-kW autonomous tractor. The simulation results confirm that the entry and exit paths generated by the proposed planner effectively guided the tractor to reach the given target points in terms of location and direction under the various entry, start, and end conditions by reducing the lateral and heading errors compared with those obtained without using the proposed search space and smoothers. For validation testing in two real paddy fields, the entry-exit paths were successfully generated in response to different entrance locations and the tractor followed the entry path and started the operation at the start point of the work path with a lateral deviation of ≤8.5 cm. In addition, the tractor navigated the exit path automatically and reached the destination with a lateral deviation of <12 cm and a heading error of <22° to the entrance and the operator was then able to drive the tractor to exit the field easily without backward navigation. Path planning A* algorithm Entry-exit path Paddy field Autonomous tractor Kim, Hak-Jin verfasserin aut Yun, Changho verfasserin aut Gang, MinSeok verfasserin aut Han, Xiongzhe verfasserin aut Enthalten in Computers and electronics in agriculture Amsterdam [u.a.] : Elsevier Science, 1985 191 Online-Ressource (DE-627)320567826 (DE-600)2016151-7 (DE-576)090955684 1872-7107 nnns volume:191 GBV_USEFLAG_U SYSFLAG_U GBV_ELV SSG-OPC-FOR GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_32 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_74 GBV_ILN_90 GBV_ILN_95 GBV_ILN_100 GBV_ILN_101 GBV_ILN_105 GBV_ILN_110 GBV_ILN_150 GBV_ILN_151 GBV_ILN_224 GBV_ILN_370 GBV_ILN_602 GBV_ILN_702 GBV_ILN_2003 GBV_ILN_2004 GBV_ILN_2005 GBV_ILN_2011 GBV_ILN_2014 GBV_ILN_2015 GBV_ILN_2020 GBV_ILN_2021 GBV_ILN_2025 GBV_ILN_2027 GBV_ILN_2034 GBV_ILN_2038 GBV_ILN_2044 GBV_ILN_2048 GBV_ILN_2049 GBV_ILN_2050 GBV_ILN_2056 GBV_ILN_2059 GBV_ILN_2061 GBV_ILN_2064 GBV_ILN_2065 GBV_ILN_2068 GBV_ILN_2111 GBV_ILN_2112 GBV_ILN_2113 GBV_ILN_2118 GBV_ILN_2122 GBV_ILN_2129 GBV_ILN_2143 GBV_ILN_2147 GBV_ILN_2148 GBV_ILN_2152 GBV_ILN_2153 GBV_ILN_2190 GBV_ILN_2336 GBV_ILN_2507 GBV_ILN_2522 GBV_ILN_4035 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4242 GBV_ILN_4251 GBV_ILN_4305 GBV_ILN_4313 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4326 GBV_ILN_4333 GBV_ILN_4334 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4393 48.03 Methoden und Techniken der Land- und Forstwirtschaft AR 191 |
allfields_unstemmed |
10.1016/j.compag.2021.106548 doi (DE-627)ELV007020910 (ELSEVIER)S0168-1699(21)00565-2 DE-627 ger DE-627 rda eng 620 630 640 004 DE-600 48.03 bkl Jeon, Chan-Woo verfasserin aut An entry-exit path planner for an autonomous tractor in a paddy field 2021 nicht spezifiziert zzz rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier A field boundary with a single entrance as well as the entry and exit paths of the tractor based on the entrance location are key design requirements that must be considered when planning an effective path for an autonomous tractor operating in a paddy field to avoid collisions with the embankments that hold floodwater. In creating a complete in-field coverage path, an entry-exit path planner that generates paths to/from the start/end points of the auto-traveled path is needed to achieve effective field operations for a fully autonomous tractor. In this study, a novel path planner for the entry and exit operations of an autonomous tractor was developed using the A* algorithm to enable the tractor located at the entrance to automatically go to the start point of an agricultural task and return to the entrance after completing the agricultural task. An occupancy grid map with virtual obstacles was designed and the A* algorithm was applied to it to create a path for the tractor to reach its destination via the entry-exit path accurately in terms of positioning and heading. Two path-smoothing processes, a line-of-sight path smoother (LOPS) and a collinear-node path smoother (CNS), were performed to reduce redundant turning and control waypoints derived by the A* algorithm. The feasibility of using the developed algorithms was investigated via computer simulations followed by field tests with a 60-kW autonomous tractor. The simulation results confirm that the entry and exit paths generated by the proposed planner effectively guided the tractor to reach the given target points in terms of location and direction under the various entry, start, and end conditions by reducing the lateral and heading errors compared with those obtained without using the proposed search space and smoothers. For validation testing in two real paddy fields, the entry-exit paths were successfully generated in response to different entrance locations and the tractor followed the entry path and started the operation at the start point of the work path with a lateral deviation of ≤8.5 cm. In addition, the tractor navigated the exit path automatically and reached the destination with a lateral deviation of <12 cm and a heading error of <22° to the entrance and the operator was then able to drive the tractor to exit the field easily without backward navigation. Path planning A* algorithm Entry-exit path Paddy field Autonomous tractor Kim, Hak-Jin verfasserin aut Yun, Changho verfasserin aut Gang, MinSeok verfasserin aut Han, Xiongzhe verfasserin aut Enthalten in Computers and electronics in agriculture Amsterdam [u.a.] : Elsevier Science, 1985 191 Online-Ressource (DE-627)320567826 (DE-600)2016151-7 (DE-576)090955684 1872-7107 nnns volume:191 GBV_USEFLAG_U SYSFLAG_U GBV_ELV SSG-OPC-FOR GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_32 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_74 GBV_ILN_90 GBV_ILN_95 GBV_ILN_100 GBV_ILN_101 GBV_ILN_105 GBV_ILN_110 GBV_ILN_150 GBV_ILN_151 GBV_ILN_224 GBV_ILN_370 GBV_ILN_602 GBV_ILN_702 GBV_ILN_2003 GBV_ILN_2004 GBV_ILN_2005 GBV_ILN_2011 GBV_ILN_2014 GBV_ILN_2015 GBV_ILN_2020 GBV_ILN_2021 GBV_ILN_2025 GBV_ILN_2027 GBV_ILN_2034 GBV_ILN_2038 GBV_ILN_2044 GBV_ILN_2048 GBV_ILN_2049 GBV_ILN_2050 GBV_ILN_2056 GBV_ILN_2059 GBV_ILN_2061 GBV_ILN_2064 GBV_ILN_2065 GBV_ILN_2068 GBV_ILN_2111 GBV_ILN_2112 GBV_ILN_2113 GBV_ILN_2118 GBV_ILN_2122 GBV_ILN_2129 GBV_ILN_2143 GBV_ILN_2147 GBV_ILN_2148 GBV_ILN_2152 GBV_ILN_2153 GBV_ILN_2190 GBV_ILN_2336 GBV_ILN_2507 GBV_ILN_2522 GBV_ILN_4035 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4242 GBV_ILN_4251 GBV_ILN_4305 GBV_ILN_4313 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4326 GBV_ILN_4333 GBV_ILN_4334 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4393 48.03 Methoden und Techniken der Land- und Forstwirtschaft AR 191 |
allfieldsGer |
10.1016/j.compag.2021.106548 doi (DE-627)ELV007020910 (ELSEVIER)S0168-1699(21)00565-2 DE-627 ger DE-627 rda eng 620 630 640 004 DE-600 48.03 bkl Jeon, Chan-Woo verfasserin aut An entry-exit path planner for an autonomous tractor in a paddy field 2021 nicht spezifiziert zzz rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier A field boundary with a single entrance as well as the entry and exit paths of the tractor based on the entrance location are key design requirements that must be considered when planning an effective path for an autonomous tractor operating in a paddy field to avoid collisions with the embankments that hold floodwater. In creating a complete in-field coverage path, an entry-exit path planner that generates paths to/from the start/end points of the auto-traveled path is needed to achieve effective field operations for a fully autonomous tractor. In this study, a novel path planner for the entry and exit operations of an autonomous tractor was developed using the A* algorithm to enable the tractor located at the entrance to automatically go to the start point of an agricultural task and return to the entrance after completing the agricultural task. An occupancy grid map with virtual obstacles was designed and the A* algorithm was applied to it to create a path for the tractor to reach its destination via the entry-exit path accurately in terms of positioning and heading. Two path-smoothing processes, a line-of-sight path smoother (LOPS) and a collinear-node path smoother (CNS), were performed to reduce redundant turning and control waypoints derived by the A* algorithm. The feasibility of using the developed algorithms was investigated via computer simulations followed by field tests with a 60-kW autonomous tractor. The simulation results confirm that the entry and exit paths generated by the proposed planner effectively guided the tractor to reach the given target points in terms of location and direction under the various entry, start, and end conditions by reducing the lateral and heading errors compared with those obtained without using the proposed search space and smoothers. For validation testing in two real paddy fields, the entry-exit paths were successfully generated in response to different entrance locations and the tractor followed the entry path and started the operation at the start point of the work path with a lateral deviation of ≤8.5 cm. In addition, the tractor navigated the exit path automatically and reached the destination with a lateral deviation of <12 cm and a heading error of <22° to the entrance and the operator was then able to drive the tractor to exit the field easily without backward navigation. Path planning A* algorithm Entry-exit path Paddy field Autonomous tractor Kim, Hak-Jin verfasserin aut Yun, Changho verfasserin aut Gang, MinSeok verfasserin aut Han, Xiongzhe verfasserin aut Enthalten in Computers and electronics in agriculture Amsterdam [u.a.] : Elsevier Science, 1985 191 Online-Ressource (DE-627)320567826 (DE-600)2016151-7 (DE-576)090955684 1872-7107 nnns volume:191 GBV_USEFLAG_U SYSFLAG_U GBV_ELV SSG-OPC-FOR GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_32 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_74 GBV_ILN_90 GBV_ILN_95 GBV_ILN_100 GBV_ILN_101 GBV_ILN_105 GBV_ILN_110 GBV_ILN_150 GBV_ILN_151 GBV_ILN_224 GBV_ILN_370 GBV_ILN_602 GBV_ILN_702 GBV_ILN_2003 GBV_ILN_2004 GBV_ILN_2005 GBV_ILN_2011 GBV_ILN_2014 GBV_ILN_2015 GBV_ILN_2020 GBV_ILN_2021 GBV_ILN_2025 GBV_ILN_2027 GBV_ILN_2034 GBV_ILN_2038 GBV_ILN_2044 GBV_ILN_2048 GBV_ILN_2049 GBV_ILN_2050 GBV_ILN_2056 GBV_ILN_2059 GBV_ILN_2061 GBV_ILN_2064 GBV_ILN_2065 GBV_ILN_2068 GBV_ILN_2111 GBV_ILN_2112 GBV_ILN_2113 GBV_ILN_2118 GBV_ILN_2122 GBV_ILN_2129 GBV_ILN_2143 GBV_ILN_2147 GBV_ILN_2148 GBV_ILN_2152 GBV_ILN_2153 GBV_ILN_2190 GBV_ILN_2336 GBV_ILN_2507 GBV_ILN_2522 GBV_ILN_4035 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4242 GBV_ILN_4251 GBV_ILN_4305 GBV_ILN_4313 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4326 GBV_ILN_4333 GBV_ILN_4334 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4393 48.03 Methoden und Techniken der Land- und Forstwirtschaft AR 191 |
allfieldsSound |
10.1016/j.compag.2021.106548 doi (DE-627)ELV007020910 (ELSEVIER)S0168-1699(21)00565-2 DE-627 ger DE-627 rda eng 620 630 640 004 DE-600 48.03 bkl Jeon, Chan-Woo verfasserin aut An entry-exit path planner for an autonomous tractor in a paddy field 2021 nicht spezifiziert zzz rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier A field boundary with a single entrance as well as the entry and exit paths of the tractor based on the entrance location are key design requirements that must be considered when planning an effective path for an autonomous tractor operating in a paddy field to avoid collisions with the embankments that hold floodwater. In creating a complete in-field coverage path, an entry-exit path planner that generates paths to/from the start/end points of the auto-traveled path is needed to achieve effective field operations for a fully autonomous tractor. In this study, a novel path planner for the entry and exit operations of an autonomous tractor was developed using the A* algorithm to enable the tractor located at the entrance to automatically go to the start point of an agricultural task and return to the entrance after completing the agricultural task. An occupancy grid map with virtual obstacles was designed and the A* algorithm was applied to it to create a path for the tractor to reach its destination via the entry-exit path accurately in terms of positioning and heading. Two path-smoothing processes, a line-of-sight path smoother (LOPS) and a collinear-node path smoother (CNS), were performed to reduce redundant turning and control waypoints derived by the A* algorithm. The feasibility of using the developed algorithms was investigated via computer simulations followed by field tests with a 60-kW autonomous tractor. The simulation results confirm that the entry and exit paths generated by the proposed planner effectively guided the tractor to reach the given target points in terms of location and direction under the various entry, start, and end conditions by reducing the lateral and heading errors compared with those obtained without using the proposed search space and smoothers. For validation testing in two real paddy fields, the entry-exit paths were successfully generated in response to different entrance locations and the tractor followed the entry path and started the operation at the start point of the work path with a lateral deviation of ≤8.5 cm. In addition, the tractor navigated the exit path automatically and reached the destination with a lateral deviation of <12 cm and a heading error of <22° to the entrance and the operator was then able to drive the tractor to exit the field easily without backward navigation. Path planning A* algorithm Entry-exit path Paddy field Autonomous tractor Kim, Hak-Jin verfasserin aut Yun, Changho verfasserin aut Gang, MinSeok verfasserin aut Han, Xiongzhe verfasserin aut Enthalten in Computers and electronics in agriculture Amsterdam [u.a.] : Elsevier Science, 1985 191 Online-Ressource (DE-627)320567826 (DE-600)2016151-7 (DE-576)090955684 1872-7107 nnns volume:191 GBV_USEFLAG_U SYSFLAG_U GBV_ELV SSG-OPC-FOR GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_32 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_74 GBV_ILN_90 GBV_ILN_95 GBV_ILN_100 GBV_ILN_101 GBV_ILN_105 GBV_ILN_110 GBV_ILN_150 GBV_ILN_151 GBV_ILN_224 GBV_ILN_370 GBV_ILN_602 GBV_ILN_702 GBV_ILN_2003 GBV_ILN_2004 GBV_ILN_2005 GBV_ILN_2011 GBV_ILN_2014 GBV_ILN_2015 GBV_ILN_2020 GBV_ILN_2021 GBV_ILN_2025 GBV_ILN_2027 GBV_ILN_2034 GBV_ILN_2038 GBV_ILN_2044 GBV_ILN_2048 GBV_ILN_2049 GBV_ILN_2050 GBV_ILN_2056 GBV_ILN_2059 GBV_ILN_2061 GBV_ILN_2064 GBV_ILN_2065 GBV_ILN_2068 GBV_ILN_2111 GBV_ILN_2112 GBV_ILN_2113 GBV_ILN_2118 GBV_ILN_2122 GBV_ILN_2129 GBV_ILN_2143 GBV_ILN_2147 GBV_ILN_2148 GBV_ILN_2152 GBV_ILN_2153 GBV_ILN_2190 GBV_ILN_2336 GBV_ILN_2507 GBV_ILN_2522 GBV_ILN_4035 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4242 GBV_ILN_4251 GBV_ILN_4305 GBV_ILN_4313 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4326 GBV_ILN_4333 GBV_ILN_4334 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4393 48.03 Methoden und Techniken der Land- und Forstwirtschaft AR 191 |
language |
English |
source |
Enthalten in Computers and electronics in agriculture 191 volume:191 |
sourceStr |
Enthalten in Computers and electronics in agriculture 191 volume:191 |
format_phy_str_mv |
Article |
bklname |
Methoden und Techniken der Land- und Forstwirtschaft |
institution |
findex.gbv.de |
topic_facet |
Path planning A* algorithm Entry-exit path Paddy field Autonomous tractor |
dewey-raw |
620 |
isfreeaccess_bool |
false |
container_title |
Computers and electronics in agriculture |
authorswithroles_txt_mv |
Jeon, Chan-Woo @@aut@@ Kim, Hak-Jin @@aut@@ Yun, Changho @@aut@@ Gang, MinSeok @@aut@@ Han, Xiongzhe @@aut@@ |
publishDateDaySort_date |
2021-01-01T00:00:00Z |
hierarchy_top_id |
320567826 |
dewey-sort |
3620 |
id |
ELV007020910 |
language_de |
englisch |
fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">ELV007020910</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230524123714.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">230506s2021 xx |||||o 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1016/j.compag.2021.106548</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)ELV007020910</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ELSEVIER)S0168-1699(21)00565-2</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">620</subfield><subfield code="a">630</subfield><subfield code="a">640</subfield><subfield code="a">004</subfield><subfield code="q">DE-600</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">48.03</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Jeon, Chan-Woo</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">An entry-exit path planner for an autonomous tractor in a paddy field</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2021</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">zzz</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">Computermedien</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Online-Ressource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">A field boundary with a single entrance as well as the entry and exit paths of the tractor based on the entrance location are key design requirements that must be considered when planning an effective path for an autonomous tractor operating in a paddy field to avoid collisions with the embankments that hold floodwater. In creating a complete in-field coverage path, an entry-exit path planner that generates paths to/from the start/end points of the auto-traveled path is needed to achieve effective field operations for a fully autonomous tractor. In this study, a novel path planner for the entry and exit operations of an autonomous tractor was developed using the A* algorithm to enable the tractor located at the entrance to automatically go to the start point of an agricultural task and return to the entrance after completing the agricultural task. An occupancy grid map with virtual obstacles was designed and the A* algorithm was applied to it to create a path for the tractor to reach its destination via the entry-exit path accurately in terms of positioning and heading. Two path-smoothing processes, a line-of-sight path smoother (LOPS) and a collinear-node path smoother (CNS), were performed to reduce redundant turning and control waypoints derived by the A* algorithm. The feasibility of using the developed algorithms was investigated via computer simulations followed by field tests with a 60-kW autonomous tractor. The simulation results confirm that the entry and exit paths generated by the proposed planner effectively guided the tractor to reach the given target points in terms of location and direction under the various entry, start, and end conditions by reducing the lateral and heading errors compared with those obtained without using the proposed search space and smoothers. For validation testing in two real paddy fields, the entry-exit paths were successfully generated in response to different entrance locations and the tractor followed the entry path and started the operation at the start point of the work path with a lateral deviation of ≤8.5 cm. In addition, the tractor navigated the exit path automatically and reached the destination with a lateral deviation of <12 cm and a heading error of <22° to the entrance and the operator was then able to drive the tractor to exit the field easily without backward navigation.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Path planning</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">A* algorithm</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Entry-exit path</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Paddy field</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Autonomous tractor</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Kim, Hak-Jin</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Yun, Changho</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Gang, MinSeok</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Han, Xiongzhe</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Computers and electronics in agriculture</subfield><subfield code="d">Amsterdam [u.a.] : Elsevier Science, 1985</subfield><subfield code="g">191</subfield><subfield code="h">Online-Ressource</subfield><subfield code="w">(DE-627)320567826</subfield><subfield code="w">(DE-600)2016151-7</subfield><subfield code="w">(DE-576)090955684</subfield><subfield code="x">1872-7107</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:191</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_U</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_U</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ELV</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OPC-FOR</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_20</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_22</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_23</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_24</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_31</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_32</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_40</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_60</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_62</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_63</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_65</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_69</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_73</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_74</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_90</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_95</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_100</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_101</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_105</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_110</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_150</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_151</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_224</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_370</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_602</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_702</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2003</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2004</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2005</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2011</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2014</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2015</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2020</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2021</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2025</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2027</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2034</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2038</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2044</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2048</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2049</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2050</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2056</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2059</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2061</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2064</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2065</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2068</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2111</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2112</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2113</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2118</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2122</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2129</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2143</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2147</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2148</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2152</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2153</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2190</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2336</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2507</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2522</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4035</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4037</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4112</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4125</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4126</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4242</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4251</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4305</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4313</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4323</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4324</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4326</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4333</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4334</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4335</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4338</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4393</subfield></datafield><datafield tag="936" ind1="b" ind2="k"><subfield code="a">48.03</subfield><subfield code="j">Methoden und Techniken der Land- und Forstwirtschaft</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">191</subfield></datafield></record></collection>
|
author |
Jeon, Chan-Woo |
spellingShingle |
Jeon, Chan-Woo ddc 620 bkl 48.03 misc Path planning misc A* algorithm misc Entry-exit path misc Paddy field misc Autonomous tractor An entry-exit path planner for an autonomous tractor in a paddy field |
authorStr |
Jeon, Chan-Woo |
ppnlink_with_tag_str_mv |
@@773@@(DE-627)320567826 |
format |
electronic Article |
dewey-ones |
620 - Engineering & allied operations 630 - Agriculture & related technologies 640 - Home & family management 004 - Data processing & computer science |
delete_txt_mv |
keep |
author_role |
aut aut aut aut aut |
collection |
elsevier |
remote_str |
true |
illustrated |
Not Illustrated |
issn |
1872-7107 |
topic_title |
620 630 640 004 DE-600 48.03 bkl An entry-exit path planner for an autonomous tractor in a paddy field Path planning A* algorithm Entry-exit path Paddy field Autonomous tractor |
topic |
ddc 620 bkl 48.03 misc Path planning misc A* algorithm misc Entry-exit path misc Paddy field misc Autonomous tractor |
topic_unstemmed |
ddc 620 bkl 48.03 misc Path planning misc A* algorithm misc Entry-exit path misc Paddy field misc Autonomous tractor |
topic_browse |
ddc 620 bkl 48.03 misc Path planning misc A* algorithm misc Entry-exit path misc Paddy field misc Autonomous tractor |
format_facet |
Elektronische Aufsätze Aufsätze Elektronische Ressource |
format_main_str_mv |
Text Zeitschrift/Artikel |
carriertype_str_mv |
cr |
hierarchy_parent_title |
Computers and electronics in agriculture |
hierarchy_parent_id |
320567826 |
dewey-tens |
620 - Engineering 630 - Agriculture 640 - Home & family management 000 - Computer science, knowledge & systems |
hierarchy_top_title |
Computers and electronics in agriculture |
isfreeaccess_txt |
false |
familylinks_str_mv |
(DE-627)320567826 (DE-600)2016151-7 (DE-576)090955684 |
title |
An entry-exit path planner for an autonomous tractor in a paddy field |
ctrlnum |
(DE-627)ELV007020910 (ELSEVIER)S0168-1699(21)00565-2 |
title_full |
An entry-exit path planner for an autonomous tractor in a paddy field |
author_sort |
Jeon, Chan-Woo |
journal |
Computers and electronics in agriculture |
journalStr |
Computers and electronics in agriculture |
lang_code |
eng |
isOA_bool |
false |
dewey-hundreds |
600 - Technology 000 - Computer science, information & general works |
recordtype |
marc |
publishDateSort |
2021 |
contenttype_str_mv |
zzz |
author_browse |
Jeon, Chan-Woo Kim, Hak-Jin Yun, Changho Gang, MinSeok Han, Xiongzhe |
container_volume |
191 |
class |
620 630 640 004 DE-600 48.03 bkl |
format_se |
Elektronische Aufsätze |
author-letter |
Jeon, Chan-Woo |
doi_str_mv |
10.1016/j.compag.2021.106548 |
dewey-full |
620 630 640 004 |
author2-role |
verfasserin |
title_sort |
an entry-exit path planner for an autonomous tractor in a paddy field |
title_auth |
An entry-exit path planner for an autonomous tractor in a paddy field |
abstract |
A field boundary with a single entrance as well as the entry and exit paths of the tractor based on the entrance location are key design requirements that must be considered when planning an effective path for an autonomous tractor operating in a paddy field to avoid collisions with the embankments that hold floodwater. In creating a complete in-field coverage path, an entry-exit path planner that generates paths to/from the start/end points of the auto-traveled path is needed to achieve effective field operations for a fully autonomous tractor. In this study, a novel path planner for the entry and exit operations of an autonomous tractor was developed using the A* algorithm to enable the tractor located at the entrance to automatically go to the start point of an agricultural task and return to the entrance after completing the agricultural task. An occupancy grid map with virtual obstacles was designed and the A* algorithm was applied to it to create a path for the tractor to reach its destination via the entry-exit path accurately in terms of positioning and heading. Two path-smoothing processes, a line-of-sight path smoother (LOPS) and a collinear-node path smoother (CNS), were performed to reduce redundant turning and control waypoints derived by the A* algorithm. The feasibility of using the developed algorithms was investigated via computer simulations followed by field tests with a 60-kW autonomous tractor. The simulation results confirm that the entry and exit paths generated by the proposed planner effectively guided the tractor to reach the given target points in terms of location and direction under the various entry, start, and end conditions by reducing the lateral and heading errors compared with those obtained without using the proposed search space and smoothers. For validation testing in two real paddy fields, the entry-exit paths were successfully generated in response to different entrance locations and the tractor followed the entry path and started the operation at the start point of the work path with a lateral deviation of ≤8.5 cm. In addition, the tractor navigated the exit path automatically and reached the destination with a lateral deviation of <12 cm and a heading error of <22° to the entrance and the operator was then able to drive the tractor to exit the field easily without backward navigation. |
abstractGer |
A field boundary with a single entrance as well as the entry and exit paths of the tractor based on the entrance location are key design requirements that must be considered when planning an effective path for an autonomous tractor operating in a paddy field to avoid collisions with the embankments that hold floodwater. In creating a complete in-field coverage path, an entry-exit path planner that generates paths to/from the start/end points of the auto-traveled path is needed to achieve effective field operations for a fully autonomous tractor. In this study, a novel path planner for the entry and exit operations of an autonomous tractor was developed using the A* algorithm to enable the tractor located at the entrance to automatically go to the start point of an agricultural task and return to the entrance after completing the agricultural task. An occupancy grid map with virtual obstacles was designed and the A* algorithm was applied to it to create a path for the tractor to reach its destination via the entry-exit path accurately in terms of positioning and heading. Two path-smoothing processes, a line-of-sight path smoother (LOPS) and a collinear-node path smoother (CNS), were performed to reduce redundant turning and control waypoints derived by the A* algorithm. The feasibility of using the developed algorithms was investigated via computer simulations followed by field tests with a 60-kW autonomous tractor. The simulation results confirm that the entry and exit paths generated by the proposed planner effectively guided the tractor to reach the given target points in terms of location and direction under the various entry, start, and end conditions by reducing the lateral and heading errors compared with those obtained without using the proposed search space and smoothers. For validation testing in two real paddy fields, the entry-exit paths were successfully generated in response to different entrance locations and the tractor followed the entry path and started the operation at the start point of the work path with a lateral deviation of ≤8.5 cm. In addition, the tractor navigated the exit path automatically and reached the destination with a lateral deviation of <12 cm and a heading error of <22° to the entrance and the operator was then able to drive the tractor to exit the field easily without backward navigation. |
abstract_unstemmed |
A field boundary with a single entrance as well as the entry and exit paths of the tractor based on the entrance location are key design requirements that must be considered when planning an effective path for an autonomous tractor operating in a paddy field to avoid collisions with the embankments that hold floodwater. In creating a complete in-field coverage path, an entry-exit path planner that generates paths to/from the start/end points of the auto-traveled path is needed to achieve effective field operations for a fully autonomous tractor. In this study, a novel path planner for the entry and exit operations of an autonomous tractor was developed using the A* algorithm to enable the tractor located at the entrance to automatically go to the start point of an agricultural task and return to the entrance after completing the agricultural task. An occupancy grid map with virtual obstacles was designed and the A* algorithm was applied to it to create a path for the tractor to reach its destination via the entry-exit path accurately in terms of positioning and heading. Two path-smoothing processes, a line-of-sight path smoother (LOPS) and a collinear-node path smoother (CNS), were performed to reduce redundant turning and control waypoints derived by the A* algorithm. The feasibility of using the developed algorithms was investigated via computer simulations followed by field tests with a 60-kW autonomous tractor. The simulation results confirm that the entry and exit paths generated by the proposed planner effectively guided the tractor to reach the given target points in terms of location and direction under the various entry, start, and end conditions by reducing the lateral and heading errors compared with those obtained without using the proposed search space and smoothers. For validation testing in two real paddy fields, the entry-exit paths were successfully generated in response to different entrance locations and the tractor followed the entry path and started the operation at the start point of the work path with a lateral deviation of ≤8.5 cm. In addition, the tractor navigated the exit path automatically and reached the destination with a lateral deviation of <12 cm and a heading error of <22° to the entrance and the operator was then able to drive the tractor to exit the field easily without backward navigation. |
collection_details |
GBV_USEFLAG_U SYSFLAG_U GBV_ELV SSG-OPC-FOR GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_32 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_74 GBV_ILN_90 GBV_ILN_95 GBV_ILN_100 GBV_ILN_101 GBV_ILN_105 GBV_ILN_110 GBV_ILN_150 GBV_ILN_151 GBV_ILN_224 GBV_ILN_370 GBV_ILN_602 GBV_ILN_702 GBV_ILN_2003 GBV_ILN_2004 GBV_ILN_2005 GBV_ILN_2011 GBV_ILN_2014 GBV_ILN_2015 GBV_ILN_2020 GBV_ILN_2021 GBV_ILN_2025 GBV_ILN_2027 GBV_ILN_2034 GBV_ILN_2038 GBV_ILN_2044 GBV_ILN_2048 GBV_ILN_2049 GBV_ILN_2050 GBV_ILN_2056 GBV_ILN_2059 GBV_ILN_2061 GBV_ILN_2064 GBV_ILN_2065 GBV_ILN_2068 GBV_ILN_2111 GBV_ILN_2112 GBV_ILN_2113 GBV_ILN_2118 GBV_ILN_2122 GBV_ILN_2129 GBV_ILN_2143 GBV_ILN_2147 GBV_ILN_2148 GBV_ILN_2152 GBV_ILN_2153 GBV_ILN_2190 GBV_ILN_2336 GBV_ILN_2507 GBV_ILN_2522 GBV_ILN_4035 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4242 GBV_ILN_4251 GBV_ILN_4305 GBV_ILN_4313 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4326 GBV_ILN_4333 GBV_ILN_4334 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4393 |
title_short |
An entry-exit path planner for an autonomous tractor in a paddy field |
remote_bool |
true |
author2 |
Kim, Hak-Jin Yun, Changho Gang, MinSeok Han, Xiongzhe |
author2Str |
Kim, Hak-Jin Yun, Changho Gang, MinSeok Han, Xiongzhe |
ppnlink |
320567826 |
mediatype_str_mv |
c |
isOA_txt |
false |
hochschulschrift_bool |
false |
doi_str |
10.1016/j.compag.2021.106548 |
up_date |
2024-07-06T23:20:56.886Z |
_version_ |
1803873741059391488 |
fullrecord_marcxml |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">ELV007020910</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230524123714.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">230506s2021 xx |||||o 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1016/j.compag.2021.106548</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)ELV007020910</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ELSEVIER)S0168-1699(21)00565-2</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">620</subfield><subfield code="a">630</subfield><subfield code="a">640</subfield><subfield code="a">004</subfield><subfield code="q">DE-600</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">48.03</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Jeon, Chan-Woo</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">An entry-exit path planner for an autonomous tractor in a paddy field</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2021</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">zzz</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">Computermedien</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Online-Ressource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">A field boundary with a single entrance as well as the entry and exit paths of the tractor based on the entrance location are key design requirements that must be considered when planning an effective path for an autonomous tractor operating in a paddy field to avoid collisions with the embankments that hold floodwater. In creating a complete in-field coverage path, an entry-exit path planner that generates paths to/from the start/end points of the auto-traveled path is needed to achieve effective field operations for a fully autonomous tractor. In this study, a novel path planner for the entry and exit operations of an autonomous tractor was developed using the A* algorithm to enable the tractor located at the entrance to automatically go to the start point of an agricultural task and return to the entrance after completing the agricultural task. An occupancy grid map with virtual obstacles was designed and the A* algorithm was applied to it to create a path for the tractor to reach its destination via the entry-exit path accurately in terms of positioning and heading. Two path-smoothing processes, a line-of-sight path smoother (LOPS) and a collinear-node path smoother (CNS), were performed to reduce redundant turning and control waypoints derived by the A* algorithm. The feasibility of using the developed algorithms was investigated via computer simulations followed by field tests with a 60-kW autonomous tractor. The simulation results confirm that the entry and exit paths generated by the proposed planner effectively guided the tractor to reach the given target points in terms of location and direction under the various entry, start, and end conditions by reducing the lateral and heading errors compared with those obtained without using the proposed search space and smoothers. For validation testing in two real paddy fields, the entry-exit paths were successfully generated in response to different entrance locations and the tractor followed the entry path and started the operation at the start point of the work path with a lateral deviation of ≤8.5 cm. In addition, the tractor navigated the exit path automatically and reached the destination with a lateral deviation of <12 cm and a heading error of <22° to the entrance and the operator was then able to drive the tractor to exit the field easily without backward navigation.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Path planning</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">A* algorithm</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Entry-exit path</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Paddy field</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Autonomous tractor</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Kim, Hak-Jin</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Yun, Changho</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Gang, MinSeok</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Han, Xiongzhe</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Computers and electronics in agriculture</subfield><subfield code="d">Amsterdam [u.a.] : Elsevier Science, 1985</subfield><subfield code="g">191</subfield><subfield code="h">Online-Ressource</subfield><subfield code="w">(DE-627)320567826</subfield><subfield code="w">(DE-600)2016151-7</subfield><subfield code="w">(DE-576)090955684</subfield><subfield code="x">1872-7107</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:191</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_U</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_U</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ELV</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OPC-FOR</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_20</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_22</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_23</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_24</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_31</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_32</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_40</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_60</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_62</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_63</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_65</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_69</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_73</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_74</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_90</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_95</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_100</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_101</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_105</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_110</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_150</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_151</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_224</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_370</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_602</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_702</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2003</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2004</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2005</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2011</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2014</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2015</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2020</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2021</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2025</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2027</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2034</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2038</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2044</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2048</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2049</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2050</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2056</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2059</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2061</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2064</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2065</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2068</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2111</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2112</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2113</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2118</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2122</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2129</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2143</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2147</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2148</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2152</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2153</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2190</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2336</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2507</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2522</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4035</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4037</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4112</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4125</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4126</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4242</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4251</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4305</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4313</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4323</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4324</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4326</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4333</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4334</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4335</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4338</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4393</subfield></datafield><datafield tag="936" ind1="b" ind2="k"><subfield code="a">48.03</subfield><subfield code="j">Methoden und Techniken der Land- und Forstwirtschaft</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">191</subfield></datafield></record></collection>
|
score |
7.40114 |