| |
Last updated on July 1, 2020. This conference program is tentative and subject to change
Technical Program for Wednesday July 1, 2020
|
WeP11 Plenary Session, Ballroom 1 |
Add to My Program |
Lots to Be Done: Towards Data-Informed, Real-Time Coordination Algorithms
That Scale Up |
|
|
Chair: Devasia, Santosh | Univ of Washington |
|
08:00-09:00, Paper WeP11.1 | Add to My Program |
Lots to Be Done: Towards Data-Informed, Real-Time Coordination Algorithms That Scale Up |
|
Martinez, Sonia | University of California at San Diego |
Keywords: Networked control systems
Abstract: Networked and robotic systems in emerging applications are required to operate safely, adaptively, and degrade gracefully while coordinating a large number of nodes. Distributed algorithms have consolidated as a means for robust coordination, overcoming the challenges imposed by the limited capabilities of each agent. However, plenty of problems still exist to break down the barriers of fast computation, make effective use of measured data, and understand large-scale limit effects. In this talk, I will present ongoing work in the control of infrastructure networks and large-swarm coordination, along with a discussion on modeling approaches, analysis tools, and architectural trade-offs going from small to large-sized robotic networks.
|
|
WeLBP-A01 Late Breaking Poster Session, Ballroom ABC |
Add to My Program |
Poster-WeA |
|
|
|
09:00-09:30, Paper WeLBP-A01.1 | Add to My Program |
Overcoming the Obstacle of Fixed Eigenvalues in Decentralized Control |
|
Liu, Fengjiao | Yale University |
Morse, A. Stephen | Yale Univ |
Keywords: Networked control systems, Linear systems, Stability of linear systems
Abstract: Fixed eigenvalues {i.e., fixed modes} present obstacles to the decentralized stabilization and decentralized spectrum assignment of a multi-channel linear system, because they will appear in the closed-loop spectrum of the system with any given finite-dimensional linear time-invariant decentralized control. This poster introduces a simple approach to fully avoid the fixed eigenvalues of a jointly controllable and jointly observable multi-channel linear system using two techniques: state space extension and distributed control. State space extension means to add auxiliary integrators to channels and distributed control is to allow the passing of appropriate data among neighboring channels. The type of data to be transmitted is explicitly characterized. If the neighbor graph associated with the multi-channel system is strongly connected, this approach enables us to construct an augmented multi-channel linear system which has no fixed eigenvalues, regardless of bounded transmission delays.
|
|
09:00-09:30, Paper WeLBP-A01.2 | Add to My Program |
Distributed Autonomous Robotic Information Gathering under Communication Constraints |
|
Moon, Sangwoo | University of Colorado Boulder |
Frew, Eric W. | University of Colorado, Bolder |
Keywords: Communication networks, Networked control systems, Multivehicle systems
Abstract: This poster treats the problem of distributed planning for communication-aware information gathering by networked mobile robots. One of the major challenges with distributed planning is how to make a convergence of optimized planning under unknown or coupled decisions by a single robot. This poster uses a distributed sequential approach to tackle the issue. The key idea of the planning scheme is each robot makes its decision based on the decision results of other robots higher in a given hierarchy. The utility considered in a single robot is formulated as expected information gain that considers sensing and communication. To derive information measures for communication-aware information gathering, mutual information was applied when measurements were sent over a packet erasure channel network. Computing the mutual information under nonlinear and non-Gaussian properties of targets, sensing, and communication at the planner phase is another challenging issue. This poster presents sampling procedures using a specific measurement set and particle methods to calculate mutual information. A series of simulations from a scenario of RF emitters tracking using a team of fixed-wing small unmanned aircraft systems (sUAS) describe the presented approach can improve estimate accuracy and information gain compared with another planning approach that assumes the perfect communication. Simulation results also show the presented approach yields better results than other approaches that simplify the communication model or communication-aware information gain. Finally, this poster describes the ROS/Gazebo-based simulation implementation and flight experiments using a team of real fixed-wing sUAS.
|
|
09:00-09:30, Paper WeLBP-A01.3 | Add to My Program |
On-Board Capacity Fade Estimation Using Supervised Learning |
|
Manickam, Anandha Natarajan | The University of Texas at Dallas |
Yurkovich, Stephen | University of Texas at Dallas |
Keywords: Energy systems, Embedded systems, Machine learning
Abstract: The capabilities of supervised learning for capacity fade estimation in battery packs have been progressing in applicability and relevance over the last decade. Concurrently, hardware developments for on-board vehicular battery management systems are becoming more and more capable with enhanced memory and power management. This has paved the way for implementation of complicated algorithms incorporating data-driven technologies, especially for data intensive tasks such as capacity fade estimation. Leveraging this expanding capability, this poster presents an implementation of a capacity fade estimation approach refined for application on a single-board computer appropriate for on-board application in a vehicle. The techniques incorporate clustering and a feedforward network based learning system, with implementation achieved on a versatile Raspberry Pi platform. The data used in training and validation of the implementation was generated in-house for an off-the-shelf battery pack. The algorithms employed in this work consist of training and prediction on a multiple layered neural network, employing clustering techniques on reduced amounts of data for further data reduction. Although any suitable microcontroller could be utilized for this work, the simple Raspberry Pi platform was chosen for proof of concept. Moreover, the capabilities of this platform provide an ideal foundation for the next phase of the work which will employ cloud connectivity for an on-board application in an existing electric vehicle project.
|
|
09:00-09:30, Paper WeLBP-A01.4 | Add to My Program |
Simulation-Guided Reachable Set Estimation for Neural Network Models of Nonlinear Dynamical Systems |
|
Xiang, Weiming | Augusta University |
Keywords: Neural networks, Formal verification/synthesis, Model Validation
Abstract: Neural networks have been showing impressive ability to solve complicated tasks including modeling complex nonlinear dynamical systems considered in this project. However, due to the vulnerability of neural networks against adversarial disturbances or attacks and the black-box nature of neural networks, such neural network models are only restricted to the applications with the lowest levels of requirements of safety. This project addresses the reachability analysis and safety verification problems for a class of feedforward neural network models of nonlinear dynamical systems. An interval-wise reachability analysis results of feedforward neural networks are proposed in the framework of interval arithmetic. An efficient simulation-guided method is developed to compute over-approximations of the output set of the feedforward neural network of interest. Then, by recursively using the simulation-guide method, the reachable set over-approximation of the neural network model of a dynamical system can be obtained over a finite-time interval. The safety verification of neural network models can be performed by checking the emptiness of the intersection between reachable set over-approximation and unsafe regions. An example of Maglev system is provided to illustrate the effectiveness of the developed approach.
|
|
09:00-09:30, Paper WeLBP-A01.5 | Add to My Program |
SLS-MATLAB Toolbox: Do-It-Yourself System Level Synthesis |
|
Li, Jing Shuang | California Institute of Technology |
Tseng, Shih-Hao | California Institute of Technology |
Keywords: Control software, Linear systems, Optimal control
Abstract: We introduce an open-source MATLAB toolbox for System Level Synthesis (SLS), a novel framework for robust and optimal linear controller synthesis in the distributed setting. As the systems we seek to control become larger, considerations such as communication delay, actuation delay, actuation sparsity, and disturbance containment become key constraints in the controller synthesis problem. The SLS-MATLAB toolbox includes solutions for these constraints, as well as additional features for distributed MPC, robust controller synthesis, actuator co-design, and controller refinement. Further, it contains built-in simulation and visualization tools for easy representation of system responses to arbitrary disturbances. The SLS framework is used in a number of ongoing works in the control community; these include interfacing robust control with learning, nonlinear distributed control, and distributed adaptive control. With this toolbox, we hope to make the SLS framework more accessible to members of the control community as both a ready-to-use tool and a base upon which new controller synthesis algorithms can be built.
|
|
09:00-09:30, Paper WeLBP-A01.6 | Add to My Program |
Controlled Microparticle Separation Using Whispering Gallery Mode Forces |
|
Chang, Yuhe | Boston University |
Andersson, Sean B. | Boston University |
Ekinci, Kamil L. | Boston University |
Svitelskiy, Oleksiy | Gorden College |
King, Alexander S. | Gorden College |
Jordan, Nathan J. | Gorden College |
Keywords: Optimal control, Filtering, Kalman filtering
Abstract: There is a wide variety of applications that require sorting and separation of micro-particles from a large cluster of similar objects. Existing methods can distinguish micro-particles by their bulk properties, such as their size, density, and electric polarizability. However, those methods are not selective with respect to the individual geometry of the particles. In this work, we describe the use of resonant amplification of light propelling forces to achieve high selection sensitivity with respect to the radius of the particle, through the use of Whispering Gallery Mode (WGM) resonances of fluid-suspended dielectric microparticles. We demonstrate that the evanescent field around a tapered optical fiber fed with sim20 mW power from a 1064 nm laser can selectively move polystyrene microspheres of up to 20 mum in diameter through distances of more than 50 mum. Since WGM force allows the entire procedure to be controllable and tunable by adjusting the direction and the power level of laser, we explore a simulation scheme of a WGM-based device for micro-particle separation. In this design, particles flow in through an inlet and leave through an outlet. Particles will pass over two actuation regions provided by waveguides carrying laser of a specified wavelength to generate the evanescent field. A camera is used to observe particles such that a feedback control can be applied to the power of laser. Challenges in this proposed structure include unknown disturbances to the fluid flow, limited laser power, and uni-directional control over each actuation region. We then combine Expectation Maximization with Kalman filtering to both estimate the unknown disturbance and filter the measurements into a position estimate. Hybrid controllers are developed and compared with regular setting of a Linear–Quadratic–Gaussian (LQG) controller in the simulation.
|
|
09:00-09:30, Paper WeLBP-A01.7 | Add to My Program |
Efficient Path Generation and Tracking Control for Autonomous Vehicles |
|
Choi, Jinsuk | Postech |
Baek, Seungmin | POSTECH |
Lee, Hyoung-woong | Pohang University of Science and Technology |
Han, Soohee | Pohang University of Science and Technology |
Keywords: Autonomous systems, Nonholonomic systems, Simulation
Abstract: In autonomous vehicles (AVs), several studies have been conducted, such as driving, path planning, artificial intelligence (AI), and decision making. The AVs tracking control is required efficient and robust controllers to conduct large computations loads such as AI and decision making. First, in the case of path planning, a rapidly-exploring random tree has a large amount of calculation, so it is not easy to apply it to a real AVs. You need to create a vehicle's moveable path and create a path that requires less computation, so you can spend more time to have environmental recognition and making decisions. Besides, some researchers have studied linear controllers, sliding mode control, and model predictive control (MPC) as AV controllers. Among those controllers, MPC is the most common controller. However, since AVs have the nonlinear dynamics, a controller using nonlinear MPC (NMPC) also appears instead of using a linear MPC. To calculate the NMPC, we generate much computational load every sampling time. This is not suitable for path planning and controllers to proceed with AI algorithms. Therefore, we introduce a more straightforward, robust, and optimal method for optimizing the movement of AVs. In this paper, we introduce path planning using polynomial and tracking control based on PID. The SPP curve generator not only takes into account the movement of the vehicle but also uses the polynomial equation. The polynomial equation makes it faster than other curve generators. Also, we design a vehicle position control and vehicle velocity control based on a PID controller. The solution combined with SPP curve generator and PID generates not only a robust controller but also moving paths in AVs, allowing sufficient time for processing not only sensor data but also AI and decision making. Therefore, it is thought that it will be able to guarantee computation load and robustness in the future research of AVs field.
|
|
WeLBP-A02 ACC Sponsors |
Add to My Program |
Meeting Space-WeA |
|
|
|
09:00-09:30, Paper WeLBP-A02.1 | Add to My Program |
Gold Sponsor: General Motors |
|
Eckman, Wendy | General Motors |
Keywords:
Abstract: We envision a future of zero crashes, zero emissions and zero congestion, and we have committed ourselves to leading the way toward this future. General Motors has been pushing the limits of transportation and technology for over 100 years. Today, we are in the midst of a transportation revolution. And we have the ambition, the talent and the technology to realize the safer, better and more sustainable world we want. As an open, inclusive company, we’re also creating an environment where everyone feels welcomed and valued for who they are. One team, where all ideas are considered and heard, where everyone can contribute to their fullest potential, with a culture based in respect, integrity, accountability and equality. Our team brings wide-ranging perspectives and experiences to solving the complex transportation challenges of today and tomorrow. At General Motors, innovation is our north star. As the first automotive company to mass-produce an affordable electric car, and the first to develop an electric starter and air bags, GM has always pushed the limits of engineering. We are General Motors. We transformed how the world moved through the last century. And we’re determined to do it again as we redefine mobility to serve our customers and shareholders and solve societal challenges. For additional information see https://www.gm.com/
|
|
09:00-09:30, Paper WeLBP-A02.2 | Add to My Program |
Gold Sponsor: Mathworks |
|
Rose, Jennifer | MathWorks |
Ulusoy, Melda | Mathworks |
Keywords:
Abstract: The MATLAB and Simulink product families are fundamental applied math and computational tools at the world's educational institutions. Adopted by more than 5000 universities and colleges, MathWorks products accelerate the pace of learning, teaching, and research in engineering and science. MathWorks products also help prepare students for careers in industry worldwide, where the tools are widely used for data analysis, mathematical modeling, and algorithm development in collaborative research and new product development. Application areas include data analytics, mechatronics, communication systems, image processing, computational finance, and computational biology. For additional information see https://www.mathworks.com/
|
|
09:00-09:30, Paper WeLBP-A02.3 | Add to My Program |
Gold Sponsor: Mitsubishi Electric Research Lab (MERL) |
|
Thornton, Jay | Mitsubishi Electric Research Lab |
Di Cairano, Stefano | Mitsubishi Electric Research Lab |
Keywords:
Abstract: Mitsubishi Electric Research Laboratory (MERL), located in Cambridge, MA, is the North American R&D organization for Mitsubishi Electric Corporation, a 40B global manufacturer of electrical products including elevator and escalators, HVAC systems, electrical power systems, satellites, factory automation equipment, automotive electronics and visual information systems. Controls researchers at MERL collaborate with corporate R&D laboratories, business units in Japan and academic partners around the world to develop new control algorithms and control technologies that extend the performance envelope of these systems. For students who are interested in pursuing an exciting summer of research, please check out our internship program and learn more at facebook, google, or @MERL_news. MERL interns work closely with top researchers, and gain valuable industry experience – an impressive 1:1 intern to researcher ratio. Internships are expected to lead to publications in major conferences and journals. We offer competitive compensation and relocation assistance. Boston is a fantastic student-oriented city, home to some of the best universities in the world. The summer season is especially lively as MERL and Boston are teeming with interns and visitors from all over the world.
|
|
09:00-09:30, Paper WeLBP-A02.4 | Add to My Program |
Silver Sponsor: Quanser |
|
Rahaman, Josie | Quanser Consulting |
Wang, Gemma | Quanser |
Keywords:
Abstract: Quanser is the world leader in mechatronics, robotics, and control platforms optimized for the academic setting. Our leadership in producing innovative lab solutions makes us a trusted partner with academic institutions to help strengthen their reputation with transformative research and teaching labs. The Quanser approach of innovation, collaboration and education has produced a number of notable technology firsts that pioneered many critical contemporary trends, including efficient validation platform for control research, and high-performance real-time control on common microcomputers. For additional information see https://www.quanser.com/
|
|
09:00-09:30, Paper WeLBP-A02.5 | Add to My Program |
Silver Sponsor: SIAM |
|
O'Neill, Kristin | SIAM |
Keywords:
Abstract: SIAM publishes textbooks and monographs in print and electronic format. Visit our booth to browse new and bestselling titles, all available at discounted conference pricing. If you’re interested in writing a book, an editor is available to explain how SIAM partners with authors to publish books of outstanding quality and accessible pricing. More info: https://www.siam.org/Publications/Books
|
|
09:00-09:30, Paper WeLBP-A02.6 | Add to My Program |
Silver Sponsor: Cancelled |
|
Kelly, Claire | Wiley |
Keywords:
Abstract: Silver Sponsor: Cancelled
|
|
09:00-09:30, Paper WeLBP-A02.7 | Add to My Program |
Silver Sponsor: DSPACE |
|
Johnson, Janice | DSpace |
Keywords:
Abstract: dSPACE offers universities and research institutions flexible systems that provide all the options necessary for the model-based development of mechatronic controllers in an academic environment. From architecture-based system design and block-diagram-based function prototyping to automatic production code generation and hardware-in-the-loop (HIL) tests, dSPACE products are successfully being used in the classroom and in research projects at internationally renowned universities. To actively support high-end research at universities and the high-quality education of young talents, dSPACE offers its hardware and software products in special kits for universities at a very attractive price. Learn more at dspaceinc.com / offers for universities. For additional information see https://www.dspace.com/en/inc/home.cfm
|
|
09:00-09:30, Paper WeLBP-A02.8 | Add to My Program |
Silver Sponsor: Springer Nature |
|
Tominich, Christopher | Springer |
Jackson, Oliver | Springer |
Keywords:
Abstract: At Springer Nature, our aim is to advance discovery. For over 175 years, we’ve dedicated ourselves to the academic community, creating value across the publishing process. We deliver an unmatched breadth and depth of quality information which spans top research publications (Nature), outstanding scientific journalism (Scientific American), highly specialized subject-specific journals across all the sciences and humanities, professional publications, databases, and the most comprehensive portfolio of academic books. We use our position and our influence to champion the issues that matter most to the research community – standing up for science, taking a leading role in open research, and being powerful advocates for the highest quality and ethical standards in research. For additional information see https://www.springer.com/gp/authors-editors
|
|
09:00-09:30, Paper WeLBP-A02.9 | Add to My Program |
Bronze Sponsor: Processes |
|
Xiang, Wency | Processes MDPI |
Keywords:
Abstract: Processes (ISSN 2227-9717) provides an advanced forum for process/systems related research in chemistry, biology, materials and allied engineering fields. The journal publishes regular research papers, communications, letters, short notes and reviews. Our aim is to encourage researchers to publish their experimental, theoretical and computational results in as much detail as necessary. There is no restriction on paper length or number of figures and tables. Experimental, theoretical and computational research on process development and engineering Chemical and biochemical reaction processes Mass transfer, separation and purification processes Mixing, fluid processing and heat transfer systems Integrated process design and scaleup Process modeling, simulation, optimization and control For additional information see https://www.mdpi.com/journal/processes
|
|
09:00-09:30, Paper WeLBP-A02.10 | Add to My Program |
Bronze Sponsor: Halliburton |
|
Darbe, Robert | Halliburton |
Keywords:
Abstract: Founded in 1919, Halliburton is one of the world's largest providers of products and services to the energy industry. With 60,000 employees, representing 140 nationalities in more than 80 countries, the company helps its customers maximize value throughout the lifecycle of the reservoir – from locating hydrocarbons and managing geological data, to drilling and formation evaluation, well construction and completion, and optimizing production throughout the life of the asset. Halliburton’s technology organization provides cutting edge research and innovative solutions to maximize asset value for our customers. For additional information see https://www.halliburton.com/en-US/default.html
|
|
WeA01 RI Session, Ballroom 1 |
Add to My Program |
RI: Optimization and Optimal Control |
|
|
Chair: Grover, Martha | Georgia Institute of Technology |
Co-Chair: Clayton, Garrett | Villanova University |
|
09:30-09:55, Paper WeA01.1 | Add to My Program |
Optimal Real-Time Scheduling of Human Attention for a Human and Multi-Robot Collaboration System |
|
Yao, Ningshi | Georgia Institute of Technology |
Zhang, Fumin | Georgia Institute of Technology |
Keywords: Optimization, Human-in-the-loop control, Networked control systems
Abstract: We analyze a human and multi-robot collaboration system and proposed a method to optimally schedule the human attention when a human operator receives collaboration requests from multiple robots at the same time. We formulate the human attention scheduling problem as an integer optimization problem which aims to maximize the overall performance among all the robots, under the constraint that a human has limited attention capacity. We first present the optimal schedule for the human to determine when to collaborate with a robot if there is no contention occurring among robots' collaboration requests. For the moments when contentions occur, we present a contention-resolving Model Predictive Control (MPC) method to dynamically schedule the human attention and determine which robot the human should collaborate with first. The optimal schedule can be then determined using a sampling based approach. The effectiveness of the proposed method is validated through simulation that shows improvements on robot performance.
|
|
09:55-09:58, Paper WeA01.2 | Add to My Program |
Optimal Evasion against Dual Pure Pursuit |
|
Von Moll, Alexander | Air Force Research Laboratory |
Fuchs, Zachariah E. | University of Cincinnati |
Pachter, Meir | AFIT/ENG |
Keywords: Optimal control
Abstract: The Pure Pursuit strategy is ubiquitous both in the control literature but also in real-world implementation. In this paper, we pose and solve a variant of Isaacs' Two Cutters and Fugitive Ship problem wherein the Pursuers' strategy is fixed to Pure Pursuit, thus making it an optimal control problem. The Pursuers are faster than the Evader and are endowed with a finite capture radius. All agents move with constant velocity and can change heading instantaneously. Although capture is inevitable, the Evader wishes to delay capture as long as possible. The optimal trajectories cover the entire state space. Regions corresponding to either solo capture or isochronous (dual) capture are computed and both types of maximal time-to-capture optimal trajectories are characterized.
|
|
09:58-10:01, Paper WeA01.3 | Add to My Program |
Extremum Seeking for Creating Optimal Feedback Controls of Unknown Systems by Tuning Basis Functions |
|
Scheinker, Alexander | Los Alamos National Lab |
Scheinker, David | Massachusetts Institute of Technology |
Keywords: Optimal control, Uncertain systems, Process Control
Abstract: We consider the problem of optimal feedback control of unknown dynamic systems. Optimal feedback control is important for systems with time-varying initial conditions, which cannot rely on feedforward controllers. For example, components in particle accelerators are turned on and off hundreds of times per second, with pulse widths of ~1 ms and repetition rates >100 Hz, whose dynamics and initial conditions vary slowly over time due to external disturbances, such as temperature fluctuations. Our approach allows us to quickly learn an optimal feedback control, which can then be applied for all initial conditions even as the system begins to drift and change. For linear systems we reproduce the cost minimizing linear quadratic regulator (LQR) optimal controller that could have been designed had the system been known.
|
|
10:01-10:04, Paper WeA01.4 | Add to My Program |
Escaping Locally Optimal Decentralized Control Polices Via Damping |
|
Feng, Han | University of California, Berkeley |
Lavaei, Javad | UC Berkeley |
Keywords: Optimal control, Decentralized control, Optimization algorithms
Abstract: We study the design of an optimal static decentralized controller with a quadratic cost and propose a variant of the homotopy continuation method using a damping technique. This method generates a series of optimal distributed control (ODC) problems via a continuous variation of the system parameters. Diverging from the classical theme of tracking a specific trajectory of locally optimal controllers for these ODC problems, we focus on the possibility of leveraging local-search algorithms to locate the globally optimal trajectory among several locally optimal controller trajectories. We analyze the continuity and asymptotic properties of the locally and globally optimal controller trajectories as the damping parameter varies. In particular, we prove that under certain conditions, there is no spurious locally optimal controller for an ODC problem with favorable control structure and a large damping parameter. As a result, the proposed method is able to locate the globally optimal trajectory with a suitable discretization in the space of the damping parameter. To demonstrate the effectiveness of this technique, it is shown that even for instances with an exponential number of connected components, damping could merge the trajectories of all local solutions to the trajectory of the global solutions. We further illustrate the convoluted behavior of the locally optimal trajectories with numerical examples on random systems.
|
|
10:04-10:07, Paper WeA01.5 | Add to My Program |
Energy-Optimal Tours for Quadrotors to Scan Moth-Infested Trees in Densely-Packed Forests |
|
Aoun, Christoph | American University of Beirut |
Shammas, Elie | American University of Beirut |
Daher, Naseem | American University of Beirut |
Keywords: Optimal control, Robotics, Autonomous systems
Abstract: In this paper, optimal control theory is used to generate energy-optimal tree-to-tree routes by taking into account the map of the forest environment and the quadrotor's dynamics. After computing the energy consumption between all pairs of trees, a Travelling Salesman Problem is formulated and solved using Integer Linear Programming along with Sub-Tour Elimination Constraints to determine the optimal global route. The first scan is not only time-optimal but is also complete. Thus, an infection map is established after the first scan. For subsequent scans, an online solution is proposed to update the path-planner and only include a subset of the trees by considering the probability of infection of a tree based on neighboring trees.
|
|
10:07-10:10, Paper WeA01.6 | Add to My Program |
Resilient Sparse Controller Design with Guaranteed Disturbance Attenuation |
|
Bahavarnia, MirSaleh | University of Maryland, College Park |
Mousavi, Hossein K. | Lehigh University |
Keywords: Optimal control, Decentralized control, Robust control
Abstract: We design resilient sparse state-feedback controllers for a linear time-invariant (LTI) control system while attaining a pre-specified guarantee on H-infinity performance measure. We leverage a technique from non-fragile control theory to identify a region of resilient state-feedback controllers. Afterward, we explore the region to identify a sparse controller. To this end, we use two different techniques: the greedy method of sparsification, as well as the re-weighted l-1 norm minimization. Our approach highlights a tradeoff between the sparsity of the feedback gain, performance measure, and fragility of the design. To best of our knowledge, this work is the first framework providing H-infinity performance guarantees for sparse feedback gain design.
|
|
10:10-10:13, Paper WeA01.7 | Add to My Program |
Cascading Structure Linear Quadratic Tracking Control for Dual-Stage Nanopositioning Systems |
|
Nagel, William | University of Utah |
Leang, Kam K. | University of Utah |
Keywords: Optimal control, Mechatronics
Abstract: This paper investigates the design of a cascading linear quadratic tracking controller to improve the tracking performance of a dual-stage nanopositioning system. This approach separates the controller design between actuators, allowing for more flexibility in assigning actuator inputs. Specifically, the short-range actuator is given a reference dependent on the long range actuator’s residual tracking error compared to the full desired trajectory, effectively enabling more aggressive effort from the secondary actuator. This new control paradigm is validated in simulation on one axis of an experimental multi-axis dual-stage positioner, where individual actuator measurements are assumed to be available. Simulations are conducted with slow and fast triangular reference trajectories using the cascading design and a standard multi-input multi-output tracking controller. The plant is varied to include high-order dynamics and nonlinearities (specifically hysteresis) to further demonstrate performance. Results show a reduction of maximum and root-mean-square error by approximately 40% for plants with umodeled dynamics and hysteresis, while the root-mean-square error is reduced by nearly 90% for a model matching the plant’s dynamics.
|
|
10:13-10:16, Paper WeA01.8 | Add to My Program |
An Iterative Method for Optimal Control of Nonlinear Quadratic Tracking Problems |
|
Ning, Nancy | Washington University in St.Louis |
Bomela, Walter | Washington University in Saint Louis |
Li, Jr-Shin | Washington University in St. Louis |
Keywords: Optimal control, Numerical algorithms, Output regulation
Abstract: In this paper, we investigate an iterative method for computing optimal controls for general affine nonlinear quadratic tracking problems. The control law is computed iteratively by solving a sequence of linear quadratic tracking problems and, in particular, it consists of solving a set of coupled differential equations derived from the Hamilton-Jacobi-Bellman equation. The convergence of the iterative scheme is shown by constructing a contraction mapping and using the fixed-point theorem. The versatility and effectiveness of the proposed method is demonstrated in numerical simulations of three structurally different nonlinear systems.
|
|
10:16-10:19, Paper WeA01.9 | Add to My Program |
Fast UAV Trajectory Optimization Using Bilevel Optimization with Analytical Gradients |
|
Sun, Weidong | Xyz Robotics |
Tang, Gao | UIUC |
Hauser, Kris | University of Illinois at Urbana Champaign |
Keywords: Optimal control, Optimization algorithms
Abstract: We present an efficient optimization framework that solves trajectory optimization problems by decoupling state variables from timing variables, thereby decomposing a challenging nonlinear programming (NLP) problem into two easier subproblems. With timing fixed, the state variables can be optimized efficiently using convex optimization, and the timing variables can be optimized in a separate NLP, which forms a bilevel optimization problem. The challenge is to obtain the gradient of the objective function which itself needs an optimization to compute. Whereas finite differences must solve many optimization problems to compute the gradient, our method is based on sensitivity analysis of parametric programming: the dual solution (Lagrange multipliers) of the lower-level optimization is used to compute analytical gradients. Since the dual solution is a by-product of the optimization, the exact gradients can be obtained ``for free''. The framework is demonstrated on generating trajectories in safe corridors for an unmanned aerial vehicle. Experiments demonstrate that bilevel optimization converges significantly more reliably than a standard NLP solver, and analytical gradients outperform finite differences in terms of computation speed and accuracy. With a 25,ms cutoff time, our approach achieves over 8 times better suboptimality than the current state-of-the-art.
|
|
10:19-10:22, Paper WeA01.10 | Add to My Program |
Continuous-Time Optimization of Time-Varying Cost Functions Via Finite-Time Stability with Pre-Defined Convergence Time |
|
Romero, Orlando | Rensselaer Polytechnic Institute |
Benosman, Mouhacine | Mitsubishi Electric Research Laboratories |
Keywords: Optimization, Optimization algorithms, Lyapunov methods
Abstract: In this paper, we propose a new family of continuous-time optimization algorithms for time-varying, locally strongly convex cost functions, based on discontinuous second-order gradient optimization flows with provable finite-time convergence to local optima. To analyze our flows, we first extend a well-know Lyapunov inequality condition for finite-time stability, to the case of arbitrary time-varying differential inclusions, particularly of the Filippov type. We then prove the convergence of our proposed flows in finite time. We illustrate the performance of our proposed flows on a quadratic cost function to track a decaying sinusoid.
|
|
10:22-10:25, Paper WeA01.11 | Add to My Program |
CPCA: A Chebyshev Proxy and Consensus Based Algorithm for General Distributed Optimization |
|
He, Zhiyu | Shanghai Jiaotong University |
He, Jianping | Shanghai Jiao Tong University |
Chen, Cailian | Shanghai Jiao Tong University |
Guan, Xin-Ping | Shanghai Jiao Tong University |
Keywords: Optimization, Distributed control, Networked control systems
Abstract: We consider a general distributed optimization problem, aiming to optimize the average of a set of local objectives that are Lipschitz continuous univariate functions, with the existence of same local constraint sets. To solve the problem, we propose a Chebyshev Proxy and Consensus-based Algorithm (CPCA). Compared with existing distributed optimization algorithms, CPCA is able to address the problem with non-convex Lipschitz objectives, and has low computational costs since it is free from gradient or projection calculations. These benefits result from 1) the idea of optimizing a Chebyshev polynomial approximation (i.e. a proxy) for the global objective to get (epsilon)-suboptimal solutions for any given precision (epsilon), and 2) the use of average consensus where the local proxies' coefficient vectors are gossiped to enable every agent to get such a global proxy. We provide comprehensive analysis of the accuracy and complexities of the proposed algorithm. Simulations are conducted to illustrate its effectiveness.
|
|
10:25-10:28, Paper WeA01.12 | Add to My Program |
Maximum Observation of a Faster Non-Maneuvering Target by a Slower Observer |
|
Weintraub, Isaac | Air Force Research Labs |
Von Moll, Alexander | Air Force Research Laboratory |
Garcia, Eloy | Air Force Research Laboratory |
Casbeer, David W. | Air Force Research Laboratory |
Demers, Zachary | Air Force Research Laboratory |
Pachter, Meir | AFIT/ENG |
Keywords: Optimal control, Multivehicle systems, Nonholonomic systems
Abstract: This paper considers a two agent scenario containing an observer and a non-maneuvering target. The observer is maneuverable but is slower than the course-holding target. In this scenario, the observer is endowed with a nonzero radius of observation within which he strives at keeping the target for as long as possible. Using the calculus of variations, we pose and solve the optimal control problem, solving for the heading of the observer which maximizes the amount of time the target remains inside the radius of observation. Utilizing the optimal observer heading we compute the exposure time based upon the angle by which the target is initially captured. Presented, along with an example, are the zero-time of exposure heading, maximum time of observation heading, and proof that observation is persistent under optimal control.
|
|
10:28-10:31, Paper WeA01.13 | Add to My Program |
On the Set of Possible Minimizers of a Sum of Known and Unknown Functions |
|
Kuwaranancharoen, Kananart | Purdue University |
Sundaram, Shreyas | Purdue University |
Keywords: Optimization, Optimization algorithms, Machine learning
Abstract: The problem of finding the minimizer of a sum of convex functions is central to the field of optimization. Thus, it is of interest to understand how that minimizer is related to the properties of the individual functions in the sum. In this paper, we consider the scenario where one of the individual functions in the sum is not known completely. Instead, only a region containing the minimizer of the unknown function is known, along with some general characteristics (such as strong convexity parameters). Given this limited information about a portion of the overall function, we provide a necessary condition which can be used to construct an upper bound on the region containing the minimizer of the sum of known and unknown functions. We provide this necessary condition in both the general case where the uncertainty region of the minimizer of the unknown function is arbitrary, and in the specific case where the uncertainty region is a ball.
|
|
10:31-10:34, Paper WeA01.14 | Add to My Program |
A Generic Solver for Unconstrained Control Problems with Integral Functional Objectives |
|
Tseng, Shih-Hao | California Institute of Technology |
Keywords: Optimization algorithms
Abstract: We present a generic solver for unconstrained control problems (UCPs) whose objectives take the form of an integral functional of the controllers. The solver generalizes and improves upon our previously proposed algorithm for the Witsenhausen's counterexample, which provides the best-known results. In essence, we show that minimizing the objective implies minimizing the marginal cost functions almost everywhere, and we perform the latter task pointwisely by the adaptive minimization technique, which speeds up the computation. We implement single-threaded and parallelized versions of the proposed algorithm. Our implementation runs 30 times faster than our previous algorithm on the Witsenhausen's counterexample, and we demonstrate the applicability of the solver and discuss the possible generalization to constrained problems and multi-dimensional controllers through three more examples.
|
|
10:34-10:37, Paper WeA01.15 | Add to My Program |
Direct Synthesis of Iterative Algorithms with Bounds on Achievable Worst-Case Convergence Rate |
|
Lessard, Laurent | University of Wisconsin-Madison |
Seiler, Peter | University of Michigan, Ann Arbor |
Keywords: Optimization algorithms, Robust control
Abstract: Iterative first-order methods such as gradient descent and its variants are widely used for solving optimization and machine learning problems. There has been recent interest in analytic or numerically efficient methods for computing worst-case performance bounds for such algorithms, for example over the class of strongly convex loss functions. A popular approach is to assume the algorithm has a fixed size (fixed dimension, or memory) and that its structure is parameterized by one or two hyperparameters, for example a learning rate and a momentum parameter. Then, a Lyapunov function is sought to certify robust stability and subsequent optimization can be performed to find optimal hyperparameter tunings. In the present work, we instead fix the constraints that characterize the loss function and apply techniques from robust control synthesis to directly search over algorithms. This approach yields stronger results than those previously available, since the bounds produced hold over algorithms with an arbitrary, but finite, amount of memory rather than just holding for algorithms with a prescribed structure.
|
|
10:37-10:40, Paper WeA01.16 | Add to My Program |
Improved Sample Complexity for Stochastic Compositional Variance Reduced Gradient |
|
Lin, Tianyi | University of California, Berkeley |
Fan, Chenyou | Google |
Wang, Mengdi | Princeton University |
Jordan, Michael I. | UC Berkeley |
Keywords: Optimization algorithms, Optimization, Machine learning
Abstract: Convex composition optimization is an emerging topic that covers a wide range of applications arising from stochastic optimal control, reinforcement learning and multi-stage stochastic programming. Existing algorithms suffer from unsatisfactory sample complexity and practical issues since they ignore the convexity structure in the algorithmic design. In this paper, we develop a new stochastic compositional variance-reduced gradient algorithm with the sample complexity of O((m+n)log(1/epsilon)+1/epsilon^3) where m+n is the total number of samples. Our algorithm is near-optimal as the dependence on m+n is optimal up to a logarithmic factor. Experimental results on real-world datasets demonstrate the effectiveness and efficiency of the new algorithm.
|
|
10:40-10:43, Paper WeA01.17 | Add to My Program |
On the Convergence of the Iterative Linear Exponential Quadratic Gaussian Algorithm to Stationary Points |
|
Roulet, Vincent | University of Washington |
Fazel, Maryam | University of Washington |
Srinivasa, Siddhartha | University of Washington |
Harchaoui, Zaid | University of Washington |
Keywords: Optimization algorithms, Robust control
Abstract: A classical method for risk-sensitive nonlinear control is the iterative linear exponential quadratic Gaussian algorithm. We present its convergence analysis from a first-order optimization viewpoint. We identify the objective that the algorithm actually minimizes and we show how the addition of a proximal term guarantees convergence to a stationary point.
|
|
10:43-10:46, Paper WeA01.18 | Add to My Program |
Market Approach to Length Constrained Min-Max Multiple Depot Multiple Traveling Salesman Problem |
|
Scott, Drew | Research Assistant |
Manyam, Satyanarayana Gupta | Air Force Research Labs |
Casbeer, David W. | Air Force Research Laboratory |
Kumar, Manish | University of Cincinnati |
Keywords: Optimization algorithms, Numerical algorithms, Optimization
Abstract: We consider a routing problem that arises in Persistent Intelligence Surveillance Reconnaissance missions, and pose it as a multiple depot traveling salesman problem, with an objective to minimize the maximum tour length, and an additional set of constraints on the revisit period of every node. We aim to satisfy the revisit period constraints by enforcing equivalent tour length constraints. We present a Mixed Integer Liner Programming (MILP) formulation for this proposed problem which is solved in a branch and cut framework. We also present a market-based solution, an iterative procedure, where each salesman is assigned prices in each iteration and the node assignments are updated accordingly. The quality of the solutions and computation time of the market-based solution are compared to a MILP solution using several numerical simulations. The MILP formulation does not scale well for larger instances with more than hundred nodes, however, the market based approach is able to produce quality solutions to these instances with only a few seconds of computation time.
|
|
10:46-10:49, Paper WeA01.19 | Add to My Program |
Multi-Agent Coordination for Distributed Transmit Beamforming |
|
George, Jemin | U.S. Army Research Laboratory |
Parayil, Anjaly | Indian Institute of Science |
Yilmaz, Cemal Tugrul | North Carolina State University |
Allik, Bethany | US Army Research Laboratory |
Bai, He | Oklahoma State University |
Chakrabortty, Aranya | North Carolina State University |
Keywords: Optimization algorithms, Cooperative control, Emerging control applications
Abstract: This paper considers the problem of distributed beamforming using multi-agent coordination. Each agent is equipped with an antenna and the agents represent the individual elements in an antenna array. The agents are tasked to coordinate their relative location, phase offsets, and amplitude to construct a desired beam-pattern. As a prospective solution, we propose a two time-scale optimization algorithm that consists of a fast time-scale algorithm to solve for the amplitude and phase while a slow time-scale algorithm re-position the agents. In addition, the framework is further extended to the scenarios where the exact parameters of the model are unknown and a model-free optimization based on real-time feedback is proposed. The numerical results given here indicate the proposed approaches reconstruct the desired beam pattern.
|
|
10:49-10:52, Paper WeA01.20 | Add to My Program |
Increasing Efficiency of Grid Free Path Planning by Bounding the Path-Planning Search Region |
|
Tau, Seth | The Pennsylvania State University |
Brennan, 16802-1400 | Penn State University |
Reichard, Karl | Penn State University |
Pentzer, Jesse | The Pennsylvania State University |
Gorsich, David | U.S. Army Tank Automotive Res, Dev & Engr Center (TARDEC) |
Keywords: Optimization algorithms, Autonomous robots, Robotics
Abstract: Path planning for mobile robotics is a topic that has been studied for many decades, with many different formulations and goals. Considering obstacle avoidance with the very simple goal of minimizing the path distance from a start to end location, even this focused problem has attracted many solutions. The aspect of the problem studied in detail here is motivated by the question: what extent of the map needs to be considered by an algorithm to guarantee that the shortest path solution is within the considered extent? The algorithm presented in this paper examines this question in detail, revealing that the area of consideration can be calculated in stages of progress through a known map. Using this bound, the paper then proposes a method for guaranteeing the shortest path, while attempting to minimize the calculation time and memory requirements caused by consideration of map areas that would not admit the optimal path.
|
|
10:52-10:55, Paper WeA01.21 | Add to My Program |
Design a High Efficiency and Low Ripple BLDC Motor Based on Multi-Objective Optimization Methods |
|
Karimi Shahri, Pouria | UNC Charlotte |
Izadi, Vahid | University of North Carolina Charlotte |
Ghasemi, Amirhossein | University of North Carolina Charlotte |
Keywords: Optimization algorithms, Optimization
Abstract: In this paper, we used a multi-objective optimization to increase the efficiency and decrease the torque ripple frequency of a BLDC motor by changing the dimensions of the stator sluts. Torque ripple usually happens when there is a variation in torque production and it causes unwanted vibrations and speed fluctuations. Simulations are used to demonstrate the effectiveness of each parameter in both efficiency and torque ripple as our objectives so we can have several design points and based on these points it is possible to reach to a mathematical formula in which describes the optimization problem. In order to get an explicit formula from true unknown responses, different meta-modeling methods were used and to solve the proposed optimization problem, Genetic Algorithm(GA) method was utilized in order to get Pareto frontiers and compare the results. Also in this paper, the accuracy of each model was checked by measuring its statistical parameters.
|
|
10:55-10:58, Paper WeA01.22 | Add to My Program |
Observer-Based Extremum Seeking Control of Static Maps with Delays |
|
Yilmaz, Cemal Tugrul | North Carolina State University |
George, Jemin | U.S. Army Research Laboratory |
Chakrabortty, Aranya | North Carolina State University |
Keywords: Optimization algorithms, Delay systems, Adaptive control
Abstract: This paper develops a multivariable extremum-seeking control technique for static maps with constant and known input-output delays. The technique is based on the estimation of the gradient of the map as an unknown time-varying parameter using an infinite-dimensional observer. Unlike conventional extremum-seeking controllers, the proposed delay-compensated controller does not require the perturbation signal to be periodic, nor does it require any averaging analysis to guarantee closed-loop stability. Using Lyapunov stability analysis, we show that the observer-coupled closed-loop system exponentially converges to a small neighborhood of the origin. The effectiveness of the controller is demonstrated using a numerical simulation.
|
|
WeA02 RI Session, Ballroom 2 |
Add to My Program |
RI: Control of Energy and Automotive Systems |
|
|
Chair: Leang, Kam K. | University of Utah |
Co-Chair: Devasia, Santosh | Univ of Washington |
|
09:30-09:55, Paper WeA02.1 | Add to My Program |
Making Money in Energy Markets: Probabilistic Forecasting and Stochastic Programming Paradigms |
|
Gao, Xian | University of Notre Dame |
Dowling, Alexander | University of Notre Dame |
Keywords: Energy systems, Smart grid, Stochastic optimal control
Abstract: Undoubtedly, evolving wholesale electricity markets continue to provide new revenue opportunities for diverse generation, energy storage, and flexible demand technologies. In this paper, we quantitatively explore how price uncertainty impacts optimal market participation strategies and resulting revenues. Specifically, we benchmark 2-stage stochastic programming formulations for self-schedule and bidding market participation modes in a receding horizon model predictive control framework. To generate probabilistic price forecasts, we propose an autoregressive Gaussian process regression model and compare three sampling strategies. As an illustrative example, we study a price-taker generation company with six unique generation units using historical price data from CAISO (California market). We show that self-schedule is sensitive to the error in the forecast mean, whereas bidding requires price forecasts that cover extreme events (e.g., tails of the distribution). We benchmark realized market revenue against optimal bidding with perfect information and find static bid curve, time-varying bid curve, and self-schedule modes recovery 95.29%, 94.85%, and 84.87% of perfect information revenue, respectively.
|
|
09:55-09:58, Paper WeA02.2 | Add to My Program |
Optimal Battery Dispatch and Real-Time State of Charge Tracking for Microgrid Applications |
|
Valibeygi, Amir | University of California, San Diego |
de Callafon, Raymond A. | Univ. of California, San Diego |
Keywords: Adaptive control, Energy systems, Smart grid
Abstract: This work studies the grid-connected microgrid of a medical facility that is equipped with photovoltaic (PV) energy generation and a local battery energy storage system (BESS). Following a systematic approach in which power flow and state of charge (SoC) dynamics of the BESS is modeled and estimated from experiments, an optimal SoC reference profile is computed given electricity price, predicted solar generation, predicted load, and power and energy constraints. With SoC measurements subjected to errors, a Kalman filter is designed and used in a feedback controller that uses information on the Kalman filtered SoC, PV power and measured power flow at the PCC to compute the desired power demand signal for the DER to ensure the SoC of the BESS remains within operational conditions and tracks the optimal SoC reference profile. Experimental results on SoC scheduling and power control are provided to demonstrate the implementation of the approach.
|
|
09:58-10:01, Paper WeA02.3 | Add to My Program |
Filter-Based Controller to Improve the Power Quality of Single-Phase Grid-Connected Inverters |
|
Alqatamin, Moath | University of Louisville |
Hawkins, Nicholas | University of Louisville |
McIntyre, Michael | University of Louisville |
Keywords: Nonlinear output feedback, Energy systems, Smart grid
Abstract: In this paper, a filter-based control scheme is developed for a single-phase grid-connected inverter system with local load. Improving the quality of the local load voltage in the grid-connected mode and injecting clean current to the grid at the same time is the main objective of the proposed scheme. Moreover, unity power factor at the grid side for different types of the local load is ensured by the proposed controller. Furthermore, this control approach ensures the seamless transfer between grid-connected and stand-alone operation modes without adjusting the controller structure and without any resynchronization scheme. The proposed scheme is validated by a Lyapunov stability analysis as well as via instantaneous dynamic circuit simulation in PLECS software.
|
|
10:01-10:04, Paper WeA02.4 | Add to My Program |
A Risk Aware Two-Stage Market Mechanism for Electricity with Renewable Generation |
|
Dahlin, Nathan | University of Southern California |
Jain, Rahul | University of Southern California |
Keywords: Smart grid, Stochastic systems, Power systems
Abstract: Over the last few decades, electricity markets around the world have adopted multi-settlement structures, allowing for balancing of supply and demand as more accurate forecast information becomes available. Given increasing uncertainty due to adoption of renewables, more recent market design work has focused on optimization of expectation of some quantity, e.g. social welfare. However, social planners and policy makers are often risk averse, so that such risk neutral formulations do not adequately reflect prevailing attitudes towards risk, nor explain the decisions that follow. Hence we incorporate the commonly used risk measure conditional value at risk (CVaR) into the central planning objective, and study how a two-stage market operates when the individual generators are risk neutral. Our primary result is to show existence (by construction) of a sequential competitive equilibrium (SCEq) in this risk-aware two-stage market. Given equilibrium prices, we design a market mechanism which achieves social cost minimization assuming that agents are non strategic.
|
|
10:04-10:07, Paper WeA02.5 | Add to My Program |
Self-Synchronizing Current Control for Single-Stage Three-Phase Grid-Connected Photovoltaic Systems |
|
Alqatamin, Moath | University of Louisville |
Bhagwat, Bhagyashri | University of Louisville |
Hawkins, Nicholas | University of Louisville |
Latham, Joseph | University of Louisville |
McIntyre, Michael | University of Louisville |
Keywords: Smart grid, Energy systems, Lyapunov methods
Abstract: Three-phase inverters for photovoltaic grid-connected applications typically require some form of grid voltage phase detection in order to properly synchronize to the grid and control real and reactive power generation. A phase locked loop is used to determine this type of phase detection. However, in the present work, a method is proposed whereby the phase angle of the grid can be accurately identified solely via the grid current feedback. This phase observer is incorporated into a current controller which can manage the real and reactive power. Moreover, the maximum power point of the photovoltaic arrays is achieved without using a DC-DC converter. The design of this combined observer/controller system is motivated and validated via a Lyapunov stability analysis. Simulation results under various operating conditions are provided for further validation.
|
|
10:07-10:10, Paper WeA02.6 | Add to My Program |
Stochastic Resource Allocation for Electricity Distribution Network Resilience |
|
Chang, Derek | Massachusetts Institute of Technology |
Shelar, Devendra | Massachusetts Institute of Technology |
Amin, Saurabh | Massachusetts Institute of Technology |
Keywords: Smart grid, Optimization algorithms, Computational methods
Abstract: In recent years, it has become crucial to improve the resilience of electricity distribution networks (DNs) against storm-induced failures. Microgrids enabled by Distributed Energy Resources (DERs) can significantly help speed up re-energization of loads, particularly in the complete absence of bulk power supply. We describe an integrated approach which considers a pre-storm DER allocation problem under the uncertainty of failure scenarios as well as a post-storm dispatch problem in microgrids during the multi-period repair of the failed components. This problem is computationally challenging because the number of scenarios (resp. binary variables) increases exponentially (resp. quadratically) in the network size. Our overall solution approach for solving the resulting two-stage mixed-integer linear program (MILP) involves implementing the sample average approximation (SAA) method and Benders Decomposition. Additionally, we implement a greedy approach to reduce the computational time requirements of the post-storm repair scheduling and dispatch problem. The optimality of the resulting solution is evaluated on a modified IEEE 36-node network.
|
|
10:10-10:13, Paper WeA02.7 | Add to My Program |
Index Policies for Stochastic Deadline Scheduling with Time-Varying Processing Rate Limits |
|
Hao, Liangliang | Chinese University of Hong Kong |
Xu, Yunjian | Chinese University of Hong Kong |
Keywords: Stochastic optimal control, Energy systems, Control applications
Abstract: We study the deadline scheduling problem for multiple deferrable jobs that arrive in a random manner and are to be processed before individual deadlines. The processing of the jobs is subject to a time-varying limit on the total processing rate at each stage. We formulate the scheduling problem as a restless multi-armed bandit (RMAB) problem. Relaxing the scheduling problem into multiple independent single-arm scheduling problems, we define the Lagrange index as the greatest tax under which it is optimal to activate the arm. For the formulated RMAB, we establish the indexability and the asymptotic optimality of the proposed randomized Lagrange index policy for large systems. Numerical results show that the proposed Lagrange index policy achieves 10%-83% higher average reward than the classical Whittle index policy (that does not take into account the processing rate limits).
|
|
10:13-10:16, Paper WeA02.8 | Add to My Program |
Adaptive Super-Twisting Sliding Mode Control for Ocean Current Turbine-Driven Permanent Magnet Synchronous Generator |
|
Tang, Yufei | Florida Atlantic University |
Zhang, Yuantao | Chongqing University of Science and Technology |
Hasankhani, Arezoo | Florida Atlantic University |
VanZwieten, James | Florida Atlantic University |
Keywords: Energy systems, Adaptive control, Electrical machine control
Abstract: Blue economy industries, such as aquaculture or deep sea mining, are moving further offshore to take advantage of the vast scale of the ocean, but moving further offshore requires access to consistent, reliable power untethered to land-based power grids. With a high potential for low cost power generation in locations otherwise isolated from the grid, marine hydrokinetic turbines could serve to help meet this growing power demand. This paper presents a novel adaptive super-twisting sliding mode control strategy for permanent magnet synchronous generators (PMSG) driven by ocean current turbines (OCT). To ensure robustness and mitigate chattering during maximum power point tracking (MPPT), an adaptive gain adjustment technique is proposed for super-twisting sliding mode control. This technique does not require knowledge of the upper bounds of uncertainties, such as external marine environment variability or unmodeled dynamics. More specifically, the adaptive gain rate can vary with a sliding variable when system states are approaching or on the sliding mode, which constitutes the novelty of this paper. The adaptive dynamic gain enables the rapid establishment of the real 2-sliding mode, and this is accomplished without overestimating or underestimating the disturbance boundary. The Lyapunov function technique is used to analyze the finite time convergence of the closed-loop system. A numerical model of a 720-kW PMSG-based OCT is utilized for validating the effectiveness of the proposed control strategy, with simulated operating environmental conditions based on ocean current data collected from the Gulf Stream off Southeast Florida.
|
|
10:16-10:19, Paper WeA02.9 | Add to My Program |
Applying the Similarity Method on Pacejka’s Magic Formula to Estimate the Maximum Longitudinal Tire-Road Friction Coefficient |
|
Bardawil, Carine | American University of Beirut |
Daher, Naseem | American University of Beirut |
Shammas, Elie | American University of Beirut |
Keywords: Automotive systems, Estimation, Identification for control
Abstract: This paper focuses on the estimation of the maximum tire-road friction in the tire’s longitudinal direction. The proposed estimation scheme relies on readily available on-board sensor measurements, hence it does not require additional hardware. The estimation problem is divided over different subsystems. First, at the chassis motion level, the estimation of the vehicle’s longitudinal speed at its center of gravity takes place. Second, based on the wheels rotational dynamics, the longitudinal tire forces and slip ratio are estimated via a state observer design. Information on the longitudinal maximum friction coefficient is then extracted using a model-based identification technique, which relies on Pacejka’s Magic Formula tire model and the similarity method. Exponential convergence of the estimation error is guaranteed based on Lyapunov’s stability theorem. The implementation and validation of the proposed estimation scheme are carried out in a MATLAB/Simulink framework via co-simulation with CarSim. Accelerate-then-brake scenarios are investigated at constant and variable friction levels, ranging from low to high. The obtained results demonstrate the estimator’s ability to detect the maximum friction value, even at low tire slip values.
|
|
10:19-10:22, Paper WeA02.10 | Add to My Program |
A Lagrangian Policy for Optimal Energy Storage Control |
|
Xu, Bolun | Columbia University |
Korpas, Magnus | Norwegian University of Science and Technology |
Botterud, Audun | MIT |
O'Sullivan, Francis | MIT |
Keywords: Energy systems, Numerical algorithms, Predictive control for nonlinear systems
Abstract: This paper presents a millisecond-level look-ahead control algorithm for energy storage. The algorithm connects the optimal control with the Lagrangian multiplier associated with the state-of-charge constraint. It is compared to solving look-ahead control using a state-of-the-art convex optimization solver. The paper include discussions on sufficient conditions for including the non-convex simultaneous charging and discharging constraint, and provide upper and lower bounds for the primal and dual results under such conditions. Simulation results show that both methods obtain the same control result, while the proposed algorithm runs up to 100,000 times faster and solves most problems within one millisecond. The theoretical results from developing this algorithm also provide key insights into designing optimal energy storage control schemes at the centralized system level as well as under distributed settings.
|
|
10:22-10:25, Paper WeA02.11 | Add to My Program |
Feature Selection for State-Of-Charge Estimation of LiFePO_4--Li_4Ti_5O_{12} Batteries Via Electrochemical Impedance |
|
La Rue, Aleksei | Colorado School of Mines |
Weddle, Peter | Colorado School of Mines |
Kee, Bob | Colorado School of Mines |
Vincent, Tyrone L. | Colorado School of Mines |
Keywords: Energy systems, Machine learning, Identification
Abstract: A safe and stable lithium-ion battery is created by pairing a lithium-iron-phosphate (LFP) cathode with a lithium-titanate (LTO) anode. The open-circuit voltage of a LFP--LTO battery is flat over significant ranges of state of charge. The weak voltage state-of-charge relationship complicates state-of-charge estimation algorithms that require open-circuit voltage measurements to calibrate or initialize coulomb counting. An alternative to open-circuit voltage state-of-charge calibration is analyzing the small-signal frequency response, which is state-of-charge dependent. The present paper estimates the electrochemical impedance spectra (EIS) using system-identification methods. The battery EIS is extracted from on/off current perturbations via balancing resistors. A LASSO regularization method is applied to the extracted EIS data for the purpose of obtaining frequencies of interest that are state-of-charge dependent. Extracted frequencies of interest are then utilized to create a state-of-charge predictor. The resulting method is validated using experimental results.
|
|
10:25-10:28, Paper WeA02.12 | Add to My Program |
Machine Learning Control for Floating Offshore Wind Turbine Individual Blade Pitch Control |
|
Kane, Michael | Northeastern University |
Keywords: Energy systems, Machine learning, Randomized algorithms
Abstract: The available resource of offshore wind could technically provide all the needed renewable electricity to the U.S. grid. However, the cost of energy from current floating offshore wind turbines (FOWTs) designs are not economical due to inefficiencies and maintenance costs associated with transitioning terrestrial wind technology offshore. By co-designing lighter less expensive FOWTs with individual pitch control (IPC) of each blade, efficiencies could increase, and costs could decrease to make offshore wind economically viable. However, the nonlinear dynamics and breadth of nonstationary wind and wave loading present challenges to designing effective and robust IPC. This manuscript presents the development, design, and simulation of machine learning control (MLC) for IPC of FOWTs. MLC has been shown effective for many complex nonlinear fluid-structure interaction problems. This project investigates scaling up these component-level control problems to the system level control of the NREL 5MW OC3 FOWT. A massively parallel genetic program (GP) is developed using MATLAB Simulink and OpenFAST that efficiently evaluates new individuals and selectively tests fitness of each generation in the most challenging design load case. The proposed controller was compared to a baseline PID controller using a cost function that captured the value of annual energy production with maintenance costs correlated to ultimate loads and harmonic fatigue. The proposed controller achieved 67% of the cost of the baseline PID controller, resulting in 4th place in the ARPA-E ATLAS Offshore competition for IPC of the OC3 FOWT for the given design load cases.
|
|
10:28-10:31, Paper WeA02.13 | Add to My Program |
Investigating the Effects of Mechanical Damage on Electrical Response of Li-Ion Pouch Cells |
|
Stacy, Andrew | Temple University |
Gilaki, Mehdi | Temple University |
Sahraei, Elham | Temple University |
Soudbakhsh, Damoon | Temple University |
Keywords: Energy systems, Fault detection, Identification
Abstract: Li-ion batteries (LIB) are used in many applications because of their high-power/energy density, long life cycle, and low self-discharge rate. Li-ion batteries are susceptible to mechanical damages which may lead to an electrical short, thermal runaway, and possibly explosions or fires. However, in some situations such as in a mild car accident, battery packs can get moderate deformations without an electrical short or immediate thermal runaway. Currently, there is no reliable battery characterization method to determine the safety of the batteries for future use after sustaining mechanical damage. In this study, we investigated the connection between the mechanical indentation of Li-ion cells to their impedance spectra. After the initial characterization of four Li-ion pouch cells, the first part of the study included indenting a cell and monitoring their Electrochemical Impedance Spectroscopy (EIS) and charge/discharge cycling data and comparing them to the ones from the control (intact) samples. The second part of the study included incremental indentation of the cell and collecting EIS measurements at specific times after each increment. The control group went through the same EIS measurements and the time series data were compared to the indented cell. Our results showed that while some properties of batteries such as ohmic resistance remain relatively constant when the battery is subjected to incremental mechanical damage, changes in low-frequency impedance were observed with the mechanical loading, suggesting a criterion to measure the safety of pouch cells.
|
|
10:31-10:34, Paper WeA02.14 | Add to My Program |
A Vehicle Coordination and Charge Scheduling Algorithm for Electric Autonomous Mobility-On-Demand Systems |
|
Boewing, Felix | ETH Zurich |
Schiffer, Maximilian | Technical University of Munich, TUM School of Management |
Salazar, Mauro | Stanford University |
Pavone, Marco | Stanford University |
Keywords: Autonomous systems, Transportation networks, Smart grid
Abstract: This paper presents an algorithmic framework to optimize the operation of an Autonomous Mobility-on-Demand system whereby a centrally controlled fleet of electric self-driving vehicles provides on-demand mobility. In particular, we first present a mixed-integer linear program that captures the joint vehicle coordination and charge scheduling problem, accounting for the battery level of the single vehicles and the energy availability in the power grid. Second, we devise a heuristic algorithm to compute near-optimal solutions in polynomial time. Finally, we apply our algorithm to realistic case studies for Newport Beach, CA. Our results validate the near optimality of our method with respect to the global optimum, whilst suggesting that through vehicle-to-grid operation we can enable a 100% penetration of renewable energy sources and still provide a high-quality mobility service.
|
|
10:34-10:37, Paper WeA02.15 | Add to My Program |
Wheel Slip Regulation Using an Optimal Reference Slip Estimation Framework |
|
Gaurkar, Pavel Vijay | Indian Institute of Technology Madras |
R, Karthik | Indian Institute of Technology Madras |
Challa, Akhil | IIT Madras |
Subramanian, Shankar | Indian Institute of Technology Madras |
Vivekanandan, Gunasekaran | Madras Engineering Industries Pvt. Ltd |
Sivaram, Sriram | Madras Engineering Industries Pvt. Ltd |
Keywords: Automotive control, Automotive systems
Abstract: Wheel slip regulation algorithms constitute a significant part of active vehicle safety systems in heavy commercial road vehicles. Any wheel slip regulation algorithm designed for set-point tracking requires a reference operating wheel slip irrespective of its control strategy. This reference slip is unique to each tire-road interface and changes with tire normal load. The present work proposes the optimal reference slip as one that minimizes braking distance, and introduces a recursive algorithm for its estimation. It further proposes a framework for reference slip estimation and wheel slip control. The credibility of the framework was established by testing in a Hardware-in-Loop setup consisting of a pneumatic braking system and IPG TruckMaker® a high fidelity vehicle dynamics simulation environment. The algorithm estimated the reference slip corresponding to different tire-road interfaces and resulted in stable braking maneuvers with 7-17 % reduction in braking distance.
|
|
10:37-10:40, Paper WeA02.16 | Add to My Program |
Head-Controlled Racecar for Quadriplegics |
|
Direen, Harry | DireenTech Inc |
Direen, Randal | DireenTech Inc |
Direen, James | Reel FX |
|
|
10:40-10:43, Paper WeA02.17 | Add to My Program |
Closed-Form Solutions for a Real-Time Energy-Optimal and Collision-Free Speed Planning with Limited Information |
|
Han, Jihun | Argonne National Laboratory |
Karbowski, Dominik | Argonne National Laboratory |
Kim, Namdoo | NIER |
Keywords: Automotive control, Optimal control, Optimization algorithms
Abstract: Under real-world driving conditions, connected and automated vehicles (CAVs) must plan and follow an energy-optimal and collision-free speed trajectory with a high updating rate, based on available information limited by its communication range. This paper presents a speed planner using analytical closed-form optimal solutions. Using the simplest vehicle model, we derive closed-form solutions as functions of boundary conditions (BCs) and summarize them without and with pure state variable inequality constraints imposed by speed limits and the preceding vehicle. Then we introduce multiple driving modes (e.g., eco-approach to a traffic signal) for responding to dynamically changing situations and show how to set BCs for each mode while retaining the nature of globally optimal solutions. Finally, we perform a large-scale simulation study to identify and quantify the energy impacts of CAVs for real-world driving routes. A simple but effective planner based on closed-form solutions shows a significant energy saving potential compared with human-driven vehicles and adaptive cruise controlled vehicles with connectivity.
|
|
10:43-10:46, Paper WeA02.18 | Add to My Program |
A Cylinder Deactivation Control Framework for Gasoline Engines without Valve Deactivation |
|
Strange, Dakota | Tennessee Technological University |
Chen, Pingen | Tennessee Technological University |
Keywords: Automotive control, Automotive systems
Abstract: Gasoline engines remain the most dominant power source for light-duty to medium-duty ground vehicles. Improving gasoline engine efficiency is critical for reducing greenhouse gas emissions and fuel consumption. Cylinder deactivation has proved to be an effective measure in improving fuel efficiency. Nevertheless, the market share of cylinder deactivation remains limited, mostly for the engines that lack of valve deactivation hardware. This paper presents an alternative control framework which is capable of enabling cylinder deactivation without using the current valve deactivation mechanisms. The new cylinder deactivation control framework mainly consists of closed-loop lambda controllers, a dual-stage adaptive engine speed controller and a two-stage emissions control. Experimental results demonstrated that, in idling condition, the proposed control framework was capable of reducing fuel consumption by up to 25.33%, while maintaining smooth engine speed profile with minimal engine speed variations. The feasibility of emissions control using two-stage TWC control is also discussed and validated using experimental data.
|
|
10:46-10:49, Paper WeA02.19 | Add to My Program |
Ammonia Distribution Control for a Two-Cell SCR System in a New Configuration |
|
Yang, Kuo | Tennessee Technological University |
Chen, Pingen | Tennessee Technological University |
Keywords: Automotive control, Automotive systems, Variable-structure/sliding-mode control
Abstract: With increasingly strict regulations on Diesel engine NOx emission, urea-based selective catalytic reduction (SCR) systems with high NOx conversion efficiency and low tailpipe ammonia (NH3) slip, are much needed. One of the major challenges in SCR operation is the intrinsic tradeoff between tailpipe NOx emissions and NH3 slip. A SCR system with high NH3 loading in the front and low NH3 loading in the rear, has demonstrated the potential to achieve low tailpipe NOx and NH3 emissions. Due to various uncertainties and highly dynamic exhaust conditions, the NH3 storage distribution along the axial direction can be much different from the desired NH3 storage distribution, which may result in high tailpipe NOx or NH3 emissions. The main issue with the existing SCR system is that it may take a significant amount of time for the NH3 storage distribution to recover from the undesired one to the desired one. To address this issue, this paper proposed a novel two-cell SCR system with a bypass valve over the upstream cell, and sliding mode control (SMC)-based control algorithms for each cell in the system to quickly recover the NH3 storage distribution from an undesired one to the target one. Simulation results over US06 cycle demonstrated that, the presented SCR system is able to reduce the time cost of profile transition of NH3 storage level, and achieve 95% or higher NOx conversion efficiency and less than 10 ppm NH3 slip after the desired NH3 storage profile is accomplished. Such a novel SCR architecture and advanced control algorithms can collectively improve SCR performance in highly dynamic operating conditions.
|
|
10:49-10:52, Paper WeA02.20 | Add to My Program |
A Port-Hamiltonian Approach to Complete Vehicle Energy Management: A Battery Electric Vehicle Case Study |
|
Padilla Cazar, G. P. | Eindhoven University of Technology |
Flores Paredes, J. C. | Eindhoven University of Technology |
Donkers, M.C.F. | Eindhoven University of Technology |
Keywords: Automotive systems, Modeling, Optimal control
Abstract: In this paper, we present a modelling approach to vehicle energy management based on Port-Hamiltonian systems representations. We consider a network of interconnected port-Hamiltonian systems that describes the powertrain components and auxiliaries in the vehicle. This description is suitable to obtain a systematic approach to formulate a decomposable optimal control problem for Complete Vehicle Energy Management. A cost function that describe total energy consumption of the vehicle is proposed in terms of internal energy and losses of each system connected system in the network, which has provided an insightful physical interpretation. Taking advantage of the modularity of the formulation proposed, we present a distributed optimization algorithm to find solutions to the energy management problem. To illustrate this modelling methodology, a case study to optimize the energy consumption of a battery electric vehicle is proposed.
|
|
10:52-10:55, Paper WeA02.21 | Add to My Program |
Uncertainty Quantification Using Generalized Polynomial Chaos for Online Simulations of Automotive Propulsion Systems |
|
Yang, Hang | University of Michigan |
Kidambi, Narayanan | University of Michigan |
Fujii, Yuji | Ford Motor Company |
Gorodetsky, Alex | University of Michigian |
Wang, Kon-Well | The University of Michigan |
Keywords: Automotive systems, Computational methods, Stochastic systems
Abstract: Online simulations conducted in vehicles can enable predictive control of automotive systems. This capability can be especially valuable for complex propulsion systems to manage performance, safety, and efficiency under changing drive conditions. Reliable online simulations require accurate models. However, modeling errors are unavoidable, and the inputs from the driver and environment are subject to uncertainty and generally unknown a priori, rendering the system stochastic. Furthermore, limited computing resources in a vehicle can prohibit solving stochastic systems, posing a major challenge. This paper seeks to alleviate these computational bottlenecks by utilizing generalized Polynomial Chaos to efficiently propagate and quantify uncertainty without loss of accuracy for online propulsion system simulations. To demonstrate the effectiveness of this method, uncertainty quantification is performed for simulations of vehicle launch where both model and input uncertainties are considered. A standard Monte Carlo method is used as a baseline for comparison. It is shown that, for the same accuracy, the proposed method is more than two orders of magnitude faster than a Monte Carlo method. A variance-based sensitivity analysis is also used to quantify the statistical contribution from each uncertainty source to the output. The outcome suggests that the proposed method is well-suited to automotive applications where fast and accurate on-board simulation capabilities are required.
|
|
10:55-10:58, Paper WeA02.22 | Add to My Program |
Online Parameter Estimation for Human Driver Behavior Prediction |
|
Bhattacharyya, Raunak | Stanford University |
Senanayake, Ransalu | Stanford University |
Brown, Kyle | Stanford University |
Kochenderfer, Mykel | Stanford University |
Keywords: Automotive systems, Automotive control, Estimation
Abstract: Driver models are invaluable for planning in autonomous vehicles as well as validating their safety in simulation. Highly parameterized black-box driver models are very expressive, and can capture nuanced behavior. However, they usually lack interpretability and sometimes exhibit unrealistic-even dangerous-behavior. Rule-based models are interpretable, and can be designed to guarantee safe behavior, but are less expressive due to their low number of parameters. In this article, we show that online parameter estimation applied to the Intelligent Driver Model captures nuanced individual driving behavior while providing collision free trajectories. We solve the online parameter estimation problem using particle filtering, and benchmark performance against rule-based and black-box driver models on two real world driving data sets. We evaluate the closeness of our driver model to ground truth data demonstration and also assess the safety of the resulting emergent driving behavior.
|
|
WeB1T1 RI Session, RI Interactive Session 1 |
Add to My Program |
Posters 'RI: Optimization and Optimal Control' |
|
|
|
11:00-11:45, Paper WeB1T1.1 | Add to My Program |
Optimal Real-Time Scheduling of Human Attention for a Human and Multi-Robot Collaboration System |
|
Yao, Ningshi | Georgia Institute of Technology |
Zhang, Fumin | Georgia Institute of Technology |
Keywords: Optimization, Human-in-the-loop control, Networked control systems
Abstract: We analyze a human and multi-robot collaboration system and proposed a method to optimally schedule the human attention when a human operator receives collaboration requests from multiple robots at the same time. We formulate the human attention scheduling problem as an integer optimization problem which aims to maximize the overall performance among all the robots, under the constraint that a human has limited attention capacity. We first present the optimal schedule for the human to determine when to collaborate with a robot if there is no contention occurring among robots' collaboration requests. For the moments when contentions occur, we present a contention-resolving Model Predictive Control (MPC) method to dynamically schedule the human attention and determine which robot the human should collaborate with first. The optimal schedule can be then determined using a sampling based approach. The effectiveness of the proposed method is validated through simulation that shows improvements on robot performance.
|
|
11:00-11:45, Paper WeB1T1.2 | Add to My Program |
Optimal Evasion against Dual Pure Pursuit |
|
Von Moll, Alexander | Air Force Research Laboratory |
Fuchs, Zachariah E. | University of Cincinnati |
Pachter, Meir | AFIT/ENG |
Keywords: Optimal control
Abstract: The Pure Pursuit strategy is ubiquitous both in the control literature but also in real-world implementation. In this paper, we pose and solve a variant of Isaacs' Two Cutters and Fugitive Ship problem wherein the Pursuers' strategy is fixed to Pure Pursuit, thus making it an optimal control problem. The Pursuers are faster than the Evader and are endowed with a finite capture radius. All agents move with constant velocity and can change heading instantaneously. Although capture is inevitable, the Evader wishes to delay capture as long as possible. The optimal trajectories cover the entire state space. Regions corresponding to either solo capture or isochronous (dual) capture are computed and both types of maximal time-to-capture optimal trajectories are characterized.
|
|
11:00-11:45, Paper WeB1T1.3 | Add to My Program |
Extremum Seeking for Creating Optimal Feedback Controls of Unknown Systems by Tuning Basis Functions |
|
Scheinker, Alexander | Los Alamos National Lab |
Scheinker, David | Massachusetts Institute of Technology |
Keywords: Optimal control, Uncertain systems, Process Control
Abstract: We consider the problem of optimal feedback control of unknown dynamic systems. Optimal feedback control is important for systems with time-varying initial conditions, which cannot rely on feedforward controllers. For example, components in particle accelerators are turned on and off hundreds of times per second, with pulse widths of ~1 ms and repetition rates >100 Hz, whose dynamics and initial conditions vary slowly over time due to external disturbances, such as temperature fluctuations. Our approach allows us to quickly learn an optimal feedback control, which can then be applied for all initial conditions even as the system begins to drift and change. For linear systems we reproduce the cost minimizing linear quadratic regulator (LQR) optimal controller that could have been designed had the system been known.
|
|
11:00-11:45, Paper WeB1T1.4 | Add to My Program |
Escaping Locally Optimal Decentralized Control Polices Via Damping |
|
Feng, Han | University of California, Berkeley |
Lavaei, Javad | UC Berkeley |
Keywords: Optimal control, Decentralized control, Optimization algorithms
Abstract: We study the design of an optimal static decentralized controller with a quadratic cost and propose a variant of the homotopy continuation method using a damping technique. This method generates a series of optimal distributed control (ODC) problems via a continuous variation of the system parameters. Diverging from the classical theme of tracking a specific trajectory of locally optimal controllers for these ODC problems, we focus on the possibility of leveraging local-search algorithms to locate the globally optimal trajectory among several locally optimal controller trajectories. We analyze the continuity and asymptotic properties of the locally and globally optimal controller trajectories as the damping parameter varies. In particular, we prove that under certain conditions, there is no spurious locally optimal controller for an ODC problem with favorable control structure and a large damping parameter. As a result, the proposed method is able to locate the globally optimal trajectory with a suitable discretization in the space of the damping parameter. To demonstrate the effectiveness of this technique, it is shown that even for instances with an exponential number of connected components, damping could merge the trajectories of all local solutions to the trajectory of the global solutions. We further illustrate the convoluted behavior of the locally optimal trajectories with numerical examples on random systems.
|
|
11:00-11:45, Paper WeB1T1.5 | Add to My Program |
Energy-Optimal Tours for Quadrotors to Scan Moth-Infested Trees in Densely-Packed Forests |
|
Aoun, Christoph | American University of Beirut |
Shammas, Elie | American University of Beirut |
Daher, Naseem | American University of Beirut |
Keywords: Optimal control, Robotics, Autonomous systems
Abstract: In this paper, optimal control theory is used to generate energy-optimal tree-to-tree routes by taking into account the map of the forest environment and the quadrotor's dynamics. After computing the energy consumption between all pairs of trees, a Travelling Salesman Problem is formulated and solved using Integer Linear Programming along with Sub-Tour Elimination Constraints to determine the optimal global route. The first scan is not only time-optimal but is also complete. Thus, an infection map is established after the first scan. For subsequent scans, an online solution is proposed to update the path-planner and only include a subset of the trees by considering the probability of infection of a tree based on neighboring trees.
|
|
11:00-11:45, Paper WeB1T1.6 | Add to My Program |
Resilient Sparse Controller Design with Guaranteed Disturbance Attenuation |
|
Bahavarnia, MirSaleh | University of Maryland, College Park |
Mousavi, Hossein K. | Lehigh University |
Keywords: Optimal control, Decentralized control, Robust control
Abstract: We design resilient sparse state-feedback controllers for a linear time-invariant (LTI) control system while attaining a pre-specified guarantee on H-infinity performance measure. We leverage a technique from non-fragile control theory to identify a region of resilient state-feedback controllers. Afterward, we explore the region to identify a sparse controller. To this end, we use two different techniques: the greedy method of sparsification, as well as the re-weighted l-1 norm minimization. Our approach highlights a tradeoff between the sparsity of the feedback gain, performance measure, and fragility of the design. To best of our knowledge, this work is the first framework providing H-infinity performance guarantees for sparse feedback gain design.
|
|
11:00-11:45, Paper WeB1T1.7 | Add to My Program |
Cascading Structure Linear Quadratic Tracking Control for Dual-Stage Nanopositioning Systems |
|
Nagel, William | University of Utah |
Leang, Kam K. | University of Utah |
Keywords: Optimal control, Mechatronics
Abstract: This paper investigates the design of a cascading linear quadratic tracking controller to improve the tracking performance of a dual-stage nanopositioning system. This approach separates the controller design between actuators, allowing for more flexibility in assigning actuator inputs. Specifically, the short-range actuator is given a reference dependent on the long range actuator’s residual tracking error compared to the full desired trajectory, effectively enabling more aggressive effort from the secondary actuator. This new control paradigm is validated in simulation on one axis of an experimental multi-axis dual-stage positioner, where individual actuator measurements are assumed to be available. Simulations are conducted with slow and fast triangular reference trajectories using the cascading design and a standard multi-input multi-output tracking controller. The plant is varied to include high-order dynamics and nonlinearities (specifically hysteresis) to further demonstrate performance. Results show a reduction of maximum and root-mean-square error by approximately 40% for plants with umodeled dynamics and hysteresis, while the root-mean-square error is reduced by nearly 90% for a model matching the plant’s dynamics.
|
|
11:00-11:45, Paper WeB1T1.8 | Add to My Program |
An Iterative Method for Optimal Control of Nonlinear Quadratic Tracking Problems |
|
Ning, Nancy | Washington University in St.Louis |
Bomela, Walter | Washington University in Saint Louis |
Li, Jr-Shin | Washington University in St. Louis |
Keywords: Optimal control, Numerical algorithms, Output regulation
Abstract: In this paper, we investigate an iterative method for computing optimal controls for general affine nonlinear quadratic tracking problems. The control law is computed iteratively by solving a sequence of linear quadratic tracking problems and, in particular, it consists of solving a set of coupled differential equations derived from the Hamilton-Jacobi-Bellman equation. The convergence of the iterative scheme is shown by constructing a contraction mapping and using the fixed-point theorem. The versatility and effectiveness of the proposed method is demonstrated in numerical simulations of three structurally different nonlinear systems.
|
|
11:00-11:45, Paper WeB1T1.9 | Add to My Program |
Fast UAV Trajectory Optimization Using Bilevel Optimization with Analytical Gradients |
|
Sun, Weidong | Xyz Robotics |
Tang, Gao | UIUC |
Hauser, Kris | University of Illinois at Urbana Champaign |
Keywords: Optimal control, Optimization algorithms
Abstract: We present an efficient optimization framework that solves trajectory optimization problems by decoupling state variables from timing variables, thereby decomposing a challenging nonlinear programming (NLP) problem into two easier subproblems. With timing fixed, the state variables can be optimized efficiently using convex optimization, and the timing variables can be optimized in a separate NLP, which forms a bilevel optimization problem. The challenge is to obtain the gradient of the objective function which itself needs an optimization to compute. Whereas finite differences must solve many optimization problems to compute the gradient, our method is based on sensitivity analysis of parametric programming: the dual solution (Lagrange multipliers) of the lower-level optimization is used to compute analytical gradients. Since the dual solution is a by-product of the optimization, the exact gradients can be obtained ``for free''. The framework is demonstrated on generating trajectories in safe corridors for an unmanned aerial vehicle. Experiments demonstrate that bilevel optimization converges significantly more reliably than a standard NLP solver, and analytical gradients outperform finite differences in terms of computation speed and accuracy. With a 25,ms cutoff time, our approach achieves over 8 times better suboptimality than the current state-of-the-art.
|
|
11:00-11:45, Paper WeB1T1.10 | Add to My Program |
Continuous-Time Optimization of Time-Varying Cost Functions Via Finite-Time Stability with Pre-Defined Convergence Time |
|
Romero, Orlando | Rensselaer Polytechnic Institute |
Benosman, Mouhacine | Mitsubishi Electric Research Laboratories |
Keywords: Optimization, Optimization algorithms, Lyapunov methods
Abstract: In this paper, we propose a new family of continuous-time optimization algorithms for time-varying, locally strongly convex cost functions, based on discontinuous second-order gradient optimization flows with provable finite-time convergence to local optima. To analyze our flows, we first extend a well-know Lyapunov inequality condition for finite-time stability, to the case of arbitrary time-varying differential inclusions, particularly of the Filippov type. We then prove the convergence of our proposed flows in finite time. We illustrate the performance of our proposed flows on a quadratic cost function to track a decaying sinusoid.
|
|
11:00-11:45, Paper WeB1T1.11 | Add to My Program |
CPCA: A Chebyshev Proxy and Consensus Based Algorithm for General Distributed Optimization |
|
He, Zhiyu | Shanghai Jiaotong University |
He, Jianping | Shanghai Jiao Tong University |
Chen, Cailian | Shanghai Jiao Tong University |
Guan, Xin-Ping | Shanghai Jiao Tong University |
Keywords: Optimization, Distributed control, Networked control systems
Abstract: We consider a general distributed optimization problem, aiming to optimize the average of a set of local objectives that are Lipschitz continuous univariate functions, with the existence of same local constraint sets. To solve the problem, we propose a Chebyshev Proxy and Consensus-based Algorithm (CPCA). Compared with existing distributed optimization algorithms, CPCA is able to address the problem with non-convex Lipschitz objectives, and has low computational costs since it is free from gradient or projection calculations. These benefits result from 1) the idea of optimizing a Chebyshev polynomial approximation (i.e. a proxy) for the global objective to get (epsilon)-suboptimal solutions for any given precision (epsilon), and 2) the use of average consensus where the local proxies' coefficient vectors are gossiped to enable every agent to get such a global proxy. We provide comprehensive analysis of the accuracy and complexities of the proposed algorithm. Simulations are conducted to illustrate its effectiveness.
|
|
11:00-11:45, Paper WeB1T1.12 | Add to My Program |
Maximum Observation of a Faster Non-Maneuvering Target by a Slower Observer |
|
Weintraub, Isaac | Air Force Research Labs |
Von Moll, Alexander | Air Force Research Laboratory |
Garcia, Eloy | Air Force Research Laboratory |
Casbeer, David W. | Air Force Research Laboratory |
Demers, Zachary | Air Force Research Laboratory |
Pachter, Meir | AFIT/ENG |
Keywords: Optimal control, Multivehicle systems, Nonholonomic systems
Abstract: This paper considers a two agent scenario containing an observer and a non-maneuvering target. The observer is maneuverable but is slower than the course-holding target. In this scenario, the observer is endowed with a nonzero radius of observation within which he strives at keeping the target for as long as possible. Using the calculus of variations, we pose and solve the optimal control problem, solving for the heading of the observer which maximizes the amount of time the target remains inside the radius of observation. Utilizing the optimal observer heading we compute the exposure time based upon the angle by which the target is initially captured. Presented, along with an example, are the zero-time of exposure heading, maximum time of observation heading, and proof that observation is persistent under optimal control.
|
|
11:00-11:45, Paper WeB1T1.13 | Add to My Program |
On the Set of Possible Minimizers of a Sum of Known and Unknown Functions |
|
Kuwaranancharoen, Kananart | Purdue University |
Sundaram, Shreyas | Purdue University |
Keywords: Optimization, Optimization algorithms, Machine learning
Abstract: The problem of finding the minimizer of a sum of convex functions is central to the field of optimization. Thus, it is of interest to understand how that minimizer is related to the properties of the individual functions in the sum. In this paper, we consider the scenario where one of the individual functions in the sum is not known completely. Instead, only a region containing the minimizer of the unknown function is known, along with some general characteristics (such as strong convexity parameters). Given this limited information about a portion of the overall function, we provide a necessary condition which can be used to construct an upper bound on the region containing the minimizer of the sum of known and unknown functions. We provide this necessary condition in both the general case where the uncertainty region of the minimizer of the unknown function is arbitrary, and in the specific case where the uncertainty region is a ball.
|
|
11:00-11:45, Paper WeB1T1.14 | Add to My Program |
A Generic Solver for Unconstrained Control Problems with Integral Functional Objectives |
|
Tseng, Shih-Hao | California Institute of Technology |
Keywords: Optimization algorithms
Abstract: We present a generic solver for unconstrained control problems (UCPs) whose objectives take the form of an integral functional of the controllers. The solver generalizes and improves upon our previously proposed algorithm for the Witsenhausen's counterexample, which provides the best-known results. In essence, we show that minimizing the objective implies minimizing the marginal cost functions almost everywhere, and we perform the latter task pointwisely by the adaptive minimization technique, which speeds up the computation. We implement single-threaded and parallelized versions of the proposed algorithm. Our implementation runs 30 times faster than our previous algorithm on the Witsenhausen's counterexample, and we demonstrate the applicability of the solver and discuss the possible generalization to constrained problems and multi-dimensional controllers through three more examples.
|
|
11:00-11:45, Paper WeB1T1.15 | Add to My Program |
Direct Synthesis of Iterative Algorithms with Bounds on Achievable Worst-Case Convergence Rate |
|
Lessard, Laurent | University of Wisconsin-Madison |
Seiler, Peter | University of Michigan, Ann Arbor |
Keywords: Optimization algorithms, Robust control
Abstract: Iterative first-order methods such as gradient descent and its variants are widely used for solving optimization and machine learning problems. There has been recent interest in analytic or numerically efficient methods for computing worst-case performance bounds for such algorithms, for example over the class of strongly convex loss functions. A popular approach is to assume the algorithm has a fixed size (fixed dimension, or memory) and that its structure is parameterized by one or two hyperparameters, for example a learning rate and a momentum parameter. Then, a Lyapunov function is sought to certify robust stability and subsequent optimization can be performed to find optimal hyperparameter tunings. In the present work, we instead fix the constraints that characterize the loss function and apply techniques from robust control synthesis to directly search over algorithms. This approach yields stronger results than those previously available, since the bounds produced hold over algorithms with an arbitrary, but finite, amount of memory rather than just holding for algorithms with a prescribed structure.
|
|
11:00-11:45, Paper WeB1T1.16 | Add to My Program |
Improved Sample Complexity for Stochastic Compositional Variance Reduced Gradient |
|
Lin, Tianyi | University of California, Berkeley |
Fan, Chenyou | Google |
Wang, Mengdi | Princeton University |
Jordan, Michael I. | UC Berkeley |
Keywords: Optimization algorithms, Optimization, Machine learning
Abstract: Convex composition optimization is an emerging topic that covers a wide range of applications arising from stochastic optimal control, reinforcement learning and multi-stage stochastic programming. Existing algorithms suffer from unsatisfactory sample complexity and practical issues since they ignore the convexity structure in the algorithmic design. In this paper, we develop a new stochastic compositional variance-reduced gradient algorithm with the sample complexity of O((m+n)log(1/epsilon)+1/epsilon^3) where m+n is the total number of samples. Our algorithm is near-optimal as the dependence on m+n is optimal up to a logarithmic factor. Experimental results on real-world datasets demonstrate the effectiveness and efficiency of the new algorithm.
|
|
11:00-11:45, Paper WeB1T1.17 | Add to My Program |
On the Convergence of the Iterative Linear Exponential Quadratic Gaussian Algorithm to Stationary Points |
|
Roulet, Vincent | University of Washington |
Fazel, Maryam | University of Washington |
Srinivasa, Siddhartha | University of Washington |
Harchaoui, Zaid | University of Washington |
Keywords: Optimization algorithms, Robust control
Abstract: A classical method for risk-sensitive nonlinear control is the iterative linear exponential quadratic Gaussian algorithm. We present its convergence analysis from a first-order optimization viewpoint. We identify the objective that the algorithm actually minimizes and we show how the addition of a proximal term guarantees convergence to a stationary point.
|
|
11:00-11:45, Paper WeB1T1.18 | Add to My Program |
Market Approach to Length Constrained Min-Max Multiple Depot Multiple Traveling Salesman Problem |
|
Scott, Drew | Research Assistant |
Manyam, Satyanarayana Gupta | Air Force Research Labs |
Casbeer, David W. | Air Force Research Laboratory |
Kumar, Manish | University of Cincinnati |
Keywords: Optimization algorithms, Numerical algorithms, Optimization
Abstract: We consider a routing problem that arises in Persistent Intelligence Surveillance Reconnaissance missions, and pose it as a multiple depot traveling salesman problem, with an objective to minimize the maximum tour length, and an additional set of constraints on the revisit period of every node. We aim to satisfy the revisit period constraints by enforcing equivalent tour length constraints. We present a Mixed Integer Liner Programming (MILP) formulation for this proposed problem which is solved in a branch and cut framework. We also present a market-based solution, an iterative procedure, where each salesman is assigned prices in each iteration and the node assignments are updated accordingly. The quality of the solutions and computation time of the market-based solution are compared to a MILP solution using several numerical simulations. The MILP formulation does not scale well for larger instances with more than hundred nodes, however, the market based approach is able to produce quality solutions to these instances with only a few seconds of computation time.
|
|
11:00-11:45, Paper WeB1T1.19 | Add to My Program |
Multi-Agent Coordination for Distributed Transmit Beamforming |
|
George, Jemin | U.S. Army Research Laboratory |
Parayil, Anjaly | Indian Institute of Science |
Yilmaz, Cemal Tugrul | North Carolina State University |
Allik, Bethany | US Army Research Laboratory |
Bai, He | Oklahoma State University |
Chakrabortty, Aranya | North Carolina State University |
Keywords: Optimization algorithms, Cooperative control, Emerging control applications
Abstract: This paper considers the problem of distributed beamforming using multi-agent coordination. Each agent is equipped with an antenna and the agents represent the individual elements in an antenna array. The agents are tasked to coordinate their relative location, phase offsets, and amplitude to construct a desired beam-pattern. As a prospective solution, we propose a two time-scale optimization algorithm that consists of a fast time-scale algorithm to solve for the amplitude and phase while a slow time-scale algorithm re-position the agents. In addition, the framework is further extended to the scenarios where the exact parameters of the model are unknown and a model-free optimization based on real-time feedback is proposed. The numerical results given here indicate the proposed approaches reconstruct the desired beam pattern.
|
|
11:00-11:45, Paper WeB1T1.20 | Add to My Program |
Increasing Efficiency of Grid Free Path Planning by Bounding the Path-Planning Search Region |
|
Tau, Seth | The Pennsylvania State University |
Brennan, 16802-1400 | Penn State University |
Reichard, Karl | Penn State University |
Pentzer, Jesse | The Pennsylvania State University |
Gorsich, David | U.S. Army Tank Automotive Res, Dev & Engr Center (TARDEC) |
Keywords: Optimization algorithms, Autonomous robots, Robotics
Abstract: Path planning for mobile robotics is a topic that has been studied for many decades, with many different formulations and goals. Considering obstacle avoidance with the very simple goal of minimizing the path distance from a start to end location, even this focused problem has attracted many solutions. The aspect of the problem studied in detail here is motivated by the question: what extent of the map needs to be considered by an algorithm to guarantee that the shortest path solution is within the considered extent? The algorithm presented in this paper examines this question in detail, revealing that the area of consideration can be calculated in stages of progress through a known map. Using this bound, the paper then proposes a method for guaranteeing the shortest path, while attempting to minimize the calculation time and memory requirements caused by consideration of map areas that would not admit the optimal path.
|
|
11:00-11:45, Paper WeB1T1.21 | Add to My Program |
Design a High Efficiency and Low Ripple BLDC Motor Based on Multi-Objective Optimization Methods |
|
Karimi Shahri, Pouria | UNC Charlotte |
Izadi, Vahid | University of North Carolina Charlotte |
Ghasemi, Amirhossein | University of North Carolina Charlotte |
Keywords: Optimization algorithms, Optimization
Abstract: In this paper, we used a multi-objective optimization to increase the efficiency and decrease the torque ripple frequency of a BLDC motor by changing the dimensions of the stator sluts. Torque ripple usually happens when there is a variation in torque production and it causes unwanted vibrations and speed fluctuations. Simulations are used to demonstrate the effectiveness of each parameter in both efficiency and torque ripple as our objectives so we can have several design points and based on these points it is possible to reach to a mathematical formula in which describes the optimization problem. In order to get an explicit formula from true unknown responses, different meta-modeling methods were used and to solve the proposed optimization problem, Genetic Algorithm(GA) method was utilized in order to get Pareto frontiers and compare the results. Also in this paper, the accuracy of each model was checked by measuring its statistical parameters.
|
|
11:00-11:45, Paper WeB1T1.22 | Add to My Program |
Observer-Based Extremum Seeking Control of Static Maps with Delays |
|
Yilmaz, Cemal Tugrul | North Carolina State University |
George, Jemin | U.S. Army Research Laboratory |
Chakrabortty, Aranya | North Carolina State University |
Keywords: Optimization algorithms, Delay systems, Adaptive control
Abstract: This paper develops a multivariable extremum-seeking control technique for static maps with constant and known input-output delays. The technique is based on the estimation of the gradient of the map as an unknown time-varying parameter using an infinite-dimensional observer. Unlike conventional extremum-seeking controllers, the proposed delay-compensated controller does not require the perturbation signal to be periodic, nor does it require any averaging analysis to guarantee closed-loop stability. Using Lyapunov stability analysis, we show that the observer-coupled closed-loop system exponentially converges to a small neighborhood of the origin. The effectiveness of the controller is demonstrated using a numerical simulation.
|
|
WeB1T2 RI Session, RI Interactive Session 2 |
Add to My Program |
Posters 'RI: Control of Energy and Automotive Systems' |
|
|
|
11:00-11:45, Paper WeB1T2.1 | Add to My Program |
Making Money in Energy Markets: Probabilistic Forecasting and Stochastic Programming Paradigms |
|
Gao, Xian | University of Notre Dame |
Dowling, Alexander | University of Notre Dame |
Keywords: Energy systems, Smart grid, Stochastic optimal control
Abstract: Undoubtedly, evolving wholesale electricity markets continue to provide new revenue opportunities for diverse generation, energy storage, and flexible demand technologies. In this paper, we quantitatively explore how price uncertainty impacts optimal market participation strategies and resulting revenues. Specifically, we benchmark 2-stage stochastic programming formulations for self-schedule and bidding market participation modes in a receding horizon model predictive control framework. To generate probabilistic price forecasts, we propose an autoregressive Gaussian process regression model and compare three sampling strategies. As an illustrative example, we study a price-taker generation company with six unique generation units using historical price data from CAISO (California market). We show that self-schedule is sensitive to the error in the forecast mean, whereas bidding requires price forecasts that cover extreme events (e.g., tails of the distribution). We benchmark realized market revenue against optimal bidding with perfect information and find static bid curve, time-varying bid curve, and self-schedule modes recovery 95.29%, 94.85%, and 84.87% of perfect information revenue, respectively.
|
|
11:00-11:45, Paper WeB1T2.2 | Add to My Program |
Optimal Battery Dispatch and Real-Time State of Charge Tracking for Microgrid Applications |
|
Valibeygi, Amir | University of California, San Diego |
de Callafon, Raymond A. | Univ. of California, San Diego |
Keywords: Adaptive control, Energy systems, Smart grid
Abstract: This work studies the grid-connected microgrid of a medical facility that is equipped with photovoltaic (PV) energy generation and a local battery energy storage system (BESS). Following a systematic approach in which power flow and state of charge (SoC) dynamics of the BESS is modeled and estimated from experiments, an optimal SoC reference profile is computed given electricity price, predicted solar generation, predicted load, and power and energy constraints. With SoC measurements subjected to errors, a Kalman filter is designed and used in a feedback controller that uses information on the Kalman filtered SoC, PV power and measured power flow at the PCC to compute the desired power demand signal for the DER to ensure the SoC of the BESS remains within operational conditions and tracks the optimal SoC reference profile. Experimental results on SoC scheduling and power control are provided to demonstrate the implementation of the approach.
|
|
11:00-11:45, Paper WeB1T2.3 | Add to My Program |
Filter-Based Controller to Improve the Power Quality of Single-Phase Grid-Connected Inverters |
|
Alqatamin, Moath | University of Louisville |
Hawkins, Nicholas | University of Louisville |
McIntyre, Michael | University of Louisville |
Keywords: Nonlinear output feedback, Energy systems, Smart grid
Abstract: In this paper, a filter-based control scheme is developed for a single-phase grid-connected inverter system with local load. Improving the quality of the local load voltage in the grid-connected mode and injecting clean current to the grid at the same time is the main objective of the proposed scheme. Moreover, unity power factor at the grid side for different types of the local load is ensured by the proposed controller. Furthermore, this control approach ensures the seamless transfer between grid-connected and stand-alone operation modes without adjusting the controller structure and without any resynchronization scheme. The proposed scheme is validated by a Lyapunov stability analysis as well as via instantaneous dynamic circuit simulation in PLECS software.
|
|
11:00-11:45, Paper WeB1T2.4 | Add to My Program |
A Risk Aware Two-Stage Market Mechanism for Electricity with Renewable Generation |
|
Dahlin, Nathan | University of Southern California |
Jain, Rahul | University of Southern California |
Keywords: Smart grid, Stochastic systems, Power systems
Abstract: Over the last few decades, electricity markets around the world have adopted multi-settlement structures, allowing for balancing of supply and demand as more accurate forecast information becomes available. Given increasing uncertainty due to adoption of renewables, more recent market design work has focused on optimization of expectation of some quantity, e.g. social welfare. However, social planners and policy makers are often risk averse, so that such risk neutral formulations do not adequately reflect prevailing attitudes towards risk, nor explain the decisions that follow. Hence we incorporate the commonly used risk measure conditional value at risk (CVaR) into the central planning objective, and study how a two-stage market operates when the individual generators are risk neutral. Our primary result is to show existence (by construction) of a sequential competitive equilibrium (SCEq) in this risk-aware two-stage market. Given equilibrium prices, we design a market mechanism which achieves social cost minimization assuming that agents are non strategic.
|
|
11:00-11:45, Paper WeB1T2.5 | Add to My Program |
Self-Synchronizing Current Control for Single-Stage Three-Phase Grid-Connected Photovoltaic Systems |
|
Alqatamin, Moath | University of Louisville |
Bhagwat, Bhagyashri | University of Louisville |
Hawkins, Nicholas | University of Louisville |
Latham, Joseph | University of Louisville |
McIntyre, Michael | University of Louisville |
Keywords: Smart grid, Energy systems, Lyapunov methods
Abstract: Three-phase inverters for photovoltaic grid-connected applications typically require some form of grid voltage phase detection in order to properly synchronize to the grid and control real and reactive power generation. A phase locked loop is used to determine this type of phase detection. However, in the present work, a method is proposed whereby the phase angle of the grid can be accurately identified solely via the grid current feedback. This phase observer is incorporated into a current controller which can manage the real and reactive power. Moreover, the maximum power point of the photovoltaic arrays is achieved without using a DC-DC converter. The design of this combined observer/controller system is motivated and validated via a Lyapunov stability analysis. Simulation results under various operating conditions are provided for further validation.
|
|
11:00-11:45, Paper WeB1T2.6 | Add to My Program |
Stochastic Resource Allocation for Electricity Distribution Network Resilience |
|
Chang, Derek | Massachusetts Institute of Technology |
Shelar, Devendra | Massachusetts Institute of Technology |
Amin, Saurabh | Massachusetts Institute of Technology |
Keywords: Smart grid, Optimization algorithms, Computational methods
Abstract: In recent years, it has become crucial to improve the resilience of electricity distribution networks (DNs) against storm-induced failures. Microgrids enabled by Distributed Energy Resources (DERs) can significantly help speed up re-energization of loads, particularly in the complete absence of bulk power supply. We describe an integrated approach which considers a pre-storm DER allocation problem under the uncertainty of failure scenarios as well as a post-storm dispatch problem in microgrids during the multi-period repair of the failed components. This problem is computationally challenging because the number of scenarios (resp. binary variables) increases exponentially (resp. quadratically) in the network size. Our overall solution approach for solving the resulting two-stage mixed-integer linear program (MILP) involves implementing the sample average approximation (SAA) method and Benders Decomposition. Additionally, we implement a greedy approach to reduce the computational time requirements of the post-storm repair scheduling and dispatch problem. The optimality of the resulting solution is evaluated on a modified IEEE 36-node network.
|
|
11:00-11:45, Paper WeB1T2.7 | Add to My Program |
Index Policies for Stochastic Deadline Scheduling with Time-Varying Processing Rate Limits |
|
Hao, Liangliang | Chinese University of Hong Kong |
Xu, Yunjian | Chinese University of Hong Kong |
Keywords: Stochastic optimal control, Energy systems, Control applications
Abstract: We study the deadline scheduling problem for multiple deferrable jobs that arrive in a random manner and are to be processed before individual deadlines. The processing of the jobs is subject to a time-varying limit on the total processing rate at each stage. We formulate the scheduling problem as a restless multi-armed bandit (RMAB) problem. Relaxing the scheduling problem into multiple independent single-arm scheduling problems, we define the Lagrange index as the greatest tax under which it is optimal to activate the arm. For the formulated RMAB, we establish the indexability and the asymptotic optimality of the proposed randomized Lagrange index policy for large systems. Numerical results show that the proposed Lagrange index policy achieves 10%-83% higher average reward than the classical Whittle index policy (that does not take into account the processing rate limits).
|
|
11:00-11:45, Paper WeB1T2.8 | Add to My Program |
Adaptive Super-Twisting Sliding Mode Control for Ocean Current Turbine-Driven Permanent Magnet Synchronous Generator |
|
Tang, Yufei | Florida Atlantic University |
Zhang, Yuantao | Chongqing University of Science and Technology |
Hasankhani, Arezoo | Florida Atlantic University |
VanZwieten, James | Florida Atlantic University |
Keywords: Energy systems, Adaptive control, Electrical machine control
Abstract: Blue economy industries, such as aquaculture or deep sea mining, are moving further offshore to take advantage of the vast scale of the ocean, but moving further offshore requires access to consistent, reliable power untethered to land-based power grids. With a high potential for low cost power generation in locations otherwise isolated from the grid, marine hydrokinetic turbines could serve to help meet this growing power demand. This paper presents a novel adaptive super-twisting sliding mode control strategy for permanent magnet synchronous generators (PMSG) driven by ocean current turbines (OCT). To ensure robustness and mitigate chattering during maximum power point tracking (MPPT), an adaptive gain adjustment technique is proposed for super-twisting sliding mode control. This technique does not require knowledge of the upper bounds of uncertainties, such as external marine environment variability or unmodeled dynamics. More specifically, the adaptive gain rate can vary with a sliding variable when system states are approaching or on the sliding mode, which constitutes the novelty of this paper. The adaptive dynamic gain enables the rapid establishment of the real 2-sliding mode, and this is accomplished without overestimating or underestimating the disturbance boundary. The Lyapunov function technique is used to analyze the finite time convergence of the closed-loop system. A numerical model of a 720-kW PMSG-based OCT is utilized for validating the effectiveness of the proposed control strategy, with simulated operating environmental conditions based on ocean current data collected from the Gulf Stream off Southeast Florida.
|
|
11:00-11:45, Paper WeB1T2.9 | Add to My Program |
Applying the Similarity Method on Pacejka’s Magic Formula to Estimate the Maximum Longitudinal Tire-Road Friction Coefficient |
|
Bardawil, Carine | American University of Beirut |
Daher, Naseem | American University of Beirut |
Shammas, Elie | American University of Beirut |
Keywords: Automotive systems, Estimation, Identification for control
Abstract: This paper focuses on the estimation of the maximum tire-road friction in the tire’s longitudinal direction. The proposed estimation scheme relies on readily available on-board sensor measurements, hence it does not require additional hardware. The estimation problem is divided over different subsystems. First, at the chassis motion level, the estimation of the vehicle’s longitudinal speed at its center of gravity takes place. Second, based on the wheels rotational dynamics, the longitudinal tire forces and slip ratio are estimated via a state observer design. Information on the longitudinal maximum friction coefficient is then extracted using a model-based identification technique, which relies on Pacejka’s Magic Formula tire model and the similarity method. Exponential convergence of the estimation error is guaranteed based on Lyapunov’s stability theorem. The implementation and validation of the proposed estimation scheme are carried out in a MATLAB/Simulink framework via co-simulation with CarSim. Accelerate-then-brake scenarios are investigated at constant and variable friction levels, ranging from low to high. The obtained results demonstrate the estimator’s ability to detect the maximum friction value, even at low tire slip values.
|
|
11:00-11:45, Paper WeB1T2.10 | Add to My Program |
A Lagrangian Policy for Optimal Energy Storage Control |
|
Xu, Bolun | Columbia University |
Korpas, Magnus | Norwegian University of Science and Technology |
Botterud, Audun | MIT |
O'Sullivan, Francis | MIT |
Keywords: Energy systems, Numerical algorithms, Predictive control for nonlinear systems
Abstract: This paper presents a millisecond-level look-ahead control algorithm for energy storage. The algorithm connects the optimal control with the Lagrangian multiplier associated with the state-of-charge constraint. It is compared to solving look-ahead control using a state-of-the-art convex optimization solver. The paper include discussions on sufficient conditions for including the non-convex simultaneous charging and discharging constraint, and provide upper and lower bounds for the primal and dual results under such conditions. Simulation results show that both methods obtain the same control result, while the proposed algorithm runs up to 100,000 times faster and solves most problems within one millisecond. The theoretical results from developing this algorithm also provide key insights into designing optimal energy storage control schemes at the centralized system level as well as under distributed settings.
|
|
11:00-11:45, Paper WeB1T2.11 | Add to My Program |
Feature Selection for State-Of-Charge Estimation of LiFePO_4--Li_4Ti_5O_{12} Batteries Via Electrochemical Impedance |
|
La Rue, Aleksei | Colorado School of Mines |
Weddle, Peter | Colorado School of Mines |
Kee, Bob | Colorado School of Mines |
Vincent, Tyrone L. | Colorado School of Mines |
Keywords: Energy systems, Machine learning, Identification
Abstract: A safe and stable lithium-ion battery is created by pairing a lithium-iron-phosphate (LFP) cathode with a lithium-titanate (LTO) anode. The open-circuit voltage of a LFP--LTO battery is flat over significant ranges of state of charge. The weak voltage state-of-charge relationship complicates state-of-charge estimation algorithms that require open-circuit voltage measurements to calibrate or initialize coulomb counting. An alternative to open-circuit voltage state-of-charge calibration is analyzing the small-signal frequency response, which is state-of-charge dependent. The present paper estimates the electrochemical impedance spectra (EIS) using system-identification methods. The battery EIS is extracted from on/off current perturbations via balancing resistors. A LASSO regularization method is applied to the extracted EIS data for the purpose of obtaining frequencies of interest that are state-of-charge dependent. Extracted frequencies of interest are then utilized to create a state-of-charge predictor. The resulting method is validated using experimental results.
|
|
11:00-11:45, Paper WeB1T2.12 | Add to My Program |
Machine Learning Control for Floating Offshore Wind Turbine Individual Blade Pitch Control |
|
Kane, Michael | Northeastern University |
Keywords: Energy systems, Machine learning, Randomized algorithms
Abstract: The available resource of offshore wind could technically provide all the needed renewable electricity to the U.S. grid. However, the cost of energy from current floating offshore wind turbines (FOWTs) designs are not economical due to inefficiencies and maintenance costs associated with transitioning terrestrial wind technology offshore. By co-designing lighter less expensive FOWTs with individual pitch control (IPC) of each blade, efficiencies could increase, and costs could decrease to make offshore wind economically viable. However, the nonlinear dynamics and breadth of nonstationary wind and wave loading present challenges to designing effective and robust IPC. This manuscript presents the development, design, and simulation of machine learning control (MLC) for IPC of FOWTs. MLC has been shown effective for many complex nonlinear fluid-structure interaction problems. This project investigates scaling up these component-level control problems to the system level control of the NREL 5MW OC3 FOWT. A massively parallel genetic program (GP) is developed using MATLAB Simulink and OpenFAST that efficiently evaluates new individuals and selectively tests fitness of each generation in the most challenging design load case. The proposed controller was compared to a baseline PID controller using a cost function that captured the value of annual energy production with maintenance costs correlated to ultimate loads and harmonic fatigue. The proposed controller achieved 67% of the cost of the baseline PID controller, resulting in 4th place in the ARPA-E ATLAS Offshore competition for IPC of the OC3 FOWT for the given design load cases.
|
|
11:00-11:45, Paper WeB1T2.13 | Add to My Program |
Investigating the Effects of Mechanical Damage on Electrical Response of Li-Ion Pouch Cells |
|
Stacy, Andrew | Temple University |
Gilaki, Mehdi | Temple University |
Sahraei, Elham | Temple University |
Soudbakhsh, Damoon | Temple University |
Keywords: Energy systems, Fault detection, Identification
Abstract: Li-ion batteries (LIB) are used in many applications because of their high-power/energy density, long life cycle, and low self-discharge rate. Li-ion batteries are susceptible to mechanical damages which may lead to an electrical short, thermal runaway, and possibly explosions or fires. However, in some situations such as in a mild car accident, battery packs can get moderate deformations without an electrical short or immediate thermal runaway. Currently, there is no reliable battery characterization method to determine the safety of the batteries for future use after sustaining mechanical damage. In this study, we investigated the connection between the mechanical indentation of Li-ion cells to their impedance spectra. After the initial characterization of four Li-ion pouch cells, the first part of the study included indenting a cell and monitoring their Electrochemical Impedance Spectroscopy (EIS) and charge/discharge cycling data and comparing them to the ones from the control (intact) samples. The second part of the study included incremental indentation of the cell and collecting EIS measurements at specific times after each increment. The control group went through the same EIS measurements and the time series data were compared to the indented cell. Our results showed that while some properties of batteries such as ohmic resistance remain relatively constant when the battery is subjected to incremental mechanical damage, changes in low-frequency impedance were observed with the mechanical loading, suggesting a criterion to measure the safety of pouch cells.
|
|
11:00-11:45, Paper WeB1T2.14 | Add to My Program |
A Vehicle Coordination and Charge Scheduling Algorithm for Electric Autonomous Mobility-On-Demand Systems |
|
Boewing, Felix | ETH Zurich |
Schiffer, Maximilian | Technical University of Munich, TUM School of Management |
Salazar, Mauro | Stanford University |
Pavone, Marco | Stanford University |
Keywords: Autonomous systems, Transportation networks, Smart grid
Abstract: This paper presents an algorithmic framework to optimize the operation of an Autonomous Mobility-on-Demand system whereby a centrally controlled fleet of electric self-driving vehicles provides on-demand mobility. In particular, we first present a mixed-integer linear program that captures the joint vehicle coordination and charge scheduling problem, accounting for the battery level of the single vehicles and the energy availability in the power grid. Second, we devise a heuristic algorithm to compute near-optimal solutions in polynomial time. Finally, we apply our algorithm to realistic case studies for Newport Beach, CA. Our results validate the near optimality of our method with respect to the global optimum, whilst suggesting that through vehicle-to-grid operation we can enable a 100% penetration of renewable energy sources and still provide a high-quality mobility service.
|
|
11:00-11:45, Paper WeB1T2.15 | Add to My Program |
Wheel Slip Regulation Using an Optimal Reference Slip Estimation Framework |
|
Gaurkar, Pavel Vijay | Indian Institute of Technology Madras |
R, Karthik | Indian Institute of Technology Madras |
Challa, Akhil | IIT Madras |
Subramanian, Shankar | Indian Institute of Technology Madras |
Vivekanandan, Gunasekaran | Madras Engineering Industries Pvt. Ltd |
Sivaram, Sriram | Madras Engineering Industries Pvt. Ltd |
Keywords: Automotive control, Automotive systems
Abstract: Wheel slip regulation algorithms constitute a significant part of active vehicle safety systems in heavy commercial road vehicles. Any wheel slip regulation algorithm designed for set-point tracking requires a reference operating wheel slip irrespective of its control strategy. This reference slip is unique to each tire-road interface and changes with tire normal load. The present work proposes the optimal reference slip as one that minimizes braking distance, and introduces a recursive algorithm for its estimation. It further proposes a framework for reference slip estimation and wheel slip control. The credibility of the framework was established by testing in a Hardware-in-Loop setup consisting of a pneumatic braking system and IPG TruckMaker® a high fidelity vehicle dynamics simulation environment. The algorithm estimated the reference slip corresponding to different tire-road interfaces and resulted in stable braking maneuvers with 7-17 % reduction in braking distance.
|
|
11:00-11:45, Paper WeB1T2.16 | Add to My Program |
Head-Controlled Racecar for Quadriplegics |
|
Direen, Harry | DireenTech Inc |
Direen, Randal | DireenTech Inc |
Direen, James | Reel FX |
|
|
11:00-11:45, Paper WeB1T2.17 | Add to My Program |
Closed-Form Solutions for a Real-Time Energy-Optimal and Collision-Free Speed Planning with Limited Information |
|
Han, Jihun | Argonne National Laboratory |
Karbowski, Dominik | Argonne National Laboratory |
Kim, Namdoo | NIER |
Keywords: Automotive control, Optimal control, Optimization algorithms
Abstract: Under real-world driving conditions, connected and automated vehicles (CAVs) must plan and follow an energy-optimal and collision-free speed trajectory with a high updating rate, based on available information limited by its communication range. This paper presents a speed planner using analytical closed-form optimal solutions. Using the simplest vehicle model, we derive closed-form solutions as functions of boundary conditions (BCs) and summarize them without and with pure state variable inequality constraints imposed by speed limits and the preceding vehicle. Then we introduce multiple driving modes (e.g., eco-approach to a traffic signal) for responding to dynamically changing situations and show how to set BCs for each mode while retaining the nature of globally optimal solutions. Finally, we perform a large-scale simulation study to identify and quantify the energy impacts of CAVs for real-world driving routes. A simple but effective planner based on closed-form solutions shows a significant energy saving potential compared with human-driven vehicles and adaptive cruise controlled vehicles with connectivity.
|
|
11:00-11:45, Paper WeB1T2.18 | Add to My Program |
A Cylinder Deactivation Control Framework for Gasoline Engines without Valve Deactivation |
|
Strange, Dakota | Tennessee Technological University |
Chen, Pingen | Tennessee Technological University |
Keywords: Automotive control, Automotive systems
Abstract: Gasoline engines remain the most dominant power source for light-duty to medium-duty ground vehicles. Improving gasoline engine efficiency is critical for reducing greenhouse gas emissions and fuel consumption. Cylinder deactivation has proved to be an effective measure in improving fuel efficiency. Nevertheless, the market share of cylinder deactivation remains limited, mostly for the engines that lack of valve deactivation hardware. This paper presents an alternative control framework which is capable of enabling cylinder deactivation without using the current valve deactivation mechanisms. The new cylinder deactivation control framework mainly consists of closed-loop lambda controllers, a dual-stage adaptive engine speed controller and a two-stage emissions control. Experimental results demonstrated that, in idling condition, the proposed control framework was capable of reducing fuel consumption by up to 25.33%, while maintaining smooth engine speed profile with minimal engine speed variations. The feasibility of emissions control using two-stage TWC control is also discussed and validated using experimental data.
|
|
11:00-11:45, Paper WeB1T2.19 | Add to My Program |
Ammonia Distribution Control for a Two-Cell SCR System in a New Configuration |
|
Yang, Kuo | Tennessee Technological University |
Chen, Pingen | Tennessee Technological University |
Keywords: Automotive control, Automotive systems, Variable-structure/sliding-mode control
Abstract: With increasingly strict regulations on Diesel engine NOx emission, urea-based selective catalytic reduction (SCR) systems with high NOx conversion efficiency and low tailpipe ammonia (NH3) slip, are much needed. One of the major challenges in SCR operation is the intrinsic tradeoff between tailpipe NOx emissions and NH3 slip. A SCR system with high NH3 loading in the front and low NH3 loading in the rear, has demonstrated the potential to achieve low tailpipe NOx and NH3 emissions. Due to various uncertainties and highly dynamic exhaust conditions, the NH3 storage distribution along the axial direction can be much different from the desired NH3 storage distribution, which may result in high tailpipe NOx or NH3 emissions. The main issue with the existing SCR system is that it may take a significant amount of time for the NH3 storage distribution to recover from the undesired one to the desired one. To address this issue, this paper proposed a novel two-cell SCR system with a bypass valve over the upstream cell, and sliding mode control (SMC)-based control algorithms for each cell in the system to quickly recover the NH3 storage distribution from an undesired one to the target one. Simulation results over US06 cycle demonstrated that, the presented SCR system is able to reduce the time cost of profile transition of NH3 storage level, and achieve 95% or higher NOx conversion efficiency and less than 10 ppm NH3 slip after the desired NH3 storage profile is accomplished. Such a novel SCR architecture and advanced control algorithms can collectively improve SCR performance in highly dynamic operating conditions.
|
|
11:00-11:45, Paper WeB1T2.20 | Add to My Program |
A Port-Hamiltonian Approach to Complete Vehicle Energy Management: A Battery Electric Vehicle Case Study |
|
Padilla Cazar, G. P. | Eindhoven University of Technology |
Flores Paredes, J. C. | Eindhoven University of Technology |
Donkers, M.C.F. | Eindhoven University of Technology |
Keywords: Automotive systems, Modeling, Optimal control
Abstract: In this paper, we present a modelling approach to vehicle energy management based on Port-Hamiltonian systems representations. We consider a network of interconnected port-Hamiltonian systems that describes the powertrain components and auxiliaries in the vehicle. This description is suitable to obtain a systematic approach to formulate a decomposable optimal control problem for Complete Vehicle Energy Management. A cost function that describe total energy consumption of the vehicle is proposed in terms of internal energy and losses of each system connected system in the network, which has provided an insightful physical interpretation. Taking advantage of the modularity of the formulation proposed, we present a distributed optimization algorithm to find solutions to the energy management problem. To illustrate this modelling methodology, a case study to optimize the energy consumption of a battery electric vehicle is proposed.
|
|
11:00-11:45, Paper WeB1T2.21 | Add to My Program |
Uncertainty Quantification Using Generalized Polynomial Chaos for Online Simulations of Automotive Propulsion Systems |
|
Yang, Hang | University of Michigan |
Kidambi, Narayanan | University of Michigan |
Fujii, Yuji | Ford Motor Company |
Gorodetsky, Alex | University of Michigian |
Wang, Kon-Well | The University of Michigan |
Keywords: Automotive systems, Computational methods, Stochastic systems
Abstract: Online simulations conducted in vehicles can enable predictive control of automotive systems. This capability can be especially valuable for complex propulsion systems to manage performance, safety, and efficiency under changing drive conditions. Reliable online simulations require accurate models. However, modeling errors are unavoidable, and the inputs from the driver and environment are subject to uncertainty and generally unknown a priori, rendering the system stochastic. Furthermore, limited computing resources in a vehicle can prohibit solving stochastic systems, posing a major challenge. This paper seeks to alleviate these computational bottlenecks by utilizing generalized Polynomial Chaos to efficiently propagate and quantify uncertainty without loss of accuracy for online propulsion system simulations. To demonstrate the effectiveness of this method, uncertainty quantification is performed for simulations of vehicle launch where both model and input uncertainties are considered. A standard Monte Carlo method is used as a baseline for comparison. It is shown that, for the same accuracy, the proposed method is more than two orders of magnitude faster than a Monte Carlo method. A variance-based sensitivity analysis is also used to quantify the statistical contribution from each uncertainty source to the output. The outcome suggests that the proposed method is well-suited to automotive applications where fast and accurate on-board simulation capabilities are required.
|
|
11:00-11:45, Paper WeB1T2.22 | Add to My Program |
Online Parameter Estimation for Human Driver Behavior Prediction |
|
Bhattacharyya, Raunak | Stanford University |
Senanayake, Ransalu | Stanford University |
Brown, Kyle | Stanford University |
Kochenderfer, Mykel | Stanford University |
Keywords: Automotive systems, Automotive control, Estimation
Abstract: Driver models are invaluable for planning in autonomous vehicles as well as validating their safety in simulation. Highly parameterized black-box driver models are very expressive, and can capture nuanced behavior. However, they usually lack interpretability and sometimes exhibit unrealistic-even dangerous-behavior. Rule-based models are interpretable, and can be designed to guarantee safe behavior, but are less expressive due to their low number of parameters. In this article, we show that online parameter estimation applied to the Intelligent Driver Model captures nuanced individual driving behavior while providing collision free trajectories. We solve the online parameter estimation problem using particle filtering, and benchmark performance against rule-based and black-box driver models on two real world driving data sets. We evaluate the closeness of our driver model to ground truth data demonstration and also assess the safety of the resulting emergent driving behavior.
|
|
WeLuT4 Special Session, Meetings and |
Add to My Program |
WeLuT4 |
|
|
|
12:00-13:30, Paper WeLuT4.1 | Add to My Program |
Special Session: An Overview of NSF Programs |
|
Dolinskaya, Irina | National Science Foundation (NSF) |
Keywords:
Abstract: The National Science Foundation (NSF) offers a number of funding opportunities for investigators working in the field of controls, both within the disciplinary programs in Engineering and other directorates, and through cross-cutting initiatives that are foundation-wide. This presentation will describe opportunities that are relevant to the robotics, dynamics and controls communities. The presentation will also describe programs targeted toward junior investigators, as well as guidelines for proposal preparation and NSF’s Intellectual Merit and Broader Impacts criteria. Question-and-answer session will follow the presentation. Speakers: Dr. Kishan Baheti, Dr. Jordan Berg, Dr. Irina Dolinskaya, Dr. Robert G. Landers, and Dr. Eduardo Misawa
|
|
12:00-13:30, Paper WeLuT4.2 | Add to My Program |
Special Session: Research with Broad Scope and High Impact in an Industrial Laboratory |
|
Berntorp, Karl | Mitsubishi Electric Research Labs |
Danielson, Claus | Mitsubishi Electric Research Labs |
Di Cairano, Stefano | Mitsubishi Electric Research Labs |
Quirynen, Rien | Mitsubishi Electric Research Laboratories (MERL) |
Keywords:
Abstract: Mitsubishi Electric Research Laboratories (MERL) is a leading research organization located in Cambridge, Massachusetts, USA that conducts fundamental research for industrially-motivated problems. MERL is a subsidiary of Mitsubishi Electric Corporation, a 41B global manufacturer of a wide range of products including industrial robots, automotive electronics and equipment, HVAC (heating, ventilation, and air conditioning) systems, factory automation equipment, electrical power systems, elevators, satellites, and information visualization systems. MERL is an active and collaborative member of both the academic and industrial communities. MERL researchers collaborate with corporate laboratories and business units in Japan, as well as academic partners from around the world to develop novel solutions to challenging problems. In particular, several researchers at MERL develops new theoretical results in control and systems theory and apply them to a wide variety of products and applications. In this talk we will present an overview of research activities at MERL, including fundamental controls research and the application of state-of-the-art control techniques to a variety of real-world systems. We will focus on fundamental research subjects including model predictive control and the control of constrained systems, estimation and motion planning for autonomous systems, and learning for control. In addition, we will describe how these fundamental research areas impact applications such as autonomous vehicles, spacecraft guidance and control, GNSS-based positioning, energy-efficient HVAC systems, high-precision manufacturing. We encourage students, researchers and faculty interested in collaborating with MERL to attend this talk
|
|
12:00-13:30, Paper WeLuT4.3 | Add to My Program |
Women in Control Luncheon Meeting |
|
Bushnell, Linda | University of Washington |
Fekih, Afef | University of Louisiana at Lafayette |
Scherpen, Jacquelien M.A. | University of Groningen |
Keywords:
Abstract: The IEEE CSS Women in Control committee is responsible for, but not limited to, promoting membership, gathering and disseminating appropriate information about women in IEEE CSS and the profession, and facilitating the development of mentoring and programs to promote the retention, recruitment, and growth of women IEEE CSS members. The IEEE WiC invites all ACC women attendees to join us for an online luncheon with interesting speakers on the first day of the conference, Wednesday, July 1st, 2020.
|
|
12:00-13:30, Paper WeLuT4.4 | Add to My Program |
Meeting: ASME DSCD TC Chairs Meeting (from 12Noon to 1PM) |
|
Tan, Xiaobo | Michigan State University |
Keywords:
Abstract: ASME DSCD TC Chairs Meeting Xiaobo Tan is inviting you to a scheduled Zoom meeting. Topic: ASME DSCD TC Chairs Meeting Time: Jul 1, 2020 12:00 PM Mountain Time (US and Canada) Session WeLuT4 Join Zoom Meeting https://msu.zoom.us/j/92010609422 Contact meeting organizer for password. One tap mobile +13126266799,,92010609422# US (Chicago) +16468769923,,92010609422# US (New York) Dial by your location +1 312 626 6799 US (Chicago) +1 646 876 9923 US (New York) +1 301 715 8592 US (Germantown) +1 346 248 7799 US (Houston) +1 669 900 6833 US (San Jose) +1 253 215 8782 US (Tacoma) Meeting ID: 920 1060 9422 Find your local number: https://msu.zoom.us/u/acowsl6Y5p Join by SIP 162.255.36.11 US East 162.255.37.11 US West 92010609422@vip2.zoomcrc.com Join by H.323 162.255.36.11 (US East) 162.255.37.11 (US West) 221.122.88.195 (China) 115.114.131.7 (India) 213.19.144.110 (EMEA) 202.177.207.158 (Australia) 209.9.211.110 (Hong Kong) 64.211.144.160 (Brazil) 69.174.57.160 (Canada) Meeting ID: 920 1060 9422 Password: 486763 Join by Skype for Business https://msu.zoom.us/skype/92010609422
|
|
12:00-13:30, Paper WeLuT4.5 | Add to My Program |
Meeting: TC Smart Cities (from 12Noon to 1.30PM) |
|
Malikopoulos, Andreas A. | University of Delaware |
Keywords:
Abstract: TC Smart Cities Wed: 12:00PM to 1:30 PM Session: WeLuT4 https://udel.zoom.us/j/97541636655 Use 2020 ACC conference password
|
|
12:00-13:30, Paper WeLuT4.6 | Add to My Program |
Meeting: ASME DSCD Vibration TC Meeting (from 12Noon to 1PM) |
|
Zheng, Minghui | University at Buffalo |
Keywords:
Abstract: ASME DSCD Vibration TC Meeting Wed: 12:00 PM to 1:00 PM Session: WeLuT4 https://buffalo.zoom.us/j/98441521787 Use 2020 ACC conference password
|
|
12:00-13:30, Paper WeLuT4.7 | Add to My Program |
Meeting: ASME DSCC 2021 OpComm Meeting (from 12Noon to 1PM) |
|
Wang, Junmin | University of Texas at Austin |
Keywords:
Abstract: Organized by Junmin Wang jwang@austin.utexas.edu Contact Organizer for Meeting Details
|
|
WeB01 Invited Session, Governor's SQ 12 |
Add to My Program |
Learning-Based Control of Multi-Agent Systems |
|
|
Chair: Bai, He | Oklahoma State University |
Co-Chair: George, Jemin | U.S. Army Research Laboratory |
Organizer: Chakrabortty, Aranya | North Carolina State University |
Organizer: Bai, He | Oklahoma State University |
Organizer: George, Jemin | U.S. Army Research Laboratory |
|
13:30-13:50, Paper WeB01.1 | Add to My Program |
Reinforcement Learning for Multi-Agent Systems with an Application to Distributed Predictive Cruise Control (I) |
|
Mynuddin, Mohammed | Georgia Southern University |
Gao, Weinan | Georgia Southern University |
Jiang, Zhong-Ping | New York University |
Keywords: Optimal control, Multivehicle systems, Intelligent systems
Abstract: In this paper, we propose a reinforcement learning (RL) approach to the coordinated control of multi-agent systems with a special emphasis on intelligent transportation systems. As a result, for a network of autonomous vehicles, a novel distributed predictive cruise control (PCC) algorithm based on RL is proposed to reduce idle time and maintain an adjustable speed depending on the traffic signals. Under the proposed distributed PCC law, given the signal phase and timing (SPaT) message from upcoming traffic intersections, autonomous vehicles can cross intersections without stopping. The effectiveness of the proposed approach has been validated through Paramics microscopic traffic simulations by choosing a scenario in Statesboro, Georgia. For different traffic demands, the travel time and fuel consumption rate of vehicles are compared between non-PCC and PCC algorithms. Microscopic traffic simulation results show that the proposed PCC algorithm is able to reduce both fuel consumption rate and travel time.
|
|
13:50-14:10, Paper WeB01.2 | Add to My Program |
Trading Dynamic Regret for Model Complexity in Nonstationary Nonparametric Optimization (I) |
|
Bedi, Amrit | US Army Research Lab |
Koppel, Alec | U.S. Army Research Laboratory |
Rajawat, Ketan | Indian Institute of Technology Kanpur |
Sadler, Brian | ARL |
Keywords: Optimization, Machine learning, Learning
Abstract: Online convex optimization against dynamic comparators in the literature is limited to linear models. In this work, we relax this requirement and propose a memory-efficient emph{online} universal function approximator based on compressed kernel methods. Our approach hinges upon viewing non-stationary learning as online convex optimization with dynamic comparators, for which performance is quantified by dynamic regret. Prior works control dynamic regret growth only for linear models. In contrast, we hypothesize actions belong to reproducing kernel Hilbert spaces (RKHS). We propose a functional variant of online gradient descent (OGD) operating in tandem with greedy subspace projections. Projections are necessary to surmount the fact that RKHS functions have complexity proportional to time. For this scheme, we establish sublinear dynamic regret growth in terms of the functional path length, and that the memory of the function sequence remains moderate. Experiments demonstrate the usefulness of the proposed technique for online nonlinear regression and classification problems with non-stationary data.
|
|
14:10-14:30, Paper WeB01.3 | Add to My Program |
A Distributed Primal-Dual Algorithm for Bandit Online Convex Optimization with Time-Varying Coupled Inequality Constraints (I) |
|
Yi, Xinlei | KTH Royal Institute of Technology |
Li, Xiuxian | Nanyang Technological University |
Yang, Tao | Northeastern University |
Xie, Lihua | Nanyang Tech. Univ |
Chai, Tianyou | Northeastern University |
Johansson, Karl H. | Royal Institute of Technology |
Keywords: Optimization algorithms, Learning, Distributed control
Abstract: This paper considers distributed bandit online optimization with time-varying coupled inequality constraints. The global cost and the coupled constraint functions are the summations of local convex cost and constraint functions, respectively. The local cost and constraint functions are held privately and only at the end of each period the constraint functions are fully revealed, while only the values of cost functions at queried points are revealed, i.e., in a so called bandit manner. A distributed bandit online primal-dual algorithm with two queries for the cost functions per period is proposed. The performance of the algorithm is evaluated using its expected regret, i.e., the expected difference between the outcome of the algorithm and the optimal choice in hindsight, as well as its constraint violation. We show that mathcal{O}(T^{c}) expected regret and mathcal{O}(T^{1-c/2}) constraint violation are achieved by the red{proposed} algorithm, where T is the total number of iterations and cin[0.5,1) is a user-defined trade-off parameter. Assuming Slater's condition, we show that mathcal{O}(sqrt{T}) expected regret and mathcal{O}(sqrt{T}) constraint violation are achieved. The theoretical results are illustrated by numerical simulations.
|
|
14:30-14:50, Paper WeB01.4 | Add to My Program |
Approximate Equilibrium Computation for Discrete-Time Linear-Quadratic Mean-Field Games (I) |
|
Zaman, Muhammad Aneeq uz | UIUC |
Zhang, Kaiqing | University of Illinois at Urbana-Champaign (UIUC) |
Miehling, Erik | University of Illinois at Urbana-Champaign |
Basar, Tamer | Univ of Illinois, Urbana-Champaign |
Keywords: Mean field games, Game theory, Large-scale systems
Abstract: While the topic of mean-field games (MFGs) has a relatively long history, heretofore there has been limited work concerning algorithms for the computation of equilibrium control policies. In this paper, we develop a computable policy iteration algorithm for approximating the mean-field equilibrium in linear-quadratic MFGs with discounted cost. Given the mean field, each agent faces a linear-quadratic tracking problem, the solution of which involves a dynamical system evolving in retrograde time. This makes the development of forward-in-time algorithm updates challenging. By identifying a structural property of the mean-field update operator, namely that it preserves sequences of a particular form, we develop a forward-in-time equilibrium computation algorithm. Bounds that quantify the accuracy of the computed mean-field equilibrium as a function of the algorithms stopping condition are provided. The optimality of the computed equilibrium is validated numerically. In contrast to the most recent/concurrent results, our algorithm appears to be the first to study infinite-horizon MFGs with non-stationary mean-field equilibria, though with focus on the linear quadratic setting.
|
|
14:50-15:10, Paper WeB01.5 | Add to My Program |
Hierarchical Control of Multi-Agent Systems Using Online Reinforcement Learning (I) |
|
Bai, He | Oklahoma State University |
George, Jemin | U.S. Army Research Laboratory |
Chakrabortty, Aranya | North Carolina State University |
Keywords: Iterative learning control, Large-scale systems, Hierarchical control
Abstract: We propose a new reinforcement learning based approach to designing hierarchical linear quadratic regulator (LQR) controllers for heterogeneous linear multi-agent systems with unknown state-space models and separated control objectives. The separation arises from grouping the agents into multiple non-overlapping groups, and defining the control goal as two distinct objectives. The first objective aims to minimize a group-wise block-decentralized LQR function that models group-level mission. The second objective, on the other hand, tries to minimize an LQR function between the average states (centroids) of the groups. Exploiting this separation, we redefine the weighting matrices of the LQR functions in a way that they allow us to decouple their respective algebraic Riccati equations. Thereafter, we develop a reinforcement learning strategy that uses online measurements of the agent states and the average states to learn the respective controllers based on the approximate Riccati equations. Since the first controller is block-decentralized and, therefore, can be learned in parallel, while the second controller is reduced-dimensional due to averaging, the overall design enjoys a significantly reduced learning time compared to centralized reinforcement learning.
|
|
WeB02 Invited Session, Ballroom ABC |
Add to My Program |
Modeling and Identification of Energy Storage Systems |
|
|
Chair: Parvini, Yasha | Clemson University |
Co-Chair: Moura, Scott | University of California, Berkeley |
Organizer: Dey, Satadru | University of Colorado Denver |
Organizer: Moura, Scott | University of California, Berkeley |
Organizer: Lin, Xinfan | University of California, Davis |
Organizer: Kim, Youngki | University of Michigan - Dearborn |
Organizer: Fang, Huazhen | University of Kansas |
Organizer: Donkers, M.C.F. | Eindhoven University of Technology |
Organizer: Song, Xingyong | Texas A&M University, College Station |
Organizer: Siegel, Jason B. | University of Michigan |
Organizer: Choe, Song-Yul (Ben) | Auburn University |
Organizer: Perez, Hector E. | University of California, Berkeley |
Organizer: Lotfi, Nima | Southern Illinois University Edwardsville |
|
13:30-13:50, Paper WeB02.1 | Add to My Program |
Optimization of Current Excitation for Identification of Battery Electrochemical Parameters Based on Analytic Sensitivity Expression (I) |
|
Lai, Qingzhi | University of California, Davis |
Ahn, Hyoung Jun | LG Chem |
Kim, Geumbee | LG Chem |
Joe, Won Tae | Battery R&D, LG Chem |
Lin, Xinfan | University of California, Davis |
Keywords: Optimization, Identification, Estimation
Abstract: The quality of data plays an important role in determining the accuracy of battery parameter identification/estimation, and hence data optimization for estimation has received increasing attention lately. The main idea is to design input excitation that is most sensitive to the target parameter(s) under estimation. However, most existing studies are hampered by the complexity of sensitivity computation/optimization, and need to impose heuristic patterns on the input to facilitate the optimization. Consequently, they are not capable of finding the ultimate optimal input pattern, and explaining the underlying mechanism. This is especially the case for the parameters of the first-principle electrochemical battery model. This paper aims at performing direct optimization of input excitation with no imposed pattern to find the ultimate optimal profile for estimating battery electrochemical parameters. The practice is enabled by the analytic expressions of sensitivity derived in our previous work. Based on the optimization results, we will explore the features/patterns of optimal profiles for different parameters by correlating to the analytic sensitivity expressions.
|
|
13:50-14:10, Paper WeB02.2 | Add to My Program |
Robust Parameter Subset Selection and Optimal Experimental Design for Effective Parameterization of PEM Fuel Cell Models (I) |
|
Goshtasbi, Alireza | University of Michigan |
Chen, Jixin | University of Michigan |
Waldecker, James | Ford Motor Company |
Hirano, Shinichi | Ford Motor Company |
Ersal, Tulga | University of Michigan |
Keywords: Identification, Estimation, Energy systems
Abstract: We address the problem of identifying the parameters of a polymer electrolyte membrane (PEM) fuel cell model when no prior parameter estimates are available. To this end, we build upon a recently developed parameter identification framework and use an extended local sensitivity analysis to obtain a more global picture of parameter sensitivities. The extended analysis consists of local analyses carried out at multiple sampled points in the parameter space. The results from this extended analysis are then used to optimally select a subset of parameters for identification. Particularly, the selected subset optimizes the expected value of the well-known D-criterion over the parameter space. Being derived from the extended analysis, the selected subset is robust to initial assumptions about the nominal parameter values. Similar procedures are then used for robust optimal experimental design (OED) for the purpose of parameter identification. The robust OED approach is benchmarked against another experimental design method based on Latin Hypercube Sampling (LHS). The effectiveness of the proposed methods is investigated by identifying model parameters using synthetic data. The results demonstrate the utility of the robust parameter subset selection and OED procedures in enabling accurate parameter identification.
|
|
14:10-14:30, Paper WeB02.3 | Add to My Program |
Validation and Sensitivity Analysis of a Fractional Order Model of a Lithium Ion Battery Via Impedance Spectra and Temporal Duty Cycles (I) |
|
Mirzaei, Hamidreza | Clemson University |
Li, Zhan | Human Horizons Technology Co., Ltd |
Parvini, Yasha | Clemson University |
Keywords: Energy systems, Identification, Modeling
Abstract: In this paper, a lumped fractional order model (FOM) is developed for a lithium-ion battery (LIB). Electrochemical impedance spectroscopy (EIS) is used to obtain the cell impedance at different temperatures and SOCs, and at a wide range of frequencies. This data is used for the model parameterization which is a complex nonlinear least squares problem. A modified Levenberg-Marquardt algorithm is adopted to solve this problem. Two statistical measures, including sum of squares of residual and coefficient of determination are employed to incrementally build up on the integer order model (IOM) and obtain the final FOM. A derivative-based parameter sensitivity analysis is performed to study the influence of parameters on the model by considering their interactions. The terminal voltage of the FOM is simulated by mathematical approximation of the fractional derivative to study the model accuracy under temporal duty cycles. A comparative analysis between the fractional and integer order models is performed to gain insight on pros and cons of each model.
|
|
14:30-14:50, Paper WeB02.4 | Add to My Program |
A Novel Lithium-Ion Battery Pack Modeling Framework - Series-Connected Case Study (I) |
|
Weaver, Trey | Stanford University |
Allam, Anirudh | Stanford University |
Onori, Simona | Stanford Univeristy |
Keywords: Modeling, Energy systems
Abstract: In this paper, a novel physics-based modeling framework is developed for lithium ion battery packs. To address a gap in the literature for pack-level simulation, we establish a high fidelity physics-based model that incorporates electrochemical-thermal-aging behavior for each cell and pack-level electrical and thermal interactions, as well as cell heterogeneity. Governing equations in the form of Partial Differential Equations (PDEs) are discretized into a system of Ordinary Differential Equations (ODEs) using Finite Difference and Finite Volume methods and reformulated into state-space models for both cell and pack dynamics. Computational time studies are conducted to demonstrate the effects of spatial discretization fidelity and pack size on simulation time. Pack model predictive capabilities are exercised through sensitivity analysis of cell design parameters. Effects of parameter perturbation are shown for pack voltage and energy responses. The goal for this modeling framework is to provide a computationally-feasible and easily scalable framework for high-fidelity offline simulation and optimization without compromising the integrity of cell dynamics across multiple time scales.
|
|
14:50-15:10, Paper WeB02.5 | Add to My Program |
Analysis of Online Parameter Estimation for Electrochemical Li-Ion Battery Models Via Reduced Sensitivity Equations (I) |
|
Gima, Zachary | University of California, Berkeley |
Kato, Dylan | UC Berkeley |
Klein, Reinhardt | Robert Bosch LLC |
Moura, Scott | University of California, Berkeley |
Keywords: Energy systems, Nonlinear systems identification, Identification for control
Abstract: This paper focuses on the problem of online parameter estimation in an electrochemical Li-ion battery model. Online parameter estimation is necessary to account for model mismatch, environmental disturbances, and cycle-induced aging in Li-ion battery models. Sensitivity analysis can improve parameter estimation by identifying which data the parameters are most sensitive to. However, computing parameter sensitivity in full-order electrochemical models is typically intractable for online applications. Using a reduced-order model can lower the computational burden and, as we demonstrate, approximates well the sensitivity of the higher-order model. To provide further insight into the parameter estimation challenge, we analyze the effect that identifying parameters according to voltage RMSE data has on internal state errors. We perform a simulation study which demonstrates that parameter estimation approaches based on this paradigm are not sufficient for safe battery operation or other control objectives that require accurate estimates of these states.
|
|
15:10-15:30, Paper WeB02.6 | Add to My Program |
On the Structure of the Optimal Input for Maximizing Lithium-Ion Battery Thermal Parameter Identifiability |
|
Doosthosseini, Mahsa | University of Maryland |
Fathy, Hosam K. | University of Maryland |
Keywords: Identification, Optimization, Energy systems
Abstract: This paper investigates input trajectory optimization for parameter identifiability in a lithium-ion battery temperature cycling experiment. Such optimal experimental design can improve battery parameterization speeds and accuracies significantly. These potential improvements are well-established in the literature for thermal, electrochemical, and multi-physics battery models. However, to the best of our knowledge, the fundamental structure of the resulting optimal test trajectories is relatively less-explored. We examine the problem of optimizing the trajectory of thermal chamber temperature versus time in a lithium-ion battery temperature cycling test. We pose this as a Pareto-optimal control problem, with the competing objectives being the maximization of the Fisher identifiability of the battery’s thermal time constant versus the minimization of the L_2 norm of the control input. Pontryagin analysis reveals that the optimal trajectory is a switching trajectory constrained within battery cell temperature bounds, where the rate at which the solution proceeds from one bound to another is governed by the Pareto weight. Solving this problem numerically, using dynamic programming, supports these insights from Pontryagin analysis.
|
|
WeB03 Regular Session, Governor's SQ 15 |
Add to My Program |
Multivehicle Systems |
|
|
Chair: Sipahi, Rifat | Northeastern University |
Co-Chair: Al Janaideh, Mohammad | Memorial University |
|
13:30-13:50, Paper WeB03.1 | Add to My Program |
Fault Detection, Localization, and Mitigation of a Network of Connected Autonomous Vehicles Using Transmissibility Identification |
|
Khalil, Abdelrahman | Memorial University of Newfoundland |
Al Janaideh, Mohammad | Memorial University |
Aljanaideh, Khaled | Jordan University of Science and Technolgoy |
Kundur, Deepa | University of Toronto |
Keywords: Multivehicle systems, Autonomous robots, Fault detection
Abstract: This paper investigates fault detection, localization, and mitigation of autonomous vehicles platoons. The platoon is a network of autonomous vehicles that communicate together to move in a desired way. A fault in an autonomous vehicles platoon is a failure in either a physical component of a vehicle or a communication link between two vehicles in the platoon. This failure may lead to damage in one or more of the autonomous vehicles. Model-based health monitoring of a network of vehicles requires knowledge of a model of the system and the excitation signal, and thus may not be applicable. In this paper, we use measurements from available sensors in the platoon to identify sensor-to-sensor models that can be used for health monitoring, fault localization, and fault mitigation in the platoon. The dynamics of the network and the vehicles and the excitation signal that acts on the platoon are assumed to be unknown. We apply the proposed approach to a model of a platoon of autonomous vehicles and an experimental setup consisting of a platoon of three autonomous robots.
|
|
13:50-14:10, Paper WeB03.2 | Add to My Program |
Cooperative Air-Ground Vehicle Routing Using Chance-Constrained Optimization |
|
Du, Bin | Purdue University |
Sun, Dengfeng | Purdue University |
Manyam, Satyanarayana Gupta | Air Force Research Labs |
Casbeer, David W. | Air Force Research Laboratory |
Keywords: Multivehicle systems, Cooperative control, Optimization
Abstract: This paper studies a cooperative air-ground routing problem, in which an unmanned aerial vehicle (UAV) and a ground vehicle coordinate with one another to visit a set of targets. The UAV, subject to limits on storage capacity and maximum flight distance, must rendezvous with the ground vehicle periodically, to upload the collected data and recharge. To solve such a cooperative routing problem, we formulate a chance-constrained mixed-integer linear program, where the chance constraint captures uncertainties in the model, such as uncertain speed or travel time of the two vehicles. Consequently, the obtained solution is less conservative compared to those found using robust methods, since only the worst case realization of uncertainties is considered in the later methods. Also novel to our approach, is that air ground rendezvous locations are not restricted to occur only at targets. Instead, the two vehicles are free to meet at any point on the UAV's path, which significantly increases the feasible solution space and leads to better solutions. We corroborate the effectiveness of the proposed approach through a set of numerical simulations on randomly generated instances.
|
|
14:10-14:30, Paper WeB03.3 | Add to My Program |
Motion Prediction of Human-Driven Vehicles in Mixed Traffic with Connected Autonomous Vehicles |
|
Zhang, Linjun | Ford Motor Company |
Tseng, Eric | Ford Motor Company |
Keywords: Multivehicle systems, Autonomous systems, Estimation
Abstract: In this paper, we investigate the motion prediction of human-driven vehicles in traffic flow mixed with connected autonomous vehicles (CAVs). Here, CAVs indicate the self-driving vehicles that can exchange messages with other vehicles through wireless vehicle-to-vehicle (V2V) communication, while human-driven vehicles are not equipped with V2V communication devices. The recursive least square (RLS) method is applied to approximate the dynamic model of the human-driven vehicles immediately ahead of CAVs, and the identified model is further used to predict the future motion of human-driven vehicles. To improve the prediction accuracy, triggering time and physical constraints are included in the predictor. Numerical simulations are utilized to validate the predictor. The effects of uncertain human reaction delays, time-varying parameters of human-driven vehicles, and stochastic packet drops in V2V communication on the accuracy of RLS prediction are also investigated.
|
|
14:30-14:50, Paper WeB03.4 | Add to My Program |
Stability Analysis of a Large-Scale Single-Lane Connected Vehicle Model with Multiple Sensing, Communication, and Human Reaction Delays |
|
Wang, Duo | NORTHEASTERN UNIVERSITY |
Sipahi, Rifat | Northeastern University |
Keywords: Multivehicle systems, Autonomous systems, Delay systems
Abstract: On a connected vehicle model with sensing, communication and human reaction delays, here we present an approach to investigate the stability of the equilibrium flow dynamics on the plane of model parameters. The approach is next utilized to reveal how the number of vehicles as well as penetration rates of sensors and communication lines in the arising vehicle network could influence the stability regions with respect to model parameters.
|
|
14:50-15:10, Paper WeB03.5 | Add to My Program |
Nonlinear Optimal Velocity Car Following Dynamics (I): Approximation in Presence of Deterministic and Stochastic Perturbations |
|
Nick Zinat Matin, Hossein | University of Illinois at Urbana Champaign |
Sowers, Richard | University Fo Illinois |
Keywords: Multivehicle systems, Traffic control, Stochastic systems
Abstract: The behavior of the optimal velocity model is investigated in this paper. Both deterministic and stochastic perturbations are considered in the Optimal velocity model and the behavior of the dynamical systems and their convergence to their associated averaged problems is studied in detail.
|
|
15:10-15:30, Paper WeB03.6 | Add to My Program |
Nonlinear Optimal Velocity Car Following Dynamics (II): Rate of Convergence in the Presence of Fast Perturbation |
|
Nick Zinat Matin, Hossein | University of Illinois at Urbana Champaign |
Sowers, Richard | University Fo Illinois |
Keywords: Multivehicle systems, Traffic control, Autonomous systems
Abstract: Traffic flow models have been the subject of extensive studies for decades. The interest in these models is both as the result of their important applications as well as their complex behavior which makes them theoretically challenging. In this paper, an optimal velocity dynamical model is considered and analyzed. We consider a dynamical model in the presence of perturbation and show that not only such a perturbed system converges to an averaged problem, but also we can show its order of convergence. Such understanding is important from different aspects, and in particular, it shows how well we can approximate a perturbed system with its associated averaged problem.
|
|
WeB04 Invited Session, Governor's SQ 14 |
Add to My Program |
Autonomous Vehicle Perception and Control |
|
|
Chair: Hall, Carrie | Illinois Institute of Technology |
Co-Chair: Malikopoulos, Andreas A. | University of Delaware |
Organizer: Dadras, Sara | Company |
Organizer: Ghasemi, Amirhossein | University of North Carolina Charlotte |
Organizer: Lotfi, Nima | Southern Illinois University Edwardsville |
Organizer: Hall, Carrie | Illinois Institute of Technology |
|
13:30-13:50, Paper WeB04.1 | Add to My Program |
Multi-Agent Control of Lane-Switching Automated Vehicles for Energy Efficiency (I) |
|
Dollar, Robert Austin | Clemson University |
Sciarretta, Antonio | IFP Energies Nouvelles |
Vahidi, Ardalan | Clemson University |
Keywords: Cooperative control, Multivehicle systems, Optimal control
Abstract: The proliferation of automatic control systems and their connectivity accents the performance of their interactions. In particular, connected and automated vehicles could become high-impact examples thanks to their energy use and productivity effects. Ideally, a controller might collectively optimize all agents' control moves for a given objective. However, limits on computational complexity, incomplete knowledge of the central planner, and risks of a single point of failure make distributed control attractive as well. This paper proposes a collaborative heuristic to approach the performance of centralized control with decentralized-like computational effort. The related centralized controller is also described in detail and evaluated as a baseline. A collaboration-intensive obstacle avoidance scenario involving electric vehicles is simulated to demonstrate benefits over fully decentralized control. While centralized optimization performed best with an 8.6% energy reduction, the collaborative decentralized scheme reached a favorable computation-performance tradeoff with a 6.7% energy reduction.
|
|
13:50-14:10, Paper WeB04.2 | Add to My Program |
Lane Change Control with Optimal Time-Varying Sliding Mode in Automated Driving Vehicle |
|
Kim, Jin Sung | Hanyang University |
Lee, Seung Hi | Hanyang University |
Chung, Chung Choo | Hanyang University |
Keywords: Automotive control, Variable-structure/sliding-mode control, Control applications
Abstract: In this paper, we propose a scheme of lane change control for automated vehicle without path planning and its tracking. It is not easy to make path planning for lane change although there are several method for the path planning such as using a combination of sinusoidal functions and high order polynomial functions. In this paper, time-varying hyperplane is utilized to cope with the problem of path planning and control for lateral motion in lane change control. Designing a sliding hyperplane in terms of lateral position and velocity is presented so that the lateral error converges uniformly and smoothly during lane changing irrespective of the amount of lateral offset. The simulation-based optimization approach is utilized to obtain the optimal time-varying sliding hyperplane. The stability of the closed-loop system is proved with the analysis of a discrete time-varying system. The effectiveness of the proposed method is validated with numerical simulation showing the uniform settling of lateral tracking error no matter what the desired lateral offset is commanded.
|
|
14:10-14:30, Paper WeB04.3 | Add to My Program |
Conditions for State and Control Constraint Activation in Coordination of Connected and Automated Vehicles (I) |
|
Mahbub, A M Ishtiaque | University of Delaware |
Malikopoulos, Andreas A. | University of Delaware |
Keywords: Constrained control, Optimal control, Autonomous systems
Abstract: Connected and automated vehicles (CAVs) provide the most intriguing opportunity to reduce pollution, energy consumption, and travel delays. In earlier work, we addressed the optimal coordination of CAVs using Hamiltonian analysis. In this paper, we investigate the nature of the unconstrained problem and provide conditions under which the state and control constraints become active. We derive a closed-form analytical solution of the constrained optimization problem and evaluate the solution using numerical simulation.
|
|
14:30-14:50, Paper WeB04.4 | Add to My Program |
A Novel Vehicle Tracking Method for Cross-Area Sensor Fusion with Reinforcement Learning Based GMM (I) |
|
Cao, Mingcong | Southeast University |
Chen, Jiayi | University of Michigan |
Wang, Junmin | University of Texas at Austin |
Keywords: Automotive systems, Sensor fusion, Learning
Abstract: Radars, LiDARs and cameras have been widely adopted in autonomous driving applications due to their complementary capabilities of environment perception. However, one problem lies in how to effectively improve the cross-area tracking accuracy with massive data from multiple sensors. This paper proposes a novel tracking solution that is composed of a reinforcement-learning-based Gaussian mixture model (GMM), submodel center realignment, and data-driven trajectory association. Specifically, developed with a Q-learning-based cluster number, an improved GMM-EM algorithm is firstly investigated to cluster the dense short-range radar data points. Subsequently, an innovative kinetic-energy-aware approach is presented to realign the Q-learning GMM cluster centers for position error mitigation. In addition to Q-learning GMM clustering, a weight-scheduled method is presented to associate the data from a long-range radar and cameras for cross-area object extraction and trajectory fusion. Eighteen experiments for training and one experiment for verification were conducted on a fully-instrumented autonomous vehicle. Experimental results demonstrate that a better tracking performance in crossing detection areas can be achieved by the proposed method.
|
|
14:50-15:10, Paper WeB04.5 | Add to My Program |
Vehicle Speed Prediction for Connected and Autonomous Vehicles Using Communication and Perception (I) |
|
Suh, Bohoon | University of Minnesota |
Shao, Yunli | University of Minnesota |
Sun, Zongxuan | University of Minnesota |
Keywords: Automotive systems, Estimation
Abstract: Real-time traffic prediction is crucial for optimization and control of connected and autonomous vehicles (CAVs). The knowledge of preceding vehicle’s future trajectory determines the bounds of car-following distance for the target vehicle. A key challenge of traffic prediction is to handle mixed traffic scenarios where both CAVs and non-CAVs co-exist. In this work, a traffic prediction framework is developed based on traffic flow model. Information from connected vehicles (CVs) provides partial measurement of traffic states (traffic speed and traffic density). The unknown traffic states can be estimated using a state observer. Once the full traffic states are known, future traffic states can be predicted by propagating the traffic flow model forward in time. With on-board perception sensors, CVs are capable of detecting locations and speeds of adjacent vehicles. This additional information can potentially improve the performance of the traffic prediction. The proposed traffic prediction framework is comprehensively evaluated for a signalized roadway for various penetration rates of connectivity and locations of CVs. Simulation results show that additional information from perception sensors can help reduce the prediction error by 25%.
|
|
15:10-15:30, Paper WeB04.6 | Add to My Program |
Autonomous Vehicle Decision Making and Monitoring Based on Signal Temporal Logic and Mixed-Integer Programming (I) |
|
Sahin, Yunus Emre | University of Michigan |
Quirynen, Rien | Mitsubishi Electric Research Laboratories (MERL) |
Di Cairano, Stefano | Mitsubishi Electric Research Labs |
Keywords: Automotive systems, Autonomous systems, Formal verification/synthesis
Abstract: We propose a decision-making system for automated driving with formal guarantees, synthesized from Signal Temporal Logic (STL) specifications. STL formulae specifying overall and intermediate driving goals and the traffic rules are encoded as mixed-integer inequalities and combined with a simplified vehicle motion model, resulting in a mixed-integer optimization problem. The specification satisfaction for the actual vehicle motion is guaranteed by imposing constraints on the quantitative semantics of STL. For reducing the computational burden, we propose an STL encoding that results in a block-sparse structure. The same STL formulae are used for monitoring faults due to imperfect prediction on the vehicle and environment. We demonstrate our method on an urban scenario with intersections, obstacles, and no-pass zones.
|
|
WeB05 Invited Session, Plaza Court 6 |
Add to My Program |
Modeling and Control of Additive Manufacturing Systems |
|
|
Chair: Barton, Kira | University of Michigan, Ann Arbor |
Co-Chair: Bristow, Douglas A. | Missouri University of Science & Technology |
Organizer: Barton, Kira | University of Michigan, Ann Arbor |
Organizer: Bristow, Douglas A. | Missouri University of Science & Technology |
Organizer: Hoelzle, David | Ohio State University |
Organizer: Mishra, Sandipan | Rensselaer Polytechnic Institute |
|
13:30-13:50, Paper WeB05.1 | Add to My Program |
A Learning-Based Approach to Modeling and Control of Inkjet 3D Printing (I) |
|
Inyang-Udoh, Uduak | Rensselaer Polytechnic Institute |
Mishra, Sandipan | Rensselaer Polytechnic Institute |
Keywords: Modeling, Predictive control for nonlinear systems, Manufacturing systems
Abstract: This paper presents a learning-based approach to modeling and control of inkjet 3D printing. First, we propose and experimentally validate a learning-based model for inkjet 3D printing. The proposed model uses a physics-based model paradigm that has been reformulated into a neural-network-like structure. This formulation enables back-propagation and the associated benefits of data-driven model identification while retaining physical interpretation of the learned model itself. Next, we propose and demonstrate a predictive control algorithm that leverages the neural-network-like structure of the model. Back-propagation is used for efficient gradient calculations to determine optimal control inputs, namely droplet patterns for subsequent layer(s), to optimize a quadratic cost function.
|
|
13:50-14:10, Paper WeB05.2 | Add to My Program |
An Experimental Study on Process Modeling for Selective Laser Melting (I) |
|
Shkoruta, Aleksandr | Rensselaer Polytechnic Institute |
Mishra, Sandipan | Rensselaer Polytechnic Institute |
Rock, Stephen | Rensselaer Polytechnic Institute |
Keywords: Identification for control, Reduced order modeling, Control of metal processing
Abstract: This paper addresses process modeling for the selective laser melting (SLM) process. We experimentally investigate the response of the SLM process output (measured by a coaxial near-infrared camera) to changing input laser power. We determined that first and second order models can be used to capture this input-output behavior. Next, we studied the dependency of this transfer function on laser scan speed and other process variables that evolve over a typical part build, such as thermal properties of surrounding medium (bulk powder, build plate, or solidified part) or layer number. The transfer function was found to strongly depend on the material environment (solidified material or bulk powder). Further, transfer function also depended on the layer number, exhibiting transient behavior. We report identified 1st order transfer functions for different scan speeds, locations on the build plate, and different layer numbers. Identified models and quantification of their variability will serve as foundational work for the future implementation of advanced real-time process control algorithms.
|
|
14:10-14:30, Paper WeB05.3 | Add to My Program |
A Control-Oriented Model for Bead Cross-Sectional Geometry in Fused Deposition Modeling (I) |
|
Aksoy, Doruk | University of Michigan |
Balta, Efe C. | University of Michigan |
Tilbury, Dawn M. | University of Michigan |
Barton, Kira | University of Michigan, Ann Arbor |
Keywords: Modeling, Manufacturing systems, Model Validation
Abstract: Additive manufacturing (AM) is a digital manufacturing technology that manufactures a 3D object in a bottom-up and layer-by-layer fashion. Fused deposition modeling(FDM), also known as desktop 3D printing, is one of the most commonly used AM technologies with numerous applications in academia and industry. Some of the greatest challenges with FDM include poor repeatability and reliability of the process, leading to mid-process failures or out-of-spec final products. Closed-loop control applications for FDM have been proposed as a means of mitigating mid-process failures. However, no models currently exist to enable control of the bead cross-sectional dimensions for the extruded material. This work presents a control-oriented model describing the effect of process parameters on cross-sectional dimensions of the deposited beads in FDM. A geometric model is presented and a procedure to evaluate the unknown machine and material-specific parameters in the model is provided by leveraging design of experiments. The proposed model is experimentally validated and the accuracy of the results is presented. The results show that the proposed model accurately represents the bead cross-sectional geometry and is suitable for closed-loop control applications.
|
|
14:30-14:50, Paper WeB05.4 | Add to My Program |
A Layer-To-Layer Control-Oriented Model for Selective Laser Melting (I) |
|
Wang, Xin | Missouri University of Science and Technology |
Lough, Cody | Missouri University of Science and Technology |
Bristow, Douglas A. | Missouri University of Science & Technology |
Landers, Robert G. | Missouri University of Science and Technology |
Kinzel, Edward | University of Notre Dame |
Keywords: Manufacturing systems, Iterative learning control, Modeling
Abstract: Selective Laser Melting (SLM) is a common additive manufacturing technique which uses a scanning laser source to fuse metal powder layer by layer. Although complex geometries can be produced, quality and repeatability of parts are still two challenges due to complex physical transformations of the metal powder and highly dynamic temperature fields. Finite Element Models (FEMs) have been developed by researchers in order to predict melt pool behavior. However, simulations on FEM software are too computationally intensive for real-time control applications. Thus, there arises the need for a control-oriented model of SLM processes. In this paper, a state-space control-oriented layer-to-layer model based on the general heat conduction equation is developed. The layer-to-layer model is constructed to step one from layer’s thermal feature measurement to the next, thus reducing computational complexity to a level suitable for control. To validate the model, an experiment of a rectangular thin part was conducted, and the simulation described the experimental thermal measurements 5% error in the output.
|
|
14:50-15:10, Paper WeB05.5 | Add to My Program |
A Loop-Shaping Method for Frequency-Based Design of Layer-To-Layer Control for Laser Metal Deposition (I) |
|
Gegel, Michelle | Missouri University of Science and Technology |
Bristow, Douglas A. | Missouri University of Science & Technology |
Landers, Robert G. | Missouri University of Science and Technology |
Keywords: Control of metal processing, Iterative learning control, Manufacturing systems
Abstract: Additive manufacturing processes fabricate parts in a layer-by-layer fashion, depositing material along a pre-defined path before incrementing to the next layer. Although the thickness of any given layer is bounded, in-layer dynamics can couple with layer-to-layer dynamics such that height defects amplify from one layer to the next. This is considered instability in the layer domain. By considering each layer as an iteration, additive processes can be categorized as repetitive processes. Although Repetitive Process Control (RPC) algorithms exist that can stabilize the process and converge to desired reference, it is typically assumed that the reference and disturbance are constant from layer to layer. In this paper, the problem of tracking references (layer thicknesses) that change from layer to layer is considered. The bandwidth of the changing references is considered bounded in both the spatial and layer domains. A loop-shaping design process is then considered, in which the bounds are mapped to a bound on the two-dimensional sensitivity function and projected onto weighting filters in an LQR control formulation. The layer-to-layer controller is then constructed from traditional LQR methods. The controller is demonstrated on a simulation of laser metal deposition for a wavy wall build having frequency content in both the spatial and layer domains.
|
|
15:10-15:30, Paper WeB05.6 | Add to My Program |
Inferential Methods for Additive Manufacturing Feedback |
|
Limoge, Damas | Nanotronics |
Nouri Gooshki, Sadegh | Nanotronics |
Hough, Fabian | Nanotronics |
Nirmaleswaran, Aswin | Nanotronics |
Pinskiy, Vadim | Nanotronics |
Keywords: Agents-based systems, Manufacturing systems, Machine learning
Abstract: Adaptive manufacturing has revolutionized desktop prototyping and the production of physical models for non-load bearing or stress inducing applications. Many extrusion-based printers are available for purchase by entrepreneurial enthusiasts or businesses with manufacturing space limitations. These low-cost printers allow for quick prototyping but are not designed or intended for high quality production or high-cycle production, requiring extensive user tuning and upkeep to maintain the printer in usable condition. In a quest to apply modern deep learning and reinforcement learning based models, this work focuses on the development of control systems and infrastructure needed to resolve many of these intrinsic limitations of desktop 3D printers. A series of real-time agents were designed and deployed to actively monitor the printing of every layer and make continuous corrections in the printing parameters and G-code commands to reduce the variance in the tensile strength of homogeneous parts printed in a large batch.
|
|
WeB06 Regular Session, Ballroom DE |
Add to My Program |
Smart Grid |
|
|
Chair: Li, Heng | Central South University |
Co-Chair: Motee, Nader | Lehigh University |
|
13:30-13:50, Paper WeB06.1 | Add to My Program |
Piggyback on TNCs for Electricity Services: Spatial Pricing and Synergetic Value |
|
Qin, Junjie | UC Berkeley |
Porter, Jared | UC Berkeley |
Poolla, Kameshwar | Univ. of California at Berkeley |
Varaiya, Pravin | Univ. of California at Berkeley |
Keywords: Energy systems, Transportation networks, Smart grid
Abstract: Major Transportation Network Companies (TNCs), including Uber and Lyft, are in the process of electrifying their fleets. These electrified fleets can provide electricity service in addition to transportation service. This paper examines the problem of optimal spatial pricing for an electrified TNC jointly providing transportation and electricity services. When the system demand is spatially balanced, we establish a tight characterization of the optimal pricing policy and the platform profit. Furthermore, we highlight the role electricity service may provide in reducing the transportation spatial imbalance and characterize the resulting synergetic value.
|
|
13:50-14:10, Paper WeB06.2 | Add to My Program |
Delay-Aware Risk Analysis and Control in Smart Grid Networks with Corrupted Measurements |
|
Somarakis, Christoforos | Palo Alto Research Center |
Motee, Nader | Lehigh University |
Keywords: Smart grid, Delay systems, Networked control systems
Abstract: A novel framework is presented for design of wide-area-control (WAC) in smart grid power systems. The problem setup regards scenarios where control suffers from noisy measurement and time-lags. We evaluate the risk of phase incoherence in interconnected power machines. We outline the effect of systemic parameters, information flow and disturbances on risk of phase deviations. Our results suggest limitations of delay-aware control in presence of multiple sources of noise. We develop algorithmic network design tools to enhance and, in some cases, optimize coherency and robustness of the closed-loop system.
|
|
14:10-14:30, Paper WeB06.3 | Add to My Program |
Simultaneous Allocation and Control of Distributed Energy Resources Via Kullback-Leibler-Quadratic Optimal Control |
|
Cammardella, Neil | University of Florida |
Busic, Ana | Inria |
Meyn, Sean P. | Univ. of Florida |
Keywords: Smart grid, Distributed control, Markov processes
Abstract: There is enormous flexibility potential in the power consumption of the majority of electric loads. This flexibility can be harnessed to obtain services for managing the grid: with carefully designed decision rules in place, power consumption for the population of loads can be ramped up and down, just like charging and discharging a battery, without any significant impact to consumers' needs. The concept is called Demand Dispatch, and the grid resource obtained from this design virtual energy storage (VES). In order to deploy VES, a balancing authority is faced with two challenges: 1. how to design local decision rules for each load given the target aggregate power consumption (distributed control problem), and 2. how to coordinate a portfolio of resources to maintain grid balance, given a forecast of net-load (resource allocation problem). Rather than separating resource allocation and distributed control, in this paper the two problems are solved simultaneously using a single convex program. The joint optimization model is cast as a finite-horizon optimal control problem in a mean-field setting, based on the new KLQ optimal control approach proposed recently by the authors. The simplicity of the proposed control architecture is remarkable: With a large portfolio of heterogeneous flexible resources, including loads such as residential water heaters, commercial water heaters, irrigation, and utility-scale batteries, the control architecture leads to a single scalar control signal broadcast to every resource in the domain of the balancing authority.
|
|
14:30-14:50, Paper WeB06.4 | Add to My Program |
Optimal Energy Management of Energy Internet: A Distributed Actor-Critic Reinforcement Learning Method |
|
Cheng, Yijun | Central South University |
Peng, Jun | Central South University |
Gu, Xin | Central South University |
Jiang, Fu | Central South University |
Li, Heng | Central South University |
Liu, Weirong | Central South University |
Huang, Zhiwu | Central South University |
Keywords: Smart grid, Power systems, Agents-based systems
Abstract: Owning to the capacity constraints and the uneven distribution of resources, energy management problem in energy internet is a major concern. To cope with the variations and complexity of large scale energy management, a distributed actor-critic reinforcement learning based method is proposed for optimal energy management. First, the intelligent action is decided in the distributed agent to alleviate the pressure on centralized intelligent computing. The distributed action of each agent is based on its neighbour information, and an actor-critic reinforcement learning algorithm is applied for dealing with the continuous action space. Then, aiming at the supply-demand balance, the action is adjusted based on global information exchange. After action adjustment, the corresponding rewards are sent to each agent. Finally, the modified action is executed in each agent. And received rewards are utilized to update each agent. Simulation driven by Pecan Street Inc.’s Dataport demonstrates that the proposed distributed method is effective.
|
|
14:50-15:10, Paper WeB06.5 | Add to My Program |
Flexibility Capacity of Thermostatically Controlled Loads with Cycling/lock-Out Constraints |
|
Coffman, Austin | University of Florida |
Cammardella, Neil | University of Florida |
Barooah, Prabir | Univ. of Florida |
Meyn, Sean P. | Univ. of Florida |
Keywords: Smart grid, Power systems
Abstract: Thermostatically Controlled Loads (TCLs), e.g., A/Cs and water heaters, are a source of flexible power demand for the power grid: many different power consumption trajectories exist that can maintain consumers' quality of service (QoS). Extensive research has shown that flexible loads can provide valuable grid services. Quantifying the flexibility capacity of a collection of TCLs is a well-studied problem. However, many studies consider temperature constraints alone, while most TCLs are on/off loads that have cycling (or lock-out) constraints. Studies that have considered lock-out constraints have proposed quantifications that depend on the control algorithm used to coordinate loads to provide grid services. In this work, we present a characterization of the capacity of a collection of TCLs that considers not only temperature, but also cycling and total energy constraints. Our characterization is independent of the algorithm used to control the TCLs; it depends only on the QoS constraints on the individual TCLs. The proposed characterization can be used for planning a feasible power deviation trajectory for a collection of TCLs by solving a convex optimization problem.
|
|
15:10-15:30, Paper WeB06.6 | Add to My Program |
Capacity of Flexible Loads for Grid Support: Statistical Characterization for Long Term Planning |
|
Coffman, Austin | University of Florida |
Guo, Zhong | University of Florida |
Barooah, Prabir | Univ. of Florida |
Keywords: Smart grid
Abstract: Flexible loads are a valuable resource for the power grid of the future to help with balancing demand and generation. A balancing authority (BA) needs to know how much flexibility a load has, meaning what type of power deviation (from the baseline demand) signals are feasible for the load. In this work we present a characterization of capacity for a flexible load in terms of the power spectral density of the power deviation. We then show how this characterization can be used for resource allocation for the grid by determining what portion of the grid's needs can be met by a collection of such loads. The key difference with prior work on flexibility characterization is that ours is posed in terms of the statistical properties grid's net load and load's demand deviation, not on specific instances of these signals. The proposed characterization can thus be used for long term planning.
|
|
WeB07 Invited Session, Plaza Court 7 |
Add to My Program |
Control for Healthcare and Medical Systems I |
|
|
Chair: Rajamani, Rajesh | Univ. of Minnesota |
Co-Chair: Ashrafiuon, Hashem | Villanova University |
Organizer: Hahn, Jin-Oh | University of Maryland |
Organizer: Zhang, Wenlong | Arizona State University |
Organizer: Rajamani, Rajesh | Univ. of Minnesota |
Organizer: Ashrafiuon, Hashem | Villanova University |
|
13:30-13:50, Paper WeB07.1 | Add to My Program |
Online Model-Based Beat-By-Beat Heart Rate Estimation (I) |
|
Albaba, Adnan | Uppsala University |
Medvedev, Alexander V. | Uppsala University |
Keywords: Biomedical, Modeling, Nonlinear systems identification
Abstract: A method for estimating the instantaneous heart rate (HR) using the morphological features of one electrocardiogram (ECG) cycle (beat) at a time is proposed. This work is not aimed at introducing an alternative way for HR estimation, but rather illustrates the utility of model-based ECG analysis in online individualized monitoring of the heart function. The HR estimation problem is reduced to fitting one parameter, whose value is related to the nine parameters of a realistic nonlinear model of the ECG and estimated from data by nonlinear least-squares optimization. The method feasibility is evaluated on synthetic ECG signals as well as signals acquired from MIT-BIH databases at Physionet website. Moreover, the performance of the method was tested under realistic free-moving conditions using a wearable ECG and HR monitor with encouraging results.
|
|
13:50-14:10, Paper WeB07.2 | Add to My Program |
Adaptive Admittance Control of Hybrid Exoskeletons (I) |
|
Cousin, 35401 | University of Alabama |
Keywords: Lyapunov methods, Adaptive control, Robotics
Abstract: Hybrid exoskeletons combine two increasingly common rehabilitative therapies, functional electrical stimulation (FES) and robotic therapy, for use on individuals with neuromuscular disorders. As hybrid exoskeletons increase in popularity and complexity, it remains an ever-important issue to not only assist people in performing rehabilitation, but also to guarantee their safety while coupled to the exoskeleton. In this paper, a novel adaptive controller for hybrid exoskeletons is developed to regulate an admittance error system using the exoskeleton’s motors while simultaneously regulating a position error system using the operator’s muscles, stimulated through FES. The stability of the controller is rigorously analyzed using a combined Lyapunov-passivity approach and while the hybrid exoskeleton is proven to be energetically passive, the admittance error system is proven to demonstrate global exponential convergence to a uniform ultimate bound. Simulations were performed on a two degree-of-freedom lower-limb hybrid exoskeleton to demonstrate the efficacy of the controller. Results show the controller achieves an average admittance tracking error of 0.0+/-0.08 rad and 0.00+/-0.08 rad/s for joint one (the knee joint), and 0.01+/-0.11 rad and 0.01+/-0.12 rad/s for joint two (the ankle joint), while simultaneously applying FES to the operator’s muscles for rehabilitation.
|
|
14:10-14:30, Paper WeB07.3 | Add to My Program |
Design and Nonlinear Control of a Haptic Glove for Virtual Palpation (I) |
|
Galla, Matt | Southern Methodist University |
Al Khatib, Ehab | Southern Methodist University |
Hurmuzlu, Yildirim | Southern Methodist Univ |
Richer, Edmond | SMU |
Keywords: Biomedical, Variable-structure/sliding-mode control, Fluid power control
Abstract: This paper presents the design and kinematic analysis of a Haptic Glove for medical elastographic imaging virtual palpation. Of the 12 degrees of freedom present in the index finger, middle finger, and thumb of the hand, the design constrains 5 and controls 6 with pneumatic air cylinder actuators, allowing uncontrolled, but measured motion in the remaining degree of freedom. Nearly linear bijective transfer functions between the actuator positions and joint angles are found in closed form for all 6 actuated joints. A nonlinear force and stiffness controller based on backstepping-sliding mode algorithm was designed and implemented.
|
|
14:30-14:50, Paper WeB07.4 | Add to My Program |
Human Learning and Coordination in Lower-Limb Physical Interactions (I) |
|
Amatya, Sunny | Arizona State University |
Rezayat Sorkhabadi, Seyed Mostafa | Arizona State University |
Zhang, Wenlong | Arizona State University |
Keywords: Biomedical, Modeling, Computational methods
Abstract: This paper explores the gait learning and coordination through physical human-human interaction. The interaction and coordination are modeled as a two-step process: 1) encoding the human gait as a periodic process and 2) adjustment of the periodic gait cycle based on the external forces due to physical interactions. Three-legged walking experiments are conducted with two human dyads. Magnitude and direction of the interaction force, as well as the knee joint angles and ground reaction forces of the tied legs are collected. The knee joint trajectory of the two participants is modeled using dynamic movement primitives (DMP) coupled with force feedback through iterative learning. Gait coordination is modeled as a learning process based on kinematics from the last gait cycle and real-time interaction force feedback. The proposed method is compared with a popular baseline DMP model, which performs batch regression based on data from the previous gait cycle. The proposed model performed better in modeling one pair in the cooperative experiment compared to the baseline algorithm. The results and approaches for improving the algorithm are further discussed.
|
|
14:50-15:10, Paper WeB07.5 | Add to My Program |
Model Predictive Control of Multi-Location Vagal Nerve Stimulation for Regulating Cardiovascular System |
|
Yao, Yuyu | Lehigh University |
Kothare, Mayuresh V. | Lehigh University |
Keywords: Biomedical, Predictive control for nonlinear systems, Control applications
Abstract: Previous studies have proposed closed-loop methods to determine one of the vagal nerve stimulation (VNS) parameters based on the feedback of heart rate but never consider the blood pressure. This study develops a nonlinear model predictive controller (NMPC) for a multi-location VNS system, which controls heart rate (HR) and mean arterial pressure (MAP) by independently manipulating multiple stimulation parameters in three different locations. Pulsatile and non-pulsatile models of the integrated cardiovascular system and baroreflex regulation are developed to predict the dynamic response of the MAP and HR. The two models are compared and elicit similar dynamics. The NMPC algorithm incorporates the non-pulsatile model and is evaluated by the pulsatile model. Three set point tracking cases are presented and discussed. The performance of NMPC shows the feasibility and usefulness of the proposed control algorithm for the regulation of HR and MAP during multi-location VNS.
|
|
15:10-15:30, Paper WeB07.6 | Add to My Program |
A Task-Invariant Learning Framework of Lower-Limb Exoskeletons for Assisting Human Locomotion |
|
Lv, Ge | Clemson University |
Xing, Haosen | Carnegie Mellon University |
Lin, Jianping | University of Michigan |
Gregg, Robert D. | University of Michigan |
Atkeson, Christopher G. | Carnegie Mellon University |
Keywords: Robotics, Human-in-the-loop control, Optimization
Abstract: Kinematic control approaches for exoskeletons follow specified trajectories, which overly constrain individuals who have partial or full volitional control of their lower-limbs. In our prior work, we proposed a general matching framework for underactuated energy shaping to provide task-invariant, energetic exoskeletal assistance. While the proposed shaping strategies demonstrated benefits such as reduced human torques during walking, it remains unclear how the parameters of these shaping strategies are related to the torque reduction. Meanwhile, research indicates that customizing assistance via optimization techniques can substantially improve exoskeleton's performance for each individual. Motivated by this fact, we combine derivative-free, sample-efficient optimization algorithms with our energy shaping strategies to propose a task-invariant learning framework for lower-limb exoskeletons. Through rapid online optimization, this framework enables exoskeletons to adjust shaping parameters for minimizing human joint torques across users and tasks. Simulation results show that shaping strategies with optimal parameters effectively reduce human joint torques and metabolic cost during simulated walking. In addition, the optimal exoskeleton torques calculated using able-bodied subjects' kinematic data closely match the real human joint torques across locomotor tasks.
|
|
WeB08 Invited Session, Governor's SQ 10 |
Add to My Program |
Mechatronics I |
|
|
Chair: Li, Perry Y. | Univ. of Minnesota |
Co-Chair: Chen, Xu | University of Washington |
Organizer: Oldham, Kenn | University of Michigan, Ann Arbor |
Organizer: Chen, Xu | University of Washington |
|
13:30-13:50, Paper WeB08.1 | Add to My Program |
AFM Tip Localization on Large Range Sample Using Particle Filter for MEMS Inspection |
|
Liu, Yi-Lin | National Taiwan University |
Huang, Kuan-Wei | National Taiwan University |
Huang, Ching - Chi | National Taiwan University |
Chen, Huang-Chih | National Taiwan University |
Fu, Li-Chen | National Taiwan University |
Keywords: Control applications, Estimation, Filtering
Abstract: Atomic force microscopy (AFM) is a powerful instrument that has the ability to characterize sample topography on nanoscale resolution. AFM is widely used in different fields, such as nanotechnology, semiconductor, Microelectromechanical Systems (MEMS), bioscience. In the case of obtaining 3D topography of a large range sample, we need to know the relative position of the AFM probe to the sample. The scanning range of an AFM generally is much smaller than the sample size. Therefore, it is hard to localize the AFM tip position without other auxiliary microscopes such as optical microscope. Moreover, the AFM scanned images on a MEMS sample typically involve only simple geometries with sparse features which usually leads to the difficulty of localization. Besides, the system uncertainties including piezoelectric scanner hysteresis, thermal drift, and coarse dual stage would affect positioning accuracy. In this paper, we propose an AFM tip localization method using particle filter referring to macro robot Simultaneous localization and mapping (SLAM). We take the AFM scanned image as the unique sensor and the sample layout as the map. The sensor model of the particle filter is based on a feature extraction algorithm. To verify the efficacy of the proposed methods, both simulations and experiments are conducted, and the proposed tip localization method is highly promising.
|
|
13:50-14:10, Paper WeB08.2 | Add to My Program |
Optimal Control of Wheeled Mobile Robots: From Simulation to Real World (I) |
|
Arab, Aliasghar | Rutgers University |
Mousavi, Yashar | Department of Applied Science, School of Computing, Engineering |
Keywords: Optimal control, Learning, Robotics
Abstract: We study the problem of taking simulations to the real world (RW) for autonomous robotic systems with dynamic uncertainties and unknown disturbances while maintaining the optimal performance and stability of the designed controller designed in simulation. In general, an optimal and robust controller that is designed through simulation often does not perform similarly when deployed in the RW. We focus on using simulations to generate an optimal control policy utilizing the Memetic algorithm (MA) iteratively. The simulation-to-RW performance and stability are realized by using an adaptive fuzzy system to learn the uncertain part of the dynamic model, disturbance and noises. We demonstrate experimentally that this method permits the development of optimal control design in simulations and integrates adaptive learning rules to enable precise and repetitive trajectory tracking for the wheeled mobile robot (WMR) with disturbances and uncertainties.
|
|
14:10-14:30, Paper WeB08.3 | Add to My Program |
Self-Sensing Dual Push-Pull Solenoids Using a Finite Dimension Flux-Observer (I) |
|
Li, Perry Y. | Univ. of Minnesota |
Keywords: Mechatronics, Observers for nonlinear systems, Fluid power control
Abstract: Position feedback in a solenoid actuated system typically requires a position sensing device such as a Linear Variable Differential Transformer (LVDT). The goal of self-sensing is to obtain position information directly from the electrical signals to the solenoid actuators, thus obviating the additional cost and footprint of a LVDT or another displacement sensing device. Such measurement is possible due to the position dependence of electrical inductance in the solenoids. This paper proposes a finite-dimensional nonlinear observer for the magnetic flux linkage for the solenoids. Once the flux linkage has been identified, the solenoid position can be determined via the position-inductance relationship. The algorithm has been adapted for actual solenoids modeled as a third-order system that includes two eddy current modes accurate up to 1024 Hz. Implementation on commercially low-cost solenoids (with 5mm stroke) has demonstrated RMS position accuracy up to 0.061mm. The ability to self-sense accurately can enable solenoids to be deployed at low-cost for many motion control applications besides hydraulic valves.
|
|
14:30-14:50, Paper WeB08.4 | Add to My Program |
High-Speed Large-Range Dynamic-Mode Atomic Force Microscope Imaging: Adaptive Multiloop Approach Via Field Programmable Gate Array (I) |
|
Chen, Jiarong | Rutgers University |
Zou, Qingze | Rutgers, the State University of New Jersey |
Keywords: MEMs and Nano systems, Mechatronics
Abstract: This paper presents a software-hardware integrated approach to high-speed large-range dynamic mode imaging of atomic force microscope (AFM). High speed AFM imaging is needed to interrogate dynamic processes at nanoscale such as chemical reactions. High-speed dynamic-modes such as tapping-mode AFM imaging are challenging as the probe tapping motion is highly sensitive to the highly nonlinear probe-sample interaction during the imaging process. The existing hardware-based approach via bandwidth enlargement, however, results in a substantial loss of imaging area that can be covered. Contrarily, software-based approach, for example, the recently developed adaptive multiloop mode (AMLM) technique has demonstrated its efficacy in increasing the tapping-mode imaging speed without loss of imaging size. However, further improvement has been limited by the the hareware bandwidth and the online signal processing speed and computation complexity.Thus, in this paper, the AMLM technique is furhter enhanced and integrated with the FPGA platform to further increase the imaging speed without loss of quality and imaging range. Issues in FPGA implementation in AFM imaging experiment is presented and discussed to illustrate this integrated approach.
|
|
14:50-15:10, Paper WeB08.5 | Add to My Program |
A New-Designed Non-Raster Scan and Precision Control for Increasing AFM Imaging Speed |
|
Chen, Huang-Chih | National Taiwan University |
Fu, Li-Chen | National Taiwan University |
Keywords: Mechatronics, Control applications, Networked control systems
Abstract: Atomic force microscope (AFM) is able to perform high resolution 3-D topography image at a nanometer resolution. This paper demonstrates the amplitude-detection mode atomic force microscopy (AM-AFM) with the proposed modified cycloid trajectory (MCT) for lateral-axes. Besides, the internal model principle-based neural network complementary sliding mode control (IMP-based NNCSMC) approach of designing controller is implemented for the xy-piezoelectric scanner to overcome some non-linear uncertainties or disturbance. Furthermore, the MCT method is a smooth and cycloid-like scan pattern that can avoid the containing frequency in fast axis signal beyond mechanical bandwidth of the scanner such that AFM can achieve higher scan speed than a raster scan. Finally, some comparison results between MCT and raster scan will be provided.
|
|
WeB09 Regular Session, Governor's SQ 16 |
Add to My Program |
Adaptive Control I |
|
|
Chair: Oliveira, Tiago Roux | State University of Rio De Janeiro |
Co-Chair: Nivison, Scott | Air Force Research Laboratory |
|
13:30-13:50, Paper WeB09.1 | Add to My Program |
A Simplified Multivariable Gradient Extremum Seeking for Distinct Input Delays with Delay-Independent Convergence Rates |
|
Oliveira, Tiago Roux | State University of Rio De Janeiro |
Tsubakino, Daisuke | Nagoya University |
Krstic, Miroslav | University of California, San Diego |
Keywords: Adaptive control, Adaptive systems, Delay systems
Abstract: In this paper, we address the design and analysis of multivariable extremum seeking for unknown static maps subject to arbitrarily long time delays. Gradient-based method is considered. Multi-input systems with different time delays in each individual input channel are dealt with. The phase compensation of the dither signals and the inclusion of predictor feedback with a perturbation-based (averaging-based) estimate of the Hessian allow to obtain local exponential convergence results to a small neighborhood of the optimal point, even in the presence of delays. Unlike previous publications considering multiparameter extremum seeking and delays, the stability analysis is carried without using backstepping transformation, which also eliminates the complexity of the controller. In a nutshell, a simpler implementation scheme and direct analysis without invoking successive backstepping transformation can be assured. In particular, the delays in our approach are independent of the dither frequency and system's dimension such that fast convergence rates are still guaranteed. A numerical example illustrates the performance of the new delay-compensated extremum seeking scheme and its simplicity.
|
|
13:50-14:10, Paper WeB09.2 | Add to My Program |
Adaptive Parameter Estimation for Aerial Manipulation |
|
Baraban, Gabriel | Johns Hopkins University |
Sheckells, Matthew | Johns Hopkins University |
Kim, Soowon | Johns Hopkins University |
Kobilarov, Marin | Johns Hopkins University |
Keywords: Adaptive control, Adaptive systems, Direct adaptive control
Abstract: This paper describes the development of a model reference adaptive controller suitable for quadrotors equipped with manipulators capable of grasping and transporting objects of unknown mass. Through a Lyapunov argument, this estimation and control algorithm is shown to be asymptotically stable when tracking a desired reference trajectory. The adaptive controller is then demonstrated on a quadrotor of unknown mass, showing that it can track a reference trajectory with sufficient accuracy to pick up a payload and maintain stable flight, despite the sudden change in vehicle parameters induced by the payload. This new adaptive controller is slower to respond to changes in vehicle mass than control strategies that use more conventional mass estimation methods, but it is subject to less noise since it does not make use of accelerometer data, resulting in a smoother control trajectory.
|
|
14:10-14:30, Paper WeB09.3 | Add to My Program |
Adaptive Output Servocontroller for MIMO System with Input Delay |
|
Nikiforov, Vladimir O. | ITMO University |
Paramonov, Aleksei | ITMO University |
Gerasimov, Dmitry | ITMO University |
Keywords: Adaptive control, Direct adaptive control, Delay systems
Abstract: The paper deals with the problem of simultaneous adaptive compensation of external disturbances and asymptotic reference tracking in linear time-invariant multi-input multi-output square plants with input delay and unmeasureble state. The plant to be controlled can be unstable. The external signals --- disturbance to be compensated and reference to be tracked --- are modeled as multi-harmonic signals with unknown frequencies, phases and amplitudes. The solution is based on suitable external signals parameterization and prediction as well as on special tracking error augmentation allowing one to overcome the problem of input delay in adaptation algorithm. Two adaptation algorithms using special augmented error are proposed: gradient-based algorithm and an algorithm with improved parametric convergence based on application of Kreisselmeier's scheme. No {em a priori} assumptions about knowledge of external signal parameters as well as about persistent excitation (PE) condition are needed for asymptotic reference tracking and disturbance rejection in the closed-loop system.
|
|
14:30-14:50, Paper WeB09.4 | Add to My Program |
Improved Adaptive Compensation of Unmatched Multisinusoidal Disturbances in Uncertain Nonlinear Plants |
|
Gerasimov, Dmitry | ITMO University |
Pashenko, Artem | ITMO University |
Nikiforov, Vladimir O. | ITMO University |
Keywords: Adaptive control, Direct adaptive control, Uncertain systems
Abstract: The paper addresses the problem of adaptive compensation of unmatched disturbance in nonlinear parametrically uncertain systems presented in parametric-strict-feedback form. The disturbance is modeled as a vector of unmeasurable multisinusoidal functions with a priori unknown amplitudes, frequencies and phases. The proposed solution is based on observer-based disturbance parameterization, modular backstepping design and special adaptation algorithm (identifier) with memory regressor extension. New adaptation algorithm proposed has two important properties. First, it has improved parametric convergence achieved by regressor recording over past period of time. Recording is provided by involving a linear SISO filter into the structure of the algorithm. Second, inclusion of this filter allows us to calculate the high-order time derivatives of the adjustable parameters used directly in virtual and actual control laws.
|
|
14:50-15:10, Paper WeB09.5 | Add to My Program |
A Distributed Output Feedback Adaptive Controller for Leader-Follower Multiagent Systems with Stochastic Disturbances and Sensor-Actuator Attacks |
|
Jin, Xu | University of Kentucky |
Haddad, Wassim M. | Georgia Inst. of Tech |
Keywords: Adaptive control, Fault tolerant systems, Stochastic systems
Abstract: In this paper, we develop distributed output feedback adaptive consensus control protocols for addressing networked multiagent systems subject to exogenous stochastic disturbances and sensor and actuators attacks. Specifically, for a class of linear leader-follower multiagent systems with an undirected communication graph topology we develop an output feedback adaptive control design protocol for each follower agent to address malicious attacks on the actuator signals of the follower agents as well as sensor attacks on the output neighborhood synchronization errors measurements. The proposed adaptive controllers involve an indirect adaptive architecure that estimates and compensates for the malicious attacks while guaranteeing uniform ultimate boundedness of the state tracking error for each agent in a mean-square sense.
|
|
15:10-15:30, Paper WeB09.6 | Add to My Program |
Improved Attention Models for Memory Augmented Neural Network Adaptive Controllers |
|
Muthirayan, Deepan | University of California at Irvine |
Nivison, Scott | Air Force Research Laboratory |
Khargonekar, Pramod | Univ. of California, Irvine |
Keywords: Adaptive control, Neural networks, Uncertain systems
Abstract: We introduced a {it working memory} augmented adaptive controller in our recent work. The controller uses attention to read from and write to the working memory. Attention allows the controller to read specific information that is relevant and update its working memory with information based on its relevance, similar to how humans pick relevant information from the enormous amount of information that is received through various senses. The retrieved information is used to modify the final control input computed by the controller. We showed that this modification speeds up learning. In the above work, we used a soft-attention mechanism for the adaptive controller. Controllers that use soft attention update and read information from all memory locations at all the times, the extent of which is determined by their relevance. But, for the same reason, the information stored in the memory can be lost. In contrast, hard attention updates and reads from only one location at any point of time, which allows the memory to retain information stored in other locations. The downside is that the controller can fail to shift attention when the information in the current location becomes less relevant. We propose an attention mechanism that comprises of (i) a hard attention mechanism and additionally (ii) an attention reallocation mechanism. %that effectively retains the benefit of hard attention and at the same time overcomes its limitation by reallocating attention whenever required. The attention reallocation enables the controller to reallocate attention to a different location when the relevance of the location it is reading from diminishes. The reallocation also ensures that the information stored in the memory before the shift in attention is retained which can be lost in both soft and hard attention mechanisms. %We illustrate through simulations that the memory that uses the proposed attention mechanism stores a more accurate representation of the variations in the hidden layer values of the neural network (NN). Through detailed simulations of various scenarios for two link robot robot arm systems we illustrate the effectiveness of the proposed attention mechanism.
|
|
WeB10 Regular Session, Governor's SQ 11 |
Add to My Program |
Autonomous Robots I |
|
|
Chair: Panagou, Dimitra | University of Michigan, Ann Arbor |
Co-Chair: Cheng, Teng-Hu | National Chiao Tung University |
|
13:30-13:50, Paper WeB10.1 | Add to My Program |
Safe and Computational Efficient Imitation Learning for Autonomous Vehicle Driving |
|
Flavia, Acerbo | Siemens PLM Software |
Herman, Van der Auweraer | Siemens PLM Software |
Son, Tong | Siemens Digital Industries Software |
Keywords: Autonomous robots, Automotive control, Machine learning
Abstract: Autonomous vehicle driving systems face the challenge of providing safe, feasible and human-like driving policy quickly and efficiently. The traditional approach usually involves a search or optimization-based planning followed by a model-based controller. This may prove to be inadequate in some driving scenarios due to disturbance, uncertainties and limited computation time. The more recent end-to-end approaches aim at overcoming these issues by learning a policy to map from sensor data to controls using machine learning techniques. Although being attractive for its simplicity, they also show some drawbacks such as sample inefficiency and difficulties in validation and interpretability. This work presents an approach that attempts to exploit both worlds, combining machine learning-based and model-based control into an imitation learning framework that mimic expert driving behavior while obtaining safe and smooth driving. The dataset is generated from high-fidelity simulations of vehicle dynamics and model predictive control (MPC). A smooth spline-based motion planning represents the policy provided by a constrained neural network exploiting the convex hull property of B-splines. The policy network is trained with few dataset aggregations coming from its induced distribution of states. The learned policy is used as guidance for model-based feedback control and tested on a 15DOF high fidelity vehicle model.
|
|
13:50-14:10, Paper WeB10.2 | Add to My Program |
ROS Based Real-Time Motion Control for Robotic Visual Arts Exhibit Using Decawave Local Positioning System |
|
Gomaa, Mahmoud | Memorial University of Newfoundland |
De Silva, Oscar | Memorial University of Newfoundland |
Mann, George K. I. | Memorial University of Newfoundland |
Gosine, Raymond G. | Memorial University of Newfoundland |
Hengeveld, Robert | Memorial University of Newfoundland |
Keywords: Autonomous robots, Autonomous systems, Control applications
Abstract: In this work, we address the problem of real-time control and localization of an autonomous art exhibit designed using Mecanum wheeled omnidirectional mobile robots. Currently, the exhibit is animated using open-loop control as there are no practical means of implementing a localization system in art galleries. This paper proposes a nonlinear model predictive controller (NMPC) supported by a Decawave localization system for trajectory tracking of the robots. A Robot Operating System (ROS) based NMPC is implemented to control the motion of the robot for a smooth and drift-free trajectory tracking. The Automatic Control and Dynamic Optimization (ACADO) toolkit is used to find the optimal control action while considering all constraints on system states and inputs. A Local Positioning System (LPS) is implemented using Decawave 1001 modules to provide position feedback with an Optitrack motion capture system providing ground truth information for validation. The proposed control approach is first evaluated using the Virtual Robot Experimentation Platform (V-REP), which additionally provides means of trajectory design and simulation of the robot in the desired exhibition space. Thereafter, laboratory experiments are conducted to evaluate the performance of the proposed control and localization systems. The results show a smooth and drift-free performance of the system with less than 10% error of the robot size, which can be deployed at gallery spaces with minimal setup requirements.
|
|
14:10-14:30, Paper WeB10.3 | Add to My Program |
LIV-LAM: LiDAR and Visual Localization and Mapping |
|
Radmanesh, Reza | University of Michigan |
Wang, Ziyin | Indiana University-Purdue University, Indianapolis |
Chipade, Vishnu S. | University of Michigan, Ann Arbor |
Tsechpenakis, Gavriil | Indiana University-Purdue University, Indianapolis |
Panagou, Dimitra | University of Michigan, Ann Arbor |
Keywords: Autonomous robots, Control applications, Robotics
Abstract: This paper presents a framework for Simultaneous Localization and Mapping (SLAM) by combining a novel method for object discovery and localization from a monocular camera with depth information provided by Light Detection and Ranging (LiDAR). One major challenge in vision is discovering unknown objects without prior training/supervision, in the wild, and on-the-fly. In our framework, no training samples are available prior to the deployment. We develop an efficient proposal-matching method to discover object temporal saliency, and then fine- tune these frequently matched object proposals according to tracking information. Detected features of the objects are used as landmark features, and are merged with the LiDAR data in the proposed LIV-LAM (LiDAR and Visual Localization and Mapping). Compared to most visual SLAM or LiDAR-based SLAM, the novelty of this method is the computationally-efficient object detection and localization for feature set-and-match, in order to increase the accuracy of the generated map. The results show that the presented method is superior in both accuracy and efficiency of the maps generated by LiDAR.
|
|
14:30-14:50, Paper WeB10.4 | Add to My Program |
A Nonlinear Optimal Control Method for the Ballbot Autonomous Vehicle |
|
Rigatos, Gerasimos | Industrial Systems Institute |
Abbaszadeh, Masoud | GE Global Research |
Pomares, Jorge | University of Alicante, Department of Systems Engineering |
Keywords: Autonomous robots, Control applications, Optimal control
Abstract: A nonlinear optimal (H-infinity) control approach is developed for the model of the ballbot. This robotic system consists of a rolling sphere with a rigid body, in the form of an inverted pendulum, mounted on top of the sphere. Because of the nonlinearities and underactuation that are due to the dynamics of both the rolling sphere and of the rotational motion of the rigid body, control of the ballbot is a non-trivial problem. In the proposed control method, the dynamic model of the ballbot undergoes first approximate linearization around a temporary operating point which is updated at each iteration of the control algorithm. The linearization process makes use of first-order Taylor series expansion and relies also on the computation of the Jacobian matrices of the state-space model of the robotic system. A stabilizing H-infinity feedback controller is designed for the approximately linearized description of the ballbot. An algebraic Riccati equation is solved at each time-step of the control method so as to compute the controller's feedback gains. Through Lyapunov analysis the stability properties of the control scheme are proven. Besides, through the article's results it is demonstrated that the control method retains the advantages of linear optimal control, that is fast and accurate tracking of the reference setpoints under moderate variations of the control inputs.
|
|
14:50-15:10, Paper WeB10.5 | Add to My Program |
An Active Perception Approach for Mid-Water Localization of Autonomous Underwater Vehicles |
|
Chang, Dongsik | University of Michigan |
Johnson-Roberson, Matthew | University of Michigan |
Sun, Jing | University of Michigan |
Keywords: Autonomous robots, Control applications, Simulation
Abstract: Mid-water localization is challenging for autonomous underwater vehicles (AUVs) due to limited communications and geo-referencing capabilities in the underwater environment, coupled with unknown complex and dynamic surroundings. Existing solutions typically utilize expensive sensors that may not be available to all AUVs. In this paper, we consider an AUV descending through the water column and propose an approach for mid-water localization using inertial and depth sensors only. During a descent of the vehicle, we leverage spiral motion, which allows for exploitation of vehicle dynamics along with associated inertial sensor measurements for localization. The spiral motion enables us to observe and estimate the influence of environmental flow (i.e., ocean currents) on the vehicle motion, thereby enhancing the understanding of the environment through active perception. The estimated flow together with inertial and depth sensor measurements are integrated in the vehicle motion model for localization. Comparing our approach with conventional dead-reckoning, the simulation results demonstrate its promising potential.
|
|
15:10-15:30, Paper WeB10.6 | Add to My Program |
Cooperative Transportation of Drones without Inter-Agent Communication |
|
Wu, Pin-Xian | National Chiao Tung University |
Hung, Hsin-Ai | National Chiao Tung University |
Yang, ChengCheng | Department of Mechanical Engineering, National Chiao Tung Univer |
Cheng, Teng-Hu | National Chiao Tung University |
Keywords: Autonomous robots, Cooperative control, Transportation networks
Abstract: A control strategy for a leader-follower system without interagent communication is developed for cooperative transportation in this work. Two cascaded UKFs (unscented Kalman filters) are developed to estimate the external force of the leader as to eliminate the need of force sensors. Compared to most existing results, performance of the developed force estimators is invariant to lighting conditions since the developed UKFs do not require measurement from vision systems. To enhance robustness of the control scheme, a switching controller along with a triggering condition is developed for the follower, so that the impact to the performance of the closed-loop system caused by the disturbances can be minimized. Experiments are conducted to evaluate the control performance. Additionally, interesting phenomena are observed from the experiments and discussed, which can facilitate the improvement of the next generation cable-based transportation systems.
|
|
WeB11 Regular Session, Director's Row I |
Add to My Program |
Agent-Based Systems I |
|
|
Chair: Mohammadi, Arash | Concordia University |
Co-Chair: Ishii, Hideaki | Tokyo Institute of Technology |
|
13:30-13:50, Paper WeB11.1 | Add to My Program |
An Optimal Control Approach to Flocking |
|
Beaver, Logan E. | University of Delaware |
Kroninger, Christopher | U.S. Army Research Laboratory |
Malikopoulos, Andreas A. | University of Delaware |
Keywords: Agents-based systems, Autonomous systems, Cooperative control
Abstract: Flocking behavior has attracted considerable attention in multi-agent systems. The structure of flocking has been predominantly studied through the application of artificial potential fields coupled with velocity consensus. These approaches, however, do not consider the energy cost of the agents during flocking, which is especially important in large-scale robot swarms. This paper introduces an optimal control framework to induce flocking in a group of agents. Guarantees of energy minimization and safety are provided, along with a decentralized algorithm that satisfies the optimality conditions and can be realized in real time. The efficacy of the proposed control algorithm is evaluated through simulation in both MATLAB and Gazebo.
|
|
13:50-14:10, Paper WeB11.2 | Add to My Program |
Safe Motion Planning under Partial Observability with an Optimal Deterministic Planner |
|
Johnson, Jeffrey Kane | Mapless AI, Inc |
Keywords: Agents-based systems, Adaptive control, Automotive systems
Abstract: This paper derives a principled framework for efficiently and safely navigating partially observable multi-agent systems using an optimal deterministic planner. This is accomplished by decoupling the navigation problem into independent collision avoidance and guidance problems and by providing mechanisms for solving both efficiently. While the framework does forgo global optimality in order to compute solutions, we argue that such optimality is unattainable in practice due to intractability, so nothing is actually sacrificed. An example solution is demonstrated for a novel graph traversal problem using a deterministic, single-agent velocity profile planner in a partially observable, multi-agent setting.
|
|
14:10-14:30, Paper WeB11.3 | Add to My Program |
Distributed Fast Flocking Control for Second-Order Multi-Agent Systems with Switching Communication Topology |
|
Wang, Fengchen | Arizona State University |
Chen, Yan | Arizona State University |
Keywords: Agents-based systems, Autonomous systems, Cooperative control
Abstract: To improve the flocking convergence speed for completing some emergent tasks, e.g. search and rescue in an accident, this paper proposes a novel fast convergent flocking control method for multi-agent systems with switching communication topology. First, a new distributed per-step convergence factor (D-PCF) is defined to indicate flocking convergence speed of each agent, whose summation indicates the overall convergence speed of multi-agent systems. Then, to decrease the D-PCF and thus increase the flocking convergence speed of the overall multi-agent system, a new distributed fast synchronization (DFS) algorithm is developed to determine position-dependent and velocity-dependent adjacency weights on every communication channel of an ad hoc network with switching topologies. The simulation results show that compared with a conventional flocking control, the flocking control using the DFS algorithm with switching communication topology can significantly increase the flocking convergence speed without requiring larger control inputs.
|
|
14:30-14:50, Paper WeB11.4 | Add to My Program |
A Dynamic Quasi-Taylor Approach for Distributed Consensus Problems with Packet Loss |
|
Mirali, Furugh | Hamburg University of Technology |
Werner, Herbert | Hamburg University of Technology |
Keywords: Agents-based systems, Cooperative control, Distributed control
Abstract: This paper presents a novel approach for handling packet loss in first-order consensus protocols based on a Taylor series expansion. We propose a dynamic memory approach which depends on a locally measured loss rate at each agent. The quasi-Taylor method assumes that each agent is storing not only the past received value of its neighbours in a memory, but the last nu received states of all neighbours in order to predict the future trajectory with the quasi-Taylor estimation. In addition, we use the so-called importance measure to label the most important information received at each time step. Then, depending on the measured loss rate the past data points of a neighbour are used to predict the future trajectory. Hereby, the trajectory is determined as a combination of different orders of the quasi-Taylor estimation. In order to minimise the distance of the consensus value to the actual average, we propose to use an adaptive step size for predicting the future trajectory of the neighbours. We give an upper bound on the convergence rate when uniform packet loss is assumed and show that the proposed approach outperforms existing methods from the literature with the help of simulation studies.
|
|
14:50-15:10, Paper WeB11.5 | Add to My Program |
Dynamic Event-Triggered Formation Control for Multi-Agent Systems: A Co-Design Optimization Approach |
|
Amini, Amir | Concordia University |
Asif, Amir | Concordia University |
Mohammadi, Arash | Concordia University |
Keywords: Agents-based systems, Cooperative control, LMIs
Abstract: This paper studies formation control in second-order multi-agent systems where communication between the neighbouring agents is based on fulfillment of dynamic event-triggering (DET) conditions. A novel co-design optimization is proposed to simultaneously design all required control and event-triggering parameters. We use the flexibility of the proposed co-design method to optimize the inter-event interval for a predefined formation convergence rate. The optimization is based on the scalarization (weighted sum) approach which provides a structured trade-off between the formation convergence rate and intensity of the event-triggerings. The computational complexity of the proposed optimization is independent of the network size. Simulations for multi-agent systems consisting a class of unmanned aerial vehicles (UAV) quantify the effectiveness of the proposed approach.
|
|
15:10-15:30, Paper WeB11.6 | Add to My Program |
A Resilient Synchronization Protocol for Pulse-Coupled Oscillators Over Robust Networks (I) |
|
Iori, Yugo | Tokyo Institute of Technology |
Ishii, Hideaki | Tokyo Institute of Technology |
Keywords: Agents-based systems, Cooperative control, Sensor networks
Abstract: In this paper, we consider a synchronization problem for wireless sensor networks using pulse-based communication in the presence of faulty or malicious nodes. Such nodes have the effect of disturbing the normal nodes. We propose a resilient distributed algorithm for synchronization among the normal nodes by assuming worst-case attacks. The algorithm functions even under a sparse network structure, which is important for scalability of this type of application. The approach is based on mean subsequence reduced (MSR) type algorithms from the area of multi-agent consensus. We characterize a detection method for finding malicious nodes that transmit pulses irregularly. Then, we show that as long as the malicious ones send pulses in a way they can remain undetected, the normal nodes can reach synchronization by ignoring suspicious pulses. To illustrate the results, numerical examples are provided.
|
|
WeB12 Regular Session, Director's Row E |
Add to My Program |
Estimation I |
|
|
Chair: Wang, Jin | Auburn University |
Co-Chair: Michalska, Hannah H. | McGill Univ |
|
13:30-13:50, Paper WeB12.1 | Add to My Program |
Adaptive State Estimation with Subspace-Constrained State Correction |
|
Goel, Ankit | University of Michigan |
Bernstein, Dennis S. | Univ. of Michigan |
Keywords: Estimation, Adaptive systems, Kalman filtering
Abstract: In many applications of state estimation, it is efficient to confine the output-error injection to a prescribed subspace of the state space. This paper considers this problem by applying the unscented Kalman filter and retrospective cost state estimator (RCSE) to linear and nonlinear systems with subspace-constrained state correction. As an application of these techniques, parameter estimation is considered for linear and nonlinear systems with unknown parameters, where the output-error injection is confined to the subspace corresponding to the states representing the unknown parameters.
|
|
13:50-14:10, Paper WeB12.2 | Add to My Program |
A Variable Selection Method for Improving Variable Selection Consistency and Soft Sensor Performance |
|
Lee, Jangwon | AUBURN UNIVERSITY |
Flores-Cerrillo, Jesus | Praxair |
Wang, Jin | Auburn University |
He, Qinghua | Auburn University |
Keywords: Estimation, Chemical process control, Sensor fusion
Abstract: In the last few decades, various spectroscopic soft sensors that predict sample properties from its spectroscopic readings have been reported. To improve prediction performance, variable selection that aims to eliminate irrelevant wavelengths is often performed prior to soft sensor model building. However, due to the data-driven nature of many variable selection methods, they can be sensitive to the choice of the training data, and oftentimes the selected wavelengths show little connection to the underlying chemical bonds or function groups that determine the property of the sample. To address these limitations, we proposed a new variable selection method, namely consistency enhanced evolution for variable selection (CEEVS), which focuses on identifying the variables that are consistently selected from different training dataset. To demonstrate the effectiveness and robustness of CEEVS, we compared it with three representative variable selection methods using two published NIR datasets. We show that by identifying variables with high selection consistency, CEEVS not only achieves improved soft sensor performance, but also identifies key chemical information from spectroscopic data.
|
|
14:10-14:30, Paper WeB12.3 | Add to My Program |
Finite Interval Estimation of LTI Systems Using Differential Invariance, Instrumental Variables, and Covariance Weighting |
|
Ghoshal, Debarshi Patanjali | McGill University |
Michalska, Hannah H. | McGill Univ |
Keywords: Estimation, Closed-loop identification
Abstract: It is shown how the kernel approach to joint parameter and state estimation can be improved to handle large measurement noise. High accuracy of estimation results from combining the powers of the kernel representation of the differential invariance in the system, a feasible recursive version of the generalized least squares with covariance weighting to eliminate regression dilution and suitable choices of instrumental variables to compensate for the error-in-the variable in the stochastic regression formulation.
|
|
14:30-14:50, Paper WeB12.4 | Add to My Program |
Distributed Parameter Estimation in Randomized One-Hidden-Layer Neural Networks |
|
Wang, Yinsong | Texas A&M University |
Shahrampour, Shahin | Texas A&M University |
Keywords: Estimation, Decentralized control, Machine learning
Abstract: This paper addresses distributed parameter estimation in randomized one-hidden-layer neural networks. A group of agents sequentially receive measurements of an unknown parameter that is only partially observable to them. In this paper, we present a fully distributed estimation algorithm where agents exchange local estimates with their neighbors to collectively identify the true value of the parameter. We prove that this distributed update provides an asymptotically unbiased estimator of the unknown parameter, i.e., the first moment of the expected global error converges to zero asymptotically. We further analyze the efficiency of the proposed estimation scheme by establishing an asymptotic upper bound on the variance of the global error. Applying our method to a real-world dataset related to appliances energy prediction, we observe that our empirical findings verify the theoretical results.
|
|
14:50-15:10, Paper WeB12.5 | Add to My Program |
State Estimation for Non-Linear Fully-Implicit, Index-1 Differential Algebraic Equation Systems |
|
Srinivasan, Neeraja | Indian Institute of Technology, Madras |
Bhatt, Nirav | Indian Institute of Technology Madras |
Narasimhan, Sridharakumar | IIT Madras |
Keywords: Estimation, Differential-algebraic systems, Process Control
Abstract: The Kalman filter and its variants have been developed for state estimation in semi-explicit, index 1 DAE systems in current literature. In this work, we develop a method for state estimation in non--linear fully implicit, index 1 differential algebraic equation (DAEs) systems. In order to extend the Kalman filtering techniques for the fully-implicit index-1 DAE systems, in the correction step we convert the fully--implicit DAE into a system of ordinary differential equations (ODEs). This is achieved by the index reduction of DAE using the method of successive differentiation of algebraic equations. This is a challenging problem as the fully implicit DAE system does not contain explicit algebraic states unlike in the semi--explicit case. In this work, we propose a linear transformation of the mass matrix which enables us to find candidate algebraic states for the system. This transformation on the mass matrix is relatively simpler than constructing the transformation matrices in the Weierstrass-Kronecker canonical form. We illustrate our proposed method with two examples, a linear and a nonlinear fully implicit index 1 DAE system.
|
|
15:10-15:30, Paper WeB12.6 | Add to My Program |
Perfect Attackability of Linear Dynamical Systems with Bounded Noise |
|
Khazraei, Amir | Duke University |
Pajic, Miroslav | Duke University |
Keywords: Estimation, Emerging control applications, Fault detection
Abstract: This paper addresses the problem of secure state estimation in the presence of attacks on sensor measurements of a linear time invariant (LTI) systems. We assume that the system is equipped with a common l0-based attack-resilient state estimator and a sound anomaly detector. We introduce the notion of perfect attackability (PA) for LTI systems with bounded noise, when the attacker may introduce an unbounded estimation error while remaining undetected by the anomaly detector. Finally, necessary and sufficient conditions for perfectly attackable systems are provided, and illustrated on examples.
|
|
WeB13 Regular Session, Plaza Court 1 |
Add to My Program |
Robust Control I |
|
|
Chair: Bridgeman, Leila Jasmine | Duke University |
Co-Chair: Matni, Nikolai | University of Pennsylvania |
|
13:30-13:50, Paper WeB13.1 | Add to My Program |
Mixed Norm H_2/H_oo and Entropy Covariance Control: A Convex Optimization Approach |
|
Haddad, Wassim M. | Georgia Inst. of Tech |
Chen, Yongxin | Georgia Institute of Technology |
Lanchares, Manuel | Georgia Institute of Technology |
Keywords: H-infinity control, Robust control, Linear systems
Abstract: In this paper, we develop a covariance control problem to address a tradeoff between H_2 performance and H_oo disturbance attenuation. In particular, we formulate a mixed-norm H_2/H_oo and entropy covariance control problem that guarantees that the state covariance of an uncertain dynamical system driven by white noise is upper bounded in the sense of the cone of nonnegative definite matrices by a given threshold matrix via state feedback control. This is accomplished by combining covariance control theory and mixed norm H_2/H_oo control theory. By using suitable transformations involving dynamic weighting on the complimentary sensitivity system transfer function, the formulation is applicable to robustness problems. The proposed formulation allows for solutions via semidefinite programming. Finally, an illustrative numerical example is provided to show the efficacy of the proposed approach.
|
|
13:50-14:10, Paper WeB13.2 | Add to My Program |
Reputation-Based Event-Triggered Formation Control and Leader Tracking with Resilience to Byzantine Adversaries |
|
Zegers, Federico | University of Florida |
Hale, Matthew | University of Florida |
Shea, John M. | University of Florida |
Dixon, Warren E. | University of Florida |
Keywords: Networked control systems, Agents-based systems, Robust control
Abstract: A distributed event-triggered controller is developed for formation control and leader tracking (FCLT) with robustness to adversarial Byzantine agents for a class of heterogeneous multi-agent systems (MASs). A reputation-based strategy is developed for each agent to detect Byzantine agent behaviors within their neighbor set and then selectively disregard Byzantine state information. Selectively ignoring Byzantine agents results in time-varying discontinuous changes to the network topology. Nonsmooth dynamics also result from the use of the event-triggered strategy enabling intermittent communication. Nonsmooth Lyapunov methods are used to prove stability and FCLT of the MAS consisting of the remaining cooperative agents.
|
|
14:10-14:30, Paper WeB13.3 | Add to My Program |
Dual, Iterative H2-Conic Controller Synthesis |
|
Wu, Liangting | Duke University |
Bridgeman, Leila Jasmine | Duke University |
Keywords: Optimal control, Robust control, LMIs
Abstract: The Conic Sector Theorem can be employed for controller synthesis to ensure input-output stability. This work develops a synthesis method for conic, observer based controllers by minimizing an upper-bound on the closed-loop H2-norm. The proposed method can be seen as the dual of an existing optimal synthesis method, but with an alternative initialization to expand the set of plants for which it is feasible. Moreover, this results in better performance in some examples and therefore provides a useful alternative tool for robust and optimal control.
|
|
14:30-14:50, Paper WeB13.4 | Add to My Program |
The Heavy-Ball ODE with Time-Varying Damping: Persistence of Excitation and Uniform Asymptotic Stability |
|
Poveda, Jorge I. | University of Colorado at Boulder |
Teel, Andrew R. | Univ. of California at Santa Barbara |
Keywords: Optimization algorithms, Robust adaptive control, Lyapunov methods
Abstract: We study the uniform asymptotic stability properties of the heavy-ball optimization dynamics with general time-varying damping. Unlike existing results in the literature, which have focused mainly on standard convergence results, we study a stronger limiting notion called uniform asymptotic stability, which is instrumental for the design of feedback-based algorithms. Given that recent results in the literature have shown that a class of heavy-ball optimization dynamics with vanishing damping fails to satisfy this limiting notion, we study sufficient and necessary conditions on the time-varying coefficients such that uniform asymptotic stability for the set of minimizers of the cost function is achieved. Our main results show that such conditions are related to the notion of persistence of excitation, which is commonly used in adaptive control and system identification. Finally, we show that the persistence of excitation condition is not necessary for a class of high-resolution accelerated optimization dynamics with Hessian-driven damping. Our results are established by using a nested Matrosov's theorem that has not been used before in the analysis of accelerated optimization algorithms.
|
|
14:50-15:10, Paper WeB13.5 | Add to My Program |
Robust Performance Guarantees for System Level Synthesis |
|
Matni, Nikolai | University of Pennsylvania |
Sarma, Anish | California Institute of Technology |
Keywords: Robust control, Distributed control, Optimal control
Abstract: We generalize the system level synthesis framework to systems defined by bounded causal linear operators, and use this parameterization to make connections between robust system level synthesis and the robust control literature. In particular, by leveraging results from L1 robust control, we show that necessary and sufficient conditions for robust performance with respect to causal bounded linear uncertainty in the system dynamics can be translated into convex constraints on the system responses. We exploit this connection to show that these conditions naturally allow for the incorporation of delay, sparsity, and locality constraints on the system responses and resulting controller implementation, allowing these methods to be applied to large-scale distributed control problems -- to the best of our knowledge, these are the first such robust performance guarantees for distributed control systems.
|
|
WeB14 Invited Session, Plaza Court 8 |
Add to My Program |
Estimation and Control of PDE Systems I |
|
|
Chair: Burns, John A | Virginia Tech |
Co-Chair: Guo, Bao-Zhu | North China Electric Power University |
Organizer: Demetriou, Michael A. | Worcester Polytechnic Institute |
Organizer: Fahroo, Fariba | AFOSR |
|
13:30-13:50, Paper WeB14.1 | Add to My Program |
A Causality-Free Neural Network Method for High-Dimensional Hamilton-Jacobi-Bellman Equations (I) |
|
Nakamura-Zimmerer, Tenavi | University of California, Santa Cruz |
Gong, Qi | University of California, Santa Cruz |
Kang, Wei | Naval Postgraduate School |
Keywords: Optimal control, Machine learning, Computational methods
Abstract: Computing optimal feedback controls for nonlinear systems generally requires solving Hamilton-Jacobi-Bellman (HJB) equations, which, in high dimensions, are notoriously difficult. Existing strategies often rely on specific, restrictive problem structures, or are valid only locally around some nominal trajectory. In this paper, we propose a data-driven method to approximate semi-global solutions to HJB equations for general high-dimensional nonlinear systems and compute optimal feedback controls in real-time. To accomplish this, we model solutions to HJB equations with neural networks (NNs) trained on data generated without discretizing the state space. Training is made more effective and data-efficient by leveraging the known problem structure and using the partially-trained NN to aid in further data generation. We demonstrate the effectiveness of our method by learning solutions to HJB equations for nonlinear systems of dimension up to 30 arising from the stabilization of a Burgers'-type partial differential equation. The trained NNs are then used for real-time optimal feedback control of these systems.
|
|
13:50-14:10, Paper WeB14.2 | Add to My Program |
A Min-Plus Fundamental Solution Semigroup for a Class of Approximate Infinite Dimensional Optimal Control Problems (I) |
|
Dower, Peter M. | University of Melbourne |
McEneaney, William M. | Univ. California San Diego |
Keywords: Optimal control, Distributed parameter systems
Abstract: By exploiting min-plus linearity, semiconcavity, and semigroup properties of dynamic programming, a fundamental solution semigroup for a class of approximate finite horizon linear infinite dimensional optimal control problems is constructed. Elements of this fundamental solution semigroup are parameterized by the time horizon, and can be used to approximate the solution of the corresponding finite horizon optimal control problem for any terminal cost. They can also be composed to compute approximations on longer horizons. The value function approximation provided takes the form of a min-plus convolution of a kernel with the terminal cost. A general construction for this kernel is provided, along with a spectral representation for a restricted class of sub-problems.
|
|
14:10-14:30, Paper WeB14.3 | Add to My Program |
Robust Error Feedback Control for Two Outputs Tracking of an Euler-Bernoulli Beam Equation (I) |
|
Guo, Bao-Zhu | North China Electric Power University |
Meng, Tingting | Academy of Mathematics and Systems Science |
Keywords: Distributed parameter systems, Robust control, Uncertain systems
Abstract: In this paper, we address a two output tracking problem under the guidance of the internal model principle for an Euler-Bernoulli beam equation, which is motivated from a recent paper [SIAM J. Control Optim., 57(2019), 1890-1928] where an adaptive control approach was used to estimate in real time all coefficients of the external harmonic disturbance. Compared with the aforementioned paper, we improve the results significantly from several aspects: a)~ both position and velocity are regulated simultaneously instead of a single position; b)~ the convergence is uniformly exponentially instead of asymptotically; c)~ the control contains essentially the internal model and is therefore conditionally robust; d)~ a man-made condition has been removed with a necessary assumption only. Our approach is systematic and straightforward in dealing with other PDEs with the same kind.
|
|
14:30-14:50, Paper WeB14.4 | Add to My Program |
Optimal Error Estimates for hp - Finite Element Approximations of Distributed Parameter LQR Control Problems (I) |
|
Burns, John A | Virginia Tech |
Cheung, James | Virginia Tech |
Keywords: Computational methods, Distributed parameter systems
Abstract: In this paper we present an optimal error estimate for hp-C0 finite element approximations of distributed parameter LQR control problems. We show that if the control weighting operators are sufficiently smooth, then the solutions of the corresponding infinite dimensional Operator Riccati Equations that define optimal feedback gain operators retain the same order of smoothness. In this case, one can extend convergence results previously obtained for parabolic control problems to a general class of distributed parameter LQR control problems. Convergence and optimal error estimates are provided for a general class of control systems when the system operator generates a compact analytic semigroup In addition, these new results eliminates the ``log'' term appearing in previous papers and applies to parabolic PDE systems and hyperbolic problems with sufficient damping. The basic theory is presented in an abstract space framework and then applied to systems modeled by parabolic and damped hyperbolic PDEs. Examples are provided to illustrate the theory.
|
|
14:50-15:10, Paper WeB14.5 | Add to My Program |
Boundary Prescribed-Time Stabilization of a Pair of Coupled Reaction-Diffusion Equations (I) |
|
Steeves, Drew | University of California, San Diego |
Camacho-Solorio, Leobardo | University of California, San Diego |
Krstic, Miroslav | University of California, San Diego |
Keywords: Distributed parameter systems, Linear systems
Abstract: We study boundary feedback stabilization of a pair of coupled reaction-diffusion equations with distinct diffusivities, where attractivity to the origin is required to occur in a finite time which is prescribed independently of initial conditions. Our approach is twofold: we first develop control laws which render the system to a cascade form; we then utilize two different time-varying control laws which ensure prescribed-time stabilization of each equation. To achieve the desired stabilization while ensuring that the resulting boundary feedback controllers remain bounded, it is necessary to prescribe two different rates of attractivity to the origin. We achieve this by using distinct time-varying gains with either square or cubic “blow-up” functions, which diverge at the prescribed terminal time. The ensuing control laws achieve stabilization of the plant in a prescribed terminal time.
|
|
15:10-15:30, Paper WeB14.6 | Add to My Program |
The Quadratic-Quadratic Regulator Problem: Approximating Feedback Controls for Quadratic-In-State Nonlinear Systems (I) |
|
Borggaard, Jeff | Virginia Tech |
Zietsman, Lizette | Virginia Tech |
Keywords: Distributed parameter systems, Computational methods, Stability of nonlinear systems
Abstract: Feedback control problems involving autonomous quadratic systems are prevalent, yet very few software tools are available for approximating their solution. This paper represents a step forward in the special case where both the state equation and the control costs are quadratic. As it represents the natural extension of the linear-quadratic regulator (LQR) problem, we describe this setting as the quadratic-quadratic regulator (QQR) problem. We describe an algorithm that exploits the structure of the QQR problem that arises when implementing Al'Brekht's method. As we show, this well-known algorithm has an elegant formulation when written using Kronecker products and produces linear systems with a special structure that can take advantage of modern tensor-based linear solvers. We demonstrate this formulation on a random test problem then apply it to a discretized distributed parameter control problem that fits the QQR framework. This approach is amenable to low degree polynomial feedback laws in systems with modest model dimensions, for example, systems produced by modern model reduction methods. Comparisons to linear feedback control laws show a benefit in using the QQR formulation.
|
|
WeB15 Regular Session, Plaza Court 5 |
Add to My Program |
Stability of Nonlinear Systems I |
|
|
Chair: Surov, Maksim | Norges Teknisk-Naturvitenskapelige Universitet |
Co-Chair: Fekih, Afef | University of Louisiana at Lafayette |
|
13:30-13:50, Paper WeB15.1 | Add to My Program |
Discrete Finite-Time Stable Attitude Tracking Control of Unmanned Vehicles on SO(3) |
|
Hamrah, Reza | Syracuse University |
Sanyal, Amit | Syracuse University |
Viswanathan, Sasi Prabhakaran | Akrobotix LLC |
Keywords: Algebraic/geometric methods, Lyapunov methods, Stability of nonlinear systems
Abstract: This paper presents a finite-time stable (FTS) attitude tracking control scheme in discrete time for an unmanned vehicle. The attitude tracking control scheme guarantees discrete-time stability of the feedback system in finite time. This scheme is developed in discrete time as it is more convenient for onboard computer implementation and guarantees stability irrespective of sampling period. Finite-time stability analysis of the discrete-time tracking control is carried out using discrete Lyapunov analysis. This tracking control scheme ensures stable convergence of attitude tracking errors to the desired trajectory in finite time. The advantages of finite-time stabilization in discrete time over finite-time stabilization of a sampled continuous time tracking control system is addressed in this paper through a numerical comparison. This comparison is performed using numerical simulations on continuous and discrete FTS tracking control schemes applied to an unmanned vehicle model.
|
|
13:50-14:10, Paper WeB15.2 | Add to My Program |
Consensus Seeking Gradient Descent Flows on Boundaries of Convex Sets |
|
Markdahl, Johan | University of Luxembourg |
Keywords: Algebraic/geometric methods, Optimization, Stability of nonlinear systems
Abstract: Consensus on nonlinear spaces is of use in many control applications. This paper proposes a gradient descent flow algorithm for consensus on hypersurfaces. We show that if an inequality holds, then the system converges for almost all initial conditions and all connected graphs. The inequality involves the hypersurface Gauss map and the gradient and Hessian of the implicit equation. Moreover, for the inequality to hold, it is necessary that the manifold is the boundary of a convex set. The literature already contains an algorithm for consensus on hypersurfaces. That algorithm on any ellipsoid is equivalent to our algorithm on the unit sphere. In particular, that algorithm achieves almost global synchronization on ellipsoids. These findings suggest that strong convergence results for consensus seeking gradient descent flows may be established on manifolds that are the boundaries of convex sets.
|
|
14:10-14:30, Paper WeB15.3 | Add to My Program |
Constructing Transverse Coordinates for Orbital Stabilization of Periodic Trajectories |
|
Surov, Maksim | Norges Teknisk-Naturvitenskapelige Universitet |
Gusev, Sergei V. | St. Petersburg State University |
Freidovich, Leonid | Umeå University |
Keywords: Algebraic/geometric methods, Stability of nonlinear systems, Numerical algorithms
Abstract: An approach for the introduction of transverse coordinates in a vicinity of a periodic trajectory is presented. The approach allows finding by numerical integration periodic normalized mutually-orthogonal vector-functions that form a continuously differentiable basis on moving Poincar'e sections for a given periodic solution of a nonlinear dynamical system. The found moving frame is used to define new local (transverse) coordinates for an associated affine nonlinear control system in a neighborhood of the trajectory, and to proceed with orbital stability analysis and/or synthesis of a stabilizing feedback control law. As a demonstrating example of the approach, the problem of orbital stabilization of a trajectory of a multibody car system is considered. The results of computer simulations of the system are presented.
|
|
14:30-14:50, Paper WeB15.4 | Add to My Program |
Stable Robust Controller Inspired by the Mammalian Limbic System for a Class of Nonlinear Systems |
|
Rubio Scola, Ignacio | Conicet - National University of Rosario |
Garcia Carrillo, Luis Rodolfo | Texas A&M University - Corpus Christi |
Hespanha, Joao P. | Univ. of California, Santa Barbara |
Keywords: Biologically-inspired methods, Robust control, Stability of nonlinear systems
Abstract: In recent years diverse computational models of emotional learning observed in the mammalian brain have inspired a number of self-learning control approaches. These architectures are promising in terms of their learning ability and low computational cost. However, the lack of rigorous stability analysis and mathematical proofs of stability and performance has limited the proliferation of these controllers. To address this drawback, this paper proposes a modified brain emotional neural network structure using a radial basis function inside the Thalamus and an emotional signal based on an integral action structure to increase performance. Mathematical stability proofs are provided, together with numerical simulations, demonstrating the superior performance obtained with the new modifications proposed to the emoional learning-inspired control.
|
|
14:50-15:10, Paper WeB15.5 | Add to My Program |
Finite Time Stabilization of Chameleon Hidden Hyperchaotic Flows |
|
Reyhani, Arezoo | University of Zanjan |
Mobayen, Saleh | University of Zanjan |
Fekih, Afef | University of Louisiana at Lafayette |
Pujol, Gisela | Univ. Politecnica De Catalunya - BarcelonaTech |
Keywords: Chaotic systems, Robust control, Stability of nonlinear systems
Abstract: The Chameleon hidden chaotic system is a chaotic system with exciting and particular properties. One of its specific features is that by changing its constant parameters, the flow exhibits three classes of hidden attractors containing one stable equilibrium, line of equilibria, or no equilibria, and self-excited attractors. In this paper, a new Chameleon hidden hyperchaotic flow is proposed and the corresponding hidden attractors and self-excited attractor are evaluated. Then, a new super-twisting fast terminal adaptive sliding mode control technique is suggested for finite-time stability of Chameleon hidden hyperchaotic flows. Dynamics of this chaotic system with different values of constant parameters has been studied using phase portraits, stability analysis and bifurcation diagrams. Descriptive simulations on the Chameleon hidden hyperchaotic system with external disturbances and parametric uncertainties are presented to approve the effectiveness of the proposed method.
|
|
15:10-15:30, Paper WeB15.6 | Add to My Program |
State Barrier Avoidance Control Design Using a Diffeomorphic Transformation Based Method |
|
Tian, Dongzuo | Texas A&M University, College Station |
Ke, Chong | Texas A&M University, College Station |
Song, Xingyong | Texas A&M University, College Station |
Keywords: Constrained control, Lyapunov methods, Stability of nonlinear systems
Abstract: This paper presents a novel design method for barrier avoidance control (or state constrained control) in a state space. This is achieved through a diffeomorphic transformation, which projects the constrained region in the original space into a radially large region in the new space. By this transformation, the state constrained control problem is converted into a non-constrained problem, and thus significantly increases the flexibility of the control design options compared with existing state constrained control methods. A case study on sliding mode control under barrier avoidance scheme is given to demonstrate the effectiveness of the proposed method.
|
|
WeB16 Regular Session, Governor's SQ 17 |
Add to My Program |
Cooperative Control I |
|
|
Chair: Hoagg, Jesse B. | University of Kentucky |
Co-Chair: Sanyal, Amit | Syracuse University |
|
13:30-13:50, Paper WeB16.1 | Add to My Program |
Optimal Assignment of Collaborating Agents in Multi-Body Asset-Guarding Games |
|
Sin, Emmanuel | University of California, Berkeley |
Arcak, Murat | University of California, Berkeley |
Packard, Andrew K. | Univ. of California at Berkeley |
Philbrick, Douglas | Uc Berkeley |
Seiler, Peter | University of Michigan, Ann Arbor |
Keywords: Cooperative control, Aerospace, Optimal control
Abstract: We study a multi-body asset-guarding game in missile defense where teams of interceptor missiles collaborate to defend a non-manuevering asset against a group of threat missiles. We approach the problem in two steps. We first formulate an assignment problem where we optimally assign subsets of collaborating interceptors to each threat so that all threats are intercepted as far away from the asset as possible. We assume that each interceptor is controlled by a collaborative guidance law derived from linear quadratic dynamic games. Our results include a 6-DOF simulation of a 5-interceptor versus 3-threat missile engagement where each agent is modeled as a missile airframe controlled by an autopilot. Despite the assumption of linear dynamics in our collaborative guidance law and the unmodeled dynamics in the simulation environment (e.g., varying density and gravity), we show that the simulated trajectories match well with those predicted by our approach. Furthermore, we show that a more agile threat, with greater speed and acceleration, can be intercepted by inferior interceptors when they collaborate. We believe the concepts introduced in this paper may be applied in asymmetric missile defense scenarios, including defense against advanced cruise missiles and hypersonic vehicles.
|
|
13:50-14:10, Paper WeB16.2 | Add to My Program |
Output and Regulated Output Synchronization of Heterogeneous Multi-Agent Systems: A Scale-Free Protocol Design Using No Information about Communication Network and the Number of AgentsCommunication Network and the Number of Agents |
|
Nojavanzadeh, Donya | Washington State University |
Liu, Zhenwei | Northeastern University |
Saberi, Ali | Washington State Univ |
Stoorvogel, Anton A. | University of Twente |
Keywords: Cooperative control, Agents-based systems, Distributed control
Abstract: In this paper, we consider scalable output and regulated output synchronization problems for heterogeneous networks of right-invertible linear agents based on localized information exchange where in the case of regulated output synchronization, the reference trajectory is generated by a so-called exosystem. We assume that all the agents are introspective, meaning that they have access to their own local measurements. We propose a scale-free linear protocol for each agent to achieve output and regulated output synchronizations. These protocols are designed solely based on agent models and they need no information about communication graph and the number of agents or other agent models information.
|
|
14:10-14:30, Paper WeB16.3 | Add to My Program |
Leader-Following Formation Control with Time-Varying Formations and Bounded Controls for Agents with Double-Integrator Dynamics |
|
Lippay, Zachary | University of Kentucky |
Hoagg, Jesse B. | University of Kentucky |
Keywords: Cooperative control, Autonomous robots, Aerospace
Abstract: We present a formation control algorithm for double-integrator agents, where the formation is time varying and the agents' controls satisfy a priori bounds (e.g., the controls accommodate actuator saturation). We assume that each agent has relative-position-and-velocity feedback of its neighbor agents, where the communication structure is a strongly connected graph, and at least one agent has a measurement of its position and velocity relative to the leader (if applicable). The main analytic results provide sufficient conditions such that all agents have a priori bounded controls and converge to the desired time-varying relative positions with one another and the leader. The results are global for an undirected communication structure, and local for the directed case. We also demonstrate the algorithm in rotorcraft experiments.
|
|
14:30-14:50, Paper WeB16.4 | Add to My Program |
Finite-Time Attitude Consensus Control of a Multi-Agent Rigid Body System |
|
Maadani, Mohammad | University of Arizona |
Butcher, Eric | University of Arizona |
Sanyal, Amit | Syracuse University |
Keywords: Cooperative control, Networked control systems, Decentralized control
Abstract: In this paper, finite-time attitude consensus control laws for multi-agent rigid body systems are presented using rotation matrices. The control objective is to stabilize the relative configurations in a finite convergence time. First, the control design is done on the kinematic level where the angular velocities are the control signals. Next, the design is conducted on the dynamic level in the framework of the tangent bundle TSO(3) associated with SO(3), where the torques implement the feedback control of relative attitudes and angular velocities. The Lyapunov-based almost global finite-time stability of the consensus subspace is demonstrated for both cases. Finally, numerical simulations are provided to verify the effectiveness of the proposed consensus control algorithms.
|
|
14:50-15:10, Paper WeB16.5 | Add to My Program |
Formation Control for Fixed-Wing UAVs Modeled with Extended Unicycle Dynamics That Include Attitude Kinematics on SO(m) and Speed Constraints |
|
Heintz, Christopher | University of Kentucky |
Hoagg, Jesse B. | University of Kentucky |
Keywords: Cooperative control, Autonomous systems, Aerospace
Abstract: We present a formation-control algorithm for agents with extended unicycle dynamics that include orientation kinematics on SO(m), first-order speed dynamics, and a hard constraint on speed. The desired interagent positions are expressed in a leader-fixed coordinate frame, which is aligned with and rotates with the leader's velocity vector. Thus, the desired interagent positions vary in time as the leader-fixed frame rotates. We assume that each agent has relative-position feedback of its neighbor agents, where the neighbor sets are such that the interagent communication (i.e., feedback) structure represents an undirected and connected graph. We also assume that at least one agent has access to a measurement its position relative to the leader. The analytic result shows that the agents converge to the desired relative positions with the other agents and the leader, and we provide sufficient conditions to ensure that each agent's speed satisfies the speed constraints.We also present an experiment with 3 fixed-wing unmanned air vehicles (UAVs) that demonstrates the leader-fixed formation-control algorithm.
|
|
15:10-15:30, Paper WeB16.6 | Add to My Program |
Distributed Consensus Protocols for Time-Varying Multi-Agent Networks with Improved Convergence Properties |
|
Buzorgnia, David | Concordia University |
Aghdam, Amir G. | Concordia University |
Keywords: Cooperative control, Distributed control, Autonomous robots
Abstract: In this paper, different distributed consensus control strategies are introduced for a multi-agent network with a leader-follower structure. The proposed strategies are based on the nearest neighbor rule, and are shown to reach consensus faster than conventional methods. The results are then extended to the case of a time-varying network with switching topology. The convergence performance under the proposed strategies in the case of a time-invariant network with fixed topology is evaluated based on the location of the dominant eigenvalue of the closed-loop system. For the case of a time-varying network with switching topology, on the other hand, the state transition matrix of the system is investigated to analyze the stability of the proposed strategies. A number of numerical examples are provided to verify the effectiveness of the proposed control schemes.
|
|
WeB17 Regular Session, Director's Row J |
Add to My Program |
Decentralized Control |
|
|
Chair: Nguyen, Nam | Hanoi University of Science and Technology |
Co-Chair: Bitar, Eilyan | Cornell University |
|
13:30-13:50, Paper WeB17.1 | Add to My Program |
Scalable Coherence in Large Scale Second-Order Networks Using High-Gain Observer |
|
Chowdhury, Dhrubajit | Michigan State University |
Khalil, Hassan K. | Michigan State Univ |
Keywords: Control of networks, Agents-based systems, Decentralized control
Abstract: We propose a scalable second-order consensus algorithm where by tuning the controller parameter, the convergence rate of the consensus protocol is almost invariant with respect to the size of the network. This is beneficial when the algebraic connectivity of the graph Laplacian decreases towards zero, with an increase in the network size, which leads to degraded closed-loop performance. We realize the controller using a high-gain observer and it is shown that for sufficiently small observer parameter, the convergence rate under output feedback approaches the one under state feedback. We also study the controller performance under stochastic disturbances by first defining a performance output and then calculating the mathcal{H}_2 norm from the disturbance input to the performance output. We show that the mathcal{H}_2 norm for the state feedback controller is scalable as the network size increases. Moreover, we also show that for sufficiently small observer parameter, the mathcal{H}_2 norm under output feedback approaches the one under state feedback.
|
|
13:50-14:10, Paper WeB17.2 | Add to My Program |
Fixed-Time Network Localization Based on Bearing Measurements |
|
Trinh, Minh Hoang | Hanoi University of Science and Technology (HUST) |
Nguyen, Truong Thanh | Hanoi University of Science and Technology |
Nguyen, Nam | Hanoi University of Science and Technology |
Ahn, Hyo-Sung | Gwangju Institute of Science and Technology (GIST) |
Keywords: Decentralized control, Distributed control, Hierarchical control
Abstract: In this paper, we study a network localization problem using only bearing measurements. By applying the fixed-time controller design technique in [1] to the existing bearing-only estimation law in [2], a fixed-time bearing-based network localization law is proposed. We show that when the network has a directed acyclic structure with some beacon nodes, the true positions of all nodes can be determined in finite time. We show that the convergence time is upper bounded by a value which is independent of the initial estimated positions. Finally, simulations are given to support the analysis.
|
|
14:10-14:30, Paper WeB17.3 | Add to My Program |
A Consensus Strategy for Decentralized Kinematic Control of Multi-Segment Soft Continuum Robots |
|
Salimi Lafmejani, Amir | Arizona State University |
Farivarnejad, Hamed | Arizona State University |
Doroudchi, Azadeh | Arizona State University |
Berman, Spring | Arizona State University |
Keywords: Decentralized control, Flexible structures, Networked control systems
Abstract: This paper proposes a novel decentralized approach to kinematic control of soft segmented continuum robots based on a consensus strategy. The robots under consideration deform in a plane according to a multi-segment Piecewise Constant Curvature (PCC) kinematic model in which each segment is represented as an equivalent rigid-link Revolute-Prismatic-Revolute (RPR) mechanism. In our approach, we assume that each segment of the robot is equipped with sensors to measure joint variables in its local coordinate frame and can communicate with its two adjacent segments. Our consensus-based decentralized control strategy provides an alternative to conventional control methods, which solve the inverse kinematic problem by using computationally intensive numerical methods to calculate the robot’s Jacobian matrix at each time instant. We investigate the stability and convergence properties of proposed controllers for position regulation and trajectory tracking tasks and provide theoretical guarantees on the controllers’ performance. We evaluate the controllers in simulation for scenarios in which the robot’s tip must reach a certain position or follow a specified trajectory. We compare the performance of the position regulator for different controller gains, and we find that a simulated 15-link robot can track a complex reference trajectory with an average root-mean-square error of only 0.16% of the robot’s initial length.
|
|
14:30-14:50, Paper WeB17.4 | Add to My Program |
Decentralized Control of Constrained Linear Systems Via Assume-Guarantee Contracts |
|
Lin, Weixuan | Cornell University |
Bitar, Eilyan | Cornell University |
Keywords: Decentralized control, Optimization, Distributed control
Abstract: We consider the decentralized control of a discrete-time, linear system subject to exogenous disturbances and polyhedral constraints on the state and input trajectories. The underlying system is composed of a finite collection of dynamically coupled subsystems, where each subsystem is assumed to have a dedicated local controller. The decentralization of information is expressed according to sparsity constraints on the state measurements that each local controller has access to. In this context, we investigate the design of decentralized controllers that are affinely parameterized in their measurement history. For problems with partially nested information structures, the optimization over such policy spaces is known to be convex. Convexity is not, however, guaranteed under more general (nonclassical) information structures in which the information available to one local controller can be affected by control actions that it cannot access or reconstruct. With the aim of alleviating the nonconvexity that arises in such problems, we propose an approach to decentralized control design where the information-coupling states are effectively treated as disturbances whose trajectories are constrained to take values in ellipsoidal contract sets whose location, scale, and orientation are jointly optimized with the underlying affine decentralized control policy. We establish a natural structural condition on the space of allowable contracts that facilitates the joint optimization over the control policy and the contract set via semidefinite programming.
|
|
14:50-15:10, Paper WeB17.5 | Add to My Program |
Practical Frequency Synchronization in Power Systems Using Extended High-Gain Observer under Unknown Time-Varying Power Demand |
|
Chowdhury, Dhrubajit | Michigan State University |
Khalil, Hassan K. | Michigan State Univ |
Keywords: Decentralized control, Power systems, Nonlinear output feedback
Abstract: In this paper, we consider the frequency synchronization problem in a network of lossless, connected and network-reduced power system. Frequency synchronization is an important problem in power systems as frequency deviation can lead to degraded power quality, tripping of generators, etc. We present a load-estimator-based consensus algorithm that achieves practical frequency synchronization in the presence of unknown time-varying power demand. It is shown that the synchronization error can be made arbitrarily small by tuning a controller parameter. Finally, simulations are performed to show the efficacy of the proposed controller.
|
|
15:10-15:30, Paper WeB17.6 | Add to My Program |
On the Effects of Collision Avoidance on Emergent Swarm Behavior |
|
Taylor, Chris | George Mason University |
Luzzi, Colin | Department of the Navy |
Nowzari, Cameron | George Mason University |
Keywords: Decentralized control, Robotics, Agents-based systems
Abstract: Swarms of autonomous agents, through their decentralized and robust nature, show great promise as a future solution to the myriad missions of business, military, and humanitarian relief. The diverse nature of mission sets creates the need for swarm algorithms to be deployed on a variety of hardware platforms. Certain swarm behaviors have been demonstrated on platforms where collisions between agents are harmless, but on many platforms collisions are prohibited since they would damage the agents involved. The available literature typically assumes that collisions can be avoided by adding a collision avoidance algorithm on top of an existing swarm behavior. Through an illustrative example in our experience replicating a particular behavior, we show that this can be difficult to achieve since the swarm behavior can be disrupted by the collision avoidance. We introduce metrics quantifying the level of disruption in our swarm behavior and propose a technique that is able to assist in tuning the collision avoidance algorithm such that the goal behavior is achieved as best as possible while collisions are avoided. We validate our results through simulation.
|
|
WeB18 Regular Session, Plaza Court 4 |
Add to My Program |
Constrained Control I |
|
|
Chair: Sanfelice, Ricardo G. | University of California at Santa Cruz |
Co-Chair: Berntorp, Karl | Mitsubishi Electric Research Labs |
|
13:30-13:50, Paper WeB18.1 | Add to My Program |
Lipschitzness of Minimal-Time Functions in Constrained Continuous-Time Systems with Applications to Reachability Analysis |
|
Maghenem, Mohamed Adlene | University of California Santa Cruz |
Sanfelice, Ricardo G. | University of California at Santa Cruz |
Keywords: Constrained control
Abstract: The minimal-time function with respect to a closed set for a constrained continuous-time system provides the first time that a solution starting from a given initial condition reaches that set. In this paper, we propose infinitesimal necessary and sufficient conditions for the minimal-time function to be locally Lipschitz. As an application of our results, we show that, in constrained continuous-time systems, the Lipschitz continuity of the minimal-time function with respect to the boundary of the set where the solutions are defined plays a crucial role on the Lipschitz continuity of the reachable set.
|
|
13:50-14:10, Paper WeB18.2 | Add to My Program |
Model-Free Learning for Safety-Critical Control Systems: A Reference Governor Approach |
|
Liu, Kaiwen | University of Michigan |
Li, Nan | University of Michigan |
Kolmanovsky, Ilya V. | The University of Michigan |
Rizzo, Denise | US Army CCDC Ground Vehicle System Center (GVSC) |
Girard, Anouck | University of Michigan, Ann Arbor |
Keywords: Constrained control, Learning, Autonomous systems
Abstract: This paper describes a learning-based approach to operating safety-critical control systems. A reference governor is an add-on scheme used to guard the nominal system against violation of pre-specified constraints by modifying set-point commands. A learning algorithm is developed in this paper to evolve the reference governor parametrization to gradually improve its performance in terms of response speed. In particular, the learning algorithm does not rely on an explicit model of the control system, i.e., it is model-free, and guarantees constraint satisfaction for all time, both during and after learning. The approach is applied to a case study of ground vehicle rollover avoidance to illustrate its functionality and characteristics.
|
|
14:10-14:30, Paper WeB18.3 | Add to My Program |
Correct-By-Design Control Barrier Functions for Euler-Lagrange Systems with Input Constraints |
|
Shaw Cortez, Wenceslao | Royal Institute of Technology (KTH) |
Dimarogonas, Dimos V. | KTH Royal Institute of Technology |
Keywords: Constrained control, Mechanical systems/robotics
Abstract: Control barrier functions are valuable for satisfying system constraints for general nonlinear systems. However a main drawback to existing techniques is the proper construction of these barrier functions to satisfy system and input constraints. In this paper, we propose a methodology to construct control barrier functions for Euler-Lagrange systems subject to input constraints. The proposed approach is validated in simulation on a 2-DOF planar manipulator.
|
|
14:30-14:50, Paper WeB18.4 | Add to My Program |
Learning-Based Parameter-Adaptive Reference Governors |
|
Chakrabarty, Ankush | Mitsubishi Electric Research Laboratories (MERL) |
Berntorp, Karl | Mitsubishi Electric Research Labs |
Di Cairano, Stefano | Mitsubishi Electric Research Labs |
Keywords: Constrained control, Machine learning, Learning
Abstract: Reference governors (RGs) provide an effective method for ensuring safety via constraint enforcement in closed-loop control systems. When the parameters of the underlying systems are unknown, but constant or slowly varying, robust formulation of RGs that consider only the worst-case effect may be overly conservative and exhibit poor performance. This paper proposes a parameter-adaptive reference governor (PARG) architecture that is capable of generating safe trajectories in spite of parameter uncertainties without being as conservative as the robust RGs. The proposed approach leverages on-line data to inform algorithms for robust parameter estimation. Subsequently, confidence bounds around parameter estimates are fed to supervised machine learners for approximating robust constraint admissible sets leveraged by the PARG. While initially the PARG may be as conservative as a robust RG, as more data is gathered and the confidence bounds become tighter, such conservativeness reduces, as demonstrated in a simulation example.
|
|
14:50-15:10, Paper WeB18.5 | Add to My Program |
Prescribed-Time Convergence with Input Constraints: A Control Lyapunov Function Based Approach |
|
Garg, Kunal | University of Michigan-Ann Arbor |
Arabi, Ehsan | University of Michigan |
Panagou, Dimitra | University of Michigan, Ann Arbor |
Keywords: Constrained control, Lyapunov methods, Time-varying systems
Abstract: In this paper, we present a control framework for a general class of control-affine nonlinear systems under spatiotemporal and input constraints. Specifically, the proposed control architecture addresses the problem of reaching a given final set S in a prescribed (user-defined) time with bounded control inputs. To this end, a time transformation technique is utilized to transform the system subject to temporal constraints into an equivalent form without temporal constraints. The transformation is defined so that asymptotic convergence in the transformed time scale results into prescribed-time convergence in the original time scale. To incorporate input constraints, we characterize a set of initial conditions D_M such that starting from this set, the closed-loop trajectories reach the set S within the prescribed time. We further show that starting from outside the set D_M, the system trajectories reach the set D_M in a finite time that depends upon the initial conditions and the control input bounds. We use a novel parameter mu in the controller, that controls the convergence-rate of the closed-loop trajectories and dictates the size of the set D_M. Finally, we present a numerical example to showcase the efficacy of our proposed method.
|
|
15:10-15:30, Paper WeB18.6 | Add to My Program |
Achieving Performance and Safety in Large Scale Systems with Saturation Using a Nonlinear System Level Synthesis Approach |
|
Yu, Jing | California Institute of Technology |
Ho, Dimitar | Caltech |
Keywords: Constrained control, Large-scale systems, Stability of nonlinear systems
Abstract: We present a novel class of nonlinear controllers that allows interpolation among differently behaving linear controllers as a case study for recently proposed Linear and Nonlinear System Level Synthesis framework. The structure of the nonlinear controller allows for simultaneously satisfying performance and safety objectives defined for small- and large-disturbance regimes. The proposed controller is distributed, handles delays, sparse actuation, and localizes disturbances. We show our nonlinear controller always outperforms its linear counterpart for constrained LQR problems. We further demonstrate the anti-windup property of the proposed control strategy for saturated systems via simulation.
|
|
WeB19 Regular Session, Plaza Court 3 |
Add to My Program |
Optimal Control I |
|
|
Chair: Dower, Peter M. | University of Melbourne |
Co-Chair: Komaee, Arash | Southern Illinois University |
|
13:30-13:50, Paper WeB19.1 | Add to My Program |
Guaranteed-Safe Approximate Reachability Via State Dependency-Based Decomposition |
|
Li, Anjian | Simon Fraser University |
Chen, Mo | Simon Fraser University |
Keywords: Optimal control, Computational methods, Formal verification/synthesis
Abstract: Hamilton Jacobi (HJ) Reachability is a formal verification tool widely used in robotic safety analysis. Given a target set as unsafe states, a dynamical system is guaranteed not to enter the target under the worst-case disturbance if it avoids the Backward Reachable Tube (BRT). However, computing BRTs suffers from exponential computational time and space complexity with respect to the state dimension. Previously, system decomposition and projection techniques have been investigated, but the trade off between applicability to a wider class of dynamics and degree of conservatism has been challenging. In this paper, we propose a State Dependency Graph to represent the system dynamics, and decompose the full system where only dependent states are included in each subsystem, and “missing” states are treated as bounded disturbance. Thus for a large variety of dynamics in robotics, BRTs can be quickly approximated in lower-dimensional chained subsystems with the guaranteed-safety property preserved. We demonstrate our method with numerical experiments on the 4D Quadruple Integrator, and the 6D Bicycle, an important car model that was formerly intractable.
|
|
13:50-14:10, Paper WeB19.2 | Add to My Program |
Inverse Optimal Control with Set-Theoretic Barrier Lyapunov Function for Handling State Constraints |
|
Deniz, Meryem | Missouri University of Science and Technology |
Lakshnmidevinivas, Devi | Missouri University of Science and Technology |
Balakrishnan, S.N. | Missouri University of Science and Technology |
Keywords: Optimal control, Constrained control, Lyapunov methods
Abstract: Although rigorous framework exists for handling state variable inequality constraints under optimal control formulations, it is quite involved and difficult to incorporate for online use. In this study, an alternative approach is proposed by combining a state-dependent Riccati equation (SDRE) based inverse optimal control formulation with a set-theoretic barrier Lyapunov function (STBLF). Necessary derivations are presented. Both regulator and tracking type problems are considered. The performance of the proposed method is evaluated using numerical examples.
|
|
14:10-14:30, Paper WeB19.3 | Add to My Program |
Co-Design of Delays and Sparse Controllers for Bandwidth-Constrained Cyber-Physical Systems |
|
Negi, Nandini | North Carolina State University |
Chakrabortty, Aranya | North Carolina State University |
Keywords: Optimal control, Delay systems, Optimization
Abstract: We address the problem of sparsity-promoting optimal control of cyber-physical systems with feedback delays. The delays are categorized into two classes - namely, intra-layer delay, and inter-layer delay between the cyber and the physical layers. Our objective is to minimize the H2-norm of the closed-loop system by designing an optimal combination of these two delays along with a sparse state-feedback controller, while respecting a given bandwidth constraint. We propose a two-loop optimization algorithm for this. The inner loop, based on alternating directions method of multipliers (ADMM), handles the conflicting directions of decreasing H2-norm and increasing sparsity of the controller. The outer loop comprises of semidefinite program (SDP)-based relaxations of non-convex inequalities necessary for stable co-design of the delays with the controller. We illustrate this algorithm using simulations that highlight various aspects of how delays and sparsity impact the stability and H2 performance of a LTI system.
|
|
14:30-14:50, Paper WeB19.4 | Add to My Program |
A Two-Player Game Representation for a Class of Infinite Horizon Control Problems under State Constraints |
|
Basco, Vincenzo | Melbourne University |
Dower, Peter M. | University of Melbourne |
Keywords: Optimal control, Constrained control
Abstract: In this paper feedback laws for a class of infinite horizon control problems under state constraints are investigated. We provide a two-player game representation for such control problems assuming time dependent dynamics and Lagrangian and the set constraints merely compact. Using viability results recently investigated for state constrained problems in an infinite horizon setting, we extend some known results for the linear quadratic regulator problem to a class of control problems with nonlinear dynamics in the state and affine in the control. Feedback laws are obtained under suitable controllability assumptions.
|
|
14:50-15:10, Paper WeB19.5 | Add to My Program |
Optimal Control of Linear Continuous-Time Systems in the Presence of State and Input Delays with Application to a Chemical Reactor |
|
Moghadam, Rohollah | Missouri University of Science and Technology |
Jagannathan, Sarangapani | Missouri Univ of Science & Tech |
Keywords: Optimal control, Delay systems, Stability of linear systems
Abstract: In this paper, the optimal regulation of linear continuous-time systems with state and input delays is introduced by utilizing a quadratic cost function and state feedback. The Lyapunov-Krakovskii functional incorporating state and input delays is defined as a value function. Next, the Bellman type equation is formulated, and a delay Algebraic Riccati equation (DARE) over infinite time horizon is derived. By using the stationarity condition for the Bellman type equation, the optimal control input is obtained. It is demonstrated that the proposed optimal control input makes the closed-loop system asymptotically stable. Finally, simulation results confirm the theoretical claims by applying the proposed approach to a chemical reactor.
|
|
15:10-15:30, Paper WeB19.6 | Add to My Program |
Optimal Control of State-Affine Dynamical Systems |
|
Komaee, Arash | Southern Illinois University |
Keywords: Optimal control, Markov processes, Stochastic optimal control
Abstract: Optimal control of state-affine systems with finite or infinite dimensions is considered. The control performance is measured by a cost functional with state-affine Lagrangian and terminal cost. Relying upon such affine structure, a simple proof of Pontryagin's maximum principle as a necessary condition for optimality is presented. This principle requires any optimal control to resolve a certain two-point boundary value problem. As the main contribution of this paper, an iterative algorithm is proposed that converges to the solution of this boundary value problem. This solution is regarded then as a candidate optimal control. Several applications are outlined for the optimal control problem of this paper, including: optimal control of unobserved stochastic systems (continuous-time Markov chain and diffusion process), convection-diffusion partial differential equations, and Lyapunov matrix differential equations.
|
|
WeB20 Regular Session, Plaza Court 2 |
Add to My Program |
Hybrid Systems I |
|
|
Chair: Sanfelice, Ricardo G. | University of California at Santa Cruz |
Co-Chair: Danielson, Claus | Mitsubishi Electric Research Labs |
|
13:30-13:50, Paper WeB20.1 | Add to My Program |
A Reference Governor for Wheel-Slip Prevention in Railway Vehicles with Pneumatic Brakes |
|
Danielson, Claus | Mitsubishi Electric Research Labs |
Di Cairano, Stefano | Mitsubishi Electric Research Labs |
Keywords: Hybrid systems, Constrained control, Control applications
Abstract: This paper applies reference governor design to the problem of preventing excessive wheel-slip in railway vehicles with pneumatic brakes. The reference governor minimizes the difference between the desired and implemented deceleration set-point such that the system state remains inside a constraint admissible positive invariant set where wheel-slip is maintained below a prescribed level. This problem is complicated by the non-linear slip-dynamics and hysteresis in the pneumatic brake which results in a non-convex invariant set. Nonetheless, we show that the reference governor can be efficiently implemented using state-dependent saturation functions. The reference governor is evaluated in numerical simulations where we observe that the governor produces non-linear integral-action that has the beneficial properties of fast transient response and offset-free tracking while being robust to delays from hysteresis and uncertainty on the slip dynamics.
|
|
13:50-14:10, Paper WeB20.2 | Add to My Program |
Design and Time-Optimal Control of a High-Speed High-TorqueDual-Motor Actuator |
|
Bell, John | Massachusetts Institute of Technology |
Asada, H. Harry | Massachusetts Inst. of Tech |
Keywords: Hybrid systems, Optimal control, Robotics
Abstract: In many robotics and mechatronics applications, actuators must bear a large load at low speeds and also move at high speeds. A single geared motor with a fixed gear ratio is unable to cover the two extreme load conditions effectively. Here, we propose a dual-motor actuator made by combining two electric motors with different gear ratios. Unlike prior works, where two operation ranges are switched by clutch, brake, and other mechanical means, the proposed design does not require any mechanical switches, but instead uses an electrical switch. At higher speeds, the motor with a high gear ratio, called the torque booster, is electrically disconnected from the drive amplifier, so that it does not generate a reverse current and thereby consume power as a generator. First, the design concept is presented, followed by modeling of the system as a hybrid control system. A basic control scheme for distributing drive currents to the two motors is presented, and an example of time-optimal control of the hybrid system is addressed. A proof-of-concept prototype is built and the control algorithms are implemented and tested experimentally.
|
|
14:10-14:30, Paper WeB20.3 | Add to My Program |
HyNTP: An Adaptive Hybrid Network Time Protocol for Clock Synchronization in Heterogeneous Distributed Systems |
|
Guarro, Marcello | University of California, Santa Cruz |
Sanfelice, Ricardo G. | University of California at Santa Cruz |
Keywords: Hybrid systems, Distributed control, Networked control systems
Abstract: This paper presents HyNTP, a distributed hybrid algorithm that synchronizes the time and rate of a set of clocks connected over a network. Clock measurements of the nodes are given at aperiodic time instants and the controller at each node uses these measurements to achieve synchronization. Due to the continuous and impulsive nature of the clocks and the network, we introduce a hybrid system model to effectively capture the dynamics of the system and proposed hybrid algorithm. Moreover, the HyNTP algorithm allows each agent to estimate the skew of its internal clock in order to allow for synchronization to a common timer rate. We provide sufficient conditions guaranteeing synchronization of the timers, exponentially fast. Numerical results illustrate the synchronization property induced by the proposed algorithm as well as robustness to communication noise.
|
|
14:30-14:50, Paper WeB20.4 | Add to My Program |
Regularity Properties of Reachability Maps for Hybrid Dynamical Systems with Applications to Safety |
|
Maghenem, Mohamed Adlene | University of California Santa Cruz |
Altin, Berk | University of California, Santa Cruz |
Sanfelice, Ricardo G. | University of California at Santa Cruz |
Keywords: Hybrid systems, Lyapunov methods
Abstract: In this paper, motivated by the safety problem in hybrid systems, two set-valued reachability maps are introduced. The outer semicontinuity, the continuity, and the local boundedness of the proposed reachability maps with respect to their arguments are analyzed under mild regularity conditions. This study is then used to revisit and improve the existing converse safety statements in terms of barrier functions. In particular, for safe hybrid systems satisfying the aforementioned regularity conditions, we construct time-varying barrier functions that depend on the proposed reachability maps. Consequently, we show that the constructed barrier functions inherit the continuity properties established for the proposed reachability maps.
|
|
14:50-15:10, Paper WeB20.5 | Add to My Program |
Hybrid Predictive Control for Tracking in a Single-Phase DC/AC Inverter with an Unknown Load |
|
Gao, Haoyue | University of California, Santa Cruz |
Maghenem, Mohamed Adlene | University of California Santa Cruz |
Sanfelice, Ricardo G. | University of California at Santa Cruz |
Keywords: Hybrid systems, Power systems
Abstract: This paper presents a control algorithm for the full H-bridge inverter that tracks with arbitrary small precision a given desired sinusoidal reference trajectory. The proposed control algorithm is hybrid and predictive in nature. It consists in steering a quadratic Lyapunov function of the tracking errors towards an arbitrarily small value. In this way, the trajectories of the inverter remain sufficiently close to the reference trajectory. This property is guaranteed in the presence of an unknown resistive load through the use of a finite-time estimator. Simulations confirm that the proposed algorithm maintains the frequency of the switches within a reasonable range.
|
|
15:10-15:30, Paper WeB20.6 | Add to My Program |
Graceful Transitions between Periodic Walking Gaits of Fully Actuated Bipedal Robots |
|
Murali, Vishal | Georgia Institute of Technology |
Hyun, Nak-seung Patrick | Harvard University |
Verriest, Erik I. | Georgia Inst. of Tech |
Keywords: Hybrid systems, Robotics, Optimization
Abstract: We present a theoretical method for graceful transitions between distinct periodic orbits of a fully actuated walking robot. First, a family of hybrid periodic orbits depending smoothly on a parameter are generated via continuously varying constrained optimization. The family specifies a fiber bundle of periodic orbits, and a reference trajectory is designed based on the bundle connecting two periodic orbits. This reference trajectory is shown to have steps that are emph{almost periodic} and hence is defined to achieve graceful transitions between orbits. Next, an online Quadratic Program (QP) based feedback controller is used to track the reference trajectory subject to ground forcing constraints. The method is illustrated on a five degrees of freedom planar bipedal robot in simulation.
|
|
WeB21 Tutorial Session, Director's Row H |
Add to My Program |
Cooperation in Pursuit-Evasion Differential Games |
|
|
Chair: Pachter, Meir | AFIT/ENG |
Co-Chair: Weintraub, Isaac | Air Force Research Labs |
Organizer: Garcia, Eloy | Air Force Research Laboratory |
Organizer: Weintraub, Isaac | Air Force Research Labs |
Organizer: Pachter, Meir | AFIT/ENG |
|
13:30-13:31, Paper WeB21.1 | Add to My Program |
An Introduction to Pursuit-Evasion Differential Games (I) |
|
Weintraub, Isaac | Air Force Research Labs |
Pachter, Meir | AFIT/ENG |
Garcia, Eloy | Air Force Research Laboratory |
Keywords: Cooperative control, Autonomous systems, Aerospace
Abstract: Pursuit and evasion conflicts represent challenging problems with important applications in aerospace and robotics. In pursuit-evasion problems, synthesis of intelligent actions must consider the adversary's potential strategies. Differential game theory provides an adequate framework to analyze possible outcomes of the conflict without assuming particular behaviors by the opponent. This article presents an organized introduction of pursuit-evasion differential games with an overview of recent advances in the area. First, a summary of the seminal work is outlined, highlighting important contributions. Next, more recent results are described by employing a classification based on the number of players: one-pursuer-one-evader, N-pursuers-one-evader, one-pursuer-M-evaders, and N-pursuer-M-evader games. In each scenario, a brief summary of the literature is presented. Finally, two representative pursuit-evasion differential games are studied in detail: the two-cutters and fugitive ship differential game and the active target defense differential game. These problems provide two important applications and, more importantly, they give great insight into the realization of cooperation between friendly agents in order to form a team and defeat the adversary.
|
|
13:31-14:30, Paper WeB21.2 | Add to My Program |
Introduction To: Cooperation in Pursuit-Evasion Differential Games (I) |
|
Garcia, Eloy | Air Force Research Laboratory |
Weintraub, Isaac | Air Force Research Labs |
Pachter, Meir | AFIT/ENG |
Keywords: Cooperative control
Abstract: Pursuit-evasion problems provide a general framework that mathematically formalizes important applications in different areas such as surveillance, navigation, analysis of biological behaviors, and conflict and combat operations. Pursuit-evasion sets up two players or autonomous agents against each other; generalizations are typical in the sense of multiple players divided into two teams – the pursuer team against the evader team. Strategy seeking in pursuit-evasion has been approached by imposing certain assumptions on the behavior of one player or team. However, many pursuit-evasion scenarios must address the presence of an intelligent adversary which does not abide by a restricted set of actions. The desire to design strategies that optimize a certain criteria against the worst possible actions of the opponent and that also provide robustness with respect to all possible behaviors implementable by the adversary led to the emergence of differential game theory. The central problem in pursuit-evasion differential games is the synthesis of saddle-point strategies that provide guaranteed performance for each team regardless of the actual strategies implemented by the adversary. This is a challenging problem as it generalizes optimal control to simultaneously minimize and maximize a performance functional while satisfying implicit robustness requirements. Many questions and open problems remain in this area where the controls community has the potential for important breakthroughs and take differential games a leap forward both in theoretical and practical terms.
|
|
14:30-14:50, Paper WeB21.3 | Add to My Program |
K-Capture in Multi-Agent Pursuit Evasion (I) |
|
Bopardikar, Shaunak D. | Michigan State University |
|
14:50-15:10, Paper WeB21.4 | Add to My Program |
Multi‐Player Pursuit‐Evasion Differential Games (I) |
|
Pachter, Meir | AFIT/ENG |
|
15:10-15:30, Paper WeB21.5 | Add to My Program |
Singular Surfaces within Multi-Agent Differential Games (I) |
|
Fuchs, Zachariah E. | University of Cincinnati |
Keywords: Game theory
Abstract: Within differential game theory, singular surfaces are regions within the state space where one or more of the agents’ regular equilibrium control strategies are undefined. There exist several types of singular surfaces in general, and the type of singularity is dependent on the underlying objectives of the agents and their influence on the system dynamics. Identifying and solving for these singular surfaces is complex even in the case of simple dynamics, and the development of the equilibrium control for states on these surfaces require the use of specific singular equilibrium conditions for each kind of surface. In this presentation, we identify and numerically solve for several types of singular trajectories within multi-agent differential games.
|
|
WeBT3 Special Session, Meetings and |
Add to My Program |
WeBT3 |
|
|
|
13:30-15:30, Paper WeBT3.1 | Add to My Program |
Special Session: Women in Controls in Industry |
|
Pan, Selina | Toyota Research Institute |
Canova, Marcello | The Ohio State University |
Shahbakhti, Mahdi | University of Alberta |
Chen, Yan | Arizona State University |
Hall, Carrie | Illinois Institute of Technology |
Keywords:
Abstract: Academic research and industry development have a symbiotic relationship. The insights gleaned from academic research can be propagated into usable products and technologies by companies. The practical problems identified in industry can also inspire and develop new academic research topics and areas and these new areas of research and development can be explored jointly. This cycle and relationship is key for researchers to understand and to participate in. To facilitate these connections, every year, the ASME Dynamic Systems and Control Division organizes an industry special session at a major controls conference. Nowadays, both academia and industry host increasingly diverse communities. These communities consist of researchers, engineers, teachers, programmers, and managers, and their members are thriving from many different backgrounds. A historically underrepresented group has been female engineers and engineers who identify as women. (For the purposes of brevity for this proposal, we will use the term “women” going forward.) This session seeks to bring together both the importance of exposure to parallel work happening in industry, with the diverse people who are doing the work, to the American Control Conference. Academia is taking increasingly large strides to increase diversity in both its student population as well as its faculty. Industry is doing the same, in both similar and diverging ways, with efforts ranging from recruiting, changing hiring practices, evolving performance review processes, workshops in unconscious bias, employee resource groups, and setting diversity and inclusion as a company-wide initiative. Speakers: Dr. Madeline Goh from RightHook Robotics, Dr. Caroline Le Floch from Tesla, Dr. Raechel Tan from Applied Materials, Dr. Sarah Thornton from Built Robotics, Dr. Xin Zhou from Waymo (Google), and Dr. Sara Dadras from Ford
|
|
13:30-15:30, Paper WeBT3.2 | Add to My Program |
Special Session: NREL’s Control Research: Enabling a Clean Energy Future |
|
Jin, Xin | National Renewable Energy Laboratory |
Bernstein, Andrey | National Renewable Energy Lab (NREL) |
King, Jennifer | National Renewable Energy Laboratory |
Bay, Christopher | National Renewable Energy Laboratory |
Shi, Ying | National Renewable Energy Laboratory |
Jun, Myungsoo | University of Florida |
Keywords:
Abstract: The National Renewable Energy Laboratory (NREL), located in Golden, Colorado, is the United States’ primary laboratory for renewable energy and energy efficiency research and development. Control plays a crucial role in NREL’s mission to advance the science and engineering of energy efficiency, sustainable transportation, renewable power technologies, and energy systems integration. This special session will provide an overview of NREL, followed by in-depth discussion of NREL’s control research in various areas such as building, grid, wind, energy storage, and transportation. The goal of the session is to give the audience an opportunity to understand the typical control research projects at NREL and how to collaborate with NREL.
|
|
13:30-15:30, Paper WeBT3.3 | Add to My Program |
Special Session: Workshop for Elementary, Middle and High School Students and Teachers and Parents |
|
Pasik-Duncan, Bozenna | Univ. of Kansas |
Bushnell, Linda | University of Washington |
Duncan, Tyrone E. | Univ. of Kansas |
Rossiter, John Anthony | University of Sheffield |
Keywords:
Abstract: This outreach event is designed to increase the general awareness of the importance of systems and control technology and its cross-disciplinary nature among students and teachers. Control is used in many common devices and systems: cell phones, computer hard drives, automobiles, and aircraft, but is usually hidden from view. The control field spans science, technology, engineering and mathematics (STEM). The success of all STEM disciplines depends on attracting the most gifted young people to science and engineering professions. Early exposure to middle and high school students and their teachers is a key factor. The goal of these outreach efforts is to promote an increased awareness of the importance and cross-disciplinary nature of control and systems technology. Workshop activities include presentations, informal discussions, and the opportunity for teachers and students to meet passionate researchers and educators from academia and industry. The talks are designed to be educational, interactive, motivating and inspirational showing the excitement of STEM education. Speakers: Dr. Daniel Abramovitch from Agilent Technologies, Dr. Dominique Duncan from University of Southern California, Dr. Tembine Hamidou from New York University, Dr. Richard M. Murray from California Institute of Technology, Dr. Lucy Pao from University of Colorado Boulder, and Dr. Ramla Qureshi from Women Engineers Pakistan (WEP)
|
|
13:30-15:30, Paper WeBT3.4 | Add to My Program |
NSF Program Manager Office Hours: Dr. Irina Dolinskaya |
|
Dolinskaya, Irina | National Science Foundation (NSF) |
Keywords:
Abstract: The National Science Foundation (NSF) offers a number of funding opportunities for investigators working in the field of controls, both within the disciplinary programs in Engineering and other directorates, and through cross-cutting initiatives that are foundation-wide. Office hours allow for individual Q&A with Program Managers. 2pm – 3:30pm - (Dr. Irina Dolinskaya)
|
|
WeLBP-P01 Late Breaking Poster Session, Ballroom ABC |
Add to My Program |
Poster-WeP |
|
|
|
15:30-16:00, Paper WeLBP-P01.1 | Add to My Program |
Extreme-Scale Wind Turbine Controller Field Validation |
|
Phadnis, Mandar | University of Colorado, Boulder |
Zalkind, Daniel | University of Colorado Boulder |
Pao, Lucy Y. | University of Colorado Boulder |
Keywords: Control applications, Simulation, Energy systems
Abstract: Segmented Ultralight Morphing Rotor (SUMR) was the Phase I of an ARPA-E project to conceptualize and demonstrate extreme-scale wind turbines with reduced levelized cost of energy (LCOE). The goal was reducing blade mass and structural loads on the wind turbine to minimize capital and maintenance costs, while maximizing annual energy production (AEP). This was a multi-institutional collaborative endeavor using control co-design techniques, wherein the aerodynamics, structures and controls teams iterated on the aero-structural models and the controller to meet the project goals. This contrasts with traditional techniques where the control is developed after the plant design is finalized. The resultant design was the SUMR-13, a 13 MW wind turbine with blade lengths of 145 m, which was gravo-aero-elastically scaled down to 22.6 m SUMR-D demonstrator. SUMR-D blades manufactured and tested by National Renewable Energy Laboratory (NREL) were used to validate the controller performance, mainly in avoiding generator over speeding shutdowns. The controller, on average, performed well to limit generator speed peaks below the shutdown thresholds. The field data has also allowed for re-tuning of the controller to further improve performance. The dynamic response of SUMR-D was used to verify actuator behavior and model fidelity in OpenFAST (NREL’s wind turbine simulator) simulations. Work on statistically developing full-field turbulence wind inputs indicative of field conditions is in progress. Phase II of the ARPA-E project is the Segmented Outboard Articulating Rotor (SOAR), intending to build upon the progress of SUMR, scale up the wind turbine and further lower the LCOE. The goal is to develop a 25 MW turbine with blade segmentation and outboard flap (aileron-like) actuation. The flap actuation is supposed to give a higher bandwidth to the controller to better react to structural loads thus improving the turbine lifespan. This project includes improving the capabilities of OpenFAST to simulate flap actuators and is currently in the initial control co-design phases of iterations between the aero-structures and control teams to establish a baseline turbine model and controller.
|
|
15:30-16:00, Paper WeLBP-P01.2 | Add to My Program |
Quality-Triggered Sampling for Control Systems |
|
Aldana-López, Rodrigo | Universidad De Zaragoza |
Sagues, Carlos | Universidad De Zaragoza |
Aragues, Rosario | Universidad De Zaragoza |
Keywords: Sampled-data control, Uncertain systems, Hybrid systems
Abstract: In robotic systems, perception latency is a term that refers to the computing time, measured from the data acquisition to the moment in which perception output is ready to be used to compute control commands. There is a clear compromise between perception-latency and the stability of the overall robotic system, referred as the latency-error trade off. In this work, we propose to compute the best sequence of latencies, and therefore different precision at different moments in time, referred as latency schedules. Using this concept we give a formal problem formulation of this trade-off. Moreover, we give a method to obtain latency schedules that improve the system performance verified by simulation experiments.
|
|
15:30-16:00, Paper WeLBP-P01.3 | Add to My Program |
Energy Cost Based Hybrid Vehicle Control and Analysis Technique |
|
Shutty, John | BorgWarner Inc |
Mohon, Sara | BorgWarner |
Kondipati, Naga Nithin Teja | Michigan Technological University |
Semenov, Dmitriy | BorgWarner |
Keywords: Automotive control, Mechatronics, Simulation
Abstract: A novel method of analyzing and controlling hybrid systems has been developed. Utilizing an engine’s Brake Specific Fuel Consumption (BSFC) map along with hybrid electrical system efficiency maps, the actual cost or savings of fuel related to the generation or usage of electric energy can be calculated. These calculations can be used to analyze a vehicle’s operation or they can produce optimized Electric Fuel Savings (EFS) or Electric Fuel Cost (EFC) maps which can be used for the supervisory control of a hybrid propulsion system. This method is similar in concept to the well-known Equivalent Consumption Minimization Strategy (ECMS), but has some unique attributes. Because the EFS and EFC maps can be quantified in advance, the operating strategy is less computationally demanding than ECMS. It also tends to be more intuitive which lends itself well to system analysis and calibration. For example, it can help in understanding why it may not be best to operate a hybrid vehicle’s engine at its lowest BSFC point for a required vehicle output power. Theory, analysis approach, controls logic and the application to P0 and P2/P0 vehicles and vehicle simulations is presented.
|
|
15:30-16:00, Paper WeLBP-P01.4 | Add to My Program |
Maximal Power Output of a Stochastic Thermodynamic Engine |
|
Fu, Rui | University of California, Irvine |
Movilla Miangolarra, Olga | UC Irvine |
Taghvaei, Amirhossein | University of Illinois at Urbana-Champaign |
Chen, Yongxin | Georgia Institute of Technology |
Georgiou, Tryphon T. | University of California, Irvine |
Keywords: Stochastic optimal control, Optimal control, Optimization
Abstract: Classical thermodynamics aimed to quantify the efficiency of thermodynamic engines, by bounding the maximal amount of mechanical energy produced, compared to the amount of heat required. While this was accomplished early on, by Carnot and Clausius, the more practical problem to quantify limits of power that can be delivered, remained elusive due to the fact that quasistatic processes require infinitely slow cycling, resulting in a vanishing power output. Recent insights, drawn from stochastic models, appear to bridge the gap between theory and practice in that they lead to physically meaningful expressions for the dissipation cost in operating a thermodynamic engine over a finite time window. Indeed, the problem to optimize power can be expressed as a stochastic control problem. Building on this framework of stochastic thermodynamics we derive bounds on the maximal power that can be drawn by cycling an overdamped ensemble of particles via a time-varying potential while alternating contact with heat baths of different temperature (Tc cold, and Th hot). Specifically, assuming a suitable bound M on the spatial gradient of the controlling potential, we show that the maximal achievable power is bounded by M/8( Th/Tc-1). Moreover, we show that this bound can be reached to within a factor of (Th/Tc-1)/( Th/Tc+1) by operating the cyclic thermodynamic process with a quadratic potential.
|
|
15:30-16:00, Paper WeLBP-P01.5 | Add to My Program |
Noncontact Direction Control of Magnetic Objects by Permanent Magnet Manipulators |
|
Riahi, Nayereh | Southern Illinois University |
Komaee, Arash | Southern Illinois University |
Keywords: Feedback linearization, Biomedical, MEMs and Nano systems
Abstract: In our earlier work [1,2], we developed the concept of noncontact 2D manipulation of magnetic objects using controllable arrays of permanent magnets. Here, we add a new degree-of-freedom to our 2D trajectory tracking in [1,2] by simultaneously controlling the direction of the magnetic object. Our setup includes an array of six identical permanent magnets equally spaced around a circular container filled with a viscous fluid. This setup utilizes diametrically magnetized cylindrical magnets, each one equipped with a servomotor to control its direction. As a result, the magnetic field inside the container can be flexibly controlled by control of the six servomotors. The control problem in [1,2] was to determine the angular position of the magnets in order to apply a desired force to a magnetic bead, and consequently, to steer it along a desired trajectory. This problem was represented by a set of two nonlinear algebraic equations with the angular position of the magnets as their unknowns. To solve these equations, an approximate method was developed in [1], which was easy to implement, but was not able to exploit full capacity of the setup in controlling the magnetic bead. Later in [2], a homotopy continuation method was proposed to exactly solve the set of equations. In this work, the magnetic bead is replaced with a magnetic rod, and the goal is to magnetically control its direction, in addition to its 2D position. Our strategy to control the direction of magnetic rod is based on the physical fact that the magnetic rod tends to align itself with the local direction of applied magnetic field, just like a compass needle. To control the direction of magnetic field, two more algebraic equations are added to those already in use for trajectory tracking. By simultaneously solving the extended system of algebraic equations, the angular positions of the magnets can be determined for simultaneous trajectory tracking and direction control of the magnetic rod. We extend our homotopy continuation method in [2] to solve this new system of highly nonlinear equations. References [1] N. Riahi and A. Komaee, ACC 2019, pp. 5432–5437. [2] N. Riahi, L. R. Tituana and A. Komaee, ACC 2020
|
|
15:30-16:00, Paper WeLBP-P01.6 | Add to My Program |
Experimental Modeling of Magnetic Force Field |
|
Sneed, Terry-Ann | Southern Illinois University |
Komaee, Arash | Southern Illinois University |
Keywords: Nonlinear systems identification, Estimation, Biomedical
Abstract: Magnetic fields provide a unique ability to manipulate magnetic objects behind nonmagnetic physical barriers. This noncontact feature can be exploited for safe and precise operation of magnetically driven medical tools inside the human body, or for actuating micro- and nanoscale systems in which direct contact for manipulation and control is not feasible. Motivated by a broad range of applications, design and development of noncontact magnetic manipulators has received great attention in recent years. These devices are designed to precisely control their magnetic force applied to magnetic objects via feedback control of adaptable arrays of magnets. To design effective control laws for magnetic manipulators, a reliable model of magnetic force is an essential need. The existing models for magnetic force mostly rely on the models known for magnetic field and a theory relating magnetic force to magnetic field. Given the often existing gap between theory and practice, more realistic experimental models for magnetic force are highly desired for design of practical control laws. This work is dedicated to the development of experimental models of magnetic force by design of suitable experiments and their supporting system identification tools. Our current experimental setup consists of a flat container filled with a transparent, highly viscous fluid in which a magnetic bead moves under the influence of a permanent magnet fixed at the edge of the container. A high-speed camera mounted on top of the container records the trajectories of the magnetic bead starting from different points of departure. These trajectories form the phase plane of the magnetic bead, from which the magnetic force can be estimated at different points around the magnet. In the presence of noise and limitations on the camera speed, extraction of a precise model for magnetic force from the recorded trajectories requires advanced estimation techniques planned to develop in our future work. Our current results rely on a simple estimation scheme to approximate the velocity of magnetic bead at each point along the recorded trajectories. In a high viscosity regime, this velocity is approximately proportional to the magnetic force.
|
|
15:30-16:00, Paper WeLBP-P01.7 | Add to My Program |
Closed-Loop System Identification - an Iterative Approach |
|
Niemann, Henrik | Technical Univ. of Denmark |
Keywords: Closed-loop identification, Identification
Abstract: The focus in this poster is on an iterative approach for system identification in closed-loop. The approach is based on a controller architecture implemented via the coprime factors. Based on this controller architecture, an excitation input is injected in the controller applied for the identification. The identification is done in two parts. In the first part, a nominal set of coprime factors for the system is identified formulated as a standard open-loop identification problem. The identified coprime factors for the system will normally be of low order. Based on identified coprime factors, the second part of the approach can be developed - the iterative part. The iterative part is based on a parameterization of all systems stabilized by a given feedback controller, also known as the dual YJBK (after Youla, Jabr, Bongiorno, and Kucera) parameterization. Based on the applied controller architecture and the identified model in terms of the coprime factors, the difference between the real system and the model can now be identified via the dual YJBK transfer function. The identified dual YJBK transfer function is then added to the setup for correcting the difference between system and model. Based on this, a new dual YJBK transfer function can be identified and added to the setup. This can be done until an acceptable difference between the system and the identified model is obtained.
|
|
WeLBP-P02 ACC Sponsors |
Add to My Program |
Meeting Space-WeP |
|
|
|
15:30-16:00, Paper WeLBP-P02.1 | Add to My Program |
Gold Sponsor: General Motors |
|
Eckman, Wendy | General Motors |
Keywords:
Abstract: We envision a future of zero crashes, zero emissions and zero congestion, and we have committed ourselves to leading the way toward this future. General Motors has been pushing the limits of transportation and technology for over 100 years. Today, we are in the midst of a transportation revolution. And we have the ambition, the talent and the technology to realize the safer, better and more sustainable world we want. As an open, inclusive company, we’re also creating an environment where everyone feels welcomed and valued for who they are. One team, where all ideas are considered and heard, where everyone can contribute to their fullest potential, with a culture based in respect, integrity, accountability and equality. Our team brings wide-ranging perspectives and experiences to solving the complex transportation challenges of today and tomorrow. At General Motors, innovation is our north star. As the first automotive company to mass-produce an affordable electric car, and the first to develop an electric starter and air bags, GM has always pushed the limits of engineering. We are General Motors. We transformed how the world moved through the last century. And we’re determined to do it again as we redefine mobility to serve our customers and shareholders and solve societal challenges. For additional information see https://www.gm.com/
|
|
15:30-16:00, Paper WeLBP-P02.2 | Add to My Program |
Gold Sponsor: Mathworks |
|
Rose, Jennifer | MathWorks |
Ulusoy, Melda | Mathworks |
Keywords:
Abstract: The MATLAB and Simulink product families are fundamental applied math and computational tools at the world's educational institutions. Adopted by more than 5000 universities and colleges, MathWorks products accelerate the pace of learning, teaching, and research in engineering and science. MathWorks products also help prepare students for careers in industry worldwide, where the tools are widely used for data analysis, mathematical modeling, and algorithm development in collaborative research and new product development. Application areas include data analytics, mechatronics, communication systems, image processing, computational finance, and computational biology. For additional information see https://www.mathworks.com/
|
|
15:30-16:00, Paper WeLBP-P02.3 | Add to My Program |
Gold Sponsor: Mitsubishi Electric Research Lab (MERL) |
|
Thornton, Jay | Mitsubishi Electric Research Lab |
Di Cairano, Stefano | Mitsubishi Electric Research Lab |
Keywords:
Abstract: Mitsubishi Electric Research Laboratory (MERL), located in Cambridge, MA, is the North American R&D organization for Mitsubishi Electric Corporation, a 40B global manufacturer of electrical products including elevator and escalators, HVAC systems, electrical power systems, satellites, factory automation equipment, automotive electronics and visual information systems. Controls researchers at MERL collaborate with corporate R&D laboratories, business units in Japan and academic partners around the world to develop new control algorithms and control technologies that extend the performance envelope of these systems. For students who are interested in pursuing an exciting summer of research, please check out our internship program and learn more at facebook, google, or @MERL_news. MERL interns work closely with top researchers, and gain valuable industry experience – an impressive 1:1 intern to researcher ratio. Internships are expected to lead to publications in major conferences and journals. We offer competitive compensation and relocation assistance. Boston is a fantastic student-oriented city, home to some of the best universities in the world. The summer season is especially lively as MERL and Boston are teeming with interns and visitors from all over the world.
|
|
15:30-16:00, Paper WeLBP-P02.4 | Add to My Program |
Silver Sponsor: Quanser |
|
Rahaman, Josie | Quanser Consulting |
Wang, Gemma | Quanser |
Keywords:
Abstract: Quanser is the world leader in mechatronics, robotics, and control platforms optimized for the academic setting. Our leadership in producing innovative lab solutions makes us a trusted partner with academic institutions to help strengthen their reputation with transformative research and teaching labs. The Quanser approach of innovation, collaboration and education has produced a number of notable technology firsts that pioneered many critical contemporary trends, including efficient validation platform for control research, and high-performance real-time control on common microcomputers. For additional information see https://www.quanser.com/
|
|
15:30-16:00, Paper WeLBP-P02.5 | Add to My Program |
Silver Sponsor: SIAM |
|
O'Neill, Kristin | SIAM |
Keywords:
Abstract: SIAM publishes textbooks and monographs in print and electronic format. Visit our booth to browse new and bestselling titles, all available at discounted conference pricing. If you’re interested in writing a book, an editor is available to explain how SIAM partners with authors to publish books of outstanding quality and accessible pricing. More info: https://www.siam.org/Publications/Books
|
|
15:30-16:00, Paper WeLBP-P02.6 | Add to My Program |
Silver Sponsor: Cancelled |
|
Kelly, Claire | Wiley |
Keywords:
Abstract: Silver Sponsor: Cancelled
|
|
15:30-16:00, Paper WeLBP-P02.7 | Add to My Program |
Silver Sponsor: DSPACE |
|
Johnson, Janice | DSpace |
Keywords:
Abstract: dSPACE offers universities and research institutions flexible systems that provide all the options necessary for the model-based development of mechatronic controllers in an academic environment. From architecture-based system design and block-diagram-based function prototyping to automatic production code generation and hardware-in-the-loop (HIL) tests, dSPACE products are successfully being used in the classroom and in research projects at internationally renowned universities. To actively support high-end research at universities and the high-quality education of young talents, dSPACE offers its hardware and software products in special kits for universities at a very attractive price. Learn more at dspaceinc.com / offers for universities. For additional information see https://www.dspace.com/en/inc/home.cfm
|
|
15:30-16:00, Paper WeLBP-P02.8 | Add to My Program |
Silver Sponsor: Springer Nature |
|
Tominich, Christopher | Springer |
Jackson, Oliver | Springer |
Keywords:
Abstract: 2020 American Control ConferenceJuly 1 - 3 ▹ Denver, CO, USA Update the Final Submission Information of ACC 2020 Submission 1449 Home Access Workspace Go to PINs Reviewers My preferences Settings Program Tools Help Refresh Log out Contact Technical Support 59:55 Submissions Menu Overview Details Files Uploads Log Archive Assign Transfer Alert Reviews Report Advise Flag Confirmation Contact Editorial Staff CrossCheck Audit This page may be used to update the submission information for the final conference program. If this information was supplied by the corresponding author when the final version of the paper was submitted then it may be edited and updated. If the corresponding author did not supply this information then it is retrieved from the data that were supplied when the paper was first submitted, and again may be edited and updated. Click on the "Submit" button to save the data after editing. Click on "Pass" when everything to satisfaction. Follow the link Details to go to the Database entry page for the submission Follow the link Previous paper to go to the previous paper in the session, or to the last paper of the previous session ("previous" according to the session schedule). Follow the link Next paper to go to the next paper in the session, or to the first paper of the next session Click on Next check (if available) to go to the next paper that needs to be checked If the final submission file is available then the link Download may be used to download it Click on the session title to go to the Session program page for the session Details Previous paper Next paper Download Update the Final Submission Information of ACC 2020 Submission 1449 Warning: Alternate submissions are not automatically updated Update the final submission data Edit the various fields. Press on Submit to update the database, and on Pass if the data are ready for inclusion in the final program Submission number 1449 Status Final version received, Not passed Schedule code WeLBP-A02.8 Session Meeting Space-WeA Number of pages in the final manuscript 1 Title of the paper Silver Sponsor: Springer Nature Author 1 129234 PIN Tominich Surname* Christopher Given name(s)* Springer Affiliation* Example: Univ. of Metropolis Author 2 45795 PIN Jackson Surname* Oliver Given name(s)* Springer Affiliation* Click to add another author slot Add another author At most 48 authors are supported Abstract Only basic paragraph formatting is supported. To start a new paragraph leave a blank line The html tags , , and are supported in the web and print versions of the final program At Springer Nature, our aim is to advance discovery. For over 175 years, we’ve dedicated ourselves to the academic community, creating value across the publishing process. We deliver an unmatched breadth and depth of quality information which spans top research publications (Nature), outstanding scientific journalism (Scientific American), highly specialized subject-specific journals across all the sciences and humanities, professional publications, databases, and the most comprehensive portfolio of academic books. We use our position and our influence to champion the issues that matter most to the research community – standing up for science, taking a leading role in open research, and being powerful advocates for the highest quality and ethical standards in research.For additional information see https://www.springer.com/gp/authors-editors Copyright form received yyyy-mm-dd Download, upload or delete the copyright form Copyright type Opt out A/V recordings (IEEE) File size 90 kB Passed Press on Submit to update the database Press on Pass to update the database and pass the final submission All Technical Content © IEEE Control Systems Society. This site is protected by copyright and trademark laws under US and International law. All rights reserved. © 2002-2020 PaperCept, Inc. Page generated 2020-06-15 09:59:36 PST Terms of use
|
|
15:30-16:00, Paper WeLBP-P02.9 | Add to My Program |
Bronze Sponsor: Processes |
|
Xiang, Wency | Processes MDPI |
Keywords:
Abstract: Processes (ISSN 2227-9717) provides an advanced forum for process/systems related research in chemistry, biology, materials and allied engineering fields. The journal publishes regular research papers, communications, letters, short notes and reviews. Our aim is to encourage researchers to publish their experimental, theoretical and computational results in as much detail as necessary. There is no restriction on paper length or number of figures and tables. Experimental, theoretical and computational research on process development and engineering Chemical and biochemical reaction processes Mass transfer, separation and purification processes Mixing, fluid processing and heat transfer systems Integrated process design and scaleup Process modeling, simulation, optimization and control For additional information see https://www.mdpi.com/journal/processes
|
|
15:30-16:00, Paper WeLBP-P02.10 | Add to My Program |
Bronze Sponsor: Halliburton |
|
Darbe, Robert | Halliburton |
Keywords:
Abstract: Founded in 1919, Halliburton is one of the world's largest providers of products and services to the energy industry. With 60,000 employees, representing 140 nationalities in more than 80 countries, the company helps its customers maximize value throughout the lifecycle of the reservoir – from locating hydrocarbons and managing geological data, to drilling and formation evaluation, well construction and completion, and optimizing production throughout the life of the asset. Halliburton’s technology organization provides cutting edge research and innovative solutions to maximize asset value for our customers. For additional information see https://www.halliburton.com/en-US/default.html
|
|
WeC01 Regular Session, Governor's SQ 12 |
Add to My Program |
Learning I |
|
|
Chair: Antunes, Duarte | Eindhoven University of Technology, the Netherlands |
Co-Chair: Kamalapurkar, Rushikesh | Oklahoma State University |
|
16:00-16:20, Paper WeC01.1 | Add to My Program |
Identifying Sparse Low-Dimensional Structures in Markov Chains: A Nonnegative Matrix Factorization Approach |
|
Ghasemi, Mahsa | The University of Texas at Austin |
Hashemi, Abolfazl | University of Texas at Austin |
Vikalo, Haris | University of Texas at Austin |
Topcu, Ufuk | The University of Texas at Austin |
Keywords: Markov processes, Machine learning, Model/Controller reduction
Abstract: We consider the problem of learning low-dimensional representations for large-scale Markov chains. We formulate the task of representation learning as that of mapping the state space of the model to a low-dimensional state space, called the textit{kernel space}. The kernel space contains a set of meta states which are desired to be representative of only a small subset of original states. To promote this structural property, we constrain the number of nonzero entries of the mappings between the state space and the kernel space. By imposing the desired characteristics of the representation, we cast the problem as a constrained nonnegative matrix factorization. To compute the solution, we propose an efficient block coordinate gradient descent and theoretically analyze its convergence properties.
|
|
16:20-16:40, Paper WeC01.2 | Add to My Program |
Safety-Guaranteed, Accelerated Learning in MDPs with Local Side Information |
|
Thangeda, Pranay | University of Illinois at Urbana-Champaign |
Ornik, Melkior | University of Illinois at Urbana-Champaign |
Keywords: Learning, Markov processes, Autonomous systems
Abstract: In environments with uncertain dynamics, synthesis of optimal control policies mandates exploration. The applicability of classical learning algorithms to real-world problems is often limited by the number of time steps required for learning the environment model. Given some local side information about the differences in transition probabilities of the states, potentially obtained from the agent's onboard sensors, we generalize the idea of indirect sampling for accelerated learning to propose an algorithm that balances between exploration and exploitation. We formalize this idea by introducing the notion of the value of information in the context of a Markov decision process with unknown transition probabilities, as a measure of the expected improvement in the agent's current estimate of transition probabilities by taking a particular action. By exploiting available local side information and maximizing the estimated value of learned information at each time step, we accelerate the learning process and subsequent synthesis of the optimal control policy. Further, we define the notion of agent safety, a vital consideration for physical systems, in the context of our problem. Under certain assumptions, we provide guarantees on the safety of an agent exploring with our algorithm that exploits local side information. We illustrate agent safety and the improvement in learning speed using numerical experiments in the setting of a Mars rover, with data from onboard sensors acting as the local side information.
|
|
16:40-17:00, Paper WeC01.3 | Add to My Program |
Mutual Learning: Part II --Reinforcement Learning |
|
Narendra, Kumpati S. | Yale Univ |
Mukhopadhyay, Snehasis | Indiana-Purdue Univ |
Keywords: Learning, Markov processes, Optimization algorithms
Abstract: The concept of “Mutual Learning” was introduced by the authors in Part I of this paper which was presented at the 2019 ACC. This is the second of the series of papers the authors propose to write on this subject. The principal question addressed in all of them concerns the process by which two agents “learn” from each other. More specifically, the question is how two (or more) agents should share their information to improve their performance. In Part I, the concept of mutual learning was introduced and discussed briefly in the context of two deterministic learning automata learning from each other in a static random environment. In this paper, we first provide some reasons why the concept can become complex even in such simple situations, and propose some (weak) necessary conditions for the problem to be well defined. Following this, we consider similar questions which arise when two agents use reinforcement learning in both static and dynamic environments. In particular, in the latter category, mutual learning in Markov Decision Processes (MDP) with finite states is discussed. Simulation results are presented wherever appropriate to complement the theoretical discussions.
|
|
17:00-17:20, Paper WeC01.4 | Add to My Program |
Scheduling Dimension Reduction of LPV Models - a Deep Neural Network Approach |
|
Koelewijn, Patrick | Eindhoven University of Technology |
Tóth, Roland | Eindhoven University of Technology |
Keywords: Linear parameter-varying systems, Modeling, Machine learning
Abstract: In this paper, the existing Scheduling Dimension Reduction (SDR) methods for Linear Parameter-Varying (LPV) models are reviewed and a Deep Neural Network (DNN) approach is developed that achieves higher model accuracy under scheduling dimension reduction. The proposed DNN method and existing SDR methods are compared on a two-link robotic manipulator, both in terms of model accuracy and performance of controllers synthesized with the reduced models. The methods compared include SDR for state-space models using Principal Component Analysis (PCA), Kernel PCA (KPCA) and Autoencoders (AE). On the robotic manipulator example, the DNN method achieves improved representation of the matrix variations of the original LPV model in terms of the Frobenius norm compared to the current methods. Moreover, when the resulting model is used to accommodate synthesis, improved closed-loop performance is obtained compared to the current methods.
|
|
17:20-17:40, Paper WeC01.5 | Add to My Program |
Online Inverse Reinforcement Learning for Systems with Disturbances |
|
Self, Ryan | Oklahoma State University |
Abudia, Moad | Oklahoma State University |
Kamalapurkar, Rushikesh | Oklahoma State University |
Keywords: Machine learning, Adaptive systems, Identification
Abstract: This paper addresses the problem of online inverse reinforcement learning for nonlinear systems with modeling uncertainties and additive disturbances. In the developed approach, the learner measures state and input trajectories of the demonstrator and identifies its unknown reward function online. Sub-optimality introduced in the measured trajectories by the unknown external disturbance is compensated for using a novel model-based inverse reinforcement learning approach. The learner estimates the external disturbances and uses them to identify the dynamic model of the demonstrator. The learned model along with the observed sub-optimal trajectories are used for reward function estimation.
|
|
17:40-18:00, Paper WeC01.6 | Add to My Program |
Embedded Learning-Based Model Predictive Control for Mobile Robots Using Gaussian Process Regression |
|
Janssen, Niels | Eindhoven University of Technology |
Kools, Laurens | Eindhoven University of Technology |
Antunes, Duarte | Eindhoven University of Technology, the Netherlands |
Keywords: Learning, Predictive control for nonlinear systems, Optimal control
Abstract: This paper proposes a learning-based Model Predictive Control (MPC) strategy for mobile robots. The strategy relies on Gaussian Process Regression (GPR) to improve the robot’s model based on measurement data, therefore avoiding the need for an accurate model. More specifically, the kinematics are assumed to be known and GPR is employed to capture the unknown robot dynamics. Within a cascaded control structure, the resulting full system model is used to generate velocity commands by means of MPC. This allows the dynamics to be taken into account during velocity reference generation, while keeping a fast inner-loop controller to track the velocity reference. The variance provided by the Gaussian process is used to tighten constraints for robust constraint satisfaction. Incremental Sparse Spectrum Gaussian Process Regression (ISSGPR) and Real-Time Iteration (RTI) are employed to facilitate real-time online learning and ensure implementability on embedded hardware. Simulations and experiments are performed to show the effectiveness of the proposed approach. Although we focus on the application to Wheeled Mobile Robots (WMR), the ideas provided here are applicable in other contexts where the kinematics are known and there are unmodelled dynamics.
|
|
WeC02 Invited Session, Ballroom ABC |
Add to My Program |
Estimation and Diagnostics of Batteries |
|
|
Chair: Dey, Satadru | University of Colorado Denver |
Co-Chair: Lotfi, Nima | Southern Illinois University Edwardsville |
Organizer: Dey, Satadru | University of Colorado Denver |
Organizer: Moura, Scott | University of California, Berkeley |
Organizer: Lin, Xinfan | University of California, Davis |
Organizer: Kim, Youngki | University of Michigan - Dearborn |
Organizer: Fang, Huazhen | University of Kansas |
Organizer: Donkers, M.C.F. | Eindhoven University of Technology |
Organizer: Song, Xingyong | Texas A&M University, College Station |
Organizer: Siegel, Jason B. | University of Michigan |
Organizer: Choe, Song-Yul (Ben) | Auburn University |
Organizer: Perez, Hector E. | University of California, Berkeley |
Organizer: Lotfi, Nima | Southern Illinois University Edwardsville |
|
16:00-16:20, Paper WeC02.1 | Add to My Program |
Addressing the Observability Problem in Batteries: Algorithm Design for Electrode-Level Charge and Health Estimation (I) |
|
Sattarzadeh, Sara | University of Colorado Denver |
Dey, Satadru | University of Colorado Denver |
Colclasure, Andrew | National Renewable Energy Laboratory |
Smith, Kandler | National Renewable Energy Lab |
Keywords: Control applications, Estimation
Abstract: From real-time battery estimation viewpoint, weak observability of individual electrode states from terminal voltage measurement is a major barrier. Nevertheless, such electrode-level information can help expand usable energy/power as well as lifespan of the battery cell by enabling electrode-level limit based battery control. Motivated by these promising improvements, we present a real-time framework for estimating charge and health of individual electrodes. Essentially, the weak observability of the electrodes is addressed by decomposing the overall estimation problem into two sub-estimators that work in a cascaded manner to provide charge and health information for individual electrodes. The performance of the proposed scheme is illustrated by using an experimentally identified battery model that considers essential nonlinearities in electrodes' Open Circuit Potential (OCP) functions and resistances as well as dominant Solid Electrolyte Interphase (SEI) aging mechanism. Simulation case studies are presented based on this identified model which validate the effectiveness of the proposed framework.
|
|
16:20-16:40, Paper WeC02.2 | Add to My Program |
Li-Ion Battery Electrode Health Diagnostics Using Machine Learning (I) |
|
Lee, Suhak | University of Michigan, Ann Arbor |
Kim, Youngki | University of Michigan - Dearborn |
Keywords: Machine learning, Fault diagnosis, Energy systems
Abstract: Diagnostic information of a battery allows for its maximum utilization while avoiding unfavorable or even dangerous operations. Model-based approaches have been proposed to identify the state of health (SOH) related parameters in lithium-ion (Li-ion) batteries; however, high computational cost for solving optimization-based parameter identification makes these approaches difficult to be implemented in onboard applications. To address this issue, this paper proposes a machine learning-based approach using a neural network (NN) model for identifying electrode-level degradation of Li-ion batteries. For the diagnosis of electrode-level degradation (i.e., loss of active material (LAM) for each electrode and loss of lithium inventory (LLI)), electrochemical features are extracted from both incremental capacity (IC) curve and differential voltage (DV) curve. The developed NN model trained with the proposed electrochemical features shows strong potential in identifying each degradation mode accurately: the RMSE of all degradation modes is less than 0.1.
|
|
16:40-17:00, Paper WeC02.3 | Add to My Program |
Battery Internal Short Detection Methodology Using Cell Swelling Measurements (I) |
|
Cai, Ting | University of Michigan |
Pannala, Sravan | University of Michigan |
Stefanopoulou, Anna G. | University of Michigan |
Siegel, Jason B. | University of Michigan |
Keywords: Fault detection, Energy systems
Abstract: Li-ion battery internal short circuits are a major safety issue for electric vehicles, and can lead to serious consequences such as battery thermal runaway. An internal short can be caused by mechanical abuse, high temperature, overcharging, and lithium plating. The low impedance or hard internal short circuit is the most dangerous kind. The high internal current flow can lead to battery temperature increase, thermal runaway, and even explosion in a few seconds. Algorithms that can quickly detect such serious events with a high confidence level and which are robust to sensor noise are needed to ensure passenger safety. False positives are also undesirable as many thermal runaway mitigation techniques, such as activating pyrotechnic safety switches, would disable the vehicle. Conventional methods of battery internal short detection, including voltage and surface temperature based algorithms, work well for a single cell. However, these methods are difficult to apply in large scale battery packs with many parallel cells. In this study, we propose a new internal short detection method by using cell swelling information during the early stages of a battery heating caused by an internal short circuit. By measuring cell expansion force, higher confidence level detection can be achieved for an internal short circuit in an electric vehicle scale battery pack.
|
|
17:00-17:20, Paper WeC02.4 | Add to My Program |
Interval Observer for SOC Estimation in Parallel-Connected Lithium-Ion Batteries (I) |
|
Zhang, Dong | University of California, Berkeley |
Couto, Luis Daniel | Université Libre De Bruxelles |
Gill, Preet | University of California Berkeley |
Benjamin, Sebastien | Saft S.A |
Zeng, Wente | Total S.A |
Moura, Scott | University of California, Berkeley |
Keywords: Estimation, Energy systems, Observers for nonlinear systems
Abstract: The internal states of Lithium-ion batteries, notably state of charge (SOC), need to be carefully monitored during battery operation to manage energy and safety. In this paper, we propose an interval observer for SOC estimation in an electrically and thermally coupled parallel connection of cells. This is a particularly challenging mbox{problem} because mathematically cells in parallel yield a system of differential-algebraic equations (DAE), which are more difficult to handle than ordinary differential equations (e.g. a series string of cells). For a large battery pack with thousands of cells, applying an estimation algorithm on each and every cell would be mathematically and computationally intractable. These issues are tackled using an interval observer based on a coupled equivalent circuit-thermal model. The key novelty lies in considering cell heterogeneity as well as state-dependent parameters as unknown, but with bounded uncertainty. The resulting interval observer maps bounded uncertainties to a feasible set of state estimation, and is independent of the number of cells in parallel. Stability and inclusion of the interval observer are proven and validated through numerical studies.
|
|
17:20-17:40, Paper WeC02.5 | Add to My Program |
Individual Cell Fault Detection for Parallel-Connected Battery Cells Based on the Statistical Model and Analysis (I) |
|
Song, Ziyou | University of Michigan, Ann Arbor |
Pinto Delgado, Fanny Adriana | University of Michigan |
Hou, Jun | University of Michigan |
Hofmann, Heath | Univ. of Michigan |
Sun, Jing | University of Michigan |
Keywords: Energy systems, Fault detection, Estimation
Abstract: Fault diagnosis is extremely important to the safe operation of Lithium-ion batteries. To avoid severe safety issues (e.g., thermal runaway), initial faults should be timely detected and resolved. In this paper, we consider parallel-connected battery cells with only one voltage and one current sensor. The lack of independent current sensors makes it difficult to detect individual cell degradation. To this end, based on the high-frequency response of the battery, a simplified fault detection-oriented model is derived and validated by a physics-informed battery model. The resistance of the battery string, which is significantly influenced by the faulty cell, is estimated and used as the health indicator. The statistical resistance distribution of battery strings is first analyzed considering the distribution of fresh and aged cells. A fault diagnosis algorithm is proposed and the thresholds (i.e., 2 standard deviation interval) are obtained through statistical analysis. Monte Carlo simulation results show that the proposed fault diagnosis algorithm can balance false alarms and missed detections well. In addition, it is verified that the proposed algorithm is robust to the uniform parameter changes of individual battery cells.
|
|
17:40-18:00, Paper WeC02.6 | Add to My Program |
A Low-Cost MPC-Based Algorithm for Battery Power Limit Estimation |
|
Araujo Xavier, Marcelo | Ford Motor Company |
Kawakita de Souza, Aloisio Henrique | University of Colorado at Colorado Springs |
Plett, Gregory L. | University of Colorado Colorado Springs |
Trimboli, Michael | University of Colorado, Colorado Springs |
Keywords: Predictive control for nonlinear systems, Constrained control, Energy systems
Abstract: Many battery applications require timely estimates of the maximum power that may be either extracted during operation or added during charge. Traditional methods of computing these estimates rely mostly on simple computations using empirically derived limits imposed on cell voltage, current and possibly temperature. While generally effective, such methods do not fully account for the dynamic aspects of the underlying model. This paper proposes a novel method of real-time power limit estimation that uses a model predictive control-inspired approach which enlarges the functional window right up to true established bounds of cell performance.
|
|
WeC03 Regular Session, Governor's SQ 15 |
Add to My Program |
Traffic Control |
|
|
Chair: Malikopoulos, Andreas A. | University of Delaware |
Co-Chair: Mohajerpoor, Reza | CSIRO |
|
16:00-16:20, Paper WeC03.1 | Add to My Program |
A Traffic Signal Control Strategy to Avoid Spillback on Short Links |
|
Mohajerpoor, Reza | CSIRO |
Cai, Chen | Data61, CSIRO |
Keywords: Modeling, Simulation, Transportation networks
Abstract: Short links at signalized intersections, even in undersaturated traffic conditions are often subject to overflow. The spillback phenomena in those links can significantly degrade the performance of the optimal signal control algorithm by blocking other movements at the intersection or an adjacent one. In this paper, we analytically derive the necessary and sufficient conditions for the spillover phenomena in an undersaturated intersection. We further propose a real-time data-driven Spillback Avoidance Signal Control (SASC) framework to treat the problem for a two-phase intersection. To add, we show how to extend the algorithm to a three or higher phase intersection. A microsimulation study is conducted to emphasize the effectiveness of the proposed SASC algorithm. Over 28 percent reduction in total vehicle delay of the system is achieved with respect to the optimal signal timing that ignores the spillback effects.
|
|
16:20-16:40, Paper WeC03.2 | Add to My Program |
Resilience of Dynamic Routing in the Face of Recurrent and Random Sensing Faults |
|
Xie, Qian | New York University |
Jin, Li | New York University |
Keywords: Traffic control, Cooperative control, Markov processes
Abstract: Feedback dynamic routing is a commonly used control strategy in transportation systems. This class of control strategies rely on real-time information about the traffic state in each link. However, such information may not always be observable due to temporary sensing faults. In this article, we consider dynamic routing over two parallel routes, where the sensing on each link is subject to recurrent and random faults. The faults occur and clear according to a finite-state Markov chain. When the sensing is faulty on a link, the traffic state on that link appears to be zero to the controller. Building on the theories of Markov processes and monotone dynamical systems, we derive lower and upper bounds for the resilience score, i.e. the guaranteed throughput of the network, in the face of sensing faults by establishing stability conditions for the network. We use these results to study how a variety of key parameters affect the resilience score of the network. The main conclusions are: (i) Sensing faults can reduce throughput and destabilize a nominally stable network; (ii) A higher failure rate does not necessarily reduce throughput, and there may exist a worst rate that minimizes throughput; (iii) The higher the correlation between the failure of two links, the larger the throughput; (iv) A large difference in capacity between two links can result in a drop in throughput.
|
|
16:40-17:00, Paper WeC03.3 | Add to My Program |
Variable Speed Limits Control in an Urban Road Network to Reduce Environmental Impact of Traffic |
|
Othman, Bassel | IFP Energies Nouvelles |
De Nunzio, Giovanni | IFP Energies Nouvelles |
Di Domenico, Domenico | IFP New Energy |
Canudas de Wit, Carlos | CNRS, GIPSA-Lab |
Keywords: Traffic control, Modeling, Simulation
Abstract: The problem of improving traffic sustainability and traffic efficiency in an urban road network, by implementing variable speed limits (VSL), is addressed in this paper. A nonlinear model predictive control (NMPC) design based on a first-order macroscopic traffic flow model is proposed for the speed limits optimization in each segment of the road network. Simulation results show the effectiveness of the proposed control approach, compared to reference cases in which the speed limits are constantly set to 30 km/h or 50 km/h. In the particular case of congested traffic conditions, the controller is capable of reducing both energy consumption and travel time, without delaying users waiting at the network boundaries.
|
|
17:00-17:20, Paper WeC03.4 | Add to My Program |
Impact of Connected and Automated Vehicles in a Corridor |
|
Mahbub, A M Ishtiaque | University of Delaware |
Malikopoulos, Andreas A. | University of Delaware |
Zhao, Liuhui | University of Delaware |
Keywords: Traffic control, Optimal control, Cooperative control
Abstract: Several approaches have been proposed in the literature that allow connected and automated vehicles (CAVs) to coordinate in areas where there is a potential conflict, for example, in intersections, merging at roadways and roundabouts. In this paper, we consider the problem of coordinating CAVs in a corridor consisting of several conflict areas where collision may occur. We derive a solution that yields the optimal control input, in terms of fuel consumption, for each CAV to cross the corridor under the hard safety constraints. We validate the effectiveness of the solution through simulation, and we show that both fuel consumption and travel time can be improved significantly.
|
|
17:20-17:40, Paper WeC03.5 | Add to My Program |
On Robustness of the Generalized Proportional Controller for Traffic Signal Control |
|
Nilsson, Gustav | Georgia Institute of Technology |
Como, Giacomo | Politecnico Di Torino |
Keywords: Traffic control, Transportation networks, Control of networks
Abstract: We investigate robustness properties of the Generalized Proportional Allocation (GPA) policy that has been recently proposed for traffic signal control in urban networks. The GPA policy is fully decentralized, relies only on local information on the current congestion state, and requires no knowledge of the routing, the exogenous inflows, or the network structure. In previous work, we proved throughput optimality of the GPA policy, by showing that it is able to stabilize the traffic network dynamics whenever any controller is able to do so. In this paper, we first extend these results by showing that even when the measurements have offsets, the GPA policy maintains the same stability properties as with exact measurements. A comparison between the GPA and the MaxPressure traffic signal controllers with respect to robustness is also performed in a microscopic traffic simulator, where it is shown that while the GPA can handle offsets in the measurements, the MaxPressure controller may make vehicles wait forever.
|
|
17:40-18:00, Paper WeC03.6 | Add to My Program |
Asymmetric Cell Transmission Model-Based, Ramp-Connected Robust Traffic Density Estimation under Bounded Disturbances |
|
Vishnoi, Suyash | The University of Texas at Austin |
Nugroho, Sebastian Adi | The University of Texas at San Antonio |
Taha, Ahmad | The University of Texas at San Antonio |
Claudel, Christian G. | UT Austin |
Banerjee, Taposh | University of Texas at San Antonio |
Keywords: Transportation networks, Traffic control, LMIs
Abstract: In modern transportation systems, traffic congestion is inevitable. To minimize the loss caused by congestion, various control strategies have been developed most of which rely on observing real-time traffic conditions. As vintage traffic sensors are limited, traffic density estimation is very helpful for gaining network-wide observability. This paper deals with this problem by first, presenting a traffic model for stretched highway having multiple ramps built based on asymmetric cell transmission model (ACTM). Second, based on the assumption that the encompassed nonlinearity of the ACTM is Lipschitz, a robust dynamic observer framework for performing traffic density estimation is proposed. Numerical test results show that the observer yields a sufficient performance in estimating traffic densities having noisy measurements, while being computationally faster the Unscented Kalman Filter in performing real-time estimation.
|
|
WeC04 Invited Session, Governor's SQ 14 |
Add to My Program |
Autonomous Vehicle Motion Planning |
|
|
Chair: Borhan, Hoseinali | Cummins Inc |
Co-Chair: Di Cairano, Stefano | Mitsubishi Electric Research Labs |
Organizer: Borhan, Hoseinali | Cummins Inc |
Organizer: Dadras, Sara | Company |
Organizer: Lotfi, Nima | Southern Illinois University Edwardsville |
Organizer: Hall, Carrie | Illinois Institute of Technology |
|
16:00-16:20, Paper WeC04.1 | Add to My Program |
Integrated Obstacle Detection and Avoidance in Motion Planning and Predictive Control of Autonomous Vehicles (I) |
|
Quirynen, Rien | Mitsubishi Electric Research Laboratories (MERL) |
Berntorp, Karl | Mitsubishi Electric Research Labs |
Kambam, Karthik | Mitsubishi Electric Research Laboratories |
Di Cairano, Stefano | Mitsubishi Electric Research Labs |
Keywords: Predictive control for nonlinear systems, Autonomous systems, Automotive control
Abstract: This paper presents a novel approach for obstacle avoidance in autonomous driving systems, based on a hierarchical software architecture that involves both a low-rate, long-term motion planning algorithm and a high-rate, highly reactive predictive controller. More specifically, an integrated framework of a particle-filter based motion planner is proposed in combination with a trajectory-tracking algorithm using nonlinear model predictive control (NMPC). The motion planner computes a reference trajectory to be tracked, and its corresponding covariance is used for automatically tuning the time-varying tracking cost in the NMPC problem formulation. Preliminary experimental results, based on a test platform of small-scale autonomous vehicles, illustrate that the proposed approach can enable safe obstacle avoidance and reliable driving behavior in relatively complex scenarios.
|
|
16:20-16:40, Paper WeC04.2 | Add to My Program |
Cooperation-Aware Lane Change Maneuver in Dense Traffic Based on Model Predictive Control with Recurrent Neural Network (I) |
|
Bae, Sangjae | University of California, Berkeley |
Saxena, Dhruv Mauria | The Robotics Institute, Carnegie Mellon University |
Nakhaei, Alireza | Honda Research Institute |
Choi, Chiho | Honda Research Institute USA |
Fujimura, Kikuo | Honda Research Institute |
Moura, Scott | University of California, Berkeley |
Keywords: Automotive control, Predictive control for nonlinear systems
Abstract: This paper presents a real-time lane change control framework of autonomous driving in dense traffic, which exploits cooperative behaviors of other drivers. This paper focuses on heavy traffic where vehicles cannot change lanes without cooperating with other drivers. In this case, classical robust controls may not apply since there is no ``safe'' area to merge to without interacting with the other drivers. That said, modeling complex and interactive human behaviors is highly non-trivial from the perspective of control engineers. We propose a mathematical control framework based on Model Predictive Control (MPC) encompassing a state-of-the-art Recurrent Neural network (RNN) architecture. In particular, RNN predicts interactive motions of other drivers in response to potential actions of the autonomous vehicle, which are then systematically evaluated in safety constraints. We also propose a real-time heuristic algorithm to find locally optimal control inputs. Finally, quantitative and qualitative analysis on simulation studies are presented to illustrate the benefits of the proposed framework.
|
|
16:40-17:00, Paper WeC04.3 | Add to My Program |
Autonomous Overtaking Assistant for Country Road Scenarios (I) |
|
Sulejmani, Fisnik | Johannes Kepler University Linz |
Reiterer, Florian | Nemak Linz GmbH |
Assadi, Amin | Johannes Kepler University Linz |
Del Re, Luigi | Johannes Kepler University Linz |
Keywords: Automotive control, Automotive systems, Predictive control for linear systems
Abstract: While Advanced Driver Assistance Systems (ADAS) are becoming the longer the more common, most interest has been devoted either to highway traffic or to special situations like parking. Against this background, this paper focuses on overtaking maneuvers on country roads, and a stochastic model predictive control (MPC) algorithm is implemented to manage this task. The behavior of the surrounding vehicles is predicted stochastically by using Bayesian networks. The overtaking algorithm is tested for various country road traffic scenarios in a stochastic traffic environment. To compare the performance of the controller to that of a real human driver a dedicated study in this stochastic traffic environment is carried out. The results of this study show that the control algorithm provides the safest trip in acceptable travel time.
|
|
17:00-17:20, Paper WeC04.4 | Add to My Program |
Receding Horizon Motion Planning for Automated Lane Change and Merge Using Monte Carlo Tree Search and Level-K Game Theory |
|
Karimi, Shahab | Clemson University |
Vahidi, Ardalan | Clemson University |
Keywords: Automotive control, Game theory, Autonomous systems
Abstract: Motion planning and predicting the future states of the surrounding environment are among the main challenges in automated driving. In lane change and merge maneuvers, it is important to know how neighboring vehicles will react in the imminent future. Such a problem becomes more demanding in the absence of inter-vehicular communication (such as V2V, V2X, etc.). Human driver models, probabilistic approaches, rule-based techniques, and machine learning methods have addressed this problem only partially as they do not focus on the behavioral features of the vehicles. In addition, the framework that undertakes the prediction is expected to be fast in providing the path planner with the estimate of future states of the vehicles. Constructing such a fast structure, considering interactions between vehicles, is the main motivation of this study. In this paper we present a fast receding horizon algorithm based on Monte Carlo tree search for real-time path planning in highway scenarios. Inspired by recent results in other recent studies, we adopt a level-k game framework for predicting the strategy of the neighboring vehicles. Our simulations show promising results with fast computations.
|
|
17:20-17:40, Paper WeC04.5 | Add to My Program |
Robust Preview-Based Tractor-Trailer Lateral Control for Lane Keeping (I) |
|
Flores, Carlos | UC Berkeley |
Lu, Xiao-Yun | Univ. of California at Berkeley |
Keywords: Automotive control, Robust control, Optimization
Abstract: This work proposes a control framework for automated lane keeping of a tractor-trailer truck. The proposed architecture controls vehicle variables in a preview-based manner, thus gaining robustness to sensing and acting delays/lags. Electronic power steering of tractor front wheels is used to act on lateral and yaw dynamics, as well as vision-based lane mark detection for loop closing. A feedforward/feedback control approach is used to stabilize the truck dynamics formulated as a Linear Parameter Varying system. The design objectives include reference yaw rate tracking, robustness against truck modeling uncertainties and control effort definition. Validation results on a high fidelity simulation environment demonstrate the algorithm performance both in constant and varying speeds scenarios, as well as its robustness to external and internal disturbances.
|
|
17:40-18:00, Paper WeC04.6 | Add to My Program |
Motion-Planning for Unicycles Using the Invariant-Set Motion-Planner (I) |
|
Danielson, Claus | Mitsubishi Electric Research Labs |
Di Cairano, Stefano | Mitsubishi Electric Research Labs |
Berntorp, Karl | Mitsubishi Electric Research Labs |
Weiss, Avishai | Mitsubishi Electric Research Labs |
Keywords: Autonomous systems, Automotive control, Nonholonomic systems
Abstract: This paper adapts the invariant-set motion-planner to systems with unicycle-like dynamics. The invariant-set motion-planner is a motion-planning algorithm that uses the positive-invariant sets of the closed-loop dynamics to find a collision-free path to a desired target through an obstacle filled environment. The main challenge in applying the invariant-set motion-planner to unicycles is that the positive invariant sets of the unicycle under discontinuous feedback control have complex geometry. Thus, we develop numerically efficient mathematical tools for detecting collisions. We demonstrate the invariant-set motion-planner for unicycles in two automated parking case studies; parallel and perpendicular parking.
|
|
WeC05 Invited Session, Plaza Court 6 |
Add to My Program |
Security & Privacy of Cyber-Physical Systems |
|
|
Chair: Ruths, Justin | University of Texas at Dallas |
Co-Chair: Hale, Matthew | University of Florida |
Organizer: Ruths, Justin | University of Texas at Dallas |
|
16:00-16:20, Paper WeC05.1 | Add to My Program |
Robust Software Rejuvenation for CPS with State Estimation and Disturbances |
|
Romagnoli, Raffaele | Carnegie Mellon University |
Krogh, Bruce H. | Carnegie Mellon Univ |
Sinopoli, Bruno | Washington University in St Louis |
Keywords: Fault tolerant systems, Lyapunov methods, Constrained control
Abstract: Software rejuvenation has been proposed and demonstrated as a strategy to protect cyber-physical systems (CSPs) against unanticipated and undetectable cyber attacks, but the supporting theory has neglected the effects of modeling uncertainties and disturbances and has assumed the availability of perfect state information from the sensor measurements. This paper addresses these issues by providing sufficient conditions for the successful implementation of software rejuvenation in the face of these real-world considerations. The results are illustrated for a simple position control system.
|
|
16:20-16:40, Paper WeC05.2 | Add to My Program |
Distributionally Robust Tuning of Anomaly Detectors in Cyber-Physical Systems with Stealthy Attacks (I) |
|
Renganathan, Venkatraman | University of Texas at Dallas |
Hashemi, Navid | University of Texas at Dallas |
Ruths, Justin | University of Texas at Dallas |
Summers, Tyler H. | University of Texas at Dallas |
Keywords: Fault detection, Fault tolerant systems, Stochastic systems
Abstract: Designing resilient control strategies for mitigating stealthy attacks is a crucial task in emerging cyber-physical systems. In the design of anomaly detectors, it is common to assume Gaussian noise models to maintain tractability; however, this assumption can lead the actual false alarm rate to be significantly higher than expected. We propose a distributionally robust anomaly detector for noise distributions in moment-based ambiguity sets. We design a detection threshold that guarantees that the actual false alarm rate is upper bounded by the desired one by using generalized Chebyshev inequalities. Furthermore, we highlight an important trade-off between the worst-case false alarm rate and the potential impact of a stealthy attacker by efficiently computing an outer ellipsoidal bound for the attack-reachable states corresponding to the distributionally robust detector threshold. We illustrate this trade-off with a numerical example and compare the proposed approach with a traditional chi-squared detector.
|
|
16:40-17:00, Paper WeC05.3 | Add to My Program |
The Dirichlet Mechanism for Differential Privacy on the Unit Simplex (I) |
|
Gohari, Parham | The University of Texas at Austin |
Wu, Bo | University of Texas at Austin |
Hale, Matthew | University of Florida |
Topcu, Ufuk | The University of Texas at Austin |
Keywords: Stochastic systems, Markov processes, Randomized algorithms
Abstract: As members of a network share more information with each other and network providers, sensitive data leakage raises privacy concerns. To address this need for a class of problems, we introduce a novel mechanism that privatizes vectors belonging to the unit simplex. Such vectors can be seen in many applications, such as privatizing a decision-making policy in a Markov decision process. We use differential privacy as the underlying mathematical framework for these developments. The introduced mechanism is a probabilistic mapping that maps a vector within the unit simplex to the same domain according to a Dirichlet distribution. We find the mechanism well-suited for inputs within the unit simplex because it always returns a privatized output that is also in the unit simplex. Therefore, no further projection back onto the unit simplex is required. We verify the privacy guarantees of the mechanism for two cases, namely, identity queries and average queries. In the former case, we derive expressions for the differential privacy level of privatizing a single vector within the unit simplex. In the latter case, we study the mechanism for privatizing the average of a collection of vectors, each of which is in the unit simplex. We establish a trade-off between the strength of privacy and the variance of the mechanism output, and we introduce a parameter to balance the trade-off between them. Numerical results illustrate these developments.
|
|
17:00-17:20, Paper WeC05.4 | Add to My Program |
Parameter Privacy versus Control Performance: Fisher Information Regularized Control (I) |
|
Ziemann, Ingvar | KTH Royal Institute of Technology |
Sandberg, Henrik | KTH Royal Institute of Technology |
Keywords: Optimal control, Information theory and control, Networked control systems
Abstract: This article introduces and solves a new privacy-related optimization problem for cyber-physical systems where an adversary tries to learn the system dynamics. In the context of linear quadratic systems, we consider the problem of achieving a small cost while balancing the need for keeping knowledge about the model's parameters private. To this end, we formulate a Fisher information regularized version of the linear quadratic regulator with cheap cost. Here the control operator is allowed to not only control the plant but also mask its state by injecting further noise. Within the class of linear policies with additive noise, we solve this problem and show that the optimal noise distribution is Gaussian with state dependent covariance. Next, we prove that the optimal linear feedback law is the same as without regularization. Finally, to motivate our proposed scheme, we formulate for scalar systems an equivalent maximin problem for the worst-case scenario in which the adversary has full knowledge of all other inputs and outputs. Here, our policies are maximin optimal with respect to maximizing the variance over all asymptotically unbiased estimators.
|
|
17:20-17:40, Paper WeC05.5 | Add to My Program |
Secure Networked Control for Decentralized Systems Via Software Rejuvenation (I) |
|
Griffioen, Paul | Carnegie Mellon University |
Romagnoli, Raffaele | Carnegie Mellon University |
Krogh, Bruce H. | Carnegie Mellon Univ |
Sinopoli, Bruno | Washington University in St Louis |
Keywords: Decentralized control, Networked control systems, Fault tolerant systems
Abstract: Decentralized control systems exist in many scenarios where agents have the ability to fully communicate with one another but do not do so for multiple reasons, including cost and the possibility of an adversary infiltrating the system through the communication network. In this paper, we present a procedure that determines when agents should communicate with one another after having been disconnected from the network for a period of time. This procedure does not depend on the type of decentralized control system being used. When agents do communicate with one another, we guarantee the safety and resilience of the system against malicious adversaries by utilizing software rejuvenation, a prevention mechanism against unanticipated and undetectable attacks on cyber-physical systems. Without implementing any detection algorithm, the system is periodically refreshed with a secure and trusted copy of the control software to eliminate any malicious modifications to the run-time code and data that may have corrupted the controller. We present an algorithm that satisfies the conditions necessary to ensure safe recovery while agents communicate with one another. A procedure for calculating parameters that achieve these conditions is presented, and our approach is illustrated via simulation.
|
|
17:40-18:00, Paper WeC05.6 | Add to My Program |
Gain Design Via LMIs to Minimize the Impact of Stealthy Attacks (I) |
|
Hashemi, Navid | University of Texas at Dallas |
Ruths, Justin | University of Texas at Dallas |
Keywords: Fault detection, LMIs, Optimization algorithms
Abstract: The goal of this paper is to design the gain matrices for estimate-based feedback to minimize the impact that falsified sensor measurements can have on the state of a stochastic linear time invariant system. Here we consider attackers that stay stealthy, by raising no alarms, to a chi-squared anomaly detector, thereby restricting the set of attack inputs within an ellipsoidal set. We design linear matrix inequalities (LMIs) to find a tight outer ellipsoidal bound on the convex set of states reachable due to the stealthy inputs (and noise). Subsequently considering the controller and estimator gains as design variables requires further linearization to maintain the LMI structure. Without a competing performance criterion, the solution of this gain design is the trivial uncoupling of the feedback loop (setting either gain to zero). Here we consider - and convexify - an output constrained covariance (OCC) H2 gain constraint on the non-attacked system. Through additional tricks to linearize the combination of these LMI constraints, we propose an iterative algorithm whose core is a combined convex optimization problem to minimize the state reachable set due to the attacker while ensuring a small enough H2 gain during nominal operation.
|
|
WeC06 Invited Session, Ballroom DE |
Add to My Program |
Autonomous Energy Systems: Optimization and Learning |
|
|
Chair: Chakraborty, Indrasis | Lawrence Livermore National Laboratory |
Co-Chair: Paoletti, Simone | Universita' Di Siena |
Organizer: Bay, Christopher | National Renewable Energy Laboratory |
Organizer: Annoni, Jennifer | National Renewable Energy Laboratory |
Organizer: Bernstein, Andrey | National Renewable Energy Lab (NREL) |
Organizer: Kroposki, Ben | National Renewable Energy Laboratory |
|
16:00-16:20, Paper WeC06.1 | Add to My Program |
On the Greedy Placement of Energy Storage Systems in Distribution Grids (I) |
|
Bucciarelli, Martina | University of Siena |
Paoletti, Simone | Universita' Di Siena |
Dall'Anese, Emiliano | University of Colorado Boulder |
Vicino, Antonio | Univ. Di Siena |
Keywords: Power systems, Optimization
Abstract: This paper considers power distribution grids and addresses the problem of finding optimal placement strategies for energy storage systems. The placement problem is, unfortunately, combinatorially complex. A placement strategy with performance guarantees based on submodularity theory and greedy methods is proposed. The greedy method is then compared with a heuristic strategy that relies on voltage sensitivity analysis. The features of both techniques are discussed and illustrated through an application to a test feeder.
|
|
16:20-16:40, Paper WeC06.2 | Add to My Program |
On the Robust Implementation of Projected Dynamical Systems with Anti-Windup Controllers (I) |
|
Hauswirth, Adrian | ETH Zurich |
Dörfler, Florian | Swiss Federal Institute of Technology (ETH) Zurich |
Teel, Andrew R. | Univ. of California at Santa Barbara |
Keywords: Constrained control, Stability of nonlinear systems, Optimization
Abstract: While projected dynamical systems (PDS) are mathematically well-defined and useful for modeling dynamics for constrained optimization and variational inequalities, their physical realization is not immediate. In this paper, we study how anti-windup schemes, which are ubiquitous in feedback control to deal with saturation, can be used to approximate PDS. Namely, we show that a particular class of anti-windup control loops are perturbations of PDS. This allows us to establish results about uniform convergence and robust stability of high-gain anti-windup schemes. We also establish how these insights apply in the context of feedback optimization, popularized recently for power systems and communication networks, and how our results introduce a new class of optimization dynamics that is particularly suited for this application.
|
|
16:40-17:00, Paper WeC06.3 | Add to My Program |
Dynamics-Aware Continuous-Time Economic Dispatch and Optimal Automatic Generation Control (I) |
|
Chakraborty, Pratyush | University of Utah |
Dhople, Sairaj | University of Minnesota |
Chen, Yu Christine | The University of British Columbia |
Parvania, Masood | University of Utah |
Keywords: Smart grid, Power systems
Abstract: In this work, we aim to minimize the cost of generation in a power system while meeting demand in near to real time. The proposed architecture is composed of two sub-problems: continuous-time economic dispatch (CTED) and optimal automatic generation control (OAGC). In its original form, the CTED problem incorporates generator aggregate frequency dynamics, and it is infinite-dimensional. However, we present a computationally tractable function space-based solution method for the proposed problem. We also develop an optimization-based control algorithm for implementing OAGC. Theoretical considerations for decoupling the two problems are explored. We validate the economic efficiency and frequency performance of the proposed method through simulations of a representative power network.
|
|
17:00-17:20, Paper WeC06.4 | Add to My Program |
Transient Safety Filter Design for Grid-Forming Inverters (I) |
|
Kundu, Soumya | Pacific Northwest National Laboratory |
Kalsi, Karan | Pacific Northwest National Lab |
Keywords: Distributed control, Constrained control, Power systems
Abstract: Unlike conventional generators, inverter-based generation do not possess any rotational inertia. While grid-forming inverters can synthesize small (virtual) inertia via advanced feedback control loops, additional control mechanisms are needed to ensure safety and security of the power grid during transients. In this paper, we propose novel real-time safety-constrained feedback controllers (``safety filters'') for droop-based (grid-forming) inverters to ensure transient security of the grid. The safety filter acts as a buffer between the network operational layer and the inverter-control layer, and only lets those dispatch control signals pass to the inverter droop-controller, which are guaranteed to not violate the safety specifications (frequency, voltage, current limits). Using a distributed barrier certificates method, we construct state-inclusive bounds on the allowable control inputs, which guarantee the satisfaction of transient safety specifications. Sum-of-square programming is used to synthesize the safety filters. Numerical simulation results are provided to illustrate the performance of the proposed filter in inverter-based microgrids.
|
|
17:20-17:40, Paper WeC06.5 | Add to My Program |
Stochastic Virtual Battery Modeling of Uncertain Electrical Loads Using Variational Autoencoder (I) |
|
Chakraborty, Indrasis | Lawrence Livermore National Laboratory |
Nandanoori, Sai Pushpak | Pacific Northwest National Laboratory |
Kundu, Soumya | Pacific Northwest National Laboratory |
Kalsi, Karan | Pacific Northwest National Lab |
Keywords: Machine learning, Uncertain systems, Stochastic systems
Abstract: Effective utilization of flexible loads for grid services, while satisfying end-user preferences and constraints, requires an accurate estimation of the aggregated predictive flexibility offered by the electrical loads. Virtual battery (VB) models are often used to quantify the predictive flexibility in thermostatic loads (e.g. residential air-conditioners, electric water-heaters), which model the temporal evolution of a (virtual) energy state via a first order dynamics including self-dissipation rate, and power and energy capacities as parameters. Uncertainties and lack of information regarding end-usage and equipment models render deterministic VB models impractical. In this paper, we introduce the notion of stochastic VB models, and propose a variational autoencoder-based deep learning algorithm to identify the probability distribution of the VB model parameters. Using available sensors and meters data, the proposed algorithm generates not only point estimates of the VB parameters, but also confidence intervals around those values. Effectiveness of the proposed frameworks is demonstrated on a collection of electric water-heater loads, whose operation is driven by uncertain water usage profiles.
|
|
17:40-18:00, Paper WeC06.6 | Add to My Program |
Quantification of Load Flexibility in Residential Buildings Using Home Energy Management Systems (I) |
|
Munankarmi, Prateek | National Renewable Energy Laboratory |
Jin, Xin | National Renewable Energy Laboratory |
Ding, Fei | National Renewable Energy Laboratory |
Zhao, Changhong | The Chinese University of Hong Kong |
Keywords: Smart grid, Building and facility automation, Optimization
Abstract: With increasing penetration of renewable energy resources, the flexibility of operating behind-the-meter (BTM) resources plays a key role in enhancing grid reliability and resilience. Residential buildings with home energy management systems (HEMS) can provide desired flexibility for the distribution system operator (DSO) while considering customer comfort and preferences. This paper discusses a methodology to quantify the flexibility of BTM resources of residential buildings using HEMS. First, we propose a model predictive control framework to formulate the flexibility band comprising nominal, upper, and lower demand profiles. Second, the paper proposes a dispatch method for HEMS to compute the control signals for each BTM resource (e.g., air conditioner, water heater, home battery system) upon receiving a flexibility service request from the DSO. The case study provides insight into the flexibility provided at the whole-home level with different user preferences and seasons. The results demonstrate that HEMS is capable of providing flexibility service at the request of the DSO while delivering primary services to the building occupants.
|
|
WeC07 Invited Session, Plaza Court 7 |
Add to My Program |
Control for Healthcare and Medical Systems II |
|
|
Chair: Hahn, Jin-Oh | University of Maryland |
Co-Chair: Simaan, Marwan A. | University of Central Florida |
Organizer: Hahn, Jin-Oh | University of Maryland |
Organizer: Zhang, Wenlong | Arizona State University |
Organizer: Rajamani, Rajesh | Univ. of Minnesota |
Organizer: Ashrafiuon, Hashem | Villanova University |
|
16:00-16:20, Paper WeC07.1 | Add to My Program |
Advantage of New Ventilation Method for Cardiopulmonary Resuscitation Qualitatively Captured by Simple Respiratory Mechanics Models (I) |
|
Pigot, Henry | Lund University |
Babiera Sancho, Carlos | Universitat Politècnica De València |
Paskevicius, Audrius | Department of Cardiothoracic Surgery, Lund University and Skåne |
Steen, Stig | Department of Cardiothoracic Surgery, Lund University and Skåne |
Soltesz, Kristian | Lund University |
Keywords: Biomedical, Modeling, Linear systems
Abstract: First responders to cardiac arrest depend on cardiopulmonary resuscitation to keep patients alive. A new ventilation method, phase-controlled intermittent insufflation of oxygen, was previously shown to improve heart perfusion during cardiopulmonary resuscitation in a large-animal study, outperforming the best currently known ventilation method. This paper investigates whether the advantage of the new method can be explained using standard linear lumped-parameter models of respiratory mechanics. The simple models were able to qualitatively capture the improvement.
|
|
16:20-16:40, Paper WeC07.2 | Add to My Program |
Impulsive Feedback Modeling of Levodopa Pharmacokinetics Subject to Intermittently Interrupted Gastric Emptying (I) |
|
Runvik, Håkan | Uppsala University |
Medvedev, Alexander V. | Uppsala University |
Kjellsson, Maria | Dep of Pharmaceutical Biosciences, Uppsala Universitet |
Keywords: Biomedical, Hybrid systems
Abstract: A novel modeling approach capturing the multiple peak phenomenon in oral levodopa administration is proposed. Multiple peaks in the blood plasma concentration of the drug are attributed to the effects caused by gastric emptying. The developed model describes the instances of interrupted gastric emptying by an impulsive feedback of the dopamine concentration in the brain acting on the pyloric sphincter. A combination of the continuous levodopa clearing dynamics and the impulsive feedback results in a hybrid model, whose solutions are positive and bounded. The stability properties of the model are studied by means of a Poincaré map describing the propagation of the continuous model states through the firings of the impulsive feedback. The model feasibility is illustrated on data sets obtained in clinical experiments.
|
|
16:40-17:00, Paper WeC07.3 | Add to My Program |
Subspace Identification of a Glucose-Insulin Model Using Meal Tracer Protocol Measurements (I) |
|
Al-Matouq, Ali | Prince Sultan University |
Alshahrani, Mohammed | King Fahd University of Petroleum and Minerals (KFUPM) |
Novara, Carlo | Politecnico Di Torino |
Keywords: Subspace methods, Identification, Biological systems
Abstract: The problem of identifying a low complexity state space model describing glucose and insulin dynamics from low sample meal tracer experiments is investigated. Triple tracer meal protocol measurements (sampled as low as 15 samples per meal) together with continuous glucose monitoring measurements, measured concurrently at a rate of 5 minutes per sample, are used. A new formulation to estimate the missing input and output measurements at such low sample rates is developed. Nuclear norm minimization is used to exploit low rankness of the stacked input and output matrix, while the l1 norm is used to exploit an available sparse basis for the glucose flux profiles. Simulation results, using the UVa Padova simulator, show that the technique outperforms previous methods and also demonstrate the possibility of identifying state space models from triple tracer measurements with good prediction performance under non-ideal conditions.
|
|
17:00-17:20, Paper WeC07.4 | Add to My Program |
Virtual Patient Generation Using Physiological Models through a Compressed Latent Parameterization (I) |
|
Tivay, Ali | University of Maryland |
Kramer, George | University of Texas Medical Branch |
Hahn, Jin-Oh | University of Maryland |
Keywords: Biological systems, Biomedical, Identification
Abstract: This paper presents a data-driven approach to generating virtual patients using mathematical models of physiological processes. Such models often contain a large number of tunable parameters that must be calibrated to capture the observed characteristics of each real patient in a dataset. By sampling from this parameter space, potentially new virtual patients can be generated. However, it is often the case that the resulting set of virtual patients contains members that exhibit physiologically unrealistic behavior. In the present work, we employ a practically important case study on the modeling of cardiovascular responses to hemorrhage and fluid resuscitation in order to demonstrate that subject-specific characteristics observed in a dataset can be alternatively represented within a highly compressed latent parameter space without significant losses in calibration error for each real patient. Then, we show that by sampling from this latent parameter space, it is possible to generate new virtual patients that also exhibit physiologically realistic behavior.
|
|
17:20-17:40, Paper WeC07.5 | Add to My Program |
Evaluating a Hardware-In-The-Loop System Intended for Testing Ventricular-Assist Device Control and Sensing Algorithms (I) |
|
Rapp, Ethan | The University of Texas at Austin |
Pawar, Suraj Rajendra | The University of Texas at Austin |
Gohean, Jeffrey | Windmill Cardiovascular Systems |
Larson, Erik | Windmill Cardiovascular Systems |
Longoria, Raul | University of Texas at Austin |
Keywords: Biomedical, Mechatronics, Control applications
Abstract: This paper presents methods used to evaluate the design and dynamic performance characteristics of a hybrid mock circulatory loop (hMCL). A hMCL platform is a hardware-in-the-loop (HIL) system that integrates numerical cardiovascular models simulated in real-time with physical implantable left ventricular assist devices (LVADs) under test. This approach replaces conventional mock loops by combining physical hardware (LVAD) with virtual systems (simulated models) that communicate through control outputs and sensor inputs. In this work, both model-based and experimental methods are used to evaluate the performance of a hMCL designed using electromechanical voice coil actuators. Of particular interest is the real-time simulation and control of physiological pressure and flowrates experienced by a physical LVAD under test. To be able to evaluate next-generation LVADs and their advanced sensing and control capabilities, it is essential that the hMCL meet specified requirements. Test results show that root-mean-square error between simulated and realized physiological pressures across a range of LVAD flowrates can be maintained within 5-8%. The hMCL is able to simulate different patient conditions, and basic sensitivity tests indicate responsiveness to changes in the simulated model parameters. The latter capability in particular demonstrates the ability for a hMCL of this type to provide a testing platform for LVADs with onboard sensing and estimation algorithms.
|
|
WeC08 Invited Session, Governor's SQ 10 |
Add to My Program |
Mechatronics II |
|
|
Chair: Rajamani, Rajesh | Univ. of Minnesota |
Co-Chair: Zheng, Minghui | University at Buffalo |
Organizer: Oldham, Kenn | University of Michigan, Ann Arbor |
Organizer: Chen, Xu | University of Washington |
|
16:00-16:20, Paper WeC08.1 | Add to My Program |
Electromagnetic Position Estimation Using Active Current Control and Nonlinear Observer (I) |
|
Wang, Heng | University of Minnesota |
Rajamani, Rajesh | Univ. of Minnesota |
Keywords: Estimation, Mechanical systems/robotics, Observers for nonlinear systems
Abstract: This paper proposes an electromagnetic position estimation system suitable for linear actuators. The inexpensive non-contacting position measurement system is composed of an electromagnet on the stationary cylinder and a magnetic sensor on the moving piston rod of the actuator. The current supply to the electromagnet is actively controlled to track a desired current profile based on the instantaneous position estimate. The desired current profile increases monotonically with position to achieve accurate position estimation even for regions with low magnetic sensitivity. A nonlinear observer is designed based on Lyapunov theory to ensure asymptotically stable position estimation and current tracking. The active position system is experimentally validated using a piston-cylinder setup with 20 cm stroke length. Experimental results show that the active position estimation system can achieve 1% measurement accuracy over the entire stroke length while a system with constant current consuming the same average power shows nearly twice the estimation error.
|
|
16:20-16:40, Paper WeC08.2 | Add to My Program |
An Optimization-Based Iterative Learning Control Design Method for UAV's Trajectory Tracking (I) |
|
Adlakha, Revant | University at Buffalo |
Zheng, Minghui | University at Buffalo |
Keywords: Control applications, Robotics, H-infinity control
Abstract: This paper presents an iterative learning control (ILC) design method to improve the unmanned aerial vehicle's (UAV's) tracking performance. ILC is a feedforward control method that aims to improve the tracking performance through learning from errors over iterations in repetitively operated systems. The tracking errors from previous iterations are injected into a learning module, which includes a learning filter and a robust filter, to generate the learning signal and to improve the tracking performance of the current iteration. This paper presents a two-step optimization based design method for these filters. As to the learning filter design, we transform it into a feedback controller design problem for a purposely constructed system. The formulated controller design problem is solved based on H-infinity optimal control theory. After the learning filter is designed, the robust filter is obtained by solving an additional H-infinity optimization problem. Through the proposed two-step optimization-based filter design method, the system’s stability is guaranteed and the learning performance is optimized. The proposed filter design method and the regarding ILC algorithm are applied to the UAV's trajectory tracking system and are validated by numerical studies based on Gazebo, one high-fidelity simulation platform for UAVs.
|
|
16:40-17:00, Paper WeC08.3 | Add to My Program |
Modeling, Identification, and Flow Control for a Microfluidic Device Using a Peristaltic Pump (I) |
|
Smyth, Jason | University of Michigan |
Smith, Kaylee | University of Michigan |
Nagrath, Sunitha | University of Michigan |
Oldham, Kenn | University of Michigan, Ann Arbor |
Keywords: MEMs and Nano systems, Modeling, Mechatronics
Abstract: This paper presents a method for modeling and controlling pressure at the inlet of a microfluidic lab-on-a-chip device using a peristaltic pump. The principle idea is to alter the voltage provided to a DC peristaltic pump based on the pressure measured at the inlet of the microfluidic device, as a simple, low-cost alternative to standard microfluidic flow control instrumentation. The model accounts for varying resistance and periodic peristaltic pump oscillations, accounting for variable viscosity of the fluid. A model capturing major phenomena with respect to pressure and flow at the inlet of the microfluidic device was developed using the extended Bernoulli equation and peristaltic pump geometry. A proportional–integral–derivative (PID) control system was implemented to achieve specified pressure across varying viscosities. Excellent agreement is obtained between experimental and simulation results using the proposed model. This pressure model can be used to determine various pump and fluidic characteristics in operation of a microfluidic lab-on-a-chip device.
|
|
17:00-17:20, Paper WeC08.4 | Add to My Program |
An Audio-Based Fault Diagnosis Method for Quadrotors Using Convolutional Neural Network and Transfer Learning (I) |
|
Liu, Wansong | University at Buffalo |
Chen, Zhu | University at Buffalo |
Zheng, Minghui | University at Buffalo |
Keywords: Fault detection, Emerging control applications, Robotics
Abstract: Quadrotor unmanned aerial vehicles (UAVs) have been developed and applied into several types of workplaces, such as warehouses, which usually involve human workers. The co-existence of human and UAVs brings new challenges to UAVs: potential failure of UAVs may cause risk and danger to surrounding human. Effective and efficient detection of such failure may provide early warning to the surrounding human workers and reduce such risk to human beings as much as possible. One of the most common reasons that cause the failure of the UAV's flight is the physical damage to the propellers. This paper presents a method to detect the propellers’ damage only based on the audio noise caused by the UAV's flight. The diagnostic model is developed based on convolutional neural network (CNN) and transfer learning techniques. The audio data is collected from the UAVs in real time, transformed into the time-frequency spectrogram, and used to train the CNN-based diagnostic model. The developed model is able to detect the abnormal features of the spectrogram and thus the physical damage of the propellers. To reduce the data dependence on the UAV's dynamic models and enable the utilization of the training data from UAVs with different dynamic models, the CNN-based diagnostic model is further augmented by transfer learning. As such, the refinement of the well-trained diagnostic model ground on other UAVs only requires a small amount of UAV's training data. Experimental tests are conducted to validate the diagnostic model with an accuracy of higher than 90%.
|
|
17:20-17:40, Paper WeC08.5 | Add to My Program |
Oriented Pedestrian Social Interaction Modeling and Inference (I) |
|
Dong, Junyi | Cornell University |
Zhu, Pingping | Cornell University |
Ferrari, Silvia | Cornell University |
Keywords: Autonomous systems, Pattern recognition and classification, Machine learning
Abstract: In order to drive and operate safely around humans, future autonomous vehicles will be expected to perceive visual scenes and predict human behaviors beyond explicit visual features. Inferring human interactions, for example, plays an indispensable role in predicting pedestrian trajectories, because social actions such as walking together, gathering, holding hands, and talking, influence where and how people move relative to each other and their environment. Existing methods for semantic action recognition and labeling provide inputs that, while useful to human operators, cannot be used to improve predictions made by autonomous vehicles. This paper presents a graphical model approach for jointly inferring pedestrian interactions from short video clips over time. New Markov random field algorithms are presented for modeling social interactions probabilistically using spatial and temporal observations obtained over short time windows, at a time scale useful for making real-time decisions such as collision avoidance. Experiments conducted using real-world pedestrian streaming videos show that the average interaction-inference accuracy of the proposed approach is approximately 94.6%.
|
|
17:40-18:00, Paper WeC08.6 | Add to My Program |
Time-Delayed Tuning of Vibration Absorbers for Non-Collocated Suppression (I) |
|
Olgac, Nejat | Univ. of Connecticut |
Jenkins, Ryan | University of Connecticut |
Keywords: Delay systems, Mechatronics, Linear systems
Abstract: A conventional actively-tuned vibration absorber aims to remove undesired oscillations at its point of attachment to the primary structure. For tuning, the sacrificial absorber subsection is brought to resonance at the frequency of excitation. Non-collocated action, however, is to create the same suppression effect at a location other than the point of attachment of the absorber. This objective presents an unsolved problem in the systems community. There are many subtleties in this operation, two of which are treated in this paper particularly for lumped-mass chain structures. First is how to induce non-collocated suppression against time-varying excitation frequency using a local feedback control only (i.e., sensor-actuator collocated)? Second is how to assure the system stability during this active tuning operation? The novel feedback control law that answers the first question is inspired from a concept called the “Delayed Resonator”. It utilizes a partial state feedback control but with a surprising time delay addition. For the stability question, a frequency sweeping method and a mathematical paradigm are combined, which provides the stable operating frequency ranges a priori to the execution of the method. We elucidate how the stability constraint appears in practice and provide example case studies for this relatively unexplored field in vibration.
|
|
WeC09 Regular Session, Govenor's SQ 16 |
Add to My Program |
Adaptive Control II |
|
|
Chair: Johnson, Jeffrey Kane | Maeve Automation |
Co-Chair: Schuster, Eugenio | Lehigh University |
|
16:00-16:20, Paper WeC09.1 | Add to My Program |
Adaptive Control of Discrete-Time Systems with Unknown, Unstable Zero Dynamics |
|
Islam, Syed Aseem Ul | University of Michigan |
Nguyen, Tam Willy | University of Michigan |
Kolmanovsky, Ilya V. | The University of Michigan |
Bernstein, Dennis S. | Univ. of Michigan |
Keywords: Adaptive control, Nonlinear output feedback, Indirect adaptive control
Abstract: Adaptive control of systems with poorly known or unmodeled unstable zero dynamics remains a challenging problem. This paper presents an extension of retrospective cost adaptive control (RCAC) called data-driven RCAC (DDRCAC), which does not require that the zero dynamics be known a priori. Instead, the method uses online identification to obtain an approximate model of the plant numerator dynamics for use in the target model of RCAC. DDRCAC is demonstrated numerically on systems with linear and nonlinear unstable zero dynamics that are a priori unknown.
|
|
16:20-16:40, Paper WeC09.2 | Add to My Program |
Active Noise Control for Harmonic and Broadband Disturbances Using RLS-Based Model Predictive Control |
|
Mohseni, Nima | University of Michigan, Ann Arbor |
Nguyen, Tam Willy | University of Michigan |
Islam, Syed Aseem Ul | University of Michigan |
Kolmanovsky, Ilya V. | The University of Michigan |
Bernstein, Dennis S. | Univ. of Michigan |
Keywords: Adaptive control, Predictive control for linear systems, Sampled-data control
Abstract: This paper develops RLS-based MPC (RLSMPC), which uses multiple implementations of recursive least squares (RLS) to perform model predictive control (MPC). RLSMPC uses output-feedback measurements rather than full-state-feedback to construct the control input, thus removing the need for state estimation. To remove the need for an a priori model, RLSMPC uses RLS to perform online, closed-loop identification. This approach is applied to active noise control with unknown sinusoidal and broadband disturbances.
|
|
16:40-17:00, Paper WeC09.3 | Add to My Program |
Adaptive Safety with Control Barrier Functions |
|
Taylor, Andrew | California Institute of Technology |
Ames, Aaron D. | California Institute of Technology |
Keywords: Adaptive control, Robust adaptive control, Uncertain systems
Abstract: Adaptive Control Lyapunov Functions (aCLFs) were introduced 20 years ago, and provided a Lyapunov-based methodology for stabilizing systems with parameter uncertainty. The goal of this paper is to revisit this classic formulation in the context of safety-critical control. This will motivate a variant of aCLFs in the context of safety: emph{adaptive Control Barrier Functions (aCBFs)}. Our proposed approach adaptively achieves safety by keeping the systems state within a safe set even in the presence of parametric model uncertainty. We unify aCLFs and aCBFs into a single control methodology for systems with uncertain parameters in the context of a Quadratic Program (QP) based framework. We validate the ability of this unified framework to achieve stability and safety in an adaptive cruise control (ACC) simulation.
|
|
17:00-17:20, Paper WeC09.4 | Add to My Program |
Recursive Least Squares with Matrix Forgetting |
|
Bruce, Adam | University of Michigan |
Goel, Ankit | University of Michigan |
Bernstein, Dennis S. | Univ. of Michigan |
Keywords: Adaptive systems, Adaptive control, Identification
Abstract: This paper considers an extension of recursive least squares (RLS), where the cost function is modified to include a matrix forgetting factor. Minimization of the modified cost function provides a framework for combined variable-rate and variable-direction (RLS-VRDF) forgetting. This extension of RLS simultaneously addresses two key issues in standard RLS, namely, the need for variable-rate forgetting due to changing plant parameters as well as the need for variable-direction covariance updating due to the loss of persistency. The performance of RSL-VRDF is illustrated by an example with abrupt parameter changes and loss of persistency.
|
|
17:20-17:40, Paper WeC09.5 | Add to My Program |
Nonlinear Adaptive Burn Control and Optimal Control Allocation of Over-Actuated Two-Temperature Plasmas |
|
Graber, Vincent | Lehigh University |
Schuster, Eugenio | Lehigh University |
Keywords: Control applications, Lyapunov methods, Adaptive control
Abstract: Tokamaks are reactors that produce energy from the fusion, or merging, of atomic particles. A suitable reaction rate is achieved by heating a gas of charged particles (free ions and electrons), or plasma, to extreme temperatures. From the fusion of deuterium and tritium ions, a burning plasma produces alpha particles that contribute to the heating of the plasma. Burning plasmas are highly nonlinear systems that require careful regulation of temperature and density, or burn control, to reach desirable operating points. Once constructed, ITER will be the first tokamak designed for burning plasmas. In this work, a Lyapunov-based burn controller is developed using a full zero-dimensional nonlinear model. An adaptive estimator manages the presence of uncertain model parameters. The control objective is to stabilize equilibria despite model nonlinearity and uncertainty. Density is regulated through the injection of fuel pellets. For ITER, the temperature of the ions may differ significantly from that of the electrons in the plasma core. Therefore, the proposed controller considers separate response models for ion and electron energies. For energy control, the controller commands two virtual control efforts: the external ion heating and the external electron heating. To satisfy these two virtual control efforts, ITER will have access to ion cyclotron heating, electron cyclotron heating and two neutral beam injectors. With more actuators than virtual control efforts, the two-temperature plasma system is over- actuated. Actuator redundancy is resolved by constructing an optimal control allocator that considers actuator saturation and rate limits. A simulation study demonstrates the capability of the adaptive control and control allocation algorithms.
|
|
17:40-18:00, Paper WeC09.6 | Add to My Program |
The Colliding Reciprocal Dance Problem: A Mitigation Strategy with Application to Automotive Active Safety Systems |
|
Johnson, Jeffrey Kane | Mapless AI, Inc |
Keywords: Agents-based systems, Adaptive control, Automotive systems
Abstract: A reciprocal dance occurs when two mobile agents attempt to pass each other but incompatible interaction models result in repeated attempts to take mutually blocking actions. Such a situation often results in deadlock, but in systems with significant inertial constraints, it can result in collision. This paper presents this colliding variant of the reciprocal dance, how it arises, and a mitigation strategy that can improve safety without sacrificing flexibility. A demonstration is provided in the context of automotive active safety.
|
|
WeC10 Regular Session, Governor's SQ 11 |
Add to My Program |
Autonomous Robots II |
|
|
Chair: Khalil, Hassan K. | Michigan State Univ |
Co-Chair: Lee, Kooktae | New Mexico Tech |
|
16:00-16:20, Paper WeC10.1 | Add to My Program |
A Fully Distributed Motion Coordination Strategy for Multi-Robot Systems with Local Information |
|
Yu, Pian | School of Electrical Engineering and Computer Science, KTH Royal |
Dimarogonas, Dimos V. | KTH Royal Institute of Technology |
Keywords: Autonomous robots, Distributed control, Intelligent systems
Abstract: This paper investigates the online motion coordination problem for a group of mobile robots moving in a shared workspace. Based on the realistic assumptions that each robot is subject to both velocity and input constraints and can have only local view and local information, a fully distributed multi-robot motion coordination strategy is proposed. Building on top of a cell decomposition, a conflict detection algorithm is presented first. Then, a rule is proposed to assign dynamically a planning order to each pair of neighboring robots, which is proven to be deadlock-free. Finally, a two-step motion planning process that combines fixed-path planning and trajectory planning is designed. The effectiveness of the resulting solution is verified by a simulation example.
|
|
16:20-16:40, Paper WeC10.2 | Add to My Program |
Robust Tracking of an Unknown Trajectory with a Multi-Rotor UAV: A High-Gain Observer Approach |
|
Boss, Connor J. | Michigan State University |
Srivastava, Vaibhav | Michigan State University |
Khalil, Hassan K. | Michigan State Univ |
Keywords: Autonomous robots, Nonlinear output feedback, Uncertain systems
Abstract: We study a trajectory tracking problem for a multi-rotor in the presence of modeling error and external disturbances. The desired trajectory is unknown and generated from a reference system with unknown or partially known dynamics. We assume that only position and orientation measurements for the multi-rotor and position measurements for the reference system can be accessed. We adopt an extended high-gain observer (EHGO) estimation framework to estimate the feedforward term required for trajectory tracking, the multi-rotor states, as well as modeling error and external disturbances. We design an output feedback controller for trajectory tracking that comprises a feedback linearizing controller and the EHGO. We rigorously analyze the proposed controller and establish its stability properties. Finally, we numerically illustrate our theoretical results using the example of a multi-rotor landing on a ground vehicle.
|
|
16:40-17:00, Paper WeC10.3 | Add to My Program |
Design of Robust Path-Following Control System for Self-Driving Vehicles Using Extended High-Gain Observer |
|
Al-Nadawi, Yasir | Michigan State University |
Al-Qassab, Hothaifa | Michigan State University |
Kent, Daniel | Michigan State University |
Pang, Su | Michigan State University |
Srivastava, Vaibhav | Michigan State University |
Radha, Hayder | Michigan State University |
Keywords: Autonomous robots, Observers for nonlinear systems, Nonlinear output feedback
Abstract: We present a robust path-following control of a self-driving vehicle under mismatched perturbations due to the effect of parametric uncertainties, vehicle side-slip angle, and road banking. In particular, the proposed control framework includes two parts. The first part ensures that the lateral and the yaw dynamics behave with nominal desired dynamics by canceling undesired dynamics. The second part is composed of two extended high-gain observers to estimate the system state variables and the perturbation terms. The proposed controller is implemented on an autonomous vehicle research platform and tested in different road conditions that include flat, inclined, and banked roads. The experimental results show the effectiveness of the controller, they also illustrate the capability of the controller in achieving comparable performance under inclined and banked roads as compared to flat roads under a range of longitudinal velocities.
|
|
17:00-17:20, Paper WeC10.4 | Add to My Program |
Feedback Linearizing Controllers on SO(3) Using a Global Parametrization |
|
Akhtar, Adeel | University of Waterloo |
Saleem, Sajid | Georgia Institute of Technology |
Waslander, Steven L. | University of Waterloo |
Keywords: Autonomous robots, Robotics, Feedback linearization
Abstract: We present a methodology for studying the stabilization problem of a fully-actuated rotating rigid body. Since a rigid body attitude is represented by a rotation matrix in three dimensions, we exploit this fact and use each element of the rotation matrix as a parameter. This nine-parameter representation is global as well as unique, and results in a simplified set of nonlinear differential equations. We apply feedback linearization to design both local and almost global controllers. We also propose two novel definitions of feedback linearization functions, and prove that they lead to a well-defined vector relative degree and, as a result, almost-globally and locally stable controllers with bounded internal states. Using the proposed methodology, we present detailed examples of two such functions, demonstrating stabilization performance for each resulting controller on a rigid body system.
|
|
17:20-17:40, Paper WeC10.5 | Add to My Program |
Receding-Horizon Ergodic Exploration Planning Using Optimal Transport Theory |
|
Kabir, Rabiul Hasan | New Mexico Institute of Mining and Technology |
Lee, Kooktae | New Mexico Tech |
Keywords: Autonomous robots, Robotics, Optimization
Abstract: This paper addresses the ergodic exploration problem based on the optimal transport theory. The ergodic exploration has been actively investigated due to its wide applicability. Most of the previous methods to realize the ergodicity in robot exploration problems are based on the Fourier basis function, which contains some technical issues. In this paper, we propose a new method to yield ergodic dynamics for a robot in a receding-horizon manner while avoiding issues stemming from the Fourier basis function. The optimal transport theory that quantifies the distance between two probability density functions is employed as a tool to measure as well as to realize ergodicity. A computationally efficient method is derived to measure the performance of the proposed algorithm. Finally, simulation results are provided for two different scenarios - uniform and nonuniform distributions, to validate the proposed method.
|
|
17:40-18:00, Paper WeC10.6 | Add to My Program |
Testing-And-Evaluation Platform for Haptics-Based Aerial Manipulation with Drones |
|
Kim, Dongbin | University of Nevada, Las Vegas |
Oh, Paul | University of Nevada Las Vegas |
Keywords: Robotics, Human-in-the-loop control, Autonomous robots
Abstract: This paper presents a haptics-based testing-and- evaluation platform for drone-based aerial manipulation. This platform serves towards the designs of a human-in-the-loop approach to dexterous manipulation tasks. The notion stems from using drones to perform tasks like sensor insertion, object positioning, and tool handling for operations like bridge deck maintenance, agricultural crop harvesting, and field services. Presented are the platform design, force sensing and displacement results, and indoor flight tests.
|
|
WeC11 Regular Session, Director's Row I |
Add to My Program |
Agent-Based Systems II |
|
|
Chair: He, Jianping | Shanghai Jiao Tong University |
Co-Chair: Marden, Jason R. | University of California, Santa Barbara |
|
16:00-16:20, Paper WeC11.1 | Add to My Program |
Attack Detection of Nonlinear Distributed Control Systems |
|
Zhang, Xu | Penn State University |
Lu, Yang | Pennsylvania State University |
Zhu, Minghui | Pennsylvania State University |
Keywords: Agents-based systems, Distributed control, Estimation
Abstract: This paper considers a class of nonlinear distributed control systems subject to false data injection attacks, Byzantine attacks and switching attacks. The problem of attack detection is formulated as the simultaneous recovery of system states, attack vectors and system mode of a switched nonlinear system. In the proposed attack detection algorithm, the inverse system of each mode aims to estimate system states and attack vectors when the corresponding mode is input-output decoupled. A set-valued mode index map gives all modes which generate a switch-singular pair. A machine learning example is used to validate the performance of the developed algorithm.
|
|
16:20-16:40, Paper WeC11.2 | Add to My Program |
Differentially Private Interval Observer Design with Bounded Input Perturbation |
|
Degue, Kwassi Holali | Ecole Polytechnique De Montreal and GERAD |
Le Ny, Jerome | Polytechnique Montreal |
Keywords: Observers for Linear systems, Agents-based systems, Networked control systems
Abstract: Real-time data processing for emerging systems such as intelligent transportation systems requires estimating variables based on privacy-sensitive data gathered from individuals, e.g., their location traces. In this paper, we present a privacy-preserving interval observer architecture for a multi-agent system, where a bounded privacy-preserving noise is added to each participant’s data and is subsequently taken into account by the observer. The estimates published by the observer guarantee differential privacy for the agents’ data, which means that their statistical distribution is not too sensitive to certain variations in any single agent’s signal. A numerical simulation illustrates the behavior of the proposed architecture.
|
|
16:40-17:00, Paper WeC11.3 | Add to My Program |
Unpredictable Trajectory Design for Mobile Agents |
|
Li, Jialun | Shanghai Jiao Tong University |
He, Jianping | Shanghai Jiao Tong University |
Li, Yushan | Shanghai Jiao Tong University |
Guan, Xin-Ping | Shanghai Jiao Tong University |
Keywords: Agents-based systems, Stochastic optimal control, Autonomous systems
Abstract: Mobileagentshaveattractedconsiderableattentions for their wide applications in civilian and military operations, where motion planning plays an important role when agents operate in physical world. During this process, the agents are prone to path information leakage and malicious attacks, suffering individual malfunction or even mission failure. In order to hide the goal position information contained in the trajectory and evade physical interception attack, this paper studies unpredictable trajectory design for mobile agents. The major challenges lie in two parts. First, how to determine the optimal form of control for one agent, in face of unknown measurement accuracy and prediction algorithm of attacker. Second, how to extend the control method of one agent to multiple agents with coupled dynamics. The novelty of our work is threefold: i) Leveraging the stochastic control method, the trajectory design problem is formulated as optimization problem universal for various prediction methods; ii) In the sense of expectation and probability measure, two kinds of optimal distributions of stochastic control for secure movement are obtained. iii) The method is extended to multiple agents in formation and the consequent performance degradation of formation convergence is quantified. Simulations demonstrate and verify the effectiveness of the proposed approach.
|
|
17:00-17:20, Paper WeC11.4 | Add to My Program |
Distributed Submodular Maximization with Parallel Execution |
|
Sun, Haoyuan | California Institute of Technology |
Grimsman, David | UC Santa Barbara |
Marden, Jason R. | University of California, Santa Barbara |
Keywords: Agents-based systems, Optimization algorithms, Sensor networks
Abstract: The submodular maximization problem is widely applicable in many engineering problems where objectives exhibit diminishing returns. While this problem is known to be NP-hard for certain subclasses of objective functions, there is a greedy algorithm which guarantees approximation at least 1/2 of the optimal solution. This greedy algorithm can be implemented with a set of agents, each making a decision sequentially based on the choices of all prior agents. In this paper, we consider a generalization of the greedy algorithm in which agents can make decisions in parallel, rather than strictly in sequence. In particular, we are interested in partitioning the agents, where a set of agents in the partition all make a decision simultaneously based on the choices of prior agents, so that the algorithm terminates in limited iterations. We provide bounds on the performance of this parallelized version of the greedy algorithm and show that dividing the agents evenly among the sets in the partition yields an optimal structure. It is shown that such optimal structures holds even under very relaxed information constraints. We additionally show that this optimal structure is still near-optimal, even when additional information (i.e., total curvature) is known about the objective function.
|
|
17:20-17:40, Paper WeC11.5 | Add to My Program |
Resilient Distributed Hypothesis Testing with Time-Varying Network Topology |
|
Wu, Bo | University of Texas at Austin |
Carr, Steven Paull | The University of Texas at Austin |
Bharadwaj, Sudarshanan | University of Texas, Austin |
Xu, Zhe | University of Texas, Austin |
Topcu, Ufuk | The University of Texas at Austin |
Keywords: Agents-based systems, Fault tolerant systems, Distributed control
Abstract: We study the problem of distributed hypothesis testing, where a team of mobile agents aims to agree on the true hypothesis (out of a finite set of hypotheses) that best explains a sequence of their local and possibly noisy observations. The setting requires team collaborations through a time-varying network topology due to mobility and limited communication range. We also assume that there is an unknown subset of compromised agents that may deliberately share wrong information to undermine the team objective. We propose a distributed algorithm where each agent maintains two sets of beliefs (i.e., probability distributions over hypotheses), namely emph{local} and emph{actual} belief. For each agent at each time step, the local belief is updated based on its local observations. Then the actual belief is updated with its local belief and shared actual beliefs from the other agents within the communication range. We show that the actual belief of each non-adversarial agent converges almost surely to the true hypothesis. Unlike most of the existing literature, we guarantee the convergence without a connectivity constraint of the time-varying network topology.
|
|
17:40-18:00, Paper WeC11.6 | Add to My Program |
An Algorithm for Multi-Objective Multi-Agent Optimization |
|
Blondin, Maude J | University of Florida |
Hale, Matthew | University of Florida |
Keywords: Agents-based systems, Optimization
Abstract: Multi-agent optimization problems with many objective functions have drawn much interest over the past two decades. Many works on the subject minimize the sum of objective functions, which implicitly carries a decision about the problem formulation. Indeed, it represents a special case of a multi-objective problem, in which all objectives are prioritized equally. To the best of our knowledge, multi-objective optimization applied to multi-agent systems remains largely unexplored. Therefore, we propose a distributed algorithm that allows the exploration of Pareto optimal solutions for the non-homogeneously weighted sum of objective functions. In the problems we consider, each agent has one objective function to minimize based on a gradient method. Agents update their decision variables by exchanging information with other agents in the network. Information exchanges are weighted by each agent's individual weights that encode the extent to which they prioritize other agents' objectives. This paper provides a proof of convergence, performance bounds, and explicit limits for the results of their computations. Simulation results with different sizes of networks demonstrate the efficiency of the proposed approach and how the choice of weights impacts the agents' final result.
|
|
WeC12 Regular Session, Director's Row E |
Add to My Program |
Estimation II |
|
|
Chair: Jorques Moreno, Carlos | Scania CV AB |
Co-Chair: Daher, Naseem | American University of Beirut |
|
16:00-16:20, Paper WeC12.1 | Add to My Program |
Analysis of Resilience for a State Estimator for Time-Discrete Linear Systems |
|
Kircher, Alexandre | Laboratoire Ampère, Ecole Centrale De Lyon |
Bako, Laurent | Ecole Centrale De Lyon |
Blanco, Eric | Ecole Centrale De Lyon |
Benallouch, Mohamed | ECAM Lyon (École Catholique D'arts Et Métiers) |
Korniienko, Anton | Ecole Centrale De Lyon, Laboratoire Ampère |
Keywords: Estimation, Fault accomodation
Abstract: This paper proposes to analyze the resilient properties of a specific state estimator for LTI discrete-time systems. The dynamic equation of the system is assumed to be affected by a bounded process noise. As to the available measurements, they are potentially corrupted by a noise of both dense and impulsive natures. In this setting, we define an estimator as the map which associates to the measurements, the minimizing set of an appropriate (convex) performance function. It is then shown that the proposed estimator enjoys the property of resilience, that is, it induces an estimation error which, under certain conditions, is independent of the extreme values of the (impulsive) measurement noise. Therefore, the estimation error may be bounded while the measurement noise is virtually unbounded. Moreover, the expression of the bound depends explicitly on the degree of observability of the system being observed and on the considered performance function. Finally, a few simulation results are provided to illustrate the resilience property.
|
|
16:20-16:40, Paper WeC12.2 | Add to My Program |
Toward Tractable Global Solutions to Bayesian Point Estimation Problems Via Sparse Sum-Of-Squares Relaxations |
|
Rodrigues, Diogo | University of California, Berkeley |
Abdalmoaty, Mohamed | KTH |
Hjalmarsson, Håkan | KTH Royal Inst. of Tech |
Keywords: Estimation, Identification, LMIs
Abstract: Bayesian point estimation is commonly used for system identification owing to its good properties for small sample sizes. Although this type of estimator is usually nonparametric, Bayes estimates can also be obtained for rational parametric models, which is often of interest. However, as in maximum-likelihood methods, the Bayes estimate is typically computed via local numerical optimization that requires good initialization and cannot guarantee global optimality. In this contribution, we propose a computationally tractable method that computes the Bayesian parameter estimates with posterior certification of global optimality via sum-of-squares polynomials and sparse semidefinite relaxations. It is shown that the method is applicable to certain discrete-time linear models, which takes advantage of the rational structure of these models and the sparsity in the Bayesian parameter estimation problem. The method is illustrated on a simulation model of a resonant system that is difficult to handle when the sample size is small.
|
|
16:40-17:00, Paper WeC12.3 | Add to My Program |
Bayesian Method for Fuel Mass Estimation of Short Pilot Injections Based on Its Misfire Probability |
|
Jorques Moreno, Carlos | Scania CV AB |
Stenlåås, Ola | Scania CV AB |
Tunestål, Per | Lund University, Faculty of Engineering |
Keywords: Estimation, Identification, Modeling
Abstract: A fuel mass estimation method for short pilot diesel injections is proposed and analyzed in this article. Previous studies showed that the pilot misfire ratio was more strongly correlated with the fuel mass than the on-time. This characteristic is exploited for the fuel mass estimation in a region where it is otherwise challenging to get good estimation accuracy due to the low signal-to-noise ratio, such as by rail pressure measurements or in-cylinder pressure for heat release estimation. The suggested method uses a Bayesian approach where the calibrated injectors, the pilot misfire ratio and the misfire detection are stochastically modelled. The effect of the different model parameters and dispersion on the estimator properties are analyzed. Experimental results in a Scania D13 Diesel engine confirm the improvement in the pilot mass estimation, for the regions within the transition from full misfire to full combustion. In this region, a 60% reduction in the estimation error was obtained, from 0.66mg to 0.27mg standard deviation.
|
|
17:00-17:20, Paper WeC12.4 | Add to My Program |
Pole and Residue Estimation from Impulse Response Data: New Error Bounding Techniques |
|
Maruf, Abdullah Al | Washington State University |
Roy, Sandip | Washington State University |
Keywords: Estimation, Identification, Stochastic systems
Abstract: Estimates of nonrandom pole and residue parameters from noisy impulse-response data are characterized. Specifically, Barankin-type lower bounds (BB) on the estimation error variance of unbiased estimators are developed for single-input single-output systems with multiple but distinct real poles. Two variants of the Barankin-type bound are compared with the widely-used Cramer-Rao lower bound (CRB) in examples. The BB is found to significantly improve on the CRB when noise levels are high compared to the impulse response signal, indicating limited effectiveness of the CRB for unbiased estimators in this low signal-to-noise regime. In addition, an apparent paradox in the error bounds for low signal-to-noise ratios (SNR), which arises because the bounds are limited to unbiased estimators, is explored. This paradox suggests the use of biased estimators for pole estimation specially in low SNR settings. Two simple constructions of biased estimators are developed, which demonstrate lower mean square errors than the BB in low SNR regimes in examples.
|
|
17:20-17:40, Paper WeC12.5 | Add to My Program |
Accurate Real-Time Estimation of the Inertia Tensor of Package Delivery Quadrotors |
|
Dhaybi, Mohamad | American University of Beirut |
Daher, Naseem | American University of Beirut |
Keywords: Estimation, Identification for control, Closed-loop identification
Abstract: The need for quadrotors to provide grasping and payload carrying abilities is ever-growing in several industries. Additional payloads attached to a quadrotor alter its dynamics and eventually affect its control system’s desired performance. In this work, an accurate real-time estimation of the varying mass and inertia tensor parameters of a quadrotor carrying a variable payload is proposed. The parameter estimation is performed via a recursive least squares algorithm that is implemented on the quadrotor’s dynamic model using measured input-output data. Covariance resetting is integrated into the algorithm to increase the convergence rate and accuracy of the obtained estimates. The vertical motion is used to estimate the mass of the system, whereas the rotational motions around the x-, y-, and z-axes are used to identify the elements of the 3x3 inertia tensor matrix. The experiment is designed such that a persistently exciting input is generated to guarantee the convergence of the parameter estimates towards their true values. The proposed identification scheme is validated in numerical simulations and experimentation on a real-life quadrotor, the Quanser QBall-2. The obtained results demonstrate the accuracy and convergence rate of the designed estimator, paving the way in front of its integration into an adaptive control system.
|
|
17:40-18:00, Paper WeC12.6 | Add to My Program |
Fitting a Kalman Smoother to Data |
|
Barratt, Shane | Stanford University |
Boyd, Stephen | Stanford University |
Keywords: Estimation, Kalman filtering, Identification
Abstract: This paper considers the problem of fitting the parameters in a Kalman smoother to data. We formulate the Kalman smoothing problem with missing measurements as a constrained least squares problem and provide an efficient solution method based on sparse linear algebra. We then introduce the Kalman smoother tuning problem, which seeks to adjust parameters in the Kalman smoother to achieve low prediction error on held out measurements. We derive a Kalman smoother auto-tuning algorithm, which is based on the proximal gradient method, that finds good, if not the best, parameters for a given dataset. Central to our method is the computation of the gradient of the prediction error on the held out measurements with respect to the parameters of the Kalman smoother; we describe how to compute the gradient at little to no additional cost. We demonstrate the method on population migration within the United States as well as data collected from a smartphone's IMU+GPS system while driving.
|
|
WeC13 Regular Session, Plaza Court 1 |
Add to My Program |
Robust Control II |
|
|
Chair: Abou Jaoude, Dany | American University of Beirut |
Co-Chair: Islam, Shafiqul | Xavier University of Louisiana |
|
16:00-16:20, Paper WeC13.1 | Add to My Program |
Robust Data-Driven State-Feedback Design |
|
Berberich, Julian | University of Stuttgart |
Koch, Anne | University of Stuttgart |
Scherer, Carsten W. | University of Stuttgart |
Allgöwer, Frank | University of Stuttgart |
Keywords: Robust control, Identification, Learning
Abstract: We consider the problem of designing robust state-feedback controllers for discrete-time linear time-invariant systems, based directly on measured data. The proposed design procedures require no model knowledge, but only a single open-loop data trajectory, which may be affected by noise. First, a data-driven characterization of the uncertain class of closed-loop matrices under state-feedback is derived. By considering this parametrization in the robust control framework, we design data-driven state-feedback gains with guarantees on stability and performance, containing, e.g., the H∞-control problem as a special case. Further, we show how the proposed framework can be extended to take partial model knowledge into account. The validity of the proposed approach is illustrated via a numerical example.
|
|
16:20-16:40, Paper WeC13.2 | Add to My Program |
Optimal Selection of Basis Functions for Robust Tracking Control of Linear Systems Using Filtered Basis Functions |
|
Ramani, Keval | University of Michigan, Ann Arbor |
Okwudire, Chinedum | University of Michigan |
Keywords: Robust control, Optimal control
Abstract: There is growing interest in the use of the filtered basis functions (FBF) approach for feedforward tracking control of linear systems. The FBF approach expresses the control input to the plant as a linear combination of basis functions. The basis functions are forward filtered through the plant dynamics and the coefficients of the linear combination are selected such that the tracking error is minimized. It has been demonstrated that the FBF approach is more versatile compared to other methods in the literature. However, the tracking accuracy of the FBF approach deteriorates in the presence of model uncertainty, much like it does with other feedforward control methods. But, unlike other methods, the FBF approach presents flexibility in terms of the choice of the basis functions, which can be used to improve its accuracy in the presence of model uncertainty. This paper analyzes the effect of choice of the basis functions on the tracking accuracy of FBF, in the presence of uncertainty, using the Frobenius norm of the lifted system representation of FBF’s error dynamics. Based on the analysis, a methodology for optimal selection of basis functions is presented. The effectiveness of the proposed methodology is demonstrated using examples. Large improvements in robustness are observed using the proposed optimal set of basis functions compared to popular basis functions, viz., B-splines, discrete cosine transform and block pulse functions.
|
|
16:40-17:00, Paper WeC13.3 | Add to My Program |
A Two-Step LMI Scheme for H2-H-Infinity Control Design |
|
He, Tianyi | Michigan State University |
Zhu, Guoming | Michigan State University |
Chen, Xiang | University of Windsor |
Keywords: Robust control, Uncertain systems, H-infinity control
Abstract: In this paper, a two-step H2-H-infinity control design scheme with guaranteed mixed H2 and H-infinity performance is proposed. Different from the traditional H2/H-infinity control, the proposed method designs an H2 controller for a nominal plant and then designs an extra Q operator to recover robustness in H-infinity sense for the closed-loop system. When the system uncertainty occurs, operator Q is triggered by a residual signal due to the error between the nominal model and the actual plants, and an extra control signal is generated by operator Q to compensate the nominal H2 controller. It is noted that the proposed H2-H-infinity design scheme provides an additional design freedom to reduce conservativeness, comparing with the traditional mixed H2/H-infinity control. The control design in the Linear Matrix Inequality (LMI) approach is applied to synthesize the H2-H-infinity controller. Simulation results of a numerical example are given to demonstrate that H2-H-inifinity control design is able to compensate the nominal H2 control and significantly improve system performance in presence of system uncertainty. Moreover, two-step H2-H-infiniry control renders better state responses than the traditional mixed H2/H-infinity control.
|
|
17:00-17:20, Paper WeC13.4 | Add to My Program |
Finite Horizon Robust Synthesis |
|
Buch, Jyot | University of Minnesota, Minneapolis |
Seiler, Peter | University of Michigan, Ann Arbor |
Keywords: Robust control, Uncertain systems, Time-varying systems
Abstract: This paper presents a robust synthesis algorithm for uncertain linear time-varying (LTV) systems on finite horizons. The uncertain system is described as an interconnection of a known LTV system and a perturbation. The input-output behavior of the perturbation is described by time-domain Integral Quadratic Constraints (IQCs). The objective is to synthesize a controller to minimize the worst-case performance. This leads to a nonconvex optimization. The proposed approach alternates between an LTV synthesis step and an IQC analysis step. This is analogous to the existing D-K iteration method. Both L 2 and terminal Euclidean norm penalties on output are considered for finite horizon performance. A simple example is provided to demonstrate the proposed algorithm.
|
|
17:20-17:40, Paper WeC13.5 | Add to My Program |
Guaranteed Output Bounds Using Performance Integral Quadratic Constraints |
|
Abou Jaoude, Dany | American University of Beirut |
Farhood, Mazen | Virginia Tech |
Keywords: Robust control, Uncertain systems, Time-varying systems
Abstract: This paper adopts the dissipativity approach to robustness analysis using integral quadratic constraints (IQCs). The nominal part of the uncertain system is a discrete-time, linear time-varying system. Generalized performance criteria are defined using time-domain IQCs. The derived robust performance theorem allows for incorporating available knowledge about the disturbance sets by means of signal IQCs. A novel way to compute point-wise bounds on the performance outputs is proposed. The developed results are illustrated by examples.
|
|
17:40-18:00, Paper WeC13.6 | Add to My Program |
Robust Adaptive Finite-Time Tracking Control for Unmanned Aerial Vehicle with Uncertainty |
|
Islam, Shafiqul | Xavier University of Louisiana |
Dias, Jorge | University of Coimbra |
Xiros, Nikolas | University of New Orleans |
Keywords: Robust control
Abstract: This paper investigates finite-time stability and tracking control problem of multirotor unmanned aerial vehicle in the presence of the modeling errors and external disturbances uncertainty. The algorithms for autonomous position and attitude flight tracking system are designed with the help ofLyapunov and nonlinear terminal sliding mode control theorem. Robust and adaptive learning algorithms for both position and attitude dynamics are designed to learn and compensate the modeling errors and external disturbances. Convergence analysis shows that the design can ensure finite-time stability and tracking property of the position and attitude subsystem motion dynamics of the underactuated complex aerial vehicle. The proposed design provides finite-time convergence as opposed to the existing asymptotic results for the multirotor aerial vehicle. The design does not need exact bound of the uncertainty that appears from external disturbance and the modeling errors of the position and attitude subsystem dynamics. The proposed finite-time design ensures faster and robust tracking in the presence of uncertainty as opposed to existing asymptotic designs.
|
|
WeC14 Invited Session, Plaza Court 8 |
Add to My Program |
Estimation and Control of PDE Systems II |
|
|
Chair: Demetriou, Michael A. | Worcester Polytechnic Institute |
Co-Chair: Heinke, Simon | Hamburg University of Technology |
Organizer: Demetriou, Michael A. | Worcester Polytechnic Institute |
Organizer: Fahroo, Fariba | AFOSR |
|
16:00-16:20, Paper WeC14.1 | Add to My Program |
Distributed Controller Design for Systems Interconnected Over Chordal Graphs (I) |
|
Heinke, Simon | Hamburg University of Technology |
Schug, Ann-Kathrin | Hamburg University of Technology |
Werner, Herbert | Hamburg University of Technology |
Keywords: Distributed control, Networked control systems, Large-scale systems
Abstract: In this paper we consider the problem of designing distributed H2 suboptimal controllers for continuous-time networked systems in a distributed fashion, when both the plant and the controller are interconnected over the same chordal network. Combining results for networked systems and sparse semidefinite optimization, it is possible to reduce the conservatism introduced by the decomposition of the synthesis problem compared to existing methods, while at the same time also reducing the computational complexity.
|
|
16:20-16:40, Paper WeC14.2 | Add to My Program |
Adaptive Control of a Scalar 1-D Linear Hyperbolic PDE with Uncertain Transport Speed Using Boundary Sensing (I) |
|
Anfinsen, Henrik | NTNU |
Holta, Haavard | NTNU |
Aamo, Ole Morten | NTNU |
Keywords: Adaptive control, Linear systems, Distributed parameter systems
Abstract: We solve an adaptive boundary control problem for an 1-D linear hyperbolic partial differential equation (PDE) with an uncertain in-domain source parameter and uncertain transport speed using boundary sensing only. Convergence of the parameters to their true values is achieved in finite-time. Since linear hyperbolic PDEs are finite-time convergent in the non-adaptive case, finite-time parameter convergence leads to the system state converging in finite-time. This is achieved by combining a recently derived transport speed estimation scheme using boundary sensing only, with the swapping scheme for hyperbolic PDEs and a least-squares identifier of an event-triggering type. The method is demonstrated in simulations.
|
|
16:40-17:00, Paper WeC14.3 | Add to My Program |
Functional Estimation of Perturbed Positive Real Infinite Dimensional Systems Using Adaptive Compensators (I) |
|
Demetriou, Michael A. | Worcester Polytechnic Institute |
Keywords: Distributed parameter systems, Direct adaptive control
Abstract: This paper extends earlier results on the adaptive estimation of nonlinear terms in finite dimensional systems utilizing a reproducing kernel Hilbert space to a class of positive real infinite dimensional systems. The simplest class of strictly positive real infinite dimensional systems has collocated input and output operators with the state operator being the generator of an exponentially stable C_{0} semigroup on the state space X. The parametrization of the nonlinear term is considered in a reproducing kernel Hilbert space Q and together with the adaptive observer, results in an evolution system considered in Xtimes Q. Using Lyapunov-redesign methods, the adaptive laws for the parameter estimates are derived and the well-posedness of the resulting evolution error system is summarized. The adaptive estimate of the unknown nonlinearity is subsequently used to compensate for the nonlinearity. A special case of finite dimensional systems with an embedded reproducing kernel Hilbert space to handle the nonlinear term is also considered and the convergence results are summarized. A numerical example on a one-dimensional diffusion equation is considered.
|
|
17:00-17:20, Paper WeC14.4 | Add to My Program |
Boundary Control of Coupled Hyperbolic PDEs for Two-Dimensional Vibration Suppression of a Deep-Sea Construction Vessel (I) |
|
Wang, Ji | University of California, San Diego |
Krstic, Miroslav | University of California, San Diego |
Keywords: Distributed parameter systems, Flexible structures, Control applications
Abstract: This paper presents a state-feedback boundary control design of a class of coupled hyperbolic PDE-ODE systems, characterized by spatially-varying coefficients and a time-varying domain, which physically describes lateral-longitudinal coupled vibrations of a deep-sea construction vessel used to install oil drilling equipment on the seafloor in deep-sea oil exploration. The exponential stability of the close | |