Cart (Loading....) | Create Account
Close category search window
 

Optimal control of multi-input SMA actuator arrays using graph theory: Expanding wavefront & simultaneous operations

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Flemming, L.J. ; Mech. Eng., Univ. of Utah, Salt Lake City, UT, USA ; Johnson, D.E. ; Mascaro, S.A.

Shape memory alloy (SMA) actuators are compact and have high force-to-weight ratios, making them strong candidates to actuate robots, exoskeletons, and prosthetics. However, these actuators are thermomechanical in nature and slow cooling rates can limit their performance. To improve the convective cooling, SMA wires have been embedded in vascular networks allowing cold fluid to pass across the actuators to cool/extend them. The vascular network can also deliver hot fluid to heat and contract the wire. In addition to the fluidic network, an electrical network operating in parallel can resistively heat the SMA to produce contraction. To minimize the weight and size of the vascular and electrical networks, a scalable N[N architecture has been implemented that allows for 2N control devices (valves, transistors) to be shared amongst N2 actuators. This Network Array Architecture (NAA) allows each actuator to be controlled individually or in discrete subarrays. However, this architecture does not allow all combinations of actuators to be activated simultaneously; therefore in general a sequence of control commands will need to be executed in order to achieve the complete actuation. In order to find an optimal sequence of control commands, graph theory algorithms have been implemented. By treating each actuator's state as binary (fully contracted or extended), the collected states of an actuator array can be represented as nodes of the graph and the control commands as the graph edges. By properly weighting the costs of the graph edges, search algorithms can be used to find an optimal set of control commands for desired state changes. NAA results in a multi-graph that has 2NA??????N nodes and is highly interconnected. While initial work in this area established the basic validity of a graph search approach for NAA control, this article presents a scalable method of determining the optimal set of controls to minimize the operating cost (time and energ- ) and computational search cost.

Published in:

Intelligent Robots and Systems (IROS), 2011 IEEE/RSJ International Conference on

Date of Conference:

25-30 Sept. 2011

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.