Joint Sampling and Trajectory Optimization over Graphs for Online Motion Planning
Pages 4700 - 4707
Abstract
Among the most prevalent motion planning techniques, sampling and trajectory optimization have emerged successful due to their ability to handle tight constraints and high-dimensional systems, respectively. However, limitations in sampling in higher dimensions and local minima issues in optimization have hindered their ability to excel beyond static scenes in offline settings. Here we consider highly dynamic environments with long horizons that necessitate a fast on-line solution. We present a unified approach that leverages the complementary strengths of sampling and optimization, and interleaves them both in a manner that is well suited to this challenging problem. With benchmarks in multiple synthetic and realistic simulated environments, we show that our approach performs significantly better on various metrics against baselines that employ either only sampling or only optimization. Project page: https://sites.google.com/view/jistplanner
References
[1]
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, July 1968.
[2]
S. Koenig, M. Likhachev, and D. Furcy, “Lifelong planning A*,” Artificial Intelligence, vol. 155, no. 1, pp. 93 – 146, 2004.
[3]
M. Likhachev, G. J. Gordon, and S. Thrun, “ARA*: Anytime A* with provable bounds on sub-optimality,” in Advances in neural information processing systems, 2004, pp. 767–774.
[4]
M. Likhachev, D. I. Ferguson, G. J. Gordon, A. Stentz, and S. Thrun, “Anytime dynamic A*: An anytime, replanning algorithm.” in ICAPS, 2005, pp. 262–271.
[5]
D. Ferguson, N. Kalra, and A. Stentz, “Replanning with rrts,” in Proceedings 2006 IEEE International Conference on Robotics and Automation, 2006. ICRA 2006. IEEE, 2006, pp. 1243–1248.
[6]
X. Sun, W. Yeoh, and S. Koenig, “Moving target D* lite,” in 9th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2010), Toronto, Canada, May 10-14, 2010, Volume 1-3, 2010, pp. 67–74.
[7]
A. Mandalika, O. Salzman, and S. Srinivasa, “Lazy receding horizon A* for efficient path planning in graphs with expensive-to-evaluate edges,” arXiv preprint arXiv:1803.04998, 2018.
[8]
L. E. Kavraki, P. Svestka, J.-C. Latombe, and M. H. Overmars, “Probabilistic roadmaps for path planning in high-dimensional configuration spaces,” Robotics and Automation, IEEE Transactions on, vol. 12, no. 4, pp. 566–580, 1996.
[9]
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.
[10]
S. M. LaValle, Planning algorithms. Cambridge university press, 2006.
[11]
S. Karaman and E. Frazzoli, “Sampling-based algorithms for optimal motion planning,” The international journal of robotics research, vol. 30, no. 7, pp. 846–894, 2011.
[12]
S. M. LaValle and J. J. Kuffner, “Randomized kinodynamic planning,” The International Journal of Robotics Research, vol. 20, no. 5, pp. 378–400, 2001.
[13]
I. A. S¸ucan and L. E. Kavraki, “Kinodynamic motion planning by interior-exterior cell exploration,” in Algorithmic Foundation of Robotics VIII. Springer, 2009, pp. 449–464.
[14]
G. Sánchez and J.-C. Latombe, “A single-query bi-directional probabilistic roadmap planner with lazy collision checking,” in Robotics Research. Springer, 2003, pp. 403–417.
[15]
S. Karaman, M. R. Walter, A. Perez, E. Frazzoli, and S. Teller, “Anytime motion planning using the RRT,” in 2011 IEEE International Conference on Robotics and Automation. IEEE, 2011, pp. 1478–1483.
[16]
J. D. Gammell, S. S. Srinivasa, and T. D. Barfoot, “Batch informed trees (BIT*): Sampling-based optimal planning via the heuristically guided search of implicit random geometric graphs,” in 2015 IEEE International Conference on Robotics and Automation (ICRA). IEEE, 2015, pp. 3067–3074.
[17]
L. Janson, E. Schmerling, A. Clark, and M. Pavone, “Fast marching tree: A fast marching sampling-based method for optimal motion planning in many dimensions,” The International journal of robotics research, vol. 34, no. 7, pp. 883–921, 2015.
[18]
M. Zucker, N. Ratliff, A. D. Dragan, M. Pivtoraiko, M. Klingensmith, C. M. Dellin, J. A. Bagnell, and S. S. Srinivasa, “CHOMP: Covariant Hamiltonian optimization for motion planning,” The International Journal of Robotics Research, vol. 32, no. 9-10, pp. 1164–1193, 2013.
[19]
M. Toussaint, “Robot trajectory optimization using approximate inference,” in Proceedings of the 26th annual international conference on machine learning. ACM, 2009, pp. 1049–1056.
[20]
J. Schulman, Y. Duan, J. Ho, A. Lee, I. Awwal, H. Bradlow, J. Pan, S. Patil, K. Goldberg, and P. Abbeel, “Motion planning with sequential convex optimization and convex collision checking,” The International Journal of Robotics Research, vol. 33, no. 9, pp. 1251–1270, 2014.
[21]
M. Kalakrishnan, S. Chitta, E. Theodorou, P. Pastor, and S. Schaal, “STOMP: Stochastic trajectory optimization for motion planning,” in Robotics and Automation (ICRA), 2011 IEEE International Conference on. IEEE, 2011, pp. 4569–4574.
[22]
J. Dong, M. Mukadam, F. Dellaert, and B. Boots, “Motion planning as probabilistic inference using Gaussian processes and factor graphs,” in Proceedings of Robotics: Science and Systems (RSS), 2016.
[23]
M. Mukadam, J. Dong, X. Yan, F. Dellaert, and B. Boots, “Continuous-time gaussian process motion planning via probabilistic inference.” The International Journal of Robotics Research (IJRR), 2018.
[24]
H. Lee, D. Lee, and D. H. Shim, “Receding horizon-based RRT* algorithm for a UAV real-time path planner,” in AIAA Information Systems-AIAA Infotech@ Aerospace, 2017, p. 0676.
[25]
M. Zucker, J. Kuffner, and M. Branicky, “Multipartite RRTs for rapid replanning in dynamic environments,” in Proceedings 2007 IEEE International Conference on Robotics and Automation. IEEE, 2007, pp. 1603–1609.
[26]
G. S. Aoude, B. D. Luders, J. M. Joseph, N. Roy, and J. P. How, “Probabilistically safe motion planning to avoid dynamic obstacles with uncertain motion patterns,” Autonomous Robots, 2013.
[27]
M. W. Otte and E. Frazzoli, “RRTX: Real-time motion planning/replanning for environments with unpredictable obstacles,” in WAFR, 2014.
[28]
O. Adiyatov and H. A. Varol, “A novel RRT*-based algorithm for motion planning in dynamic environments,” in 2017 IEEE International Conference on Mechatronics and Automation (ICMA). IEEE, 2017, pp. 1416–1421.
[29]
Y. Tassa, T. Erez, and W. D. Smart, “Receding horizon differential dynamic programming,” in Advances in neural information processing systems, 2008, pp. 1465–1472.
[30]
F. Allgöwer and A. Zheng, Nonlinear model predictive control. Birkhäuser, 2012, vol. 26.
[31]
C. Park, J. Pan, and D. Manocha, “ITOMP: Incremental trajectory optimization for real-time replanning in dynamic environments.” in ICAPS, 2012.
[32]
J. Vannoy and J. Xiao, “Real-time adaptive motion planning (ramp) of mobile manipulators in dynamic environments with unforeseen changes,” IEEE Transactions on Robotics, vol. 24, no. 5, pp. 1199–1212, Oct 2008.
[33]
C. Park, J. Pan, and D. Manocha, “Real-time optimization-based planning in dynamic environments using GPUs,” in Robotics and Automation (ICRA), 2013 IEEE International Conference on. IEEE, 2013, pp. 4090–4097.
[34]
H. Oleynikova, M. Burri, Z. Taylor, J. Nieto, R. Siegwart, and E. Galceran, “Continuous-time trajectory optimization for online uav replanning,” in 2016 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS). IEEE, 2016, pp. 5332–5339.
[35]
O. Khatib, “Real-time obstacle avoidance for manipulators and mobile robots,” The international journal of robotics research, vol. 5, no. 1, pp. 90–98, 1986.
[36]
S. Quinlan, “Real-time modification of collision-free paths,” Ph.D. dissertation, Stanford University, 1994.
[37]
J.-H. Chuang and N. Ahuja, “An analytically tractable potential field model of free space and its application in obstacle avoidance,” Systems, Man, and Cybernetics, Part B: Cybernetics, IEEE Transactions on, vol. 28, no. 5, pp. 729–736, 1998.
[38]
M. Mabrouk and C. McInnes, “Solving the potential field local minimum problem using internal agent states,” Robotics and Autonomous Systems, vol. 56, no. 12, pp. 1050–1060, 2008.
[39]
J. Van den Berg, M. Lin, and D. Manocha, “Reciprocal velocity obstacles for real-time multi-agent navigation,” in 2008 IEEE International Conference on Robotics and Automation, 2008.
[40]
A. Kuntz, C. Bowen, and R. Alterovitz, “Interleaving optimization with sampling-based motion planning (ios-mp): Combining local optimization with global exploration,” arXiv preprint arXiv:1607.06374, 2016.
[41]
B. S. Willey, “Combining sampling and optimizing for robotic path planning,” Ph.D. dissertation, Rice University, 2018.
[42]
S. Choudhury, J. Gammell, T. Barfoot, and S. Srinivasa, “Regionally accelerated batch informed trees (RABIT*): A framework to integrate local information into optimal path planning,” in Proceedings of the 2016 IEEE Conference on Robotics and Automation (ICRA), 2016.
[43]
E. Huang, M. Mukadam, Z. Liu, and B. Boots, “Motion planning with graph-based trajectories and Gaussian process inference.” in Proceedings of the 2017 IEEE Conference on Robotics and Automation (ICRA), 2017.
[44]
F. R. Kschischang, B. J. Frey, and H.-A. Loeliger, “Factor graphs and the sum-product algorithm,” Information Theory, IEEE Transactions on, vol. 47, no. 2, pp. 498–519, 2001.
[45]
F. Dellaert and M. Kaess, “Square root SAM: Simultaneous localization and mapping via square root information smoothing,” The International Journal of Robotics Research, vol. 25, no. 12, pp. 1181–1203, 2006.
[46]
K. V. Alwala and M. Mukadam, “Joint sampling and trajectory optimization over graphs for online motion planning,” arXiv preprint arXiv:2011.07171, 2020.
[47]
K. Kolur, S. Chintalapudi, B. Boots, and M. Mukadam, “Online motion planning over multiple homotopy classes with Gaussian process inference,” IEEE Conference on Robotics and Automation (ICRA), 2019.
[48]
F. Dellaert, “Factor graphs and GTSAM: a hands-on introduction,” Georgia Tech Technical Report, GT-RIM-CP&R-2012-002, Tech. Rep., 2012.
[49]
M. Mukadam, C.-A. Cheng, X. Yan, and B. Boots, “Approximately optimal continuous-time motion planning and control via probabilistic inference.” in Proceedings of the 2017 IEEE Conference on Robotics and Automation (ICRA), 2017.
[50]
J. Reeds and L. Shepp, “Optimal paths for a car that goes both forwards and backwards,” Pacific journal of mathematics, vol. 145, no. 2, pp. 367–393, 1990.
[51]
N. Koenig and A. Howard, “Design and use paradigms for gazebo, an open-source multi-robot simulator,” in 2004 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)(IEEE Cat. No. 04CH37566), vol. 3. IEEE, 2004, pp. 2149–2154.
[52]
C. Gloor, “Pedsim: Pedestrian crowd simulation,” URL http://pedsim.silmaril.org, vol. 5, no. 1, 2016.
[53]
H. Oleynikova, Z. Taylor, M. Fehr, R. Siegwart, and J. Nieto, “Voxblox: Incremental 3d euclidean signed distance fields for on-board mav planning,” in 2017 Ieee/rsj International Conference on Intelligent Robots and Systems (iros). IEEE, 2017, pp. 1366–1373.
[54]
J. D. Gammell, S. S. Srinivasa, and T. D. Barfoot, “Informed RRT*: Optimal sampling-based path planning focused via direct sampling of an admissible ellipsoidal heuristic,” in 2014 IEEE/RSJ International Conference on Intelligent Robots and Systems. IEEE, 2014, pp. 2997–3004.
[55]
S. Choudhury, M. Bhardwaj, S. Arora, A. Kapoor, G. Ranade, S. Scherer, and D. Dey, “Data-driven planning via imitation learning,” The International Journal of Robotics Research, vol. 37, no. 13-14, pp. 1632–1672, 2018.
[56]
B. Ichter, J. Harrison, and M. Pavone, “Learning sampling distributions for robot motion planning,” in 2018 IEEE International Conference on Robotics and Automation (ICRA). IEEE, 2018, pp. 7087–7094.
[57]
M. Bhardwaj, B. Boots, and M. Mukadam, “Differentiable Gaussian process motion planning,” in 2020 IEEE International Conference on Robotics and Automation (ICRA). IEEE, 2020, pp. 10 598–10 604.
Index Terms
- Joint Sampling and Trajectory Optimization over Graphs for Online Motion Planning
Index terms have been assigned to the content through auto-classification.
Recommendations
Importance sampling for online planning under uncertainty
The partially observable Markov decision process (POMDP) provides a principled general framework for robot planning under uncertainty. Leveraging the idea of Monte Carlo sampling, recent POMDP planning algorithms have scaled up to various challenging ...
Sampling-Based Roadmap of Trees for Parallel Motion Planning
This paper shows how to effectively combine a sampling-based method primarily designed for multiple-query motion planning [probabilistic roadmap method (PRM)] with sampling-based tree methods primarily designed for single-query motion planning (...
Comments
Information & Contributors
Information
Published In
Sep 2021
7915 pages
Copyright © 2021.
Publisher
IEEE Press
Publication History
Published: 27 September 2021
Qualifiers
- Research-article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 13 Nov 2024
Other Metrics
Citations
View Options
View options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in