# Explicit control laws for the periodic motion planning of controllable driftless systems on SU(n)

December 2012 Category : Controllers | All

**Authors**: H. Bressa Silveira, P.S. Pereira da Silva, P. Rouchon, IEEE Conference on Decision and Control (2012), pp. 3640-3645, 10-13 Dec. 2012, Hawai, USA.

In a previous work, the authors have introduced and treated the periodic motion planning problem for right-invariant driftless systems that evolve on SU(n), which in turn corresponds to an approximate motion planning control problem. Although the only assumption was the controllability of the system, the control laws are not explicitly known in general. By using analogous Lyapunov-like control techniques that were developed in that work, this paper complements its results and proves that if the system satisfies a more restrictive form of controllability, then the control laws are given by explicit and analytical expressions. Simulation results are presented for n = 4 and the generation of the C-NOT (Controlled-NOT) quantum logic gate.

Download PDF

**BibTeX**:

@Proceedings{,

author = {H. Bressa Silveira, P.S. Pereira da Silva, P. Rouchon},

editor = {},

title = {Explicit control laws for the periodic motion planning of controllable driftless systems on SU(n)},

booktitle = {IEEE Conference on Decision and Control (2012)},

volume = {},

publisher = {},

address = {Hawai},

pages = {3640-3645},

year = {2012},

abstract = {In a previous work, the authors have introduced and treated the periodic motion planning problem for right-invariant driftless systems that evolve on SU(n), which in turn corresponds to an approximate motion planning control problem. Although the only assumption was the controllability of the system, the control laws are not explicitly known in general. By using analogous Lyapunov-like control techniques that were developed in that work, this paper complements its results and proves that if the system satisfies a more restrictive form of controllability, then the control laws are given by explicit and analytical expressions. Simulation results are presented for n = 4 and the generation of the C-NOT (Controlled-NOT) quantum logic gate.},

keywords = {Controllability, Convergence, Logic gates, Planning, Switches, Trajectory}}