Splines and polynomial tools for flatness-based constrained motion planning

• Published in: International journal of systems science Vol. 43; no. 8; pp. 1396 - 1411
• Main Authors: Suryawan, Fajar, De Doná, José, Seron, María
• Format: Journal Article
• Language: English
• Published: Taylor & Francis Group 01.08.2012
• Subjects: B-splines; flatness; magnetic levitation; motion planning; polynomials
• ISSN: 0020-7721; 1464-5319
• DOI: 10.1080/00207721.2010.549592

This article addresses the problem of trajectory planning for flat systems with constraints. Flat systems have the useful property that the input and the state can be completely characterised by the so-called flat output. We propose a spline parametrisation for the flat output, the performance output, the states and the inputs. Using this parametrisation the problem of constrained trajectory planning can be cast into a simple quadratic programming problem. An important result is that the B-spline parametrisation used gives exact results for constrained linear continuous-time system. The result is exact in the sense that the constrained signal can be made arbitrarily close to the boundary without having intersampling issues (as one would have in sampled-data systems). Simulation examples are presented, involving the generation of rest-to-rest trajectories. In addition, an experimental result of the method is also presented, where two methods to generate trajectories for a magnetic-levitation (maglev) system in the presence of constraints are compared and each method's performance is discussed. The first method uses the nonlinear model of the plant, which turns out to belong to the class of flat systems. The second method uses a linearised version of the plant model around an operating point. In every case, a continuous-time description is used. The experimental results on a real maglev system reported here show that, in most scenarios, the nonlinear and linearised models produce almost similar, indistinguishable trajectories.