Neural Path Planning: Fixed Time, Near-Optimal Path Generation via Oracle Imitation

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

1968

Earlier work this paper cites.

O. Khatib, “Real-time obstacle avoidance for manipulators and mobile robots,” in Autonomous robot vehicles . Springer, 1986, pp. 396–404

1986

Earlier work this paper cites.

K.-i. Funahashi and Y. Nakamura, “Approximation of dynamical systems by continuous time recurrent neural networks,” Neural networks , vol. 6, no. 6, pp. 801–806, 1993

1993

Earlier work this paper cites.

R. Glasius, A. Komoda, and S. C. Gielen, “Neural network dynamics for path planning and obstacle avoidance,” Neural Networks , vol. 8, no. 1, pp. 125–133, 1995

1995

Earlier work this paper cites.

S. Hochreiter and J. Schmidhuber, “Long short-term memory,” Neural computation , vol. 9, no. 8, pp. 1735–1780, 1997

1997

Earlier work this paper cites.

S. M. LaValle, “Rapidly-exploring random trees: A new tool for path planning,” 1998

1998

Earlier work this paper cites.

J. J. Kuffner and S. M. LaValle, “Rrt-connect: An efficient approach to single-query path planning,” in Robotics and Automation, 2000. Proceedings. ICRA’00. IEEE International Conference on , vol. 2. IEEE, 2000, pp. 995–1001

2000

Earlier work this paper cites.

S. M. LaValle, M. S. Branicky, and S. R. Lindemann, “On the relationship between classical grid search and probabilistic roadmaps,” The International Journal of Robotics Research , vol. 23, no. 7-8, pp. 673–692, 2004

2004

Earlier work this paper cites.

M. Rickert, O. Brock, and A. Knoll, “Balancing exploration and exploitation in motion planning,” in Robotics and Automation, 2008. ICRA 2008. IEEE International Conference on . IEEE, 2008, pp. 2812–2817

2008

Cited alongside, same era.

N. Ratliff, M. Zucker, J. A. Bagnell, and S. Srinivasa, “Chomp: Gradient optimization techniques for efficient motion planning,” in Robotics and Automation, 2009. ICRA’09. IEEE International Conference on . IEEE, 2009, pp. 489–494

2009

Cited alongside, same era.

P. Abbeel, A. Coates, and A. Y. Ng, “Autonomous helicopter aerobatics through apprenticeship learning,” The International Journal of Robotics Research , vol. 29, no. 13, pp. 1608–1639, 2010

2010

Cited alongside, same era.

S. Calinon, F. D’halluin, E. L. Sauser, D. G. Caldwell, and A. G. Billard, “Learning and reproduction of gestures by imitation,” IEEE Robotics & Automation Magazine , vol. 17, no. 2, pp. 44–54, 2010

2010

Cited alongside, same era.

A. Krontiris and K. E. Bekris, “Dealing with difficult instances of object rearrangement.” in Robotics: Science and Systems , 2015

2015

Later among the works it cites.

A. H. Qureshi and Y. Ayaz, “Potential functions based sampling heuristic for optimal path planning,” Autonomous Robots , vol. 40, no. 6, pp. 1079–1093, 2016

2016

Later among the works it cites.

D. González, J. Pérez, V. Milanés, and F. Nashashibi, “A review of motion planning techniques for automated vehicles,” IEEE Transactions on Intelligent Transportation Systems , vol. 17, no. 4, pp. 1135–1145, 2016

2016

Later among the works it cites.

N. Chen, M. Karl, and P. van der Smagt, “Dynamic movement primitives in latent space of time-dependent variational autoencoders,” in Humanoid Robots (Humanoids), 2016 IEEE-RAS 16th International Conference on . IEEE, 2016, pp. 629–636

2016

Later among the works it cites.