Time-Optimal Path Following for Robots With Convex-Concave Constraints Using Sequential Convex Programming

Time-optimal path following considers the problem of moving along a predetermined geometric path in minimum time. In the case of a robotic manipulator with simplified constraints, a convex reformulation of this optimal control problem has been derived previously. However, many applications in roboti...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE transactions on robotics Ročník 29; číslo 6; s. 1485 - 1495
Hlavní autoři: Debrouwere, Frederik, Van Loock, Wannes, Pipeleers, Goele, Dinh, Quoc Tran, Diehl, Moritz, De Schutter, Joris, Swevers, Jan
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York IEEE 01.12.2013
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:
Convergence
Flexibility
Manipulators
Mobile robots
Motion planning
Numerical simulation
Optimal control
Robot control
Robotics
Robots
Velocity
ISSN:1552-3098, 1941-0468
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Time-optimal path following considers the problem of moving along a predetermined geometric path in minimum time. In the case of a robotic manipulator with simplified constraints, a convex reformulation of this optimal control problem has been derived previously. However, many applications in robotics feature constraints such as velocity-dependent torque constraints or torque rate constraints that destroy the convexity. The present paper proposes an efficient sequential convex programming (SCP) approach to solve the corresponding nonconvex optimal control problems by writing the nonconvex constraints as a difference of convex (DC) functions, resulting in convex-concave constraints. We consider seven practical applications that fit into the proposed framework even when mutually combined, illustrating the flexibility and practicality of the proposed framework. Furthermore, numerical simulations for some typical applications illustrate the fast convergence of the proposed method in only a few SCP iterations, confirming the efficiency of the proposed framework.
Bibliografie:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ISSN:1552-3098
1941-0468
DOI:10.1109/TRO.2013.2277565