The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Cooperative Collision Avoidance for Nonholonomic Robots
Open accessAbstract
In this paper, we present a method, namely€CCA, for collision avoidance in dynamic environments among interacting agents, such as other robots or humans. Given a preferred motion by a global planner or driver, the method computes a collision-free local motion for a short time horizon, which respects the actuator constraints and allows for smooth and safe control. The method builds on the concept of reciprocal velocity obstacles and extends it to respect the kinodynamic constraints of the robot and account for a grid-based map representation of the environment. The method is best suited for large multirobot settings, including heterogeneous teams of robots, in which computational complexity is of paramount importance and the robots interact with one another. In particular, we consider a set of motion primitives for the robot and solve an optimization in the space of control velocities with additional constraints. Additionally, we propose a cooperative approach to compute safe velocity partitions in the distributed case. We describe several instances of the method for distributed and centralized operation and formulated both as convex and nonconvex optimizations. We compare the different variants and describe the benefits and tradeoffs both theoretically and in extensive experiments with various robotic platforms: robotic wheelchairs, robotic boats, humanoid robots, small unicycle robots, and simulated cars.
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×
“Traditional approaches for collision avoidance are potential fields [10], the dynamic window [11], inevitable colli-”
BackgroundRandomized Kinodynamic Planning
LaValle, S. M., & Kuffner, J. J. (2001) · The International Journal of Robotics Research · doi:10.1177/02783640122067453 · Cited by 3,254
Feature-Based Prediction of Trajectories for Socially Compliant Navigation
Kuderer, M., Kretzschmar, H., Sprunk, C., & Burgard, W. (2012) · Robotics: Science and Systems VIII · doi:10.15607/rss.2012.viii.025 · Cited by 214
Cited by
Swarm of micro flying robots in the wild
Zhou, X., Wen, X., Wang, Z., Gao, Y., Li, H., Wang, Q., Yang, T., Lu, H., Cao, Y., Xu, C., et al. (2022) · Science Robotics · doi:10.1126/scirobotics.abm5954 · Cited by 657
Ship collision avoidance methods: State-of-the-art
Huang, Y., Chen, L., Chen, P., Negenborn, R. R., & van Gelder, P. H. A. J. M. (2020) · Safety Science · doi:10.1016/j.ssci.2019.09.018 · Cited by 431
Fan, T., Long, P., Liu, W., & Pan, J. (2020) · The International Journal of Robotics Research · doi:10.1177/0278364920916531 · Cited by 332
Luis, C. E., Vukosavljev, M., & Schoellig, A. P. (2020) · IEEE Robotics and Automation Letters · doi:10.1109/lra.2020.2964159 · Cited by 274
Bio-Inspired Collision Avoidance in Swarm Systems via Deep Reinforcement Learning
Na, S., Niu, H., Lennox, B., & Arvin, F. (2022) · IEEE Transactions on Vehicular Technology · doi:10.1109/tvt.2022.3145346 · Cited by 64
Metadata
- Authors
- Alonso-Mora, J., Beardsley, P., & Siegwart, R.
- Venue
- IEEE Transactions on Robotics
- Published
- 2018-04
- Volume
- 34
- Issue
- 2
- Pages
- 404-420
- ISSN
- 1552-3098 (ISSN-L)
- 1941-0468
- OpenAlex
- W2790268363
- Cited by
- 173
- References
- 3
- FWCI
- 9.22
- 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.