Efficient multi-agent task allocation for collaborative route planning with multiple unmanned vehicles

S Yoon, J Kim - IFAC-PapersOnLine, 2017 - Elsevier
Collaborative operation with multiple unmanned systems has drawn significant research
attention as the technology for the operation of a single unmanned system have gradually …

Collaborative mission and route planning of multi-vehicle systems for autonomous search in marine environment

S Yoon, H Do, J Kim - International Journal of Control, Automation and …, 2020 - Springer
As the impact and complexity of disasters, either natural or man-made, have increased,
collaborative operation of a group of unmanned vehicles attracts much attention for effective …

Robust Task Allocation for Multiple Cooperative Robotic Vehicles Considering Node Position Uncertainty

S Yoon, H Do, J Kim - Journal of Intelligent & Robotic Systems, 2022 - Springer
In order for an effective and efficient collaboration among multiple vehicles to be possible,
task allocation is essential. In general, task allocation algorithms assume constant costs and …

Heuristic Greedy-Gradient Route Search Method for Finding an Optimal Traffic Distribution in Telecommunication Networks

K Gaipov, D Tausnev, S Khodenkov, N Shepeta… - Algorithms, 2023 - mdpi.com
Rapid growth in the volume of transmitted information has lead to the emergence of new
wireless networking technologies with variable heterogeneous topologies. With limited radio …

Fleet size optimization and collaborative route planning for multi-vehicle task allocation

S Yoon, J Kim - AIAA Scitech 2019 Forum, 2019 - arc.aiaa.org
A= dummy agent nodes Ea= set of the edges C= cost matrix Cm= modified-cost matrix D=
set of the deactivated edges NOF= number of the optimal fleet Na= number of the agents Nt …

A constraint-based parallel local search for the edge-disjoint rooted distance-constrained minimum spanning tree problem

A Arbelaez, D Mehta, B O'Sullivan, L Quesada - Journal of Heuristics, 2018 - Springer
Many network design problems arising in areas as diverse as VLSI circuit design, QoS
routing, traffic engineering, and computational sustainability require clients to be connected …

Constraint-based local search for finding node-disjoint bounded-paths in optical access networks

A Arbelaez, D Mehta, B O'Sullivan - … , CP 2015, Cork, Ireland, August 31 …, 2015 - Springer
Mass deployment of fibre access networks is without doubt one of the goals of many network
operators around the globe. The Passive Optical Network has been proposed as a solution …

Parallel constraint-based local search: an application to designing resilient long-reach passive optical networks

A Arbelaez, D Mehta, B O'Sullivan… - Handbook of Parallel …, 2018 - Springer
Many network design problems arising in areas as diverse as VLSI circuit design, QoS
routing, traffic engineering, and computational sustainability require clients to be connected …

Learning a Stopping Criterion for Local Search

A Arbelaez, B O'Sullivan - International Conference on Learning and …, 2016 - Springer
Local search is a very effective technique to tackle combinatorial problems in multiple areas
ranging from telecommunications to transportations, and VLSI circuit design. A local search …

[PDF][PDF] Distributed Local Search Based on a Parallel Neighborhood Exploration for the Rooted Distance-Constrained Minimum Spanning-Tree Problem

CDL Quintana - 2019 - researchgate.net
Optimization problems can be formulated in terms of finding and choosing a solution that
maximizes a set of criteria, among a set of candidate solutions. A local search is a heuristic …