Matthew M. Peet

Matthew M. Peet

Auto-generated profile, based on publicly available information

Matthew M. Peet

School for the Engineering of Matter, Transport and Energy, Arizona State University, Tempe, AZ, USA

Research Focus & Metrics

Academic Career Length

18Years (2009-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
26 February 2020 in IEEE Robotics and Automation Letters
Verified
Journal Article
Closed access
ALAmir Salimi Lafmejani
Amir Salimi Lafmejani
ADAzadeh Doroudchi
Azadeh Doroudchi
HFHamed Farivarnejad
Hamed Farivarnejad
XHXimin He
Ximin He
DADaniel Aukes
Daniel Aukes
SBSpring Berman
Spring Berman
This paper addresses the kinematic modeling and control of continuum robots inspired by the octopus arm. We propose a discrete multi-segment model in which each segment is a 6-DoF Gough-Stewart parallel platform. Our model is novel in that it can reproduce all generic motions of an octopus arm, including elongation, shortening, bending, and particularly twisting, which is usually not included in such models, while enforcing the constant-volume property of the octopus arm. We use an approach that is inspired by the unique decentralized nervous system of the octopus arm to overcome challenges in solving the Inverse Kinematics (IK) problem, including the large number of solutions for this problem and the impracticality of numerical methods for real-time applications. We apply the pseudo-inverse Jacobian method to design a kinematic controller that drives the tip of the continuum robot to track a reference trajectory. We evaluate our proposed model and controller in simulation for a variety of 3D reference trajectories: a straight line, an ellipse, a sinusoidal path, and trajectories that emulate octopus-like reaching and fetching movements. The tip of the simulated continuum robot tracks the reference trajectories with average root-mean-square errors that are less than 0.3% of the robot's initial length, demonstrating the effectiveness of our modeling and control approaches.

1 January 2015 in Discrete and Continuous Dynamical Systems-Series B
Verified
Journal Article
Open access
PDF file
RKReza Kamyar
Reza Kamyar
MPMatthew M. Peet
Matthew M. Peet
In this paper, we explore the merits of various algorithms for solving polynomial optimization and optimization of polynomials, focusing on alternatives to sum of squares programming. While we refer to advantages and disadvantages of Quantifier Elimination, Reformulation Linear Techniques, Blossoming and Groebner basis methods, our main focus is on algorithms defined by Polya's theorem, Bernstein's theorem and Handelman's theorem. We first formulate polynomial optimization problems as verifying the feasibility of semi-algebraic sets. Then, we discuss how Polya's algorithm, Bernstein's algorithm and Handelman's algorithm reduce the intractable problem of feasibility of semi-algebraic sets to linear and/or semi-definite programming. We apply these algorithms to different problems in robust stability analysis and stability of nonlinear dynamical systems. As one contribution of this paper, we apply Polya's algorithm to the problem of $H_\infty$ control of systems with parametric uncertainty. Numerical examples are provided to compare the accuracy of these algorithms with other polynomial optimization algorithms in the literature.

2 May 2018 in IEEE Transactions on Automatic Control
Verified
Journal Article
Closed access
MPMatthew M. Peet
Matthew M. Peet
We present a dual form of Lyapunov-Krasovskii functional which allows the problem of controller synthesis for multi-delay systems to be formulated and solved in a convex manner. First, we give a generalized version of the dual stability condition formulated in terms of Lyapunov operators which are positive, self-adjoint and preserve the structure of the state-space. Second, we provide a class of such operators and express the stability conditions as positivity and negativity of quadratic Lyapunov-Krasovskii functional forms. Next, we adapt the SOS methodology to express positivity and negativity of these forms as LMIs, describing a new set of polynomial manipulation tools designed for this purpose. We apply the resulting LMIs to a battery of numerical examples and demonstrate that the stability conditions are not significantly conservative. Finally, we formulate a test for controller synthesis for systems with multiple delays, apply the test to a numerical example, and simulate the resulting closed-loop system.

25 November 2024 in IEEE Transactions on Automatic Control
Verified
Journal Article
Closed access
SSSachin Shivakumar
Sachin Shivakumar
ADAMRITAM DAS
AMRITAM DAS
SWSiep Weiland
Siep Weiland
MPMatthew Peet
Matthew Peet
Partial integral equation (PIE) representation of a partial differential equation (PDE) allows using computationally tractable algorithms for analysis, simulation, and optimal control. However, the PIE representation has not previously been extended to many of the complex, higher order PDEs that may be encountered in speculative or data-based models. In this article, we propose PIE representations for a large class of such PDE models, including higher order derivatives, boundary-valued inputs, and coupling with ordinary differential equations. The main technical contribution that enables this extension is a generalization of Cauchy's rule for repeated integration. The process of conversion of a complex PDE model to a PIE is simplified through a PDE modeling interface in the open-source software PIETOOLS. Numerical tests and illustrations are used to demonstrate the controller synthesis and simulation of PDEs.

1 January 2019 in IFAC-PapersOnLine
Verified
Journal Article
Open access
MPMatthew M. Peet
Matthew M. Peet
SSSachin Shivakumar
Sachin Shivakumar
ADAMRITAM DAS
AMRITAM DAS
SWSeip Weiland
Seip Weiland

18 October 2010 in IEEE Transactions on Automatic Control
Verified
Journal Article
Closed access
YZYashun Zhang
Yashun Zhang
MPMatthew Peet
Matthew Peet
KGKeqin Gu
Keqin Gu
This technical note considers the problem of reducing the computational complexity associated with the Sum-of-Squares approach to stability analysis of time-delay systems. Specifically, this technical note considers systems with a large state-space but where delays affect only certain parts of the system. This yields a coefficient matrix of the delayed state with low rank-a common scenario in practice. The technical note uses the general framework of coupled differential-difference equations with delays in feedback channels. This framework includes systems of both the neutral and retarded-type. The approach is based on recent results which introduced a new Lyapunov-Krasovskii structure which was shown to be necessary and sufficient for stability of this class of systems. This technical note shows how exploiting the structure of the new functional can yield dramatic improvements in computational complexity. Numerical examples are given to illustrate this improvement.