Jump to content

Pfaffian constraint

From Wikipedia, the free encyclopedia

Indynamics,aPfaffian constraintis a way to describe a dynamical system in the form:

[1]

whereis the number of equations in a system of constraints.

Holonomic systems can always be written in Pfaffian constraint form.

Derivation[edit]

Given a holonomic system described by a set ofholonomic constraintequations

whereare thengeneralized coordinatesthat describe the system, and whereis the number of equations in a system of constraints, we can differentiate by the chain rule for each equation:

By a simple substitution of nomenclature we arrive at:

Examples[edit]

Pendulum[edit]

A pendulum

Consider a pendulum. Because of how the motion of the weight is constrained by the arm, the velocity vectorof the weight must be perpendicular at all times to the position vector.Because these vectors are always orthogonal, theirdot productmust be zero. Both position and velocity of the mass can be defined in terms of an-coordinate system:

Simplifying the dot product yields:

We multiply both sides by.This results in the Pfaffian form of the constraint equation:

This Pfaffian form is useful, as we may integrate it to solve for the holonomic constraint equation of the system, if one exists. In this case, the integration is rather trivial:

Where C is the constant of integration.

And conventionally, we may write:

The termis squared simply because it must be a positive number; being a physical system, dimensions must all bereal numbers.Indeed,is the length of the pendulum arm.

Robotics[edit]

Inrobotmotion planning,aPfaffian constraintis a set ofklinearly independentconstraintslinear in velocity, i.e., of the form

One source of Pfaffian constraints is rolling without slipping inwheeled robots.[2]

References[edit]

  1. ^Ardema, Mark D. (2005).Analytical Dynamics: Theory and Applications.Kluwer Academic / Plenum Publishers. p. 57.ISBN0-306-48681-4.
  2. ^Choset, H.M. (2005).Principles of Robot Motion: Theory, Algorithms, and Implementation.The MIT Press.ISBN0-262-03327-5.