DeepAI AI Chat
Log In Sign Up

Multi-Agent Continuous Transportation with Online Balanced Partitioning

by   Chao Wang, et al.
National University of Singapore
Agency for Science, Technology and Research

We introduce the concept of continuous transportation task to the context of multi-agent systems. A continuous transportation task is one in which a multi-agent team visits a number of fixed locations, picks up objects, and delivers them to a final destination. The goal is to maximize the rate of transportation while the objects are replenished over time. Examples of problems that need continuous transportation are foraging, area sweeping, and first/last mile problem. Previous approaches typically neglect the interference and are highly dependent on communications among agents. Some also incorporate an additional reconnaissance agent to gather information. In this paper, we present a hybrid of centralized and distributed approaches that minimize the interference and communications in the multi-agent team without the need for a reconnaissance agent. We contribute two partitioning-transportation algorithms inspired by existing algorithms, and contribute one novel online partitioning-transportation algorithm with information gathering in the multi-agent team. Our algorithms have been implemented and tested extensively in the simulation. The results presented in this paper demonstrate the effectiveness of our algorithms that outperform the existing algorithms, even without any communications between the agents and without the presence of a reconnaissance agent.


page 1

page 2


Automatic Algorithm Selection In Multi-agent Pathfinding

In a multi-agent pathfinding (MAPF) problem, agents need to navigate fro...

Attrition-Aware Adaptation for Multi-Agent Patrolling

Multi-agent patrolling is a key problem in a variety of domains such as ...

Distributed Heuristic Forward Search for Multi-Agent Systems

This paper describes a number of distributed forward search algorithms f...

Ergodic Control Strategy for Multi-Agent Environment Exploration

In this study, an ergodic environment exploration problem is introduced ...

Cooperative Pathfinding based on memory-efficient Multi-agent RRT*

In cooperative pathfinding problems, no-conflicts paths that bring sever...

Combinatorial-hybrid Optimization for Multi-agent Systems under Collaborative Tasks

Multi-agent systems can be extremely efficient when working concurrently...