Design of Port Positions Based on Self-organizing Maps for Travel Path of Mobile Robots in a Logistics Warehouse

This study proposes an algorithm for optimizing port (loading points) placement in logistics warehouses to prevent collisions and improve mobile robot navigation. The proposed approach uses a self-organizing map (SOM) to iteratively adjust node positions and eliminate edge intersections in non-uniform planar graphs. A counter clockwise (CCW) algorithm ensures accurate intersection detection, while a maintain node distance (MND) algorithm prevents node overlap and enhances visual readability. Simulation results confirm that the approach effectively removes initial edge intersections and improves overall graph layout. This study proposes a novel framework for addressing non-uniform planar graph challenges with practical implications for warehouse automation and robot path optimization.

Authors

Publication Details

Journal
Journal of Institute of Control Robotics and Systems
Published
2025-10-15
DOI
https://doi.org/10.5302/j.icros.2025.25.0169
Primary Topic
Advanced Manufacturing and Logistics Optimization
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Design of Port Positions Based on Self-organizing Maps for Travel Path of Mobile Robots in a Logistics Warehouse

G Cho, Dong-Hun Kim
Journal of Institute of Control Robotics and Systems
Advanced Manufacturing and Logistics Optimization
article

Design of Port Positions Based on Self-organizing Maps for Travel Path of Mobile Robots in a Logistics Warehouse

G Cho, Dong-Hun Kim
article en

Abstract

This study proposes an algorithm for optimizing port (loading points) placement in logistics warehouses to prevent collisions and improve mobile robot navigation. The proposed approach uses a self-organizing map (SOM) to iteratively adjust node positions and eliminate edge intersections in non-uniform planar graphs. A counter clockwise (CCW) algorithm ensures accurate intersection detection, while a maintain node distance (MND) algorithm prevents node overlap and enhances visual readability. Simulation results confirm that the approach effectively removes initial edge intersections and improves overall graph layout. This study proposes a novel framework for addressing non-uniform planar graph challenges with practical implications for warehouse automation and robot path optimization.

Journal of Institute of Control Robotics and SystemsVol. 31(10)
Openalex Percentile: Top 59%
Advanced Manufacturing and Logistics Optimization
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.