Control Problems Research Articles

Neurofeedback and meditation technology in outpatient offender treatment: a feasibility and usability pilot study.

Although Cognitive Behavioral Therapy (CBT) is the most often used intervention in forensic treatment, its effectivity is not consistently supported. Interventions incorporating knowledge from neuroscience could provide for more successful intervention methods. The current pilot study set out to assess the feasibility and usability of the study protocol of a 4-week neuromeditation training in adult forensic outpatients with impulse control problems. The neuromeditation training, which prompts awareness and control over brain states of restlessness with EEG neurofeedback, was offered in addition to treatment as usual (predominantly CBT). Eight patients completed the neuromeditation training under guidance of their therapists. Despite some emerging obstacles, overall, the training was rated sufficiently usable and feasible by patients and their therapists. The provided suggestions for improvement can be used to implement the intervention in treatment and set up future trials to study the effectiveness of neuromeditation in offender treatment.

Infinite Horizon Mean-Field Linear Quadratic Optimal Control Problems with Jumps and the Related Hamiltonian Systems

Infinite Horizon Mean-Field Linear Quadratic Optimal Control Problems with Jumps and the Related Hamiltonian Systems

A Comparative Study of Traffic Signal Control Based on Reinforcement Learning Algorithms

In recent years, the increasing production and sales of automobiles have led to a notable rise in congestion on urban road traffic systems, particularly at ramps and intersections with traffic signals. Intelligent traffic signal control represents an effective means of addressing traffic congestion. Reinforcement learning methods have demonstrated considerable potential for addressing complex traffic signal control problems with multidimensional states and actions. In this research, the team propose Q-learning and Deep Q-Network (DQN) based signal control frameworks that use variable phase sequences and cycle times to adjust the order and the duration of signal phases to obtain a stable traffic signal control strategy. Experiments are simulated using the traffic simulator Simulation of Urban Mobility (SUMO) to test the average speed and the lane occupancy rate of vehicles entering the ramp to evaluate its safety performance and test the vehicle’s traveling time to assess its stability. The simulation results show that both reinforcement learning algorithms are able to control cars in dynamic traffic environments with higher average speed and lower lane occupancy rate than the no-control method and that the DQN control model improves the average speed by about 10% and reduces the lane occupancy rate by about 30% compared to the Q-learning control model, providing a higher safety performance.

Continuous Time Algebraic Riccati Equation Solution for Second Order Systems

Abstract The continuous time algebraic Riccati equation (ARE) is often utilized in control, estimation, and optimization. For a linear system with a second order structure, the ARE required to be solved to get the control values in standard control problems results in complex sub-equations in terms of the second order system matrices. The computational costs of solving the algebraic Riccati equation through standard methods such as the Hamiltonian matrix pencil approach increase substantially as matrix sizes increase for a second order system, due to the eigendecomposition of the 2n x 2n system matrices involved. This work introduces a new solution that does not require the eigendecomposition of the 2n x 2n system matrices, while satisfying all of the requirements of the solution to the Riccati equation (e.g., detectability, stabilizability, positive semi-definite solution matrix).

Adaptive consensus control of uncertain nonlinear multi-agent systems with communication delays and relative output information

This paper explores the challenges of distributed adaptive consensus control problems in nonlinear multi-agent systems with unknown parameters and communication delays. To address these issues, a novel backstepping-based adaptive state feedback control protocol is proposed by utilizing a reference dynamic system. Furthermore, an output-feedback consensus control algorithm incorporating a state observer is introduced. Through the application of Laplace transformation, matrix properties, and graph theory, it is demonstrated that the closed-loop multi-agent system ensures the boundedness of all signals and achieves output consensus, even in the presence of nonuniform communication delays. Numerical simulations on a group of inverted pendulums illustrate the effectiveness of these algorithms.

Control strategy for trading off solar power and control input while rendezvous and docking

