Papers
Topics
Authors
Recent
Search
2000 character limit reached

Minimum-Time Planar Paths with up to Two Constant Acceleration Inputs and $L_2$ Velocity and Acceleration Constraints

Published 7 Mar 2024 in cs.RO | (2403.04602v1)

Abstract: Given starting and ending positions and velocities, $L_2$ bounds on the acceleration and velocity, and the restriction to no more than two constant control inputs, this paper provides routines to compute the minimal-time path. Closed form solutions are provided for reaching a position in minimum time with and without a velocity bound, and for stopping at the goal position. A numeric solver is used to reach a goal position and velocity with no more than two constant control inputs. If a cruising phase at the terminal velocity is needed, this requires solving a non-linear equation with a single parameter. Code is provided on GitHub at https://github.com/RoboticSwarmControl/MinTimeL2pathsConstraints.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (22)
  1. K. R. Duda, R. W. Loffi, and P. M. Handley, “System and method for assisted extravehicular activity self-return,” May 2018, US Patent 9,977,427.
  2. V. Evans, “Newton’s laws, g-forces and the impact on the brain,” The Australasian journal of neuroscience, vol. 30, no. 1, pp. 24–29, 2020.
  3. M. Laux and A. Zell, “Robot arm motion planning based on geodesics,” in 2021 IEEE International Conference on Robotics and Automation (ICRA).   IEEE, 2021, pp. 7585–7591.
  4. A. De Marchi, “On the mixed-integer linear-quadratic optimal control with switching cost,” IEEE Control Systems Letters, vol. 3, no. 4, pp. 990–995, 2019.
  5. F. Bestehorn, C. Hansknecht, C. Kirches, and P. Manns, “Mixed-integer optimal control problems with switching costs: a shortest path approach,” Mathematical Programming, vol. 188, no. 2, pp. 621–652, 2021.
  6. C. Kirches, E. Kostina, A. Meyer, M. Schlöder, and S. PN, “Numerical solution of optimal control problems with switches, switching costs and jumps,” Optimization Online, vol. 6888, 2018.
  7. S. Lu, J. Zhao, L. Jiang, and H. Liu, “Solving the time-jerk optimal trajectory planning problem of a robot using augmented lagrange constrained particle swarm optimization,” Mathematical Problems in Engineering, vol. 2017, 2017.
  8. R. Zhao and D. Sidobre, “Trajectory smoothing using jerk bounded shortcuts for service manipulator robots,” in 2015 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS).   IEEE, 2015, pp. 4929–4934.
  9. L. E. Dubins, “On curves of minimal length with a constraint on average curvature, and with prescribed initial and terminal positions and tangents,” American Journal of mathematics, vol. 79, no. 3, pp. 497–516, 1957.
  10. D. Carozza, S. Johnson, and F. Morgan, “Baserunner’s optimal path,” The Mathematical Intelligencer, vol. 32, no. 1, pp. 10–15, 2010.
  11. H. J. Sussmann and J. C. Willems, “300 years of optimal control: from the brachystochrone to the maximum principle,” IEEE Control Systems Magazine, vol. 17, no. 3, pp. 32–44, 1997.
  12. M. Lepetič, G. Klančar, I. Škrjanc, D. Matko, and B. Potočnik, “Time optimal path planning considering acceleration limits,” Robotics and Autonomous Systems, vol. 45, no. 3, pp. 199–210, 2003. [Online]. Available: https://www.sciencedirect.com/science/article/pii/S0921889003001544
  13. M. Hehn, R. Ritz, and R. D’Andrea, “Performance benchmarking of quadrotor systems using time-optimal control,” Autonomous Robots, vol. 33, no. 1-2, pp. 69–88, 2012.
  14. F. Ramos, M. Gajamohan, N. Huebel, and R. D’Andrea, “Time-optimal online trajectory generator for robotic manipulators,” Eidgenössische Technische Hochschule Zürich, Institute for Dynamic Systems, Tech. Rep., 2013. [Online]. Available: https://roboearth.ethz.ch/wp-content/uploads/2013/02/OMG.pdf
  15. T. Kröger and F. M. Wahl, “Online trajectory generation: Basic concepts for instantaneous reactions to unforeseen events,” IEEE Transactions on Robotics, vol. 26, no. 1, pp. 94–111, 2010.
  16. H. Liu, X. Lai, and W. Wu, “Time-optimal and jerk-continuous trajectory planning for robot manipulators with kinematic constraints,” Robotics and Computer-Integrated Manufacturing, vol. 29, no. 2, pp. 309–317, 2013.
  17. A. A. Ata, “Optimal trajectory planning of manipulators: a review,” Journal of Engineering Science and technology, vol. 2, no. 1, pp. 32–54, 2007.
  18. S. A. Bazaz and B. Tondu, “Minimum time on-line joint trajectory generator based on low order spline method for industrial manipulators,” Robotics and Autonomous Systems, vol. 29, no. 4, pp. 257–268, 1999.
  19. D. Verscheure, B. Demeulenaere, J. Swevers, J. De Schutter, and M. Diehl, “Time-optimal path tracking for robots: A convex optimization approach,” IEEE Transactions on Automatic Control, vol. 54, no. 10, pp. 2318–2327, 2009.
  20. H. Zhao, N. Abdurahiman, N. Navkar, J. Leclerc, and A. T. Becker, “Jerk-continuous online trajectory generation for robot manipulator with arbitrary initial state and kinematic constraints,” in 2022 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS).   IEEE, 2022, pp. 5730–5736.
  21. V. M. Baez and A. T. Becker, “Appendix: Equations for minimum-time planar paths with l2 velocity and acceleration constraints and a limited number of constant acceleration inputs,” University of Houston, Tech. Rep., 2023. [Online]. Available: https://github.com/RoboticSwarmControl/MinTimeL2pathsConstraints
  22. J. Lin, N. Somani, B. Hu, M. Rickert, and A. Knoll, “An efficient and time-optimal trajectory generation approach for waypoints under kinematic constraints and error bounds,” in 2018 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS).   IEEE, 2018, pp. 5869–5876.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.