Refine
Language
- English (3)
Keywords
- Optimal control (1)
- Trajectory planning, optimal control problem, collision avoidance, (1)
- active set strategy (1)
- backface culling (1)
- collision avoidance (1)
- collision detection, distance computation, (1)
- cooperative robots (1)
- graph search algorithm, initialization, robotics (1)
- motion planning, robotics (1)
Project
- C30 (3)
Application Area
- C (3)
An optimal control problem to find the fastest collision-free trajectory of a robot surrounded by obstacles is presented.
The collision avoidance is based on linear programming arguments and expressed as state constraints. The optimal control problem is
solved with a sequential programming method. In order to decrease the number of unknowns and constraints a backface culling active set
strategy is added to the resolution technique.
An algorithm to detect collisions between robots moving along given trajectories is presented. The method is a combination of the adaptive
dynamic collision checking developed by Schwarzer et al. and Lin and Canny's algorithm, which computes efficiently the distance between two polyhedra. The resulting algorithm is part of a global model that computes the optimal task assignment, sequencing and kinodynamic
motion planning in a robotic work-cell.
A coupling of discrete and continuous optimization to solve kinodynamic motion planning problems
(2014)
This paper studies the relationship between the material derivative method, the shape derivative method, the min-max formulation of Correa and Seeger, and the Lagrange method introduced by Cea. A theorem is formulated
which allows a rigorous proof of the shape differentiability without the usage of material derivative;
the domain expression is automatically obtained and the boundary expression is easy to derive.
Furthermore, the theorem is applied to a cost function which depends on a quasi-linear transmission
problem. Using a Gagliardo penalization the existence of optimal shapes is established.