The DOI matches its Crossref record; 27 of the 27 references it cites were found in a registry or an index.
Fast, On-line Collision Avoidance for Dynamic Vehicles Using Buffered Voronoi Cells
Abstract
This letter presents a distributed collision avoidance algorithm for multiple dynamic vehicles moving in arbitrary dimensions. In our algorithm, each robot continually computes its buffered Voronoi cell (BVC) and plans its path within the BVC in a receding horizon fashion. We prove that our algorithm guarantees collision avoidance for robots with single integrator dynamics. We show that our algorithm has computational complexity of O(k), which is the same as that of the optimal reciprocal collision avoidance (ORCA) algorithm, and is considerably faster than model predictive control (MPC) and sequential convex programming (SCP) based approaches. Moreover, ORCA and MPC-SCP require relative position, velocity, and even other information, to be exchanged over a communication network among the robots. Our algorithm only requires the sensed relative position, and therefore is well suited for on-line implementation as it does not require a communication network, and it works well with noisy relative position sensors. Furthermore, we provide an extension of our algorithm to robots with higher-order dynamics like quadrotors. We demonstrate the capabilities of our algorithm by comparing it to ORCA in multiple benchmark simulation scenarios, and we present results of over 70 experimental trials using five quadrotors in a motion capture environment.
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
Spatial Tessellations: Concepts and Applications of Voronoi Diagrams
Okabe, A., Boots, B. N., & Sugihara, K. (1992) · Cited by 3,546
Coverage Control for Mobile Sensing Networks
Cortes, J., Martinez, S., Karatas, T., & Bullo, F. (2004) · IEEE Transactions on Robotics and Automation · doi:10.1109/tra.2004.824698 · Cited by 2,710
Reciprocal n-Body Collision Avoidance
van den Berg, J., Guy, S. J., Lin, M., & Manocha, D. (2011) · Springer Tracts in Advanced Robotics · doi:10.1007/978-3-642-19457-3_1 · Cited by 1,858
Reciprocal Velocity Obstacles for real-time multi-agent navigation
van den Berg, J., Lin, M., & Manocha, D. (2008) · 2008 IEEE International Conference on Robotics and Automation · doi:10.1109/robot.2008.4543489 · Cited by 1,722
Motion planning with sequential convex optimization and convex collision checking
Schulman, J., Duan, Y., Ho, J., Lee, A., Awwal, I., Bradlow, H., Pan, J., Patil, S., Goldberg, K., & Abbeel, P. (2014) · The International Journal of Robotics Research · doi:10.1177/0278364914528132 · Cited by 866
CVXGEN: a code generator for embedded convex optimization
Mattingley, J., & Boyd, S. (2012) · Optimization and Engineering · doi:10.1007/s11081-011-9176-9 · Cited by 790
Spatial tessellations: concepts and applications of voronoi diagrams
Watson, D. (1993) · Computers & Geosciences · doi:10.1016/0098-3004(93)90024-y · Cited by 574
Mixed integer programming for multi-vehicle path planning
Schouwenaars, T., De Moor, B., Feron, E., & How, J. (2001) · 2001 European Control Conference (ECC) · doi:10.23919/ecc.2001.7076321 · Cited by 566
Spacecraft Trajectory Planning with Avoidance Constraints Using Mixed-Integer Linear Programming
Richards, A., Schouwenaars, T., How, J. P., et al. (2002) · Journal of Guidance Control and Dynamics · doi:10.2514/2.4943 · Cited by 508
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
Finding Locally Optimal, Collision-Free Trajectories with Sequential Convex Optimization
Schulman, J., Ho, J., Lee, A., Awwal, I., Bradlow, H., & Abbeel, P. (2013) · Robotics: Science and Systems IX · doi:10.15607/rss.2013.ix.031 · Cited by 430
Model Predictive Control of Swarms of Spacecraft Using Sequential Convex Programming
Morgan, D., Chung, S.-J., & Hadaegh, F. Y. (2014) · Journal of Guidance, Control, and Dynamics · doi:10.2514/1.g000218 · Cited by 384
(2011) · IEEE Control Systems · doi:10.1109/mcs.2011.940571 · Cited by 344
Bortoff, S. A. (2000) · Proceedings of the 2000 American Control Conference. ACC (IEEE Cat. No.00CH36334) · doi:10.1109/acc.2000.878915 · Cited by 338
Comprehensive Simulation of Quadrotor UAVs Using ROS and Gazebo
Meyer, J., Sendobry, A., Kohlbrecher, S., Klingauf, U., & von Stryk, O. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-34327-8_36 · Cited by 337
Roadmap-Based Path Planning - Using the Voronoi Diagram for a Clearance-Based Shortest Path
Bhattacharya, P., & Gavrilova, M. (2008) · IEEE Robotics & Automation Magazine · doi:10.1109/mra.2008.921540 · Cited by 312
Sensing and coverage for a network of heterogeneous robots
Pimenta, L. C. A., Kumar, V., Mesquita, R. C., & Pereira, G. A. S. (2008) · 2008 47th IEEE Conference on Decision and Control · doi:10.1109/cdc.2008.4739194 · Cited by 279
Mixed-integer quadratic program trajectory generation for heterogeneous quadrotor teams
Mellinger, D., Kushleyev, A., & Kumar, V. (2012) · 2012 IEEE International Conference on Robotics and Automation · doi:10.1109/icra.2012.6225009 · Cited by 274
Generalized velocity obstacles
Wilkie, D., van den Berg, J., & Manocha, D. (2009) · 2009 IEEE/RSJ International Conference on Intelligent Robots and Systems · doi:10.1109/iros.2009.5354175 · Cited by 241
Collision avoidance for multiple agent systems
Chang, D. E., Shadden, S. C., Marsden, J. E., & Olfati-Saber, R. (2004) · 42nd IEEE International Conference on Decision and Control (IEEE Cat. No.03CH37475) · doi:10.1109/cdc.2003.1272619 · Cited by 227
Path Planning for Mobile Robot Navigation using Voronoi Diagram and Fast Marching
Garrido, S., Moreno, L., Abderrahim, M., & Martin, F. (2006) · 2006 IEEE/RSJ International Conference on Intelligent Robots and Systems · doi:10.1109/iros.2006.282649 · Cited by 199
Flight Demonstrations of Cooperative Control for UAV Teams
How, J. P., Kuwata, Y., & King, E. T. (2004) · AIAA "Unmanned Unlimited" Conference and Workshop & Exhibit · doi:10.2514/6.2004-6490 · Cited by 135
Reciprocal collision avoidance for multiple car-like robots
Alonso–Mora, J., Breitenmoser, A., Beardsley, P. A., & Siegwart, R. (2012) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/icra.2012.6225166 · Cited by 133
Probabilistic swarm guidance using optimal transport
Bandyopadhyay, S., Chung, S., & Hadaegh, F. Y. (2014) · The proceedings of the IEEE Conference on Control Applications/The proceedings of the ... IEEE Conference on Control Applications · doi:10.1109/cca.2014.6981395 · Cited by 80
Self-citationVector field following for quadrotors using differential flatness
Zhou, D., & Schwager, M. (2014) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/icra.2014.6907828 · Cited by 78
Self-citationVirtual Rigid Bodies for coordinated agile maneuvering of teams of micro aerial vehicles
Zhou, D., & Schwager, M. (2015) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/icra.2015.7139422 · Cited by 38
Self-citationProbabilistic guidance of distributed systems using sequential convex programming
Morgan, D., Subramanian, G. P., Bandyopadhyay, S., Chung, S., & Hadaegh, F. Y. (2014) · IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) · doi:10.1109/iros.2014.6943103 · Cited by 15
Self-citation
Cited by
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
Persistent and Robust Execution of MAPF Schedules in Warehouses
Honig, W., Kiesel, S., Tinka, A., Durham, J. W., & Ayanian, N. (2019) · IEEE Robotics and Automation Letters · doi:10.1109/lra.2019.2894217 · Cited by 139
Adajania, V. K., Zhou, S., Singh, A. K., & Schoellig, A. P. (2023) · 2023 IEEE International Conference on Robotics and Automation (ICRA) · doi:10.1109/icra48891.2023.10161063 · Cited by 23
Metadata
- Authors
- Zhou, D., Wang, Z., Bandyopadhyay, S., & Schwager, M.
- Venue
- IEEE Robotics and Automation Letters
- Published
- 2017-04
- Volume
- 2
- Issue
- 2
- Pages
- 1047-1054
- ISSN
- 2377-3766 (ISSN-L)
- 2377-3774
- OpenAlex
- W2573311857
- Cited by
- 286
- References
- 27
- FWCI
- 6.96
- 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
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.