Student or educator? Sign up with your school email and get 6 months of Pro free.

The DOI matches its Crossref record; 52 of the 60 references it cites were found in a registry or an index, and 1 are not checked yet.

A heuristic technique for multi‐agent planning

Ephrati, Eithan, Rosenschein, Jeffrey S.·1997·Annals of Mathematics and Artificial Intelligence

Overview

Integrity signals

Registry

Crossref · 10.1023/a:1018924209812

Cites

52 of 53 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

Citations

Cites

Show all 60 references

Research works printed but not linked: 10

  1. T. Dean and M. Boddy, An analysis of time-dependent planning, in: Proceedings of the Seventh National Conference on Artificial Intelligence (St. Paul, Minnesota, August 1988) pp. 49–54.
  2. E.H. Durfee, A cooperative approach to planning for real-time control, in: Proceedings of the Workshop on Innovative Approaches to Planning, Scheduling and Control (San Diego, California, November 1990) pp. 277–283.
  3. E. Ephrati, M.E. Pollack and J.S. Rosenschein, Exploitation of decision theory techniques in multi-agent planning (extended abstract), in: Working Notes of the AAAI Spring Symposium on Decision-Theoretic Planning (Stanford, CA, March 1994) pp. 90–98.
  4. E. Ephrati, M.E. Pollack and S. Ur, Exploitation of decision theory techniques in multi-agent planning (extended abstract), in: Proceedings of The Fourteenth International Joint Conference on Artificial Intelligence (Montreal, Canada, August 1995) pp. 679–685.
  5. P. Haddawy and S. Hanks, Issues in decision-theoretic planning: Symbolic goals and numeric utilities, in: Proceedings of the 1990 DARPA Workshop on Innovative Approaches to Planning, Scheduling, and Control (November 1990) pp. 48–58.
  6. S. Hanks and R.J. Firby, Issues and architectures for planning and execution, in: Proceedings of the Workshop on Innovative Approaches to Planning, Scheduling and Control (San Diego, California, November 1990) pp. 59–70.
  7. S. Kraus, M. Nirkhe and D. Perlis, Deadline-coupled real-time planning, in: Proceedings of the Workshop on Innovative Approaches to Planning, Scheduling and Control (San Diego, California, November 1990) pp. 100–108.
  8. A.L. Lansky, Localized search for controlling automated reasoning, in: Proceedings of the Workshop on Innovative Approaches to Planning, Scheduling and Control (San Diego, California, November 1990) pp. 115–125.
  9. T. Moehlman and V. Lesser, Cooperative planning and decentralized negotiation in Multi-Fireboss Phoenix, in: Proceedings of the Workshop on Innovative Approaches to Planning, Scheduling and Control (San Diego, California, November 1990) pp. 144–159.
  10. R.P. Pope, S.E. Conry and R.A. Mayer, Distributing the planning process in a dynamic environment, in: Proceedings of the Eleventh International Workshop on Distributed Artificial Intelligence (Glen Arbor, Michigan, February 1992) pp. 317–331.

Cited by

See all 94

Metadata

Authors
Ephrati, E., & Rosenschein, J. S.
Affiliations
  • Bar-Ilan University (IL)
  • Hebrew University of Jerusalem (IL)
Corresponding author
  • Ephrati, Eithan
  • Rosenschein, Jeffrey S.
Venue
Annals of Mathematics and Artificial Intelligence
Published
1997-07
Volume
20
Issue
1-4
Pages
13-67
ISSN
  • 1012-2443 (ISSN-L)
  • 1573-7470
OpenAlex
W1889721679
Cited by
93
References
60
Citations by year
2026: 1 · 2025: 2 · 2024: 3 · 2023: 1 · 2021: 4 · 2020: 3 · 2019: 1 · 2018: 2 · 2017: 2 · 2016: 3 · 2015: 5 · 2014: 10 · 2013: 5 · 2012: 7
FWCI
0.00
Type
journal article
Language
en
Open access
closed
Licence
Locations
Annals of Mathematics and Artificial Intelligence (publishedVersion)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Multi-Agent Systems and Negotiation
  • Physical Sciences › Computer Science › Artificial Intelligence › AI-based Problem Solving and Planning
  • Physical Sciences › Engineering › Control and Systems Engineering › Robotic Path Planning Algorithms
Keywords
multi-agent planning, heuristic planning, subgoal decomposition, distributed artificial intelligence, rational agents

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 technique for multi‐agent planning. https://app.cochat.ai/papers/10.1023/a:1018924209812
The paper
Ephrati, E., & Rosenschein, J. S. (1997). A heuristic technique for multi‐agent planning. Annals of Mathematics and Artificial Intelligence. https://doi.org/10.1023/a%3A1018924209812

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.