Abstract
Time-optimal path following considers the problem of moving along a predetermined geometric path in minimum time while respecting system constraints. This paper focusses on time-optimal path following problems in robotics where collision must be avoided with other robots or moving obstacles. The developed method is based on the convex reformulation of the time-optimal path following problem with simplified dynamics presented in [1]. The robot and the obstacles are modelled as unions of convex polyhedra and the collision avoidance constraints are derived using Lagrangian duality. These constraints render the optimization problem non-convex. However, numerical simulations show that the resulting non-convex optimization problem can still be solved efficiently using a non-linear solver, due to the time-optimal path following formulation [1] and the proposed formulation of the collision avoidance constraints.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
