Abstract
Abstract Forest harvesting operations with heavy machinery can lead to significant soil rutting. Risks of rutting depend on the soil bearing capacity which has considerable spatial and temporal variability. Trafficability prediction is required in the selection of suitable operation sites for a given time window and conditions, and for on-site route optimization during the operation. Integrative tools are necessary to plan and carry out forest operations with minimal negative ecological and economic impacts. This study demonstrates a trafficability prediction framework that utilizes a spatial hydrological model and a wide range of spatial data. Trafficability was approached by producing a rut depth prediction map at a 16 × 16 m grid resolution, based on the outputs of a general linear mixed model developed using field data from Southern Finland, modelled daily soil moisture, spatial forest inventory and topography data, along with field measured rolling resistance and information on the mass transported through the grid cells. Dynamic rut depth prediction maps were produced by accounting for changing weather conditions through hydrological modelling. We also demonstrated a generalization of the rolling resistance coefficient, measured with harvester CAN-bus channel data. Future steps towards a nationwide prediction framework based on continuous data flow, process-based modelling and machine learning are discussed.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: Forestry: An International Journal of Forest Research
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.