This paper presents a novel strategy for decoupling the attitude and orbit equations of a CubeSat for rendezvous and docking with an uncontrollable cooperative target. For computing a safe trajectory, the proposed control algorithm takes into account the solar energy received by the CubeSat. The CubeSat is equipped with a thruster for orbit maneuvers, magnetic coils for attitude control, and four fixed single-sided rectangular solar panels. The coupled dynamics arising from the dynamical model of the spacecraft is solved using a novel weighted vector-based approach. This paper presents a linearized nonlinear optimal control problem arising in small spacecrafts while trying to maximize solar energy input in the rendezvous and docking process. An intermediate orbit is defined and used to divide the problem into two different optimal control problems: rendezvous optimization and docking optimization problems. A geometrical approach based on the shape of the chaser and the target is contemplated for collision avoidance while docking. The proposed controller design is modified whenever the sunlight is obstructed by the Earth, and the maneuvering controls are redesigned accordingly for optimal rendezvous and docking. Numerical simulations have been carried out to show the efficacy of the proposed concept for steering the trade-off between solar energy and control input during the rendezvous and docking of CubeSat with a tumbling target.

Linear quadratic optimal control problems of infinite‐dimensional mean‐field type with jumps

AbstractIn this paper, we formulate and investigate a framework for the theory of the linear quadratic optimal control problem (LQ problem) for infinite‐dimensional mean‐field stochastic evolution systems with jumps. We ensure the well‐posedness of the investigated problems by establishing the existence, uniqueness, and a priori estimates for mild solutions to general infinite‐dimensional mean‐field forward stochastic evolution equations (MF‐SEE) and mean‐field backward stochastic evolution equations (MF‐BSEE) with jumps. Leveraging the Yosida approximation theory, we establish a dual theory between MF‐SEE and MF‐BSEE with jumps, overcoming the challenge posed by the inapplicability of Itô's formula in the context of mild solutions. Our main results regarding the existence and uniqueness of the optimal control, along with corresponding dual characterizations and state feedback representations, are obtained through convex analysis techniques, our established dual theory, and decoupling methods.

Optimal distributed time-varying formation control for second-order multiagent systems: LQR-based method

The optimal leaderless and leader-following time-varying formation (TVF) control problems for second-order multiagent systems (MASs) are investigated, where two optimal TVF control protocols are proposed to achieve the desired formations as well as minimize the comprehensive optimization function that contain the cooperative performance index and the control energy index. For leaderless case, the optimal formation control problem is reformulated as an infinite-time state regulator problem by employing the state space decomposition method, which is subject to specified constraints on energy and performance indices, and the analytic criterion for optimal TVF achievability is subsequently proposed. Then, the results of optimal leaderless TVF control are extended to the leader-following case with switching topologies, where the main challenge is changed to find the optimal controller rather than the optimal gain matrix, and the optimal value of the comprehensive index is accurately determined. Finally, two simulation cases are proposed to validate the effectiveness of the theoretical results, and comparisons with previous works are presented to expound the optimality of the proposed formation control method.

Two-grid Method of Expanded Mixed Finite Element Approximations for Parabolic Integro-differential Optimal Control Problems

Two-grid Method of Expanded Mixed Finite Element Approximations for Parabolic Integro-differential Optimal Control Problems

On solving terminal approach and evasion problems for linear discrete-time systems under state constraints

The paper is devoted to elaboration of polyhedral techniques for solving two control problems for linear discrete-time systems with uncertainties under state constraints, namely, the terminal approach problem and the terminal evasion one. Such problems arise in systems with two controls, where the aim of the first is to steer the trajectory onto a given terminal set at a given instant without violating the state constraints, the aim of the other is opposite. It is assumed that the terminal set is a parallelepiped, the controls are bounded by parallelotope-valued constraints, and the state constraints are given in the form of so-called zones. We present techniques for solving both problems basing on polyhedral (parallelotope-valued or parallelepiped-valued) tubes. The techniques for solving the approach problem were proposed by the author earlier, but here additional properties of them are investigated. In particular, for the case without state constraints, guaranteed estimates are found for the trajectory that ensure that it is inside the tube. Convenient sufficient conditions are given to guarantee the obtaining of nondegenerate cross-sections during the calculations. For the evasion problem, a common solution scheme is considered, and then polyhedral techniques are proposed. The whole parametric families of external and internal polyhedral estimates for the solvability tubes for both problems are presented and compared. An illustrative example is given.

A class of germs arising from homogenization in traffic flow on junctions

