Flexible Path Planning for Multi-Agent Field Observation

This paper proposes a flexible path-planning method for conducting agricultural observation tasks using multiple autonomous guided vehicles. The observation task was formulated as the rural postman problem by graphing the agricultural field to be observed and assigning costs to mandatory and optional paths. The observation area was re-divided according to the progress of each robot’s work, and the latest path was planned to minimize the difference between the working time of individual robots, thereby reducing the overall working time. Simulations were conducted to verify the influence of the parameters used in the proposed method. The effect of workload adjustment on progress delay was verified, and the increase in overall working time owing to delay was reduced by an average of 32.9%. A performance comparison was conducted using Google OR-Tools, software specialized for combinatorial optimization. Superior solutions with shorter computation times were obtained using the proposed method.

Authors

Institutions

Publication Details

Journal
Journal of Robotics and Mechatronics
Published
2024-10-19
DOI
https://doi.org/10.20965/jrm.2024.p1262
Primary Topic
Robotic Path Planning Algorithms
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Flexible Path Planning for Multi-Agent Field Observation

Takashi Kawamura, T. Kobayashi
Journal of Robotics and Mechatronics
Robotic Path Planning Algorithms
article

Flexible Path Planning for Multi-Agent Field Observation

Takashi Kawamura, T. Kobayashi
article en

Abstract

This paper proposes a flexible path-planning method for conducting agricultural observation tasks using multiple autonomous guided vehicles. The observation task was formulated as the rural postman problem by graphing the agricultural field to be observed and assigning costs to mandatory and optional paths. The observation area was re-divided according to the progress of each robot’s work, and the latest path was planned to minimize the difference between the working time of individual robots, thereby reducing the overall working time. Simulations were conducted to verify the influence of the parameters used in the proposed method. The effect of workload adjustment on progress delay was verified, and the increase in overall working time owing to delay was reduced by an average of 32.9%. A performance comparison was conducted using Google OR-Tools, software specialized for combinatorial optimization. Superior solutions with shorter computation times were obtained using the proposed method.

Journal of Robotics and MechatronicsVol. 36(5)
Shinshu University (JP)
Japan Science and Technology Agency
Openalex Percentile: Top 82%
Robotic Path Planning Algorithms
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Flexible Path Planning for Multi-Agent Field Observation — Takashi Kawamura, T. Kobayashi · Journal of Robotics and Mechatronics (2024) | TGRS Research Map | TGRS