Abstract
This work considers a Motion Planning Problem with Dynamic Obstacles (MPDO) in 2D that requires finding a minimum-arrival-time collision-free trajectory for a point robot between its start and goal locations amid dynamic obstacles moving along known trajectories. Existing methods, such as continuous Dijkstra paradigm, can find an optimal solution by restricting the shape of the obstacles or the motion of the robot, while this work makes no such assumptions. Other methods, such as search-based planners and sampling-based approaches can compute a feasible solution to this problem but do not provide approximation bounds. Since finding the optimum is challenging for MPDO, this paper develops a framework that can provide tight lower bounds to the optimum. These bounds act as proxies for the optimum which can then be used to bound the deviation of a feasible solution from the optimum. To accomplish this, we develop a framework that consists of (i) a bi-level discretization approach that converts the MPDO to a relaxed path planning problem, and (ii) an algorithm that can solve the relaxed problem to obtain lower bounds. We also present numerical results to corroborate the performance of the proposed framework. These results show that the bounds obtained by our approach for some instances are up to twice tighter than a baseline approach showcasing potential advantages of the proposed approach.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Canny, J., Reif, J.: New lower bound techniques for robot motion planning problems. In: 28th Annual Symposium on Foundations of Computer Science (SFCS 1987), pp. 49–60. IEEE (1987)
Choset, H., Lynch, K.M., Hutchinson, S., Kantor, G.A., Burgard, W.: Principles of Robot Motion: Theory, Algorithms, and Implementations. MIT Press (2005)
Frazzoli, E., Dahleh, M.A., Feron, E.: Real-time motion planning for agile autonomous vehicles. J. Guid. Control. Dyn. 25(1), 116–129 (2002)
Fujimura, K.: Motion planning amid transient obstacles. Int. J. Robot. Res. 13(5), 395–407 (1994)
Fujimura, K., Samet, H.: Planning a time-minimal motion among moving obstacles. Algorithmica 10(1), 41–63 (1993)
Gochev, K., Cohen, B., Butzke, J., Safonova, A., Likhachev, M.: Path planning with adaptive dimensionality. In: Fourth Annual Symposium on Combinatorial Search (2011)
Halperin, D., Salzman, O., Sharir, M.: Algorithmic motion planning. In: Handbook of Discrete and Computational Geometry, pp. 1311–1342. Chapman and Hall/CRC (2017)
Hart, P.E., Nilsson, N.J., Raphael, B.: A formal basis for the heuristic determination of minimum cost paths. IEEE Trans. Syst. Sci. Cybern. 4(2), 100–107 (1968)
Hershberger, J., Suri, S.: An optimal algorithm for euclidean shortest paths in the plane. SIAM J. Comput. 28(6), 2215–2256 (1999)
Hsu, D., Kindel, R., Latombe, J.C., Rock, S.: Randomized kinodynamic motion planning with moving obstacles. Int. J. Robot. Res. 21(3), 233–255 (2002)
Kant, K., Zucker, S.W.: Toward efficient trajectory planning: The path-velocity decomposition. Int. J. Robot. Res. 5(3), 72–89 (1986)
Latombe, J.C.: Robot Motion Planning, vol. 124. Springer Science & Business Media (2012)
LaValle, S.M.: Planning Algorithms. Cambridge University Press (2006)
Lozano-Pérez, T., Wesley, M.A.: An algorithm for planning collision-free paths among polyhedral obstacles. Commun. ACM 22(10), 560–570 (1979)
Maheshwari, A., Nouri, A., Sack, J.R.: Shortest paths among transient obstacles. J. Comb. Optim. 1–39 (2020)
Phillips, M., Likhachev, M.: Sipp: safe interval path planning for dynamic environments. In: 2011 IEEE International Conference on Robotics and Automation, pp. 5628–5635. IEEE (2011)
Ren, Z., Gong, C., Choset, H.: Deformed state lattice planning. In: 2017 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS), pp. 6307–6312. IEEE (2017)
Acknowledgments
This material is based upon work supported by the National Science Foundation under Grant No. 2120219 and 2120529. Any opinions, findings, and conclusions or recommendations expressed in this material are those of the author(s) and do not necessarily reflect the views of the National Science Foundation.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Ren, Z., Rathinam, S., Choset, H. (2023). A Lower Bounding Framework for Motion Planning Amid Dynamic Obstacles in 2D. In: LaValle, S.M., O’Kane, J.M., Otte, M., Sadigh, D., Tokekar, P. (eds) Algorithmic Foundations of Robotics XV. WAFR 2022. Springer Proceedings in Advanced Robotics, vol 25. Springer, Cham. https://doi.org/10.1007/978-3-031-21090-7_32
Download citation
DOI: https://doi.org/10.1007/978-3-031-21090-7_32
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-21089-1
Online ISBN: 978-3-031-21090-7
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)