FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W2600856894> ?p ?o ?g. }

• W2600856894 abstract "In this thesis, a coverage path planning problem is discussed in the case of agricultural fields and agricultural machines. Methods and algorithms to solve this problem are developed. The necessary condition is to cover the whole field, while the goal is to find as efficient a route as possible. As yet, there is no universal algorithm or method capable of solving the problem in all cases.In this thesis, two new approaches to solve the coverage path planning problem in the case of agricultural fields and agricultural machines are presented. In the first algorithm, the field plot is split into subfields that are simple to drive. Each subfield is constructed from trapezoids, the sides of which are attached. Thus the opposite sides of each subfield are parallel. In the search method, the best driving direction for each subfield is found. In the second algorithm, the path is planned on the basis of the machine's current state. Inspired by model predictive control, all the possible routes are simulated over the horizon of one route around the field or one back-and-forth swath. The best of the simulated routes is selected and the first part of that route is applied, up to the next turning. In the next turning, the algorithm is repeated. There are advantages and drawbacks in both algorithms. Neither of them solves the universal problem optimally. Nevertheless, the developed algorithms are remarkable steps towards finding a way to solve the problem.As a side-result, the properties of Finnish field plots are discussed and the field plot shape analysis is made. The classification of field plots based on shape was investigated, but only 25% of field plots belong to one or other simple-shape classes, such as rectangles and triangles, while the rest are more or less undetermined shapes.The other side-result is a trajectory generation for a tractor-trailer vehicle in a headland. The problem is formulated as an optimal control problem and solved using available methods and tools. With this approach, the trajectory can be solved for any headland width and angle.; Tassa vaitoskirjassa kasitellaan peltoliikenteen reitinsuunnitteluun liittyvia ongelmia ja kehitetaan menetelmia ja tyokaluja ongelmien ratkaisemiseen. Reitinsuunnittelun ehdottomana vaatimuksena on kattaa koko pelto ja pyrkia suunnittelemaan reitti mahdollisimman tehokkaaksi. Viela ei tunneta mitaan yleista menetelmaa jolla reitinsuunnittelu voitaisiin ratkaista optimaalisesti kaikissa tapauksissa.Tassa vaitoskirjassa esitetaan kaksi uutta lahestymistapaa ratkaisemaan peltoliikenteen reitinsuunnittelu. Ensimmaisessa menetelmassa pilkotaan hankalan muotoinen lohko useampaan osalohkoon, jotka erillisina on helppo ajaa. Osalohkon muoto koostuu kyljistaan yhteenliitetyista puolisuunnikkaista, ja siten osalohkon vastakkaiset sivut ovat myos samansuuntaiset. Hakumenetelmassa etsitaan kullekin osalohkolle paras ajosuunta. Toisessa menetelmassa suunnitellaan reittia koneen sen hetkisesta tilanteesta lahtien simuloimalla kaikki mahdolliset reitit eteenpain yhden…" @default.
• W2600856894 created "2017-04-07" @default.
• W2600856894 creator A5021744500 @default.
• W2600856894 date "2007-12-14" @default.
• W2600856894 modified "2023-09-26" @default.
• W2600856894 title "Path planning algorithms for agricultural field machines" @default.
• W2600856894 cites W101508493 @default.
• W2600856894 cites W140238390 @default.
• W2600856894 cites W1434983646 @default.
• W2600856894 cites W1520256448 @default.
• W2600856894 cites W1544032329 @default.
• W2600856894 cites W1561941139 @default.
• W2600856894 cites W1590932131 @default.
• W2600856894 cites W1603643961 @default.
• W2600856894 cites W179323378 @default.
• W2600856894 cites W1968510751 @default.
• W2600856894 cites W1972061292 @default.
• W2600856894 cites W1981891657 @default.
• W2600856894 cites W1993336589 @default.
• W2600856894 cites W1996530509 @default.
• W2600856894 cites W1999019844 @default.
• W2600856894 cites W2001981441 @default.
• W2600856894 cites W2004825803 @default.
• W2600856894 cites W2022144657 @default.
• W2600856894 cites W2040872506 @default.
• W2600856894 cites W2062399425 @default.
• W2600856894 cites W2089344586 @default.
• W2600856894 cites W2102443145 @default.
• W2600856894 cites W2110824994 @default.
• W2600856894 cites W2114682338 @default.
• W2600856894 cites W2135404126 @default.
• W2600856894 cites W2166177494 @default.
• W2600856894 cites W2188810566 @default.
• W2600856894 cites W2250706791 @default.
• W2600856894 cites W2263376545 @default.
• W2600856894 cites W2271067568 @default.
• W2600856894 cites W2726100503 @default.
• W2600856894 cites W2729883132 @default.
• W2600856894 cites W2731986717 @default.
• W2600856894 cites W2798534591 @default.
• W2600856894 cites W2909350703 @default.
• W2600856894 cites W3011685483 @default.
• W2600856894 cites W3184766140 @default.
• W2600856894 cites W75760822 @default.
• W2600856894 cites W89203788 @default.
• W2600856894 cites W98066755 @default.
• W2600856894 cites W2791272553 @default.
• W2600856894 hasPublicationYear "2007" @default.
• W2600856894 type Work @default.
• W2600856894 sameAs 2600856894 @default.
• W2600856894 citedByCount "13" @default.
• W2600856894 countsByYear W26008568942012 @default.
• W2600856894 countsByYear W26008568942013 @default.
• W2600856894 countsByYear W26008568942015 @default.
• W2600856894 countsByYear W26008568942019 @default.
• W2600856894 crossrefType "journal-article" @default.
• W2600856894 hasAuthorship W2600856894A5021744500 @default.
• W2600856894 hasConcept C11413529 @default.
• W2600856894 hasConcept C126255220 @default.
• W2600856894 hasConcept C154945302 @default.
• W2600856894 hasConcept C199360897 @default.
• W2600856894 hasConcept C202444582 @default.
• W2600856894 hasConcept C2777735758 @default.
• W2600856894 hasConcept C33923547 @default.
• W2600856894 hasConcept C41008148 @default.
• W2600856894 hasConcept C48103436 @default.
• W2600856894 hasConcept C81074085 @default.
• W2600856894 hasConcept C90509273 @default.
• W2600856894 hasConcept C9652623 @default.
• W2600856894 hasConceptScore W2600856894C11413529 @default.
• W2600856894 hasConceptScore W2600856894C126255220 @default.
• W2600856894 hasConceptScore W2600856894C154945302 @default.
• W2600856894 hasConceptScore W2600856894C199360897 @default.
• W2600856894 hasConceptScore W2600856894C202444582 @default.
• W2600856894 hasConceptScore W2600856894C2777735758 @default.
• W2600856894 hasConceptScore W2600856894C33923547 @default.
• W2600856894 hasConceptScore W2600856894C41008148 @default.
• W2600856894 hasConceptScore W2600856894C48103436 @default.
• W2600856894 hasConceptScore W2600856894C81074085 @default.
• W2600856894 hasConceptScore W2600856894C90509273 @default.
• W2600856894 hasConceptScore W2600856894C9652623 @default.
• W2600856894 hasLocation W26008568941 @default.
• W2600856894 hasOpenAccess W2600856894 @default.
• W2600856894 hasPrimaryLocation W26008568941 @default.
• W2600856894 hasRelatedWork W1418115906 @default.
• W2600856894 hasRelatedWork W1451359022 @default.
• W2600856894 hasRelatedWork W1770975719 @default.
• W2600856894 hasRelatedWork W1795617219 @default.
• W2600856894 hasRelatedWork W1980464078 @default.
• W2600856894 hasRelatedWork W1990390843 @default.
• W2600856894 hasRelatedWork W2059156800 @default.
• W2600856894 hasRelatedWork W2069676695 @default.
• W2600856894 hasRelatedWork W2123984982 @default.
• W2600856894 hasRelatedWork W2126716943 @default.
• W2600856894 hasRelatedWork W2217243206 @default.
• W2600856894 hasRelatedWork W2265630374 @default.
• W2600856894 hasRelatedWork W2268320119 @default.
• W2600856894 hasRelatedWork W2515285539 @default.
• W2600856894 hasRelatedWork W2933166405 @default.
• W2600856894 hasRelatedWork W2949644089 @default.

• next