The DOI matches its Crossref record; 15 of the 15 references it cites were found in a registry or an index.
A Heuristic Distributed Task Allocation Method for Multivehicle Multitask Problems and Its Application to Search and Rescue Scenario
Open accessAbstract
Using distributed task allocation methods for cooperating multivehicle systems is becoming increasingly attractive. However, most effort is placed on various specific experimental work and little has been done to systematically analyze the problem of interest and the existing methods. In this paper, a general scenario description and a system configuration are first presented according to search and rescue scenario. The objective of the problem is then analyzed together with its mathematical formulation extracted from the scenario. Considering the requirement of distributed computing, this paper then proposes a novel heuristic distributed task allocation method for multivehicle multitask assignment problems. The proposed method is simple and effective. It directly aims at optimizing the mathematical objective defined for the problem. A new concept of significance is defined for every task and is measured by the contribution to the local cost generated by a vehicle, which underlies the key idea of the algorithm. The whole algorithm iterates between a task inclusion phase, and a consensus and task removal phase, running concurrently on all the vehicles where local communication exists between them. The former phase is used to include tasks into a vehicle's task list for optimizing the overall objective, while the latter is to reach consensus on the significance value of tasks for each vehicle and to remove the tasks that have been assigned to other vehicles. Numerical simulations demonstrate that the proposed method is able to provide a conflict-free solution and can achieve outstanding performance in comparison with the consensus-based bundle algorithm.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
An Overview of Recent Progress in the Study of Distributed Multi-Agent Coordination
Cao, Y., Yu, W., Ren, W., & Chen, G. (2013) · IEEE Transactions on Industrial Informatics · doi:10.1109/tii.2012.2219061 · Cited by 2,399
Consensus-Based Decentralized Auctions for Robust Task Allocation
Choi, H.-L., Brunet, L., & How, J. P. (2009) · IEEE Transactions on Robotics · doi:10.1109/tro.2009.2022423 · Cited by 1,128
Market-Based Multirobot Coordination: A Survey and Analysis
Dias, M. B., Zlot, R., Kalra, N., & Stentz, A. (2006) · Proceedings of the IEEE · doi:10.1109/jproc.2006.876939 · Cited by 932
Zhu, D., Huang, H., & Yang, S. X. (2013) · IEEE Transactions on Cybernetics · doi:10.1109/tsmcb.2012.2210212 · Cited by 251
The Auction Algorithm for Assignment and Other Network Flow Problems: A Tutorial
Bertsekas, D. P. (1990) · Interfaces · doi:10.1287/inte.20.4.133 · Cited by 224
Robot exploration with combinatorial auctions
Berhault, M., Huang, H., Keskinocak, P., Koenig, S., Elmaghraby, W., Griffin, P., & Kleywegt, A. (2004) · Proceedings 2003 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2003) (Cat. No.03CH37453) · doi:10.1109/iros.2003.1248932 · Cited by 183
Simple auctions with performance guarantees for multi-robot task allocation
Lagoudakis, M. G., Berhault, M., Koenig, S., Keskinocak, P., & Kleywegt, A. J. (2005) · IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) · doi:10.1109/iros.2004.1389434 · Cited by 178
Cooperative Multi-Vehicle Localization Using Split Covariance Intersection Filter
Li, H., & Nashashibi, F. (2013) · IEEE Intelligent Transportation Systems Magazine · doi:10.1109/mits.2012.2232967 · Cited by 170
Qin, J., Zheng, W. X., & Gao, H. (2011) · IEEE Transactions on Systems Man and Cybernetics Part B (Cybernetics) · doi:10.1109/tsmcb.2011.2164523 · Cited by 132
Repeated auctions for robust task execution by a robot team
Nanjanath, M., & Gini, M. L. (2010) · Robotics and Autonomous Systems · doi:10.1016/j.robot.2010.03.011 · Cited by 124
Cited by
Collaborative Multi-Robot Search and Rescue: Planning, Coordination, Perception, and Active Vision
Queralta, J. P., Taipalmaa, J., Can Pullinen, B., Sarker, V. K., Nguyen Gia, T., Tenhunen, H., Gabbouj, M., Raitoharju, J., & Westerlund, T. (2020) · IEEE Access · doi:10.1109/access.2020.3030190 · Cited by 526
UAV Swarm Intelligence: Recent Advances and Future Trends
Zhou, Y., Rao, B., & Wang, W. (2020) · IEEE Access · doi:10.1109/access.2020.3028865 · Cited by 373
Cheikhrouhou, O., & Khoufi, I. (2021) · Computer Science Review · doi:10.1016/j.cosrev.2021.100369 · Cited by 290
Collaborative Multi-Robot Systems for Search and Rescue: Coordination and Perception
Queralta, J. P., Taipalmaa, J., Pullinen, B. C., Sarker, V. K., Gia, T. N., Tenhunen, H., Gabbouj, M., Raitoharju, J., & Westerlund, T. (2020) · arXiv · doi:10.48550/arxiv.2008.12610 · Cited by 27
Metadata
- Authors
- Zhao, W., Meng, Q., & Chung, P. W. H.
- Venue
- IEEE Transactions on Cybernetics
- Published
- 2016-04
- Volume
- 46
- Issue
- 4
- Pages
- 902-915
- ISSN
- 2168-2267 (ISSN-L)
- 2168-2275
- OpenAlex
- W2076422387
- Cited by
- 270
- References
- 15
- FWCI
- 9.98
- Type
- journal article
- Language
- en
- Open access
- hybrid
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: A Heuristic Distributed Task Allocation Method for Multivehicle Multitask Problems and Its Application to Search and Rescue Scenario. https://app.cochat.ai/papers/10.1109/tcyb.2015.2418052
- The paper
- Zhao, W., Meng, Q., & Chung, P. W. H. (2016). A Heuristic Distributed Task Allocation Method for Multivehicle Multitask Problems and Its Application to Search and Rescue Scenario. IEEE Transactions on Cybernetics. https://doi.org/10.1109/tcyb.2015.2418052
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.