Advertisement

Human-Like Path Planning in the Presence of Landmarks

  • Basak SakcakEmail author
  • Luca Bascetta
  • Gianni Ferretti
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9991)

Abstract

This work proposes a path planning algorithm for scenarios where the agent has to move strictly inside the space defined by signal emitting bases. Considering a base can emit within a limited area, it is necessary for the agent to be in the vicinity of at least one base at each point along the path in order to receive a signal. The algorithm starts with forming a specific network, based on the starting point such that only the bases which allow the described motion are included. A second step is based on RRT*, where each edge is created solving an optimal control problem that at the end provides a human-like path. Finally the best path is selected among all the ones that reach the goal region with the minimum cost.

Keywords

Human-like path planning Planning with landmarks 

References

  1. 1.
    Arechavaleta, G., Laumond, J.P., Hicheur, H., Berthoz, A.: An optimality principle governing human walking. IEEE Trans. Robot. 24(1), 5–14 (2008)CrossRefGoogle Scholar
  2. 2.
    Arechavaleta, G., Laumond, J.P., Hicheur, H., Berthoz, A.: On the nonholonomic nature of human locomotion. Auton. Robots 25(1–2), 25–35 (2008)CrossRefGoogle Scholar
  3. 3.
    Devaurs, D., Simon, T., Corts, J.: Efficient sampling-based approaches to optimal path planning in complex cost spaces. In: Akin, H.L., Amato, N.M., Isler, V., van der Stappen, A.F. (eds.) Algorithmic Foundations of Robotics XI. Springer Tracts in Advanced Robotics, vol. 107, pp. 143–159. Springer, Heidelberg (2015)Google Scholar
  4. 4.
    Jeon, J.H., Karaman, S., Frazzoli, E.: Anytime computation of time-optimal off-road vehicle maneuvers using the RRT*. In: Decision and Control and European Control Conference (CDC-ECC) (2011)Google Scholar
  5. 5.
    Karaman, S., Frazzoli, E.: Sampling-based algorithms for optimal motion planning. Int. J. Robot. Res. 30(7), 846–894 (2011)CrossRefzbMATHGoogle Scholar
  6. 6.
    LaValle, S.M., Kuffner, J.J.: Randomized kinodynamic planning. Int. J. Robot. Res. 20(5), 378–400 (2001)CrossRefGoogle Scholar
  7. 7.
    Papadopoulos, A.V., Bascetta, L., Ferretti, G.: Generation of human walking paths. Auton. Robots 40(1), 59–75 (2016)CrossRefGoogle Scholar
  8. 8.
    Patterson, M.A., Rao, A.V.: A MATLAB software for solving multiple-phase optimal control problems using hp-adaptive Gaussian quadrature collocation methods and sparse nonlinear programming. ACM Trans. Math. Softw. (TOMS) 41(1), 1 (2014)MathSciNetCrossRefGoogle Scholar
  9. 9.
    Perez, A., Platt Jr., R., Konidaris, G., Kaelbling, L., Lozano-Perez, T.: LQR-RRT*: optimal sampling-based motion planning with automatically derived extension heuristics. In: Robotics and Automation (ICRA) (2012)Google Scholar
  10. 10.
    Puydupin-Jamin, A.S., Johnson, M., Bretl, T.: A convex approach to inverse optimal control and its application to modeling human locomotion. In: IEEE International Conference on Robotics and Automation (ICRA) (2012)Google Scholar

Copyright information

© Springer International Publishing AG 2016

Authors and Affiliations

  1. 1.Dipartimento di Elettronica Informazione e BioingegneriaPolitecnico di MilanoMilanoItaly

Personalised recommendations