We consider traffic flows described by conservation laws. We mainly study a 2:1 junction (with two incoming roads and one outgoing road). At the mesoscopic level, the priority law at the junction is given by traffic lights, which are periodic in time; the traffic can also be slowed down by periodic in time flux-limiters. Looking at long-time behavior and on large space scale, we intuitively expect an effective junction condition to emerge, thus deriving a macroscopic model from the mesoscopic one. At the limit of the rescaling, we show rigorous homogenization of the problem and identify the effective junction condition, which belongs to a general class of germs (in the terminology of [B. Andreianov, K. H. Karlsen and N. H. Risebro, A theory of [Formula: see text]-dissipative solvers for scalar conservation laws with discontinuous flux, Arch. Ration. Mech. Anal. 201 (2011) 27–86; U. S. Fjordholm, M. Musch and N. H. Risebro, Well-posedness and convergence of a finite volume method for conservation laws on networks, SIAM J. Numer. Anal. 60(2) (2022) 606–630; M. Musch, U. S. Fjordholm and N. H. Risebro, Well-posedness theory for nonlinear scalar conservation laws on networks, Netw. Heterog. Media 17 (2022) 101–128]). The proof of homogenization requires two steps: our first key result is the identification of this germ and of a characteristic subgerm which determines the whole germ. The second key result is the construction of a family of correctors whose values at infinity are related to each element of the characteristic subgerm. This construction is indeed explicit at the level of some mixed Hamilton–Jacobi equations for concave Hamiltonians (i.e. fluxes). The solutions are found in the spirit of representation formulas for optimal control problems.

Review of Ti3C2Tx MXene Nanofluids: Synthesis, Characterization, and Applications

MXene-based nanofluids are important because of their thermal and rheological properties, influencing scientific and industrial applications. MXenes, made of titanium carbides and nitrides, are investigated for nanofluid enhancement. This review covers MXene nanofluid creation, characterization, and application. To produce nanoscale MXene particles, two-dimensional materials are dissolved and dispersed in a base fluid. The stability and efficacy of MXene nanofluids depend on production methods, such as chemical exfoliation, electrochemical etching, and mechanical delamination. Improved heat transfer coefficients and thermal conductivity from MXene nanofluids help resolve heat transfer, energy efficiency, and thermal control problems. This extensive review also addresses long-term safety and the necessity for standardized characterization methodologies, helping researchers optimize MXene-based nanofluids in many technological fields

Research on the Application of Neural Network PID in Quadcopter Aircraft

As a highly maneuverable and flexible unmanned aerial vehicle, quadcopters have broad application prospects in both civilian and military fields. However, due to their complex dynamic characteristics, nonlinearity, and strong coupling, achieving stable and precise control of quadcopters is a challenging task. Traditional control methods often fail to meet the control performance requirements for such complex nonlinear systems. Neural networks provide a new approach to solving control problems in complex systems due to their powerful learning and adaptive capabilities. Neural networks can improve the performance of control systems by learning from large amounts of data, capturing the dynamic characteristics of the system, and adjusting control strategies online. Combining neural networks with PID control is expected to fully leverage the advantages of both. Neural networks can adjust the parameters of PID controllers in real-time, enabling them to better adapt to the complex dynamic changes and external disturbances of quadcopter aircraft. This fusion control method brings new possibilities for improving the control performance of quadcopter aircraft. This study explores the application of neural network PID in quadcopter aircraft to achieve stable and precise control, laying the foundation for its widespread promotion in practical applications.

Mean-Field Neural Networks-Based Algorithms for McKean-Vlasov Control Problems

Mean-Field Neural Networks-Based Algorithms for McKean-Vlasov Control Problems

Gauss–Newton Runge–Kutta integration for efficient discretization of optimal control problems with long horizons and least-squares costs

This work proposes an efficient treatment of continuous-time optimal control problems with long horizons and nonlinear least-squares costs. In particular, we present the Gauss–Newton Runge–Kutta (GNRK) integrator which provides a high-order cost integration. Crucially, the Hessian of the cost terms required within an SQP-type algorithm is approximated with a Gauss–Newton Hessian. Moreover, L2 penalty formulations for constraints are shown to be particularly effective for optimization with GNRK. An efficient implementation of GNRK is provided in the open-source software framework acados. We demonstrate the effectiveness of the proposed approach and its implementation on an illustrative example showing a reduction of relative suboptimality by a factor greater than 10 while increasing the runtime by only 10%.

