Abstract
In this paper we discuss the problem of planning safe paths amidst unpredictably moving obstacles in the plane. Given the initial positions and the maximal velocities of the moving obstacles, the regions that are possibly not collision-free are modeled by discs that grow over time. We present an approach to compute the shortest path between two points in the plane that avoids these growing discs. The generated paths are thus guaranteed to be collision-free with respect to the moving obstacles while being executed. We created a fast implementation that is capable of planning paths amidst many growing discs within milliseconds.
This research was supported by the IST Programme of the EU as a Shared-cost RTD (FET Open) Project under Contract No IST-2001-39250 (MOVIE - Motion Planning in Virtual Environments).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
de Berg, M., van Kreveld, M., Overmars, M., Schwarzkopf, O.: Computational Geometry, Algorithms and Applications, ch. 6 and 8, 2nd edn. Springer, Berlin, Heidelberg (2000)
van den Berg, J., Ferguson, D., Kuffner, J.: Anytime path planning and replanning in dynamic environments. In: Proc. IEEE Int. Conf. on Robotics and Automation (ICRA) (2006)
Burden, R.L., Faires, J.D.: Numerical analysis, ch.2, 7th edn. Brooks/Cole, Pacific Grove (2001)
Chang, E.C., Choi, S.W., Kwon, D.Y., Park, H., Yap, C.K.: Shortest path amidst disc obstacles is computable. In: Proc. Ann. Symposium on Computational Geometry (SoCG), pp. 116–125 (2005)
Fiorini, P., Shiller, Z.: Motion planning in dynamic environments using velocity obstacles. Int. J. of Robotics Research 17(7), 760–772 (1998)
Hsu, D., Kindel, R., Latombe, J., Rock, S.: Randomized kinodynamic motion planning with moving obstacles. Int. J. of Robotics Research 21(3), 233–255 (2002)
LaValle, S.M.: Planning Algorithms, ch. 2. Cambridge University Press, New York (2006)
Mitchell, J.S.B.: Geometric shortest paths and network optimization. In: Handbook of Computational Geometry, pp. 633–701. Elsevier Science Publishers, Amsterdam (2000)
Petty, S., Fraichard, T.: Safe motion planning in dynamic environments. In: Proc. IEEE Int. Conf. on Intelligent Robots and Systems (IROS), pp. 3726–3731 (2005)
Vasquez, D., Large, F., Fraichard, T., Laugier, C.: High-speed autonomous navigation with motion prediction for unknown moving obstacles. In: Proc. IEEE Int. Conf. on Intelligent Robots and Systems (IROS), pp. 82–87 (2004)
Weisstein, E.W.: Logarithmic Spiral. In MathWorld – a Wolfram web resource, http://mathworld.wolfram.com/LogarithmicSpiral.html
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
van den Berg, J., Overmars, M. (2008). Planning the Shortest Safe Path Amidst Unpredictably Moving Obstacles. In: Akella, S., Amato, N.M., Huang, W.H., Mishra, B. (eds) Algorithmic Foundation of Robotics VII. Springer Tracts in Advanced Robotics, vol 47. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-68405-3_7
Download citation
DOI: https://doi.org/10.1007/978-3-540-68405-3_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-68404-6
Online ISBN: 978-3-540-68405-3
eBook Packages: EngineeringEngineering (R0)