The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Robot exploration with combinatorial auctions
Abstract
We study how to coordinate a team of mobile robots to visit a number of given targets in a partially unknown terrain. Robotics researchers have studied single-item auctions to perform this exploration task but these do not make synergies between the targets into account. We therefore design combinatorial auctions, propose different combinatorial bidding strategies and compare their performance with each other, as well as to single item auctions and an optimal centralized mechanism. Our computational results in teambots, a multi-robot simulator, indicate that combinatorial auctions generally lead to significantly superior team performance than single-item auctions, and generate very good results compared to an optimal centralized mechanism.
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
Multiagent systems: A survey from a machine learning perspective
Stone, P., & Veloso, M. (2000) · Autonomous Robots · doi:10.1023/a:1008942012299 · Cited by 1,218
Cited by
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
Parker, L. E., Rus, D., & Sukhatme, G. S. (2016) · Springer Handbooks · doi:10.1007/978-3-319-32552-1_53 · Cited by 290
Efficient frontier detection for robot exploration
Keidar, M., & Kaminka, G. A. (2014) · The International Journal of Robotics Research · doi:10.1177/0278364913494911 · Cited by 151
Metadata
- Authors
- Berhault, M., Huang, H., Keskinocak, P., Koenig, S., Elmaghraby, W., Griffin, P., & Kleywegt, A.
- Venue
- Proceedings 2003 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2003) (Cat. No.03CH37453)
- Publisher
- IEEE
- Published
- 2004-04-23
- Volume
- 2
- Pages
- 1957-1962
- OpenAlex
- W2124447233
- Cited by
- 183
- References
- 1
- FWCI
- 11.66
- Type
- conference paper
- Language
- en
- Open access
- closed
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: Robot exploration with combinatorial auctions. https://app.cochat.ai/papers/10.1109/iros.2003.1248932
- The paper
- Berhault, M., Huang, H., Keskinocak, P., Koenig, S., Elmaghraby, W., Griffin, P., & Kleywegt, A. (2004). Robot exploration with combinatorial auctions. Proceedings 2003 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2003) (Cat. No.03CH37453). https://doi.org/10.1109/iros.2003.1248932
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.
