Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
125 tokens/sec
GPT-4o
53 tokens/sec
Gemini 2.5 Pro Pro
42 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

PINSAT: Parallelized Interleaving of Graph Search and Trajectory Optimization for Kinodynamic Motion Planning (2401.08948v2)

Published 17 Jan 2024 in cs.RO

Abstract: Trajectory optimization is a widely used technique in robot motion planning for letting the dynamics and constraints on the system shape and synthesize complex behaviors. Several previous works have shown its benefits in high-dimensional continuous state spaces and under differential constraints. However, long time horizons and planning around obstacles in non-convex spaces pose challenges in guaranteeing convergence or finding optimal solutions. As a result, discrete graph search planners and sampling-based planers are preferred when facing obstacle-cluttered environments. A recently developed algorithm called INSAT effectively combines graph search in the low-dimensional subspace and trajectory optimization in the full-dimensional space for global kinodynamic planning over long horizons. Although INSAT successfully reasoned about and solved complex planning problems, the numerous expensive calls to an optimizer resulted in large planning times, thereby limiting its practical use. Inspired by the recent work on edge-based parallel graph search, we present PINSAT, which introduces systematic parallelization in INSAT to achieve lower planning times and higher success rates, while maintaining significantly lower costs over relevant baselines. We demonstrate PINSAT by evaluating it on 6 DoF kinodynamic manipulation planning with obstacles.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (44)
  1. Multi-heuristic A*. The International Journal of Robotics Research, 35(1-3): 224–243.
  2. Joint sampling and trajectory optimization over graphs for online motion planning. In 2021 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS), 4700–4707. IEEE.
  3. Betts, J. T. 2010. Practical methods for optimal control and estimation using nonlinear programming. SIAM.
  4. Regionally accelerated batch informed trees (rabit*): A framework to integrate local information into optimal path planning. In 2016 IEEE International Conference on Robotics and Automation (ICRA), 4207–4214. IEEE.
  5. Parallelized Control-Aware Motion Planning With Learned Controller Proxies. IEEE Robotics and Automation Letters, 8(4): 2237–2244.
  6. De Boor, C. 1978. A practical guide to splines, volume 27. springer-verlag New York.
  7. Parallelizing RRT on distributed-memory architectures. In 2011 IEEE International Conference on Robotics and Automation, 2261–2266.
  8. PRA*: Massively parallel heuristic search. Journal of Parallel and Distributed Computing, 25(2): 133–143.
  9. 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), 3067–3074. IEEE.
  10. A formal basis for the heuristic determination of minimum cost paths. IEEE transactions on Systems Science and Cybernetics, 4(2): 100–107.
  11. Asymptotically optimal planning by feasible kinodynamic planning in a state–cost space. IEEE Transactions on Robotics, 32(6): 1431–1443.
  12. Efficient parallel A* search on multi-GPU system. Future Generation Computer Systems, 123: 35–47.
  13. Parallel sampling-based motion planning with superlinear speedup. In IROS, 1206–1212.
  14. Parallel A* and AO* algorithms- An optimality criterion and performance evaluation. In 1986 International Conference on Parallel Processing, University Park, PA, 274–277.
  15. A scalable method for parallelizing sampling-based motion planning algorithms. In 2012 IEEE International Conference on Robotics and Automation, 2529–2536.
  16. A scalable distributed RRT for motion planning. In 2013 IEEE International Conference on Robotics and Automation, 5088–5095.
  17. Bitkomo: Combining sampling and optimization for fast convergence in optimal motion planning. In 2022 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS), 4492–4497. IEEE.
  18. Probabilistic roadmaps for path planning in high-dimensional configuration spaces. IEEE tran. on Robot. Autom., 12(4): 566–580.
  19. Fast Kinodynamic Planning on the Constraint Manifold with Deep Neural Networks. arXiv preprint arXiv:2301.04330.
  20. Kinodynamic RRTs with fixed time step and best-input extension are not probabilistically complete. In Algorithmic Foundations of Robotics XI: Selected Contributions of the Eleventh International Workshop on the Algorithmic Foundations of Robotics, 233–244. Springer.
  21. A planning framework for persistent, multi-uav coverage with global deconfliction. In Field and Service Robotics, 459–474. Springer.
  22. Kinodynamic motion planning for mobile robots using splines. In 2009 IEEE/RSJ International Conference on Intelligent Robots and Systems, 2427–2433. IEEE.
  23. Randomized kinodynamic planning. Int. J. Robot. Research, 20(5): 378–400.
  24. LaValle, S. M.; et al. 1998. Rapidly-exploring random trees: A new tool for path planning.
  25. Mpc-mpnet: Model-predictive motion planning networks for fast, near-optimal planning under kinodynamic constraints. IEEE Robotics and Automation Letters, 6(3): 4496–4503.
  26. Search-Based Task Planning with Learned Skill Effect Models for Lifelong Robotic Manipulation. arXiv preprint arXiv:2109.08771.
  27. Planning long dynamically feasible maneuvers for autonomous vehicles. The International Journal of Robotics Research, 28(8): 933–945.
  28. Efficient and asymptotically optimal kinodynamic motion planning via dominance-informed regions. In 2018 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS), 1–9. IEEE.
  29. Time-optimal and jerk-continuous trajectory planning for robot manipulators with kinematic constraints. Robotics and Computer-Integrated Manufacturing, 29(2): 309–317.
  30. ePA*SE: Edge-Based Parallel A* for Slow Evaluations. In International Symposium on Combinatorial Search, volume 15, 136–144. AAAI Press.
  31. MPLP: Massively Parallelized Lazy Planning. IEEE Robotics and Automation Letters, 7(3): 6067–6074.
  32. Reactive long horizon task execution via visual skill and precondition models. In 2021 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS), 5717–5724. IEEE.
  33. Interleaving graph search and trajectory optimization for aggressive quadrotor flight. IEEE Robotics and Automation Letters, 6(3): 5357–5364.
  34. Torque-limited manipulation planning through contact by interleaving graph search and trajectory optimization. In 2023 IEEE International Conference on Robotics and Automation (ICRA), 8148–8154. IEEE.
  35. iDb-A*: Iterative Search and Optimization for Optimal Kinodynamic Motion Planning. arXiv preprint arXiv:2311.03553.
  36. PA* SE: Parallel A* for slow expansions. In Twenty-Fourth International Conference on Automated Planning and Scheduling.
  37. The NURBS book. Springer Science & Business Media.
  38. Pohl, I. 1970. Heuristic search viewed as path finding in a graph. Artificial intelligence, 1(3-4): 193–204.
  39. Minimum-time B-spline trajectories with corridor constraints. Application to cinematographic quadrotor flight plans. Control Engineering Practice, 89: 190–203.
  40. Sampling-based optimal kinodynamic planning with motion primitives. Autonomous Robots, 43(7): 1715–1732.
  41. Motion planning with sequential convex optimization and convex collision checking. The International Journal of Robotics Research, 33(9): 1251–1270.
  42. Control-limited differential dynamic programming. In 2014 IEEE International Conference on Robotics and Automation (ICRA), 1168–1175. IEEE.
  43. Toussaint, M. 2017. A tutorial on Newton methods for constrained trajectory optimization and relations to SLAM, Gaussian Process smoothing, optimal control, and probabilistic inference. Geometric and numerical foundations of movements, 361–392.
  44. Massively parallel A* search on a GPU. In Proceedings of the AAAI Conference on Artificial Intelligence.
Citations (3)
View on Semantic Scholar

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now