Modeling and Optimizing the Provisioning of Exhaustible Capabilities for Simultaneous Task Allocation and Scheduling

Jinwoo Park, Harish Ravichandar, Seth Hutchinson
2/14/2026
cs.ROcs.MA

No official code found. Best implementation: jinwoop/TRAITS (1 star, GPL-3.0, last commit 2026-01-29).

Abstract

Deploying heterogeneous robot teams to accomplish multiple tasks over extended time horizons presents significant computational challenges for task allocation and planning. In this paper, we present a comprehensive, time-extended, offline heterogeneous multi-robot task allocation framework, TRAITS, which we believe to be the first that can cope with the provisioning of exhaustible traits under battery and temporal constraints. Specifically, we introduce a nonlinear programming-based trait distribution module that can optimize the trait-provisioning rate of coalitions to yield feasible and time-efficient solutions. TRAITS provides a more accurate feasibility assessment and estimation of task execution times and makespan by leveraging trait-provisioning rates while optimizing battery consumption -- an advantage that state-of-the-art frameworks lack. We evaluate TRAITS against two state-of-the-art frameworks, with results demonstrating its advantage in satisfying complex trait and battery requirements while remaining computationally tractable.

View on arXivView PDF

Code Implementations(1)

jinwoop/TRAITSCommunity67%
GPL-3.0

Modeling and Optimizing the Provisioning of Exhaustible Capabilities for Simultaneous Task Allocation and Scheduling | AAMAS 2026

11C++, CMakeJan 24, 20268 months agoGPL-3.0

Similar Papers

Cite this paper

@article{park2026modeling,
  title  = {Modeling and Optimizing the Provisioning of Exhaustible Capabilities for Simultaneous Task Allocation and Scheduling},
  author = {Jinwoo Park and Harish Ravichandar and Seth Hutchinson},
  year   = {2026},
  eprint = {2602.13866},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2602.13866v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2602.13866.svg)](https://codeofpaper.com/paper/2602.13866)

Discussion