The DOI matches its Crossref record; 22 of the 22 references it cites were found in a registry or an index.
Market-Based Multirobot Coordination: A Survey and Analysis
Open accessAbstract
Market-based multirobot coordination approaches have received significant attention and are growing in popularity within the robotics research community. They have been successfully implemented in a variety of domains ranging from mapping and exploration to robot soccer. The research literature on market-based approaches to coordination has now reached a critical mass that warrants a survey and analysis. This paper addresses this need for a survey of the relevant literature by providing an introduction to market-based multirobot coordination, a review and analysis of the state of the art in the field, and a discussion of remaining research challenges
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
The Contract Net Protocol: High-Level Communication and Control in a Distributed Problem Solver
Smith (1980) · IEEE Transactions on Computers · doi:10.1109/tc.1980.1675516 · Cited by 3,716
A Formal Analysis and Taxonomy of Task Allocation in Multi-Robot Systems
Gerkey, B. P., & Matarić, M. J. (2004) · The International Journal of Robotics Research · doi:10.1177/0278364904045564 · Cited by 1,753
Sold!: auction methods for multirobot coordination
Gerkey, B. P., & Mataric, M. J. (2002) · IEEE Transactions on Robotics and Automation · doi:10.1109/tra.2002.803462 · Cited by 1,012
Algorithm for optimal winner determination in combinatorial auctions
Sandholm, T. (2002) · Artificial Intelligence · doi:10.1016/s0004-3702(01)00159-x · Cited by 929
VEHICLE ROUTING: METHODS AND STUDIES
Golden, B., & Assad, A. A. (1988) · North-Holland eBooks · Cited by 691
Coordination for Multi-Robot Exploration and Mapping
Simmons, R. G., Apfelbaum, D., Burgard, W., Fox, D., Moors, M., Thrun, S., & Younes, H. L. S. (2000) · Cited by 502
Multi-robot exploration controlled by a market economy
Zlot, R., Stentz, A., Dias, M. B., & Thayer, S. (2003) · Proceedings 2002 IEEE International Conference on Robotics and Automation (Cat. No.02CH37292) · doi:10.1109/robot.2002.1013690 · Cited by 489
Self-citationAn implementation of the contract net protocol based on marginal cost calculations
Sandholm, T. (1993) · National Conference on Artificial Intelligence · Cited by 456
Wolfstetter, E. G. (1996) · Journal of Economic Surveys · doi:10.1111/j.1467-6419.1996.tb00018.x · Cited by 317
Auction-Based Multi-Robot Routing
Lagoudakis, M. G., Markakis, E., Kempe, D., Keskinocak, P., Kleywegt, A. J., Koenig, S., Tovey, C. A., Meyerson, A., & Jain, S. A. (2005) · Robotics: Science and Systems · doi:10.15607/rss.2005.i.045 · Cited by 310
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
Indoor automation with many mobile robots
Caloud, P., Choi, W., Latombe, J.-C., Le Pape, C., & Yim, M. (2002) · IEEE International Workshop on Intelligent Robots and Systems, Towards a New Frontier of Applications · doi:10.1109/iros.1990.262370 · Cited by 181
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
A combinatorial auction for collaborative planning
Hunsberger, L., & Grosz, B. J. (2002) · International Conference on Multi Agent Systems · doi:10.1109/icmas.2000.858447 · Cited by 157
Contract Types for Satisficing Task Allocation:I Theoretical Results
Sandholm, T. (2002) · Cited by 150
Hoplites: A Market-Based Framework for Planned Tight Coordination in Multirobot Teams
Kalra, N., Ferguson, D., & Stentz, A. (2006) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/robot.2005.1570274 · Cited by 134
Self-citationOn multi-robot task allocation
Matarić, M. J., & Gerkey, B. P. (2003) · Cited by 86
Learning Opportunity Costs in Multi-Robot Market Based Planners
Schneider, J., Apfelbaum, D., Bagnell, D., & Simmons, R. G. (2006) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/robot.2005.1570271 · Cited by 47
Market-Driven Multi-Agent Collaboration in Robot Soccer Domain
Kose, H., Kaplan, K., Meriçli, Ç., Tatlidede, U., & Aki, L. (2005) · Pro Literatur Verlag, Germany eBooks · doi:10.5772/4661 · Cited by 38
Learning to be Competitive in the Market
Oliveira, E., Fonseca, J., & Jennings, N. R. (1999) · ePrints Soton (University of Southampton) · Cited by 19
The effects of co-operation on multiagent search in task-oriented domains
Vidal, J. M. (2004) · Journal of Experimental & Theoretical Artificial Intelligence · doi:10.1080/09528130410001710792 · Cited by 17
Köse, H., Meriçli, Ç., Kaplan, K., & Akın, H. L. (2003) · Lecture notes in computer science · doi:10.1007/978-3-540-39737-3_66 · Cited by 13
Cited by
A Formal Analysis and Taxonomy of Task Allocation in Multi-Robot Systems
Gerkey, B. P., & Matarić, M. J. (2004) · The International Journal of Robotics Research · doi:10.1177/0278364904045564 · Cited by 1,753
Parker, L. E., Rus, D., & Sukhatme, G. S. (2016) · Springer Handbooks · doi:10.1007/978-3-319-32552-1_53 · 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
- Dias, M. B., Zlot, R., Kalra, N., & Stentz, A.
- Venue
- Proceedings of the IEEE
- Published
- 2006-07
- Volume
- 94
- Issue
- 7
- Pages
- 1257-1270
- ISSN
- 0018-9219 (ISSN-L)
- 1558-2256
- OpenAlex
- W2144827113
- Cited by
- 932
- References
- 22
- FWCI
- 55.88
- Type
- journal article
- Language
- en
- Open access
- green
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
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.
