The DOI matches its Crossref record; 13 of the 13 references it cites were found in a registry or an index.
On social laws for artificial agent societies: off-line design
Open accessAbstract
We are concerned with the utility of social laws in a computational environment, laws which guarantee the successful coexistence of multiple programs and programmers. In this paper we are interested in the off-line design of social laws, where we as designers must decide ahead of time on useful social laws. In the first part of this paper we suggest the use of social laws in the domain of mobile robots, and prove analytic results about the usefulness of this approach in that setting. In the second part of this paper we present a general model of social law in a computational system, and investigate some of its properties. This includes a definition of the basic computational problem involved with the design of multi-agent systems, and an investigation of the automatic synthesis of useful social laws in the framework of a model which refers explicitly to social laws.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Real-Time Obstacle Avoidance for Manipulators and Mobile Robots
Khatib, O. (1986) · The International Journal of Robotics Research · doi:10.1177/027836498600500106 · Cited by 7,894 · cited 1×
“…solution relied only on on-line negotiations among robots. there exist local for collision avoidance, such as artificial potential fields (see [ 6]), the should not confuse them with a global mechanism of coordination such as social without detracting from the merit of the above mechanisms, we…”
BackgroundThe control of discrete event systems
Ramadge, P. J. G., & Wonham, W. M. (1989) · Proceedings of the IEEE · doi:10.1109/5.21072 · Cited by 2,937
Shoham, Y. (1993) · Artificial Intelligence · doi:10.1016/0004-3702(93)90034-9 · Cited by 2,041
Self-citationNegotiation as a metaphor for distributed problem solving
Davis, R., & Smith, R. G. (1983) · Artificial Intelligence · doi:10.1016/0004-3702(83)90015-2 · Cited by 1,230
Marschak, J., & Radner, R. (1972) · Medical Entomology and Zoology · Cited by 1,082
Readings in Distributed Artificial Intelligence
(1988) · Elsevier eBooks · doi:10.1016/c2013-0-07700-6 · Cited by 986
Proceedings. 1988 IEEE International Conference on Robotics and Automation
(1988) · doi:10.1109/robot.1988 · Cited by 984
Erdmann, M., & Lozano-Pérez, T. (1987) · Algorithmica · doi:10.1007/bf01840371 · Cited by 736
Proceedings of the 30th IEEE symposium on Foundations of computer science
Galil, Z., & Blum, E. K. (1994) · Cited by 677
Modeling Coordination in Organizations and Markets
Malone, T. W. (1987) · Management Science · doi:10.1287/mnsc.33.10.1317 · Cited by 661
Coherent Cooperation Among Communicating Problem Solvers
Durfee, E. H., Lesser, V. R., & Corkill, D. D. (1987) · IEEE Transactions on Computers · doi:10.1109/tc.1987.5009468 · Cited by 276
Rosenschein, J. S., & Genesereth, M. R. (1988) · Readings in Distributed Artificial Intelligence · doi:10.1016/b978-0-934613-63-7.50027-9 · Cited by 273
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
Cited by
Multiagent systems: algorithmic, game-theoretic, and logical foundations
(2009) · Choice Reviews Online · doi:10.5860/choice.46-5662 · Cited by 1,756
Self-citationA survey of multi-agent organizational paradigms
HORLING, B., & LESSER, V. (2004) · The Knowledge Engineering Review · doi:10.1017/s0269888905000317 · Cited by 709
Designing Collective Behavior in a Termite-Inspired Robot Construction Team
Werfel, J., Petersen, K., & Nagpal, R. (2014) · Science · doi:10.1126/science.1245842 · Cited by 599
Distributed covering by ant-robots using evaporating traces
Wagner, I. A., Lindenbaum, M., & Bruckstein, A. M. (1999) · IEEE Transactions on Robotics and Automation · doi:10.1109/70.795795 · Cited by 275
SODA: Societies and Infrastructures in the Analysis and Design of Agent-Based Systems
Omicini, A. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44564-1_12 · Cited by 256
Metadata
- Authors
- Shoham, Y., & Tennenholtz, M.
- Venue
- Artificial Intelligence
- Publisher
- Elsevier BV
- Published
- 1995-02
- Volume
- 73
- Issue
- 1-2
- Pages
- 231-252
- ISSN
- 0004-3702 (ISSN-L)
- OpenAlex
- W1986112535
- Cited by
- 463
- References
- 13
- FWCI
- 18.67
- 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
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.