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

Fast Safe Rectangular Corridor-based Online AGV Trajectory Optimization with Obstacle Avoidance (2309.07979v2)

Published 14 Sep 2023 in cs.RO

Abstract: Automated Guided Vehicles (AGVs) are essential in various industries for their efficiency and adaptability. However, planning trajectories for AGVs in obstacle-dense, unstructured environments presents significant challenges due to the nonholonomic kinematics, abundant obstacles, and the scenario's nonconvex and constrained nature. To address this, we propose an efficient trajectory planning framework for AGVs by formulating the problem as an optimal control problem. Our framework utilizes the fast safe rectangular corridor (FSRC) algorithm to construct rectangular convex corridors, representing avoidance constraints as box constraints. This eliminates redundant obstacle influences and accelerates the solution speed. Additionally, we employ the Modified Visibility Graph algorithm to speed up path planning and a boundary discretization strategy to expedite FSRC construction. Experimental results demonstrate the effectiveness and superiority of our framework, particularly in computational efficiency. Compared to advanced frameworks, our framework achieves computational efficiency gains of 1 to 2 orders of magnitude. Notably, FSRC significantly outperforms other safe convex corridor-based methods regarding computational efficiency.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (40)
  1. K. Saleh, M. Hossny, and S. Nahavandi, “Real-time intent prediction of pedestrians for autonomous ground vehicles via spatio-temporal densenet,” in 2019 International Conference on Robotics and Automation (ICRA).   IEEE, 2019, pp. 9704–9710.
  2. B. Li, Y. Zhang, Y. Ouyang, Y. Liu, X. Zhong, H. Cen, and Q. Kong, “Real-time trajectory planning for agv in the presence of moving obstacles: A first-search-then-optimization approach,” arXiv preprint arXiv:1902.06201, 2019.
  3. J. M. Roberts, E. S. Duff, and P. I. Corke, “Reactive navigation and opportunistic localization for autonomous underground mining vehicles,” Information Sciences, vol. 145, no. 1-2, pp. 127–146, 2002.
  4. X. Zhang, C. Shu, S. Li, C. Wu, and Z. Liu, “Agvs: A new change detection dataset for airport ground video surveillance,” IEEE Transactions on Intelligent Transportation Systems, vol. 23, no. 11, pp. 20 588–20 600, 2022.
  5. L. Li, Y.-H. Liu, M. Fang, Z. Zheng, and H. Tang, “Vision-based intelligent forklift automatic guided vehicle (agv),” in 2015 IEEE International Conference on Automation Science and Engineering (CASE).   IEEE, 2015, pp. 264–265.
  6. F. Pratissoli, N. Battilani, C. Fantuzzi, and L. Sabattini, “Hierarchical and flexible traffic management of multi-agv systems applied to industrial environments,” in 2021 IEEE International Conference on Robotics and Automation (ICRA).   IEEE, 2021, pp. 10 009–10 015.
  7. W.-Q. Zou, Q.-K. Pan, and M. F. Tasgetiren, “An effective iterated greedy algorithm for solving a multi-compartment agv scheduling problem in a matrix manufacturing workshop,” Applied Soft Computing, vol. 99, p. 106945, 2021.
  8. Z. Chen, J. Alonso-Mora, X. Bai, D. D. Harabor, and P. J. Stuckey, “Integrated task assignment and path planning for capacitated multi-agent pickup and delivery,” IEEE Robotics and Automation Letters, vol. 6, no. 3, pp. 5816–5823, 2021.
  9. M. Elsisi and M.-Q. Tran, “Development of an iot architecture based on a deep neural network against cyber attacks for automated guided vehicles,” Sensors, vol. 21, no. 24, p. 8467, 2021.
  10. D. Bechtsis, N. Tsolakis, D. Vlachos, and E. Iakovou, “Sustainable supply chain management in the digitalisation era: The impact of automated guided vehicles,” Journal of Cleaner Production, vol. 142, pp. 3970–3984, 2017.
  11. I. P. Vlachos, R. M. Pascazzi, G. Zobolas, P. Repoussis, and M. Giannakis, “Lean manufacturing systems in the area of industry 4.0: A lean automation plan of agvs/iot integration,” Production planning & control, vol. 34, no. 4, pp. 345–358, 2023.
  12. B. Farooq, J. Bao, H. Raza, Y. Sun, and Q. Ma, “Flow-shop path planning for multi-automated guided vehicles in intelligent textile spinning cyber-physical production systems dynamic environment,” Journal of manufacturing systems, vol. 59, pp. 98–116, 2021.
  13. T. Mercy, R. Van Parys, and G. Pipeleers, “Spline-based motion planning for autonomous guided vehicles in a dynamic environment,” IEEE Transactions on Control Systems Technology, vol. 26, no. 6, pp. 2182–2189, 2017.
  14. X. Wang, B. Li, X. Su, H. Peng, L. Wang, C. Lu, and C. Wang, “Autonomous dispatch trajectory planning on flight deck: A search-resampling-optimization framework,” Engineering Applications of Artificial Intelligence, vol. 119, p. 105792, 2023.
  15. B. Li, Y. Zhang, Y. Ouyang, Y. Liu, X. Zhong, H. Cen, and Q. Kong, “Fast trajectory planning for agv in the presence of moving obstacles: A combination of 3-dim a search and qcqp,” in 2021 33rd Chinese Control and Decision Conference (CCDC).   IEEE, 2021, pp. 7549–7554.
  16. B. Li, K. Wang, and Z. Shao, “Time-optimal maneuver planning in automatic parallel parking using a simultaneous dynamic optimization approach,” IEEE Transactions on Intelligent Transportation Systems, vol. 17, no. 11, pp. 3263–3274, 2016.
  17. S. Shi, Y. Xiong, J. Chen, and C. Xiong, “A bilevel optimal motion planning (bomp) model with application to autonomous parking,” International Journal of Intelligent Robotics and Applications, vol. 3, no. 4, pp. 370–382, 2019.
  18. K. Bergman and D. Axehill, “Combining homotopy methods and numerical optimal control to solve motion planning problems,” in 2018 IEEE Intelligent Vehicles Symposium (IV).   IEEE, 2018, pp. 347–354.
  19. R. Chai, A. Tsourdos, A. Savvaris, S. Chai, and Y. Xia, “Two-stage trajectory optimization for autonomous ground vehicles parking maneuver,” IEEE Transactions on Industrial Informatics, vol. 15, no. 7, pp. 3899–3909, 2018.
  20. Y. Guo, D. Yao, B. Li, H. Gao, and L. Li, “Down-sized initialization for optimization-based unstructured trajectory planning by only optimizing critical variables,” IEEE Transactions on Intelligent Vehicles, vol. 8, no. 1, pp. 709–720, 2022.
  21. B. Li, T. Acarman, X. Peng, Y. Zhang, X. Bian, and Q. Kong, “Maneuver planning for automatic parking with safe travel corridors: A numerical optimal control approach,” in 2020 European Control Conference (ECC).   IEEE, 2020, pp. 1993–1998.
  22. Y. Li, S. Liang, J. Gao, Z. Chen, S. Qiao, and Z. Yin, “Trajectory optimization for the nonholonomic space rover in cluttered environments using safe convex corridors,” Aerospace, vol. 10, no. 8, p. 705, 2023.
  23. J. Lian, W. Ren, D. Yang, L. Li, and F. Yu, “Trajectory planning for autonomous valet parking in narrow environments with enhanced hybrid a* search and nonlinear optimization,” IEEE Transactions on Intelligent Vehicles, 2023.
  24. Z. Zhu, E. Schmerling, and M. Pavone, “A convex optimization approach to smooth trajectories for motion planning with car-like robots,” in 2015 54th IEEE conference on decision and control (CDC).   IEEE, 2015, pp. 835–842.
  25. S. Liu, M. Watterson, K. Mohta, K. Sun, S. Bhattacharya, C. J. Taylor, and V. Kumar, “Planning dynamically feasible trajectories for quadrotors using safe flight corridors in 3-d complex environments,” IEEE Robotics and Automation Letters, vol. 2, no. 3, pp. 1688–1695, 2017.
  26. R. Deits and R. Tedrake, “Computing large convex regions of obstacle-free space through semidefinite programming,” in Algorithmic Foundations of Robotics XI: Selected Contributions of the Eleventh International Workshop on the Algorithmic Foundations of Robotics.   Springer, 2015, pp. 109–124.
  27. J. Chen, T. Liu, and S. Shen, “Online generation of collision-free trajectories for quadrotor flight in unknown cluttered environments,” in 2016 IEEE international conference on robotics and automation (ICRA).   IEEE, 2016, pp. 1476–1483.
  28. C. Liu, C.-Y. Lin, and M. Tomizuka, “The convex feasible set algorithm for real time optimization in motion planning,” SIAM Journal on Control and optimization, vol. 56, no. 4, pp. 2712–2733, 2018.
  29. B. Li, Z. Yin, Y. Ouyang, Y. Zhang, X. Zhong, and S. Tang, “Online trajectory replanning for sudden environmental changes during automated parking: A parallel stitching method,” IEEE Transactions on Intelligent Vehicles, vol. 7, no. 3, pp. 748–757, 2022.
  30. P. E. Hart, N. J. Nilsson, and B. Raphael, “A formal basis for the heuristic determination of minimum cost paths,” IEEE transactions on Systems Science and Cybernetics, vol. 4, no. 2, pp. 100–107, 1968.
  31. M. Buehler, K. Iagnemma, and S. Singh, “Junior: the stanford entry in the urban challenge,” The DARPA urban challenge: autonomous vehicles in city traffic, vol. 56, pp. 91–123, 2009.
  32. S. M. LaValle and J. J. Kuffner Jr, “Randomized kinodynamic planning,” The international journal of robotics research, vol. 20, no. 5, pp. 378–400, 2001.
  33. I. Noreen, A. Khan, and Z. Habib, “Optimal path planning using rrt* based approaches: a survey and future directions,” International Journal of Advanced Computer Science and Applications, vol. 7, no. 11, 2016.
  34. Y. Chen, M. Cutler, and J. P. How, “Decoupled multiagent path planning via incremental sequential convex programming,” in 2015 IEEE International Conference on Robotics and Automation (ICRA).   IEEE, 2015, pp. 5954–5961.
  35. B. Li and Z. Shao, “A unified motion planning method for parking an autonomous vehicle in the presence of irregularly placed obstacles,” Knowledge-Based Systems, vol. 86, pp. 11–20, 2015.
  36. T. Lozano-Pérez and M. A. Wesley, “An algorithm for planning collision-free paths among polyhedral obstacles,” Communications of the ACM, vol. 22, no. 10, pp. 560–570, 1979.
  37. E. W. Dijkstra, “A note on two problems in connexion with graphs,” in Edsger Wybe Dijkstra: His Life, Work, and Legacy, 2022, pp. 287–290.
  38. 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, pp. 25–57, 2006.
  39. A. HSL, “collection of fortran codes for large-scale scientific computation,” See http://www. hsl. rl. ac. uk, 2007.
  40. T. Shan, B. Englot, D. Meyers, W. Wang, C. Ratti, and D. Rus, “Lio-sam: Tightly-coupled lidar inertial odometry via smoothing and mapping,” in 2020 IEEE/RSJ international conference on intelligent robots and systems (IROS).   IEEE, 2020, pp. 5135–5142.

Summary

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

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