A comparative study of sensitivity computations in ESDIRK-based optimal control problems

This paper compares the impact of iterated and direct approaches to sensitivity computation in fixed step-size explicit singly diagonally implicit Runge–Kutta (ESDIRK) methods when applied to optimal control problems (OCPs). We strictly use the principle of internal numerical differentiation (IND) for the iterated approach, i.e., reusing iteration matrix factorizations, the number of Newton-type iterations, and Newton iterates, to compute the sensitivities. The direct method computes the sensitivities without using the Newton schemes. We compare the impact of these sensitivity computations in OCPs for the quadruple tank system (QTS). We discretize the OCPs using multiple shooting and solve these with a sequential quadratic programming (SQP) solver. We benchmark the iterated and direct approaches against a base case. This base case applies the ESDIRK methods with exact Newton schemes and a direct approach for sensitivity computations. In these OCPs, we vary the number of integration steps between control intervals and evaluate the performance based on the number of SQP and QPs iterations, KKT violations, function evaluations, Jacobian updates, and iteration matrix factorizations. We also provide examples using the continuous-stirred tank reactor (CSTR), and the IPOPT algorithm instead of the SQP. For OCPs solved using SQP, the QTS results show the direct method converges only once, while the iterated approach and base case converges in all situations. Similar results are seen with the CSTR. Using IPOPT, both the iterated approach and base case converge in all cases. In contrast, the direct method only converges in all cases regarding the CSTR.

Convex Hull Relaxation of Optimal Control Problems With General Nonconvex Control Constraints

Convex Hull Relaxation of Optimal Control Problems With General Nonconvex Control Constraints

AONN-2: An adjoint-oriented neural network method for PDE-constrained shape optimization

PDE-constrained shape optimization has been playing an important role in a large variety of engineering applications. Traditional mesh-dependent shape optimization methods often encounter challenges due to mesh deformation. To address this issue, we present a new adjoint-oriented neural network method, AONN-2, for PDE-constrained shape optimization problems. This method extends the capabilities of the original AONN method [1], which is developed for efficiently solving parametric optimal control problems. AONN-2 inherits from AONN the direct-adjoint looping (DAL) framework for computing the extremum of an objective functional and the involved neural network methods for solving complicated PDEs. Furthermore, AONN-2 expands the application scope to shape optimization by taking advantage of the shape derivatives to optimize the shape represented by discrete boundary points. AONN-2 is a fully mesh-free shape optimization approach, naturally sidestepping issues related to mesh deformation, with no needs for maintaining mesh quality and additional mesh corrections. A series of experimental results are presented, highlighting the flexibility, robustness, and accuracy of AONN-2.

First- and second-order optimality conditions for the control of infinite horizon Navier–Stokes equations

First and second-order optimality conditions for optimal control problems over the infinite time horizon subject to the Navier–Stokes equations are derived. The cost functional enhances temporal sparsity of the controls, which implies that the optimal controls shut down in finite time. The problem formulation also includes explicit constraints on the control which may be non-smooth and non-affine.

The switch point algorithm applied to a harvesting problem.

In this paper, we investigate an optimal harvesting problem of a spatially explicit fishery model that was previously analyzed. On the surface, this problem looks innocent, but if parameters are set to where a singular arc occurs, two complex questions arise. The first question pertains to Fuller's phenomenon (or chattering), a phenomenon in which the optimal control possesses a singular arc that cannot be concatenated with the bang-bang arcs without prompting infinite oscillations over a finite region. 1) How do we numerically assess whether or not a problem chatters in cases when we cannot analytically prove such a phenomenon? The second question focuses on implementation of an optimal control. 2) When an optimal control has regions that are difficult to implement, how can we find alternative strategies that are both suboptimal and realistic to use? Although the former question does not apply to all optimal harvesting problems, most fishery managers should be concerned about the latter. Interestingly, for this specific problem, our techniques for answering the first question results in an answer to the the second. Our methods involve using an extended version of the switch point algorithm (SPA), which handles control problems having initial and terminal conditions on the states. In our numerical experiments, we obtain strong empirical evidence that the harvesting problem chatters, and we find three alternative harvesting strategies with fewer switches that are realistic to implement and near optimal.