Adeyinka Adedigba

Dr. Adeyinka Adedigba


Research Focus & Metrics

Academic Career Length

2Years (2025-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
21 January 2026 in Multimedia Tools and Applications
Verified
Journal Article
Closed access
PDF file
IFIvan Fenyom
Ivan Fenyom
AAAdeyinka Adedigba
Adeyinka Adedigba
DDDaison Darlan
Daison Darlan
OAOladayo S. Ajani
Oladayo S. Ajani
Rammohan MallipeddiRammohan Mallipeddi
Rammohan Mallipeddi
HJHwang Jae Joon
Hwang Jae Joon

25 December 2025 in arXiv
Verified
Preprint
Open access
PDF file
ZGzikun Guo
zikun Guo
AAAdeyinka Adedigba
Adeyinka Adedigba
Rammohan MallipeddiRammohan Mallipeddi
Rammohan Mallipeddi
Heoncheol LeeHeoncheol Lee
Heoncheol Lee
Multi-robot path planning is a fundamental yet challenging problem due to its combinatorial complexity and the need to balance global efficiency with fair task allocation among robots. Traditional swarm intelligence methods, although effective on small instances, often converge prematurely and struggle to scale to complex environments. In this work, we present a structure-induced exploration framework that integrates structural priors into the search process of the ant colony optimization (ACO). The approach leverages the spatial distribution of the task to induce a structural prior at initialization, thereby constraining the search space. The pheromone update rule is then designed to emphasize structurally meaningful connections and incorporates a load-aware objective to reconcile the total travel distance with individual robot workload. An explicit overlap suppression strategy further ensures that tasks remain distinct and balanced across the team. The proposed framework was validated on diverse benchmark scenarios covering a wide range of instance sizes and robot team configurations. The results demonstrate consistent improvements in route compactness, stability, and workload distribution compared to representative metaheuristic baselines. Beyond performance gains, the method also provides a scalable and interpretable framework that can be readily applied to logistics, surveillance, and search-and-rescue applications where reliable large-scale coordination is essential.