On the public citation graph

Multi-Level Partitioning and Distribution of the Assignment Problem for Large-Scale Multi-Robot Task Allocation

https://doi.org/10.15607/rss.2011.vii.026

0 signed · 63 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.

Claim with ORCID

Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.

See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/j.1538-7305.1970.tb01770.xopenalex-snapshot

An Efficient Heuristic Procedure for Partitioning Graphs

inferredcites →https://doi.org/10.1002/nav.20053openalex-snapshot

The Hungarian method for the assignment problem

inferredcites →https://doi.org/10.1002/nav.3800020109openalex-snapshot

The Hungarian method for the assignment problem

inferredcites →https://doi.org/10.1007/4-431-35881-1_10openalex-snapshot

Comparative Study of Market-Based and Threshold-Based Task Allocation

inferredcites →https://doi.org/10.1007/978-1-4613-8369-7_3openalex-snapshot

Automatic Mesh Partitioning

inferredcites →https://doi.org/10.1007/bfb0018528openalex-snapshot

Partitioning sparse rectangular matrices for parallel processing

inferredcites →https://doi.org/10.1016/j.ins.2006.05.004openalex-snapshot

Incremental assignment problem

inferredcites →https://doi.org/10.1016/j.sysarc.2007.10.001openalex-snapshot

A multilevel partitioning approach for efficient tasks allocation in heterogeneous distributed systems

inferredcites →https://doi.org/10.1016/s0167-8191(05)80062-6openalex-snapshot

Parallel synchronous and asynchronous implementations of the auction algorithm

inferredcites →https://doi.org/10.1109/71.780863openalex-snapshot

Hypergraph-partitioning-based decomposition for parallel sparse-matrix vector multiplication

inferredcites →https://doi.org/10.1109/cdc.2008.4739098openalex-snapshot

A distributed auction algorithm for the assignment problem

inferredcites →https://doi.org/10.1109/ipps.1995.395965openalex-snapshot

Geometric mesh partitioning: implementation and experiments

inferredcites →https://doi.org/10.1109/iros.2003.1248932openalex-snapshot

Robot exploration with combinatorial auctions

inferredcites →https://doi.org/10.1109/jproc.2006.876939openalex-snapshot

Market-Based Multirobot Coordination: A Survey and Analysis

inferredcites →https://doi.org/10.1109/robot.2005.1570374openalex-snapshot

Path Planning for Permutation-Invariant Multi-Robot Formations

inferredcites →https://doi.org/10.1109/robot.2007.363990openalex-snapshot

A Complete Methodology for Generating Multi-Robot Task Solutions using ASyMTRe-D and Market-Based Task Allocation

inferredcites →https://doi.org/10.1109/tac.2009.2026926openalex-snapshot

Monotonic Target Assignment for Robotic Networks

inferredcites →https://doi.org/10.1109/tro.2006.878952openalex-snapshot

Path planning for permutation-invariant multirobot formations

inferredcites →https://doi.org/10.1109/tro.2007.913992openalex-snapshot

Dynamic Assignment in Distributed Motion Planning With Local Coordination

inferredcites →https://doi.org/10.1137/0611030openalex-snapshot

Partitioning Sparse Matrices with Eigenvectors of Graphs

inferredcites →https://doi.org/10.1137/s1064827502401953openalex-snapshot

Permuting Sparse Rectangular Matrices into Block-Diagonal Form

inferredcites →https://doi.org/10.1137/s1064827594275339openalex-snapshot

Geometric Mesh Partitioning: Implementation and Experiments

inferredcites →https://doi.org/10.1137/s1064827595287997openalex-snapshot

A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs

inferredcites →https://doi.org/10.1137/s1064827598341475openalex-snapshot

Partitioning Rectangular and Structurally Unsymmetric Sparse Matrices for Parallel Processing

inferredcites →https://doi.org/10.1145/224170.224228openalex-snapshot

A multilevel algorithm for partitioning graphs

inferredcites →https://doi.org/10.1145/502512.502550openalex-snapshot

Co-clustering documents and words using bipartite spectral graph partitioning

inferredcites →https://doi.org/10.1145/800119.803884openalex-snapshot

Some simplified NP-complete problems

inferredcites →https://doi.org/10.1145/800263.809204openalex-snapshot

A linear-time heuristic for improving network partitions

inferredcites →https://doi.org/10.1177/0278364904045564openalex-snapshot

A Formal Analysis and Taxonomy of Task Allocation in Multi-Robot Systems

inferredcites →https://doi.org/10.1177/0278364911404579openalex-snapshot

Assessing optimal assignment under uncertainty: An interval-based algorithm

inferredcites →https://doi.org/10.1201/9781420010749-71openalex-snapshot

Hypergraph Partitioning and Clustering

inferredcites →https://doi.org/10.1201/9781420010749.ch61openalex-snapshot

Hypergraph Partitioning and Clustering

inferredcites →https://doi.org/10.1287/inte.20.4.133openalex-snapshot

The Auction Algorithm for Assignment and Other Network Flow Problems: A Tutorial

inferredcites →https://doi.org/10.15607/rss.2010.vi.016openalex-snapshot

Assessing Optimal Assignment under Uncertainty: An Interval-based Algorithm

inferredcites →https://doi.org/10.21236/ada526116openalex-snapshot

Market-Based Multirobot Coordination: A Survey and Analysis

inferredcites →https://doi.org/10.2172/1436openalex-snapshot

Partitioning Rectangular and Structurally Nonsymmetric Sparse Matrices for Parallel Processing

inferredcites →https://doi.org/10.2172/658436openalex-snapshot

Partitioning sparse rectangular matrices for parallel processing

inferredcites →https://doi.org/10.7551/mitpress/9123.003.0020openalex-snapshot

Assessing Optimal Assignment under Uncertainty: An Interval-based Algorithm

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-3-031-47444-6_6openalex-snapshot

Problem Statement of Network Science-Based Process Optimization

inferred← citeshttps://doi.org/10.1007/978-3-319-40159-1_17openalex-snapshot

Negotiating and Executing Composite Tasks for QoS-Aware Teams of Robots

inferred← citeshttps://doi.org/10.1007/978-3-642-25832-9_42openalex-snapshot

Sequential Single-Cluster Auctions for Robot Task Allocation

inferred← citeshttps://doi.org/10.1007/978-3-642-36279-8_11openalex-snapshot

Trajectory Planning and Assignment in Multirobot Systems

inferred← citeshttps://doi.org/10.1007/978-981-15-5243-4_44openalex-snapshot

A Distributed Solution to the Multi-robot Task Allocation Problem Using Ant Colony Optimization and Bat Algorithm

inferred← citeshttps://doi.org/10.1007/s10514-014-9412-1openalex-snapshot

Goal assignment and trajectory planning for large teams of interchangeable robots

inferred← citeshttps://doi.org/10.1007/s10514-018-9742-5openalex-snapshot

Solving the task variant allocation problem in distributed robotics

inferred← citeshttps://doi.org/10.1016/j.automatica.2019.108670openalex-snapshot

Multi-agent coordination over local indexes via clique-based distributed assignment

inferred← citeshttps://doi.org/10.1016/j.jpdc.2012.09.019openalex-snapshot

Parallel partitioning for distributed systems using sequential assignment

inferred← citeshttps://doi.org/10.1016/j.robot.2013.06.007openalex-snapshot

Decentralized task allocation for surveillance systems with critical tasks

inferred← citeshttps://doi.org/10.1109/icra.2012.6224917openalex-snapshot

Decentralized multi-robot cooperation with auctioned POMDPs

inferred← citeshttps://doi.org/10.1109/icra.2013.6630671openalex-snapshot

Concurrent assignment and planning of trajectories for large teams of interchangeable robots

inferred← citeshttps://doi.org/10.1109/icra.2014.6907857openalex-snapshot

Decentralized goal assignment and trajectory generation in multi-robot networks: A multiple Lyapunov functions approach

inferred← citeshttps://doi.org/10.1109/robio.2012.6491200openalex-snapshot

Decentralized task allocation for heterogeneous agent systems with constraints on agent capacity and critical tasks

inferred← citeshttps://doi.org/10.1109/tac.2019.2946333openalex-snapshot

Decentralized Goal Assignment and Safe Trajectory Generation in Multirobot Networks via Multiple Lyapunov Functions

inferred← citeshttps://doi.org/10.1109/tcyb.2016.2519525openalex-snapshot

A Hierarchical Auction-Based Mechanism for Real-Time Resource Allocation in Cloud Robotic Systems

inferred← citeshttps://doi.org/10.1155/2013/483095openalex-snapshot

Task Allocation and Path Planning for Collaborative Autonomous Underwater Vehicles Operating through an Underwater Acoustic Network

inferred← citeshttps://doi.org/10.1177/0278364913483345openalex-snapshot

Decentralized multi-robot cooperation with auctioned POMDPs

inferred← citeshttps://doi.org/10.1177/0278364913515307openalex-snapshot

C apt : Concurrent assignment and planning of trajectories for multiple robots

inferred← citeshttps://doi.org/10.15607/rss.2013.ix.030openalex-snapshot

Goal Assignment and Trajectory Planning for Large Teams of Aerial Robots

inferred← citeshttps://doi.org/10.15607/rss.2013.ix.033openalex-snapshot

Optimal Market-based Multi-Robot Task Allocation via Strategic Pricing

inferred← citeshttps://doi.org/10.15607/rss.2019.xv.002openalex-snapshot

Efficient Algorithms for Optimal Perimeter Guarding

inferred← citeshttps://doi.org/10.1609/aaai.v28i1.9053openalex-snapshot

Minimising Undesired Task Costs in Multi-Robot Task Allocation Problems with In-Schedule Dependencies

inferred← citeshttps://doi.org/10.3233/ia-150087openalex-snapshot

QoS-aware task distribution to a team of robots: an healthcare case study

inferred← citeshttps://doi.org/10.3390/robotics4030316openalex-snapshot

A Spatial Queuing-Based Algorithm for Multi-Robot Task Allocation

Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.