Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
169 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Obstacle Identification and Ellipsoidal Decomposition for Fast Motion Planning in Unknown Dynamic Environments (2209.14233v4)

Published 28 Sep 2022 in cs.RO and cs.LG

Abstract: Collision avoidance in the presence of dynamic obstacles in unknown environments is one of the most critical challenges for unmanned systems. In this paper, we present a method that identifies obstacles in terms of ellipsoids to estimate linear and angular obstacle velocities. Our proposed method is based on the idea of any object can be approximately expressed by ellipsoids. To achieve this, we propose a method based on variational Bayesian estimation of Gaussian mixture model, the Kyachiyan algorithm, and a refinement algorithm. Our proposed method does not require knowledge of the number of clusters and can operate in real-time, unlike existing optimization-based methods. In addition, we define an ellipsoid-based feature vector to match obstacles given two timely close point frames. Our method can be applied to any environment with static and dynamic obstacles, including the ones with rotating obstacles. We compare our algorithm with other clustering methods and show that when coupled with a trajectory planner, the overall system can efficiently traverse unknown environments in the presence of dynamic obstacles.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (32)
  1. H. Chen and P. Lu, “Real-time identification and avoidance of simultaneous static and dynamic obstacles on point cloud for uavs navigation,” Robotics and Autonomous Systems, vol. 154, p. 104124, 2022. [Online]. Available: https://www.sciencedirect.com/science/article/pii/S0921889022000665
  2. O. Esrafilian and H. D. Taghirad, “Autonomous flight and obstacle avoidance of a quadrotor by monocular slam,” in 2016 4th International Conference on Robotics and Mechatronics (ICROM), 2016, pp. 240–245.
  3. J. Mok, Y. Lee, S. Ko, I. Choi, and H. S. Choi, “Gaussian-mixture based potential field approach for uav collision avoidance,” in 2017 56th Annual Conference of the Society of Instrument and Control Engineers of Japan (SICE), 2017, pp. 1316–1319.
  4. M. Corah, C. O’Meadhra, K. Goel, and N. Michael, “Communication-efficient planning and mapping for multi-robot exploration in large environments,” IEEE Robotics and Automation Letters, vol. 4, no. 2, pp. 1715–1721, 2019.
  5. D. M. Blei and M. I. Jordan, “Variational inference for Dirichlet process mixtures,” Bayesian Analysis, vol. 1, no. 1, pp. 121 – 143, 2006. [Online]. Available: https://doi.org/10.1214/06-BA104
  6. M. Ester, H.-P. Kriegel, J. Sander, and X. Xu, “A density-based algorithm for discovering clusters in large spatial databases with noise,” in Proceedings of the Second International Conference on Knowledge Discovery and Data Mining, ser. KDD’96.   AAAI Press, 1996, p. 226–231.
  7. J. Lin, H. Zhu, and J. Alonso-Mora, “Robust vision-based obstacle avoidance for micro aerial vehicles in dynamic environments,” 02 2020.
  8. B. Brito, B. Floor, L. Ferranti, and J. Alonso-Mora, “Model predictive contouring control for collision avoidance in unstructured dynamic environments,” IEEE Robotics and Automation Letters, vol. PP, pp. 1–1, 07 2019.
  9. D. Falanga, K. Kleber, and D. Scaramuzza, “Dynamic obstacle avoidance for quadrotors with event cameras,” Science Robotics, vol. 5, no. 40, p. eaaz9712, 2020. [Online]. Available: https://www.science.org/doi/abs/10.1126/scirobotics.aaz9712
  10. A. Chakravarthy and D. Ghose, “Collision cones for quadric surfaces,” IEEE Transactions on Robotics, vol. 27, no. 6, pp. 1159–1166, 2011.
  11. R. Shioda and L. Tunçel, “Clustering via minimum volume ellipsoids,” Computational Optimization and Applications, vol. 37, no. 3, pp. 247–295, Jul 2007. [Online]. Available: https://doi.org/10.1007/s10589-007-9024-1
  12. L. G. Khachiyan, “Rounding of polytopes in the real number model of computation,” Mathematics of Operations Research, vol. 21, no. 2, pp. 2:307–2:320, 1996. [Online]. Available: https://doi.org/10.1287/moor.21.2.307
  13. J. MacQueen, “Some methods for classification and analysis of multivariate observations,” 1967.
  14. N. S. Altman, “An introduction to kernel and nearest-neighbor nonparametric regression,” The American Statistician, vol. 46, no. 3, pp. 175–185, 1992. [Online]. Available: http://www.jstor.org/stable/2685209
  15. J. Park and H. Baek, “Stereo vision based obstacle collision avoidance for a quadrotor using ellipsoidal bounding box and hierarchical clustering,” Aerospace Science and Technology, vol. 103, p. 105882, 2020. [Online]. Available: https://www.sciencedirect.com/science/article/pii/S1270963820305642
  16. D. D. Pasqual, S. J. Sooriyaarachchi, and C. Gamage, “Dynamic obstacle detection and environmental modelling for agricultural drones,” in 2022 7th Asia-Pacific Conference on Intelligent Robot Systems (ACIRS), 2022, pp. 70–75.
  17. S. Xenaki, K. Koutroumbas, and A. Rontogiannis, “Generalized adaptive possibilistic c-means clustering algorithm,” in Proceedings of the 10th Hellenic Conference on Artificial Intelligence, ser. SETN ’18.   New York, NY, USA: Association for Computing Machinery, 2018. [Online]. Available: https://doi.org/10.1145/3200947.3201012
  18. R. Krishnapuram and J. Keller, “A possibilistic approach to clustering,” IEEE Transactions on Fuzzy Systems, vol. 1, no. 2, pp. 98–110, 1993.
  19. ——, “The possibilistic c-means algorithm: insights and recommendations,” IEEE Transactions on Fuzzy Systems, vol. 4, no. 3, pp. 385–393, 1996.
  20. A. Dhawale, X. Yang, and N. Michael, “Reactive collision avoidance using real-time local gaussian mixture model maps,” in 2018 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS), 2018, pp. 3545–3550.
  21. T. Eppenberger, G. Cesari, M. Dymczyk, R. Siegwart, and R. Dubé, “Leveraging stereo-camera data for real-time dynamic obstacle detection and tracking,” 2020. [Online]. Available: https://arxiv.org/abs/2007.10743
  22. Y. Wang, J. Ji, Q. Wang, C. Xu, and F. Gao, “Autonomous flights in dynamic environments with onboard vision,” 2021. [Online]. Available: https://arxiv.org/abs/2103.05870
  23. R. D. Hjelm, A. Fedorov, S. Lavoie-Marchildon, K. Grewal, A. Trischler, and Y. Bengio, “Learning deep representations by mutual information estimation and maximization,” 08 2018.
  24. P. Bekker and J. van Essen, “Ml and gmm with concentrated instruments in the static panel data model,” Econometric Reviews, vol. 39, no. 2, pp. 181–195, 2020. [Online]. Available: https://doi.org/10.1080/07474938.2019.1580946
  25. X. Li, Y. Hu, M. Li, and J. Zheng, “Fault diagnostics between different type of components: A transfer learning approach,” Applied Soft Computing, vol. 86, p. 105950, 2020. [Online]. Available: https://www.sciencedirect.com/science/article/pii/S1568494619307318
  26. G. Wu, “Fast and scalable variational bayes estimation of spatial econometric models for gaussian data,” Spatial Statistics, vol. 24, pp. 32–53, 2018. [Online]. Available: https://www.sciencedirect.com/science/article/pii/S2211675318300162
  27. M. J. Todd and E. A. Yıldırım, “On khachiyan’s algorithm for the computation of minimum-volume enclosing ellipsoids,” Discrete Applied Mathematics, vol. 155, no. 13, pp. 1731–1744, 2007. [Online]. Available: https://www.sciencedirect.com/science/article/pii/S0166218X07000716
  28. S. Gottschalk, M. Lin, and D. Manocha, “Obbtree: A hierarchical structure for rapid interference detection,” Computer Graphics, vol. 30, 10 1997.
  29. M. Castillo-Lopez, S. A. Sajadi-Alamdari, J. L. Sanchez-Lopez, M. A. Olivares-Mendez, and H. Voos, “Model predictive control for aerial collision avoidance in dynamic environments,” pp. 1–6, 2018.
  30. A. Wächter and L. T. Biegler, “On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming,” Mathematical Programming, vol. 106, no. 1, pp. 25–57, Mar 2006. [Online]. Available: https://doi.org/10.1007/s10107-004-0559-y
  31. B. J. Frey and D. Dueck, “Clustering by passing messages between data points,” Science, vol. 315, no. 5814, pp. 972–976, 2007. [Online]. Available: https://www.science.org/doi/abs/10.1126/science.1136800
  32. A. Ng, M. Jordan, and Y. Weiss, “On spectral clustering: Analysis and an algorithm,” in Advances in Neural Information Processing Systems, T. Dietterich, S. Becker, and Z. Ghahramani, Eds., vol. 14.   MIT Press, 2001. [Online]. Available: https://proceedings.neurips.cc/paper/2001/file/801272ee79cfde7fa5960571fee36b9b-Paper.pdf

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now