The Viability of Domain Constrained Coalition Formation for Robotic Collectives

• URL: http://arxiv.org/abs/2306.05590v1
• Date: Thu, 8 Jun 2023 23:28:41 GMT
• Title: The Viability of Domain Constrained Coalition Formation for Robotic Collectives
• Authors: Grace Diehl and Julie A. Adams
• Abstract summary: Military and disaster response applications can benefit from robotic collectives' ability to perform multiple cooperative tasks. Coalition formation algorithms can potentially facilitate collective robots' assignment to appropriate task teams. This manuscript identifies the challenges inherent to designing coalition formation algorithms for very large collectives.
• Score: 0.0
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: Applications, such as military and disaster response, can benefit from robotic collectives' ability to perform multiple cooperative tasks (e.g., surveillance, damage assessments) efficiently across a large spatial area. Coalition formation algorithms can potentially facilitate collective robots' assignment to appropriate task teams; however, most coalition formation algorithms were designed for smaller multiple robot systems (i.e., 2-50 robots). Collectives' scale and domain-relevant constraints (i.e., distribution, near real-time, minimal communication) make coalition formation more challenging. This manuscript identifies the challenges inherent to designing coalition formation algorithms for very large collectives (e.g., 1000 robots). A survey of multiple robot coalition formation algorithms finds that most are unable to transfer directly to collectives, due to the identified system differences; however, auctions and hedonic games may be the most transferable. A simulation-based evaluation of three auction and hedonic game algorithms, applied to homogeneous and heterogeneous collectives, demonstrates that there are collective compositions for which no existing algorithm is viable; however, the experimental results and literature survey suggest paths forward.

Related papers

• Heterogeneous Robot Collaboration in Unstructured Environments with Grounded Generative Intelligence [54.91177026001217]
  Large language model (LLM)-enabled teaming methods typically assume well-structured and known environments.<n>We present SPINE-HT, a framework that addresses these limitations by grounding the reasoning abilities of LLMs in the context of a heterogeneous robot team.<n>Our framework achieves nearly twice the success rate compared to prior LLM-enabled heterogeneous teaming approaches.
  arXiv  Detail & Related papers  (2025-10-30T18:24:38Z)
• When Disagreements Elicit Robustness: Investigating Self-Repair Capabilities under LLM Multi-Agent Disagreements [56.29265568399648]
  We argue that disagreements prevent premature consensus and expand the explored solution space.<n>Disagreements on task-critical steps can derail collaboration depending on the topology of solution paths.
  arXiv  Detail & Related papers  (2025-02-21T02:24:43Z)
• A Multiagent Path Search Algorithm for Large-Scale Coalition Structure Generation [61.08720171136229]
  Coalition structure generation is a fundamental computational problem in multiagent systems. We develop SALDAE, a multiagent path finding algorithm for CSG that operates on a graph of coalition structures.
  arXiv  Detail & Related papers  (2025-02-14T15:21:27Z)
• Capability-Aware Shared Hypernetworks for Flexible Heterogeneous Multi-Robot Coordination [2.6590401523087634]
  We propose Capability-Aware Shared Hypernetworks (CASH) for multi-robot teams.<n>CASH is a soft weight sharing architecture that uses hypernetworks to efficiently learn a flexible shared policy.<n>We show that CASH consistently outperforms baseline architectures in terms of performance and sample efficiency during both training and zero-shot generalization.
  arXiv  Detail & Related papers  (2025-01-10T15:39:39Z)
• Generalizability of Graph Neural Networks for Decentralized Unlabeled Motion Planning [72.86540018081531]
  Unlabeled motion planning involves assigning a set of robots to target locations while ensuring collision avoidance. This problem forms an essential building block for multi-robot systems in applications such as exploration, surveillance, and transportation. We address this problem in a decentralized setting where each robot knows only the positions of its $k$-nearest robots and $k$-nearest targets.
  arXiv  Detail & Related papers  (2024-09-29T23:57:25Z)
• COHERENT: Collaboration of Heterogeneous Multi-Robot System with Large Language Models [49.24666980374751]
  COHERENT is a novel LLM-based task planning framework for collaboration of heterogeneous multi-robot systems. A Proposal-Execution-Feedback-Adjustment mechanism is designed to decompose and assign actions for individual robots. The experimental results show that our work surpasses the previous methods by a large margin in terms of success rate and execution efficiency.
  arXiv  Detail & Related papers  (2024-09-23T15:53:41Z)
• Robotic warehousing operations: a learn-then-optimize approach to large-scale neighborhood search [84.39855372157616]
  This paper supports robotic parts-to-picker operations in warehousing by optimizing order-workstation assignments, item-pod assignments and the schedule of order fulfillment at workstations. We solve it via large-scale neighborhood search, with a novel learn-then-optimize approach to subproblem generation. In collaboration with Amazon Robotics, we show that our model and algorithm generate much stronger solutions for practical problems than state-of-the-art approaches.
  arXiv  Detail & Related papers  (2024-08-29T20:22:22Z)
• LPAC: Learnable Perception-Action-Communication Loops with Applications to Coverage Control [80.86089324742024]
  We propose a learnable Perception-Action-Communication (LPAC) architecture for the problem. CNN processes localized perception; a graph neural network (GNN) facilitates robot communications. Evaluations show that the LPAC models outperform standard decentralized and centralized coverage control algorithms.
  arXiv  Detail & Related papers  (2024-01-10T00:08:00Z)
• GRAPE-S: Near Real-Time Coalition Formation for Multiple Service Collectives [0.0]
  This manuscript integrates GRAPE and a services model, producing GRAPE-S and Pair-GRAPE-S. GRAPE-S satisfies the target domains' coalition formation requirements, producing near optimal solutions in near real-time. Pair-GRAPE-S more than satisfies the domain requirements, producing optimal solutions in near real-time.
  arXiv  Detail & Related papers  (2023-10-19T05:36:00Z)
• Communication-Efficient Reinforcement Learning in Swarm Robotic Networks for Maze Exploration [2.958532752589616]
  Communication is key to the successful coordination of swarm robots. This paper proposes a new communication-efficient decentralized cooperative reinforcement learning algorithm for coordinating swarm robots.
  arXiv  Detail & Related papers  (2023-05-26T16:56:00Z)
• Among Us: Adversarially Robust Collaborative Perception by Consensus [50.73128191202585]
  Multiple robots could perceive a scene (e.g., detect objects) collaboratively better than individuals. We propose ROBOSAC, a novel sampling-based defense strategy generalizable to unseen attackers. We validate our method on the task of collaborative 3D object detection in autonomous driving scenarios.
  arXiv  Detail & Related papers  (2023-03-16T17:15:25Z)
• Decentralised construction of a global coordinate system in a large swarm of minimalistic robots [0.8701566919381223]
  In this study, we present an algorithm to enable positional self-awareness in a swarm of minimalistic error-prone robots. Despite being unable to measure the bearing of incoming messages, the robots running our algorithm can calculate their position within a swarm deployed in a regular formation. Our solution has fewer requirements than state-of-the-art algorithms and contains collective noise-filtering mechanisms.
  arXiv  Detail & Related papers  (2023-02-28T14:14:17Z)
• AdverSAR: Adversarial Search and Rescue via Multi-Agent Reinforcement Learning [4.843554492319537]
  We propose an algorithm that allows robots to efficiently coordinate their strategies in the presence of adversarial inter-agent communications. It is assumed that the robots have no prior knowledge of the target locations, and they can interact with only a subset of neighboring robots at any time. The effectiveness of our approach is demonstrated on a collection of prototype grid-world environments.
  arXiv  Detail & Related papers  (2022-12-20T08:13:29Z)
• Leveraging Sequentiality in Reinforcement Learning from a Single Demonstration [68.94506047556412]
  We propose to leverage a sequential bias to learn control policies for complex robotic tasks using a single demonstration. We show that DCIL-II can solve with unprecedented sample efficiency some challenging simulated tasks such as humanoid locomotion and stand-up.
  arXiv  Detail & Related papers  (2022-11-09T10:28:40Z)
• Bi-Manual Manipulation and Attachment via Sim-to-Real Reinforcement Learning [23.164743388342803]
  We study how to solve bi-manual tasks using reinforcement learning trained in simulation. We also discuss modifications to our simulated environment which lead to effective training of RL policies. In this work, we design a Connect Task, where the aim is for two robot arms to pick up and attach two blocks with magnetic connection points.
  arXiv  Detail & Related papers  (2022-03-15T21:49:20Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.