Skip to content
Hub Nexus

No author yetClaim it

Version 1Updated 2 min read

Support

State Machines

Digital computers have a lot more power and flexibility to offer than processing simple difference equations like the kind that we have been looking at so far in our discrete cases. Computer systems are capable of handling much more complicated digital control tasks, and they are also capable of changing their algorithms in the middle of the processing time. For tasks like this, we will employ state-machines to allow us to dynamically control several aspects of a single problem with a single computer.

A state machine, in its simplest form, is a system that performs different actions, depending upon the state of the machine.

State Diagrams

A state diagram depicts the different states of a state machine, and it uses arrows to show which states can be reached, and what are the conditions for reaching them.

Example

Consider a common controls example of a movable cart that is attached to a horizontal pole. This cart, like the print-head on a printer, is free to travel back and forth across this pole at finite speeds. Dangling from the cart is a pendulum that is capable of freely spinning 360 degrees around its pivot point.

(Image: Whiteknight at English Wikibooks, CC BY-SA 3.0)

As the cart moves back and forth across the horizontal pole, the pendulum will swing side-to-side. In fact, if the cart moves quickly enough, and in the correct pattern, the pendulum will actually swing up over the top of the cart, and travel a full 360 degrees. The purpose of this contraption is to swing the pendulum upwards so that it is standing up vertically above the cart, and to balance it as such. There are then two distinct stages of operation for our control system:

  • we must swing the pendulum from directly downward, to standing vertical
  • we must balance the pendulum vertically

(Image: Whiteknight at English Wikibooks, CC BY-SA 3.0)

Where this page came from

This page was imported from Wikibooks. From “Control Systems” on Wikibooks, by its contributors, under CC BY-SA 4.0. Changed here: set as a page; navigation and edit links left out; each image under its own licence, credited in its caption.

Nobody has written it yet — it is the source material at a new address, which is why search engines are asked to skip it and why no one earns from it. It is up for grabs: take it on, and it is yours to rewrite and to earn from.

Comments

Spinner Logo

Next in Control Systems

CC BY-SA 4.0
We can define them recursively as such: ${x}_{n} ( t ) = {x}_{0} + {∫}_{{t}_{0}}^{t} f ( τ , {x}_{n − 1} ( τ ) ) d τ$ ${x}_{1} ( t ) = {x}_{0}$ We can show that the following relationship is true: $x ( t ) = {lim}_{n → ∞} {x}_{n} ( t )$ The xn series of equations will converge on the solution to the
CC BY-SA 4.0
There are some nonlinearities that happen so frequently in physical systems that they are called "Common nonlinearities". These common nonlinearities include Hysteresis, Backlash, and Dead-zone. ## Hysteresis Continuing with the example of a household thermostat, let's say that your thermostat is se
CC BY-SA 4.0
- The two inputs may act on the system in completely different ways. As we will show in the next example, it is frequently a good idea to consider the noise and the control inputs separately: **Example:** Consider a moving automobile. The control signals for the automobile consist of acceleration (g
CC BY-SA 4.0
Notice that we set our start time t0 = kT, because we are only interested in the behavior of our system during a single sample period: $u ( t ) = u ( k T ) , k T ≤ t ≤ ( k + 1 ) T$ $x ( t ) = Φ ( t , k T ) x ( k T ) + {∫}_{k T}^{t} Φ ( t , τ ) B d τ u ( k T )$ We were able to remove u(kT) from the i
CC BY-SA 4.0
Other delays however, such as synchronization delays, are an integral part of a system. This chapter will talk about how delays are utilized and represented in the Laplace Domain. Once we represent a delay in the Laplace domain, it is an easy matter, through change of variables, to express delays in