The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Decentralized Cooperative Policy for Conflict Resolution in Multivehicle Systems
Abstract
In this paper, we propose a novel policy for steering multiple vehicles between assigned start and goal configurations, ensuring collision avoidance. The policy rests on the assumption that all agents are cooperating by implementing the same traffic rules. However, the policy is completely decentralized, as each agent decides its own motion by applying those rules only on the locally available information, and scalable, in the sense that the amount of information processed by each agent and the computational complexity of the algorithms do not increase with the number of agents in the scenario. The proposed policy applies to systems in which new vehicles may enter the scene and start interacting with existing ones at any time, while others may leave. Under mild conditions on the initial configurations, the policy is shown to be safe, i.e., it guarantees collision avoidance throughout the system evolution. In the paper, conditions are discussed on the desired configurations of agents, under which the ultimate convergence of all vehicles to their goals can also be guaranteed. To show that such conditions are actually necessary and sufficient, which turns out to be a challenging liveness-verification problem for a complex hybrid automaton, we employ a probabilistic verification method. The paper finally presents and discusses simulations for systems of several tens of vehicles, and reports on some experimental implementation showing the practicality of the approach.
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
Coordination of groups of mobile autonomous agents using nearest neighbor rules
Jadbabaie, A., Lin, J., & Morse, A. S. (2003) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2003.812781 · Cited by 8,339
Cited by
Conflict-based search for optimal multi-agent pathfinding
Sharon, G., Stern, R., Felner, A., & Sturtevant, N. R. (2015) · Artificial Intelligence · doi:10.1016/j.artint.2014.11.006 · Cited by 1,242
Hoy, M., Matveev, A. S., & Savkin, A. V. (2015) · Robotica · doi:10.1017/s0263574714000289 · Cited by 469
The Hybrid Reciprocal Velocity Obstacle
Snape, J., Berg, J. V. D., Guy, S. J., & Manocha, D. (2011) · IEEE Transactions on Robotics · doi:10.1109/tro.2011.2120810 · Cited by 448
The increasing cost tree search for optimal multi-agent pathfinding
Sharon, G., Stern, R., Goldenberg, M., & Felner, A. (2013) · Artificial Intelligence · doi:10.1016/j.artint.2012.11.006 · Cited by 323
Formal Specification and Verification of Autonomous Robotic Systems: A Survey
Luckcuck, M., Farrell, M., Dennis, L. A., Dixon, C., & Fisher, M. (2020) · ACM Computing Surveys · doi:10.1145/3342355 · Cited by 281
Metadata
- Authors
- Pallottino, L., Scordio, V. G., Bicchi, A., & Frazzoli, E.
- Venue
- IEEE Transactions on Robotics
- Published
- 2007-12
- Volume
- 23
- Issue
- 6
- Pages
- 1170-1183
- ISSN
- 1552-3098 (ISSN-L)
- OpenAlex
- W2056549180
- Cited by
- 234
- References
- 1
- FWCI
- 17.02
- Type
- journal article
- 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: Decentralized Cooperative Policy for Conflict Resolution in Multivehicle Systems. https://app.cochat.ai/papers/10.1109/tro.2007.909810
- The paper
- Pallottino, L., Scordio, V. G., Bicchi, A., & Frazzoli, E. (2007). Decentralized Cooperative Policy for Conflict Resolution in Multivehicle Systems. IEEE Transactions on Robotics. https://doi.org/10.1109/tro.2007.909810
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.