Sep 2026· International Journal of Intelligent Unmanned Systems· 0 citations· 25 references
TL;DR
A lightweight arbitration mechanism that guarantees bounded unfairness for autonomous agents in warehouse logistics and urban unmanned systems is proposed, providing a deterministic finite-time worst-case fairness guarantee that holds for every agent at every moment.
Abstract
This paper addresses repeated unfairness in multi-robot coordination, where the same agents may repeatedly yield at shared bottlenecks, leading to missed deadlines, reduced throughput, and safety violations. The purpose is to propose a lightweight arbitration mechanism that guarantees bounded unfairness for autonomous agents in warehouse logistics and urban unmanned systems.
Each robot maintains a bounded local credit state that increases after yielding and decreases after passing. During every contention event, robots are ranked according to their credit values, with deterministic ID-based tie-breaking used when credits are equal. A finite-time theoretical analysis is developed to derive an explicit worst-case bound on cumulative cost disparity between any pair of robots. The proposed method is evaluated through numerical simulations involving corridor- and intersection-style contention scenarios and is further validated through deployment on a TI LaunchXL-F28379D embedded controller. Experimental measurements demonstrate an average execution latency of 2.738 µs over 1,000 arbitration events, confirming the feasibility of real-time edge deployment.
The proposed mechanism guarantees that the cumulative cost difference between any two robots remains uniformly bounded regardless of interaction history, preventing persistent unfairness and starvation. Simulation results demonstrate lower unfairness than representative baseline methods while requiring only a bounded integer credit state and minimal communication, making the approach suitable for practical warehouse and autonomous traffic applications.
Unlike existing approaches that provide fairness only in expectation or at equilibrium, this work provides a deterministic finite-time worst-case fairness guarantee that holds for every agent at every moment. The mechanism is parameter-insensitive, requires minimal communication, and integrates into existing robot software stacks without hardware modifications, offering practical value for real-world unmanned systems.
A novel way is presented to characterize collective belief dynamics as a discrete-time switched system in which communication topologies have distinct consensus-contraction rates and token costs, and defines a consensus safe set that jointly captures agreement and resource feasibility.
Numerical results show that the proposed model predictive control (MPC) scheduler achieves the best trade-off between control performance and communication cost, while the auction-based scheduler attains performance close to MPC with substantially lower computational complexity.
The O-RAN control plane is becoming agentic: autonomous AI agents, deployed as rApps by different vendors, independently close control loops over shared radio resources. We demonstrate on a live O-RAN system that this independence is unsafe. Two agents with individually correct objectives, one protecting a latency SLA...
The effectiveness of the suggested strategy in conserving network resources without sacrificing system stability is validated by simulation results for a heterogeneous MAS with two second–order and two first–order agents, which show that all agent states converge to common values while the number of information transmi...
Muhammad Shamrooz Aslam, Wen-Jer Chang, Hazrat Bilal et al.· Computer Modeling in Enginee...· 0 citations
DART (Deadline-Aware Rapid Target-swapping), a highly scalable rule-based framework for AMAPFwID, which employs an Excess Time heuristic that prioritizes agents based on their temporal slack, guiding the search toward deadline-feasible configurations.
Sahar Badri, Serafino Cicerone, A. Di Fonso· Proceedings of the Internati...· 0 citations
It is established that CC-OPI terminates in finite time, free of stale-completion deadlock and of unbounded reassignment within the mission horizon, and within the tested settings, CC-OPI degrades gracefully as connectivity weakens and absorbs packet loss, terrain occlusion, and runtime task arrival.
Biao Liu, Tong Zhang· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.