Have a personal or library account? Click to login
3K Method: Time-optimal Path Planning for Field Robot Cover

3K Method: Time-optimal Path Planning for Field Robot

Acta Mechanica et Automatica
Volume 19 (2025): Issue 1 (March 2025)
By: Konrad K. Kwaśniewski and  Zdzisław Gosiewski  
Open Access
|Mar 2025

Figures & Tables

Fig. 1.

Flowchart of 3K method
Flowchart of 3K method

Fig. 2.

Example of map model
Example of map model

Fig. 3.

Example of collision detection between B-spline and circle-shaped obstacles
Example of collision detection between B-spline and circle-shaped obstacles

Fig. 4.

Visualization of the collision depth
Visualization of the collision depth

Fig. 5.

Flowchart of the local path finding method
Flowchart of the local path finding method

Fig. 6.

Visualization of local path computation
Visualization of local path computation
DOI: https://doi.org/10.2478/ama-2025-0020 | Journal eISSN: 2300-5319 | Journal ISSN: 1898-4088
Journal RSS Feed
Language: English
Page range: 172 - 176
Submitted on: Oct 10, 2023
Accepted on: Jul 25, 2024
Published on: Mar 31, 2025
Published by: Bialystok University of Technology
In partnership with: Paradigm Publishing Services
Publication frequency: 4 issues per year
Keywords:
mobile robot,
path planning,
path optimization,
robot rover,
autonomous,
genetic algorithm
Related subjects:
Engineering,
Electrical engineering,
Electronics,
Mechanical engineering,
Mechanics,
Bioengineering and biomedical engineering,
Biomechanics,
Civil engineering,
Environmental engineering

© 2025 Konrad K. Kwaśniewski, Zdzisław Gosiewski, published by Bialystok University of Technology
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.

Previous articleVolume 19 (2025): Issue 1 (March 2025)