Timo Oksanen
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Research Interests
Timo Oksanen has a total of 24 co-authors. Here are the top co-authors by number of shared publications:
Riikka Soitinaho
4 shared publications- Samuel Brodie
Chair of Agrimechatronics, Technical University of Munich and Munich Institute of Robotics and Machine Intelligence (MIRMI), Garching b. Mnchen, Germany
4 shared publications Vili Väyrynen
3 shared publications- Fredrik Kämmerling2 shared publications
- Marcel Moll
Chair of Agrimechatronics, Technical University of Munich and Munich Institute of Robotics and Machine Intelligence (MIRMI), Garching b. Mnchen, Germany
2 shared publications - Peter Buckel2 shared publications
Latest Publications
- Open Access
- 6 November 2026
- Published by Elsevier in Computers and Electronics in Agriculture
Machine-readable operator manuals over the ISO 11783 network for offline, multilingual LLM assistance
- 6 November 2026
- Published by Elsevier in Computers and Electronics in Agriculture
Open AccessMachine-readable operator manuals over the ISO 11783 network for offline, multilingual LLM assistance
- Open Access
- 19 October 2026
- Published by Elsevier in Smart Agricultural Technology
- Vol. 15
Benchmark datasets for soil-borne dust removal in agricultural imagery under day and night conditions
- 19 October 2026
- Published by Elsevier in Smart Agricultural Technology
- Vol. 15
Open AccessBenchmark datasets for soil-borne dust removal in agricultural imagery under day and night conditions
- Open Access
- 18 August 2026
- Published by Elsevier in Biosystems Engineering
- Vol. 271
Drone based method for 2D pattern recognition of organic fertiliser centrifugal spreading
- 18 August 2026
- Published by Elsevier in Biosystems Engineering
- Vol. 271
Open AccessDrone based method for 2D pattern recognition of organic fertiliser centrifugal spreading
- Open Access
- 11 July 2026
- Published by Elsevier in Computers and Electronics in Agriculture
- Vol. 253
A dataset for investigating dust removal for person detection
- 11 July 2026
- Published by Elsevier in Computers and Electronics in Agriculture
- Vol. 253
Open AccessA dataset for investigating dust removal for person detection
- Open Access
- 16 June 2026
- Published by Elsevier in Smart Agricultural Technology
- Vol. 14
Real-time turn path planning with obstacle avoidance for autonomous agricultural field machines
- 16 June 2026
- Published by Elsevier in Smart Agricultural Technology
- Vol. 14
Open AccessReal-time turn path planning with obstacle avoidance for autonomous agricultural field machines
- Open Access
- 27 April 2026
- Published by Elsevier in SSRN Electronic Journal
Real-time turn path planning with obstacle avoidance for autonomous agricultural field machines
Turn path planning is an essential component of autonomous agricultural field operations, where nonholonomic field machines must navigate between work swaths while respecting spatial constraints such as field boundaries and obstacles. This article presents a real-time turn path planning algorithm for autonomous agricultural field machines. The algorithm was designed to operate as part of a cooperative coverage path planning system in which multiple autonomous tractors perform sequentially dependent tasks simultaneously on the same field. The proposed algorithm is based on Hybrid A*, combining analytical Reeds-Shepp and Dubins path computation with a four-dimensional A* search, followed by gradient descent smoothing to achieve path feasibility. A state machine architecture was employed to meet the real-time constraint of a maximum of 100 ms per function call and 3 s of total computation time per turn path. The algorithm was evaluated through four experiments which include real-world field experiments with autonomous tractors. In the simulated obstacle-free experiment, the average computation time was 118 ms, which corresponds to approximately 4 % of the permitted maximum. The generated paths were feasible, with curvatures averaging approximately 60 % of the maximum permitted by the minimum turning radius. In the field experiment, the algorithm successfully generated all required turn paths in real time as part of a complete autonomous coverage operation. The results demonstrate that the proposed algorithm is capable of generating feasible turn paths in real time for typical agricultural field operations with spatial constraints.
- 27 April 2026
- Published by Elsevier in SSRN Electronic Journal
Open AccessReal-time turn path planning with obstacle avoidance for autonomous agricultural field machines
Turn path planning is an essential component of autonomous agricultural field operations, where nonholonomic field machines must navigate between work swaths while respecting spatial constraints such as field boundaries and obstacles. This article presents a real-time turn path planning algorithm for autonomous agricultural field machines. The algorithm was designed to operate as part of a cooperative coverage path planning system in which multiple autonomous tractors perform sequentially dependent tasks simultaneously on the same field. The proposed algorithm is based on Hybrid A*, combining analytical Reeds-Shepp and Dubins path computation with a four-dimensional A* search, followed by gradient descent smoothing to achieve path feasibility. A state machine architecture was employed to meet the real-time constraint of a maximum of 100 ms per function call and 3 s of total computation time per turn path. The algorithm was evaluated through four experiments which include real-world field experiments with autonomous tractors. In the simulated obstacle-free experiment, the average computation time was 118 ms, which corresponds to approximately 4 % of the permitted maximum. The generated paths were feasible, with curvatures averaging approximately 60 % of the maximum permitted by the minimum turning radius. In the field experiment, the algorithm successfully generated all required turn paths in real time as part of a complete autonomous coverage operation. The results demonstrate that the proposed algorithm is capable of generating feasible turn paths in real time for typical agricultural field operations with spatial constraints.
- Open Access
- 6 April 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on AgriFood Electronics
- Vol. 4 (1) , 444-456
Optimized Coverage Map Representation for Bandwidth-Limited Data Exchange of Agricultural Vehicles
Sharing location-based data among multiple agricultural machines or with the cloud is a key enabler for cooperative farming in precision agriculture. Wireless communication is essential for real-time synchronization, but bandwidth remains limited, particularly when links are shared across multiple machines and applications. Reducing the amount of transmitted data is therefore a critical requirement. This article proposes an efficient message structure for coverage-map sharing, where polygons serve as the spatial representation of worked area. A globally applicable scaling method is developed to quantize geodetic coordinates at a user-defined resolution, independent of geographic location. In addition, polygon vertices are minimized without loss of relevant information and transmitted as relative coordinates using Google Protocol Buffers. Additional message-size reductions are achieved through optimized selection of a reference point for relative encoding, based on heuristics and a mixed-integer linear programming benchmark. Applied to a real-world dataset, the proposed approach achieves a compression ratio of $4.66$ compared to previous implementations at a resolution of $2 \,\text{c}\text{m}$. These results demonstrate the potential of the method to reduce bandwidth demands and enable robust multimachine and cloud-based cooperation in agriculture.
- 6 April 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on AgriFood Electronics
- Vol. 4 (1) , 444-456
Open AccessOptimized Coverage Map Representation for Bandwidth-Limited Data Exchange of Agricultural Vehicles
Sharing location-based data among multiple agricultural machines or with the cloud is a key enabler for cooperative farming in precision agriculture. Wireless communication is essential for real-time synchronization, but bandwidth remains limited, particularly when links are shared across multiple machines and applications. Reducing the amount of transmitted data is therefore a critical requirement. This article proposes an efficient message structure for coverage-map sharing, where polygons serve as the spatial representation of worked area. A globally applicable scaling method is developed to quantize geodetic coordinates at a user-defined resolution, independent of geographic location. In addition, polygon vertices are minimized without loss of relevant information and transmitted as relative coordinates using Google Protocol Buffers. Additional message-size reductions are achieved through optimized selection of a reference point for relative encoding, based on heuristics and a mixed-integer linear programming benchmark. Applied to a real-world dataset, the proposed approach achieves a compression ratio of $4.66$ compared to previous implementations at a resolution of $2 \,\text{c}\text{m}$. These results demonstrate the potential of the method to reduce bandwidth demands and enable robust multimachine and cloud-based cooperation in agriculture.
- Open Access
ISO FastLane: Faster ISO 11783 with Dual Stack Approach as a Short Term Solution
The agricultural industry has been searching for a high-speed successor to the 250~kbit/s CAN bus backbone of ISO~11783 (ISOBUS) for over a decade, yet no protocol-level solution has reached standardization. Meanwhile, modern planters, sprayers, and Virtual Terminals are already constrained by the bus bandwidth. This paper presents ISO FastLane, a gateway-less dual-stack approach that routes point-to-point ISOBUS traffic over Ethernet while keeping broadcast messages on the existing CAN bus. The solution requires no new state machines, no middleware, and no changes to application layer code: only a simple Layer~3 routing decision and a lightweight peer discovery mechanism called Augmented Address Claim (AACL). Legacy devices continue to operate unmodified and unaware of FastLane traffic. Preliminary tests reported on the paper demonstrate that ISO FastLane accelerates Virtual Terminal object pool uploads by factor of 8 and sustains Task Controller message rates over 100 times beyond the current specification limit. Because ISO FastLane builds entirely on existing J1939 and ISO~11783 conventions, it can be implemented by ISOBUS engineers in a matter of weeks. This is delivering tangible performance gains today, without waiting for the long-term High Speed ISOBUS solution.
Open AccessISO FastLane: Faster ISO 11783 with Dual Stack Approach as a Short Term Solution
The agricultural industry has been searching for a high-speed successor to the 250~kbit/s CAN bus backbone of ISO~11783 (ISOBUS) for over a decade, yet no protocol-level solution has reached standardization. Meanwhile, modern planters, sprayers, and Virtual Terminals are already constrained by the bus bandwidth. This paper presents ISO FastLane, a gateway-less dual-stack approach that routes point-to-point ISOBUS traffic over Ethernet while keeping broadcast messages on the existing CAN bus. The solution requires no new state machines, no middleware, and no changes to application layer code: only a simple Layer~3 routing decision and a lightweight peer discovery mechanism called Augmented Address Claim (AACL). Legacy devices continue to operate unmodified and unaware of FastLane traffic. Preliminary tests reported on the paper demonstrate that ISO FastLane accelerates Virtual Terminal object pool uploads by factor of 8 and sustains Task Controller message rates over 100 times beyond the current specification limit. Because ISO FastLane builds entirely on existing J1939 and ISO~11783 conventions, it can be implemented by ISOBUS engineers in a matter of weeks. This is delivering tangible performance gains today, without waiting for the long-term High Speed ISOBUS solution.
- Open Access
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on AgriFood Electronics
- p. 1-10
A Modular Building-Block Approach for Vehicle Kinematics of Tractor–Trailer Systems
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on AgriFood Electronics
- p. 1-10
Open AccessA Modular Building-Block Approach for Vehicle Kinematics of Tractor–Trailer Systems
- Open Access
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automation Science and Engineering
- Vol. 23, 1
Tractor-Sensor-Independent Real-Time State Estimation for Agricultural Trailers
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automation Science and Engineering
- Vol. 23, 1
Open AccessTractor-Sensor-Independent Real-Time State Estimation for Agricultural Trailers