On the public citation graph

Priority-Aware Coalition Formation using Simulated Annealing under Temporal Constraints

0 signed · 29 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.1007/s10846-016-0416-2openalex-snapshot
FAST
inferredcites →https://doi.org/10.1007/s10846-025-02287-4openalex-snapshot
CF-HMRTA: Coalition Formation for Heterogeneous Multi-Robot Task Allocation
inferredcites →https://doi.org/10.1007/s11370-021-00363-wopenalex-snapshot
Coordination of multi-robot path planning for warehouse application using smart approach for identifying destinations
inferredcites →https://doi.org/10.1007/s11721-022-00213-0openalex-snapshot
Sample greedy based task allocation for multiple robot systems
inferredcites →https://doi.org/10.1007/s43684-021-00017-9openalex-snapshot
Task scheduling for transport and pick robots in logistics: a comparative study on constructive heuristics
inferredcites →https://doi.org/10.1016/j.robot.2010.03.011openalex-snapshot
Repeated auctions for robust task execution by a robot team
inferredcites →https://doi.org/10.1016/j.robot.2019.02.016openalex-snapshot
Sequential single-item auction improvements for heterogeneous multi-robot routing
inferredcites →https://doi.org/10.1016/j.robot.2019.04.012openalex-snapshot
A distributed method for dynamic multi-robot task allocation problems with critical time constraints
inferredcites →https://doi.org/10.1016/j.sysconle.2009.07.001openalex-snapshot
The dynamic team forming problem: Throughput and delay for unbiased policies
inferredcites →https://doi.org/10.1016/s0004-3702(99)00036-3openalex-snapshot
Coalition structure generation with worst case guarantees
inferredcites →https://doi.org/10.1097/00001888-199506000-00007openalex-snapshot
A reexamination of the NRMP matching algorithm. National Resident Matching Program
inferredcites →https://doi.org/10.1109/access.2024.3505947openalex-snapshot
DTA-HMR-TT: Dynamic Task Allocation for a Heterogeneous Team of Mobile Robots With Task Transfer
inferredcites →https://doi.org/10.1109/icnc.2009.15openalex-snapshot
Robot Exploration Mission Planning Based on Heterogeneous Interactive Cultural Hybrid Algorithm
inferredcites →https://doi.org/10.1109/icra.2019.8793855openalex-snapshot
One-to-many bipartite matching based coalition formation for multi-robot task allocation
inferredcites →https://doi.org/10.1109/icra.2019.8794338openalex-snapshot
Cannot avoid penalty? Let’s minimize
inferredcites →https://doi.org/10.1109/lra.2020.3016285openalex-snapshot
A Routing Framework for Heterogeneous Multi-Robot Teams in Exploration Tasks
inferredcites →https://doi.org/10.1109/ojcsys.2024.3467991openalex-snapshot
Resiliency Through Collaboration in Heterogeneous Multi-Robot Systems
inferredcites →https://doi.org/10.1109/saci51354.2021.9465629openalex-snapshot
Multi-Constrained Voronoi-Based Task Allocator for Smart-Warehouses
inferredcites →https://doi.org/10.1109/sii59315.2025.10870944openalex-snapshot
Task-priority Intermediated Hierarchical Distributed Policies: Reinforcement Learning of Adaptive Multi-robot Cooperative Transport
inferredcites →https://doi.org/10.1109/tase.2019.2946688openalex-snapshot
Incorporation of Contingency Tasks in Task Allocation for Multirobot Teams
inferredcites →https://doi.org/10.1109/tase.2024.3395283openalex-snapshot
A Self-Learning Approach to Heterogeneous Multi-Robot Coalition Formation Under Uncertainty
inferredcites →https://doi.org/10.1109/tcyb.2017.2743164openalex-snapshot
Distributed Task Rescheduling With Time Constraints for the Optimization of Total Task Allocations in a Multirobot System
inferredcites →https://doi.org/10.1109/tcyb.2020.2977468openalex-snapshot
Finite-Horizon H∞ Bipartite Consensus Control of Cooperation–Competition Multiagent Systems With Round-Robin Protocols
inferredcites →https://doi.org/10.1145/3700591openalex-snapshot
A Systematic Literature Review on Multi-Robot Task Allocation
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/0278364913496484openalex-snapshot
A comprehensive taxonomy for multi-robot task allocation
inferredcites →https://doi.org/10.1371/journal.pone.0170659openalex-snapshot
Multi-Robot Coalitions Formation with Deadlines: Complexity Analysis and Solutions
inferredcites →https://doi.org/10.3390/robotics14070093openalex-snapshot
Optimizing Coalition Formation Strategies for Scalable Multi-Robot Task Allocation: A Comprehensive Survey of Methods and Mechanisms
inferredcites →https://doi.org/10.4300/jgme-d-22-00248.1openalex-snapshot
The US Residency Match at 70: What Was, What Is, and What Could Be
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.