1-6 of 6
Keywords: computational complexity
Close
Follow your search
Access your saved searches in your account

Would you like to receive an alert when new items match your search?
Close Modal
Sort by
Journal Articles
Publisher: ASME
Article Type: Research Papers
J. Mech. Des. September 2011, 133(9): 091007.
Published Online: September 15, 2011
... computational complexity control system synthesis microactuators optimisation product design co-design optimization coupling control Optimal design of “smart” products and systems requires optimization of both the physical system or artifact, and its controller. This codesign problem can...
Journal Articles
Publisher: ASME
Article Type: Technical Briefs
J. Mech. Des. March 2010, 132(3): 034502.
Published Online: March 1, 2010
... to the robustness of the linear programming solver. 14 01 2009 18 12 2009 01 03 2010 01 03 2010 computational complexity convergence hierarchical systems large-scale systems linear programming stability Design optimization of complex systems often requires multidisciplinary...
Journal Articles
Publisher: ASME
Article Type: Research Papers
J. Mech. Des. August 2007, 129(8): 793–798.
Published Online: August 18, 2006
... efficiency; and (2) compared with the algebraic method, it has evidently reduced the difficulty of deducing formulas. The principle of the new method can be generalized to kinematic analysis of parallel mechanisms. 23 01 2006 18 08 2006 robot kinematics search problems computational...
Journal Articles
Publisher: ASME
Article Type: Research Papers
J. Mech. Des. March 2007, 129(3): 326–333.
Published Online: February 28, 2006
... or Jacobian of inverse kinematics is used, the computational complexity is reduced significantly, and the control scheme is more stable at or near singular manipulator configurations. Furthermore, the complexities and oddities associated with hybrid control, such as nonuniformity of the space matrix...
Journal Articles
Publisher: ASME
Article Type: Technical Papers
J. Mech. Des. May 2004, 126(3): 488–494.
Published Online: October 1, 2003
.... A method for elimination of redundant kinematic loop constraints is proposed. Its computational complexity is addressed. This complexity is tenable since the reduction algorithm is only carried out once as part of the preprocessing of the model. Moreover the achieved overall complexity of the MBS dynamics...
Journal Articles
Publisher: ASME
Article Type: Technical Briefs
J. Mech. Des. September 2003, 125(3): 640–642.
Published Online: September 4, 2003
... of a graph, as both eigenvalues and eigenvectors are used. It is shown from the discussion that the algorithm developed based on the quadratic form can work out all the challenging examples presented in the literature. Elsewhere, we can prove that the computational complexity of the proposed algorithm...