Combining Safe Interval Path Planning and Constrained Path Following Control: Preliminary Results

  • Konstantin Yakovlev
  • Anton AndreychukEmail author
  • Julia Belinskaya
  • Dmitry Makarov
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11659)


We study the navigation problem for a robot moving amidst static and dynamic obstacles and rely on a hierarchical approach to solve it. First, the reference trajectory is planned by the safe interval path planning algorithm that is capable of handling any-angle translations and rotations. Second, the path following problem is treated as the constrained control problem and the original flatness-based approach is proposed to generate control. We suggest a few enhancements for the path planning algorithm aimed at finding trajectories that are more likely to be followed by a robot without collisions. Results of the conducted experimental evaluation show that the number of successfully solved navigation instances significantly increases when using the suggested techniques.


Path planning Path finding AA-SIPP Differentially flat systems Point-to-point control problem 



This work was partially supported by RFBR Grant no. 18-37-20032 and by the “RUDN University Program 5-100”.


  1. 1.
    Belinskaya, Y.S., Chetverikov, V.N.: Control of four-rotor helicopter. Sci. Educ. (BMSTU. Electr. J.) 5, 157–171 (2012). (in Russian)Google Scholar
  2. 2.
    Bokovoy, A.V., Fomin, M.B., Yakovlev, K.S.: Implementation of the pathfinding system for autonomous navigation of mobile ground robot. In: CEUR, vol. 2236, pp. 72–78.
  3. 3.
    Chetverikov, V.N.: Flatness of dynamically linearizable systems. Differ. Equ. 40(12), 1747–1756 (2004)MathSciNetCrossRefGoogle Scholar
  4. 4.
    Chetverikov, V.N.: Controllability of flat systems. Differ. Equ. 43(11), 1558–1568 (2007)MathSciNetCrossRefGoogle Scholar
  5. 5.
    Fliess, M., Levine, J., Martin, P., Rouchon, P.: Flatness and defect of nonlinear systems: introductory theory and examples. Int. J. Control 61(6), 1327–1361 (1995)CrossRefGoogle Scholar
  6. 6.
    Hart, P.E., Nilsson, N.J., Raphael, B.: A formal basis for the heuristic determination of minimum cost paths. IEEE Trans. Sys. Sci. Cybern. 4(2), 100–107 (1968)CrossRefGoogle Scholar
  7. 7.
    Isidori, A.: Nonlinear Control Systems. Springer, Berlin (1995). Scholar
  8. 8.
    LaValle, S.M., Kuffner Jr., J.J.: Randomized kinodynamic planning. Int. J. Robot. Res. 20(5), 378–400 (2001)CrossRefGoogle Scholar
  9. 9.
    Magid, E., Rivlin, E.: Cautiousbug: a competitive algorithm for sensory-based robot navigation. In: 2004 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2004), vol. 3, pp. 2757–2762 (2004)Google Scholar
  10. 10.
    Ng, J., Bräunl, T.: Performance comparison of bug navigation algorithms. J. Intell. Rob. Syst. 50(1), 73–84 (2007)CrossRefGoogle Scholar
  11. 11.
    Nieuwenhuisen, M., Behnke, S.: Local multiresolution trajectory optimization for micro aerial vehicles employing continuous curvature transitions. In: Proceedings of the 2016 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS-2016), pp. 3219–3224. IEEE (2016)Google Scholar
  12. 12.
    Phillips, M., Likhachev, M.: SIPP: safe interval path planning for dynamic environments. In: Proceedings of the 2011 IEEE International Conference on Robotics and Automation (ICRA-2011), pp. 5628–5635 (2011)Google Scholar
  13. 13.
    Sahoo, S.R., Chiddarwar, S.S.: Mobile robot control using bond graph and flatness based approach. Int. Conf. Robot. Smart Manuf. (RoSMa2018) 133, 213–221 (2018)Google Scholar
  14. 14.
    Sira-Ramirez, H., Agrawal, S.K.: Differentially Flat Systems. Marcel Dekker, New York (2004)CrossRefGoogle Scholar
  15. 15.
    van den Berg, J., Guy, S.J., Lin, M., Manocha, D.: Reciprocal n-body collision avoidance. In: Pradalier, C., Siegwart, R., Hirzinger, G. (eds.) Robotics Research. STAR, vol. 70, pp. 3–19. Springer, Heidelberg (2011). Scholar
  16. 16.
    Wooden, D.T.: Graph-based path planning for mobile robots. Ph.D. thesis, Georgia Institute of Technology (2006)Google Scholar
  17. 17.
    Yakovlev, K., Andreychuk, A.: Any-angle pathfinding for multiple agents based on SIPP algorithm. In: Proceedings of the 27th International Conference on Automated Planning and Scheduling (ICAPS-2017), pp. 586–593 (2017)Google Scholar
  18. 18.
    Yap, P.: Grid-based path-finding. In: Proceedings of the 15th Conference of the Canadian Society for Computational Studies of Intelligence, pp. 44–55 (2002)CrossRefGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  1. 1.Artificial Intelligence Research InstituteFederal Research Center “Computer Science and Control” of Russian Academy of SciencesMoscowRussia
  2. 2.National Research University Higher School of EconomicsMoscowRussia
  3. 3.Peoples’ Friendship University of Russia (RUDN University)MoscowRussia
  4. 4.Bauman Moscow State Technical UniversityMoscowRussia
  5. 5.Moscow Institute of Physics and TechnologyDolgoprudnyRussia

Personalised recommendations