state variable constraints
Recently Published Documents


TOTAL DOCUMENTS

15
(FIVE YEARS 4)

H-INDEX

5
(FIVE YEARS 2)

Author(s):  
Alberto Castellini ◽  
Georgios Chalkiadakis ◽  
Alessandro Farinelli

Online planning methods for partially observable Markov decision processes (POMDPs) have recently gained much interest. In this paper, we propose the introduction of prior knowledge in the form of (probabilistic) relationships among discrete state-variables, for online planning based on the well-known POMCP algorithm. In particular, we propose the use of hard constraint networks and probabilistic Markov random fields to formalize state-variable constraints and we extend the POMCP algorithm to take advantage of these constraints. Results on a case study based on Rocksample show that the usage of this knowledge provides significant improvements to the performance of the algorithm. The extent of this improvement depends on the amount of knowledge encoded in the constraints and reaches the 50% of the average discounted return in the most favorable cases that we analyzed.


2006 ◽  
Vol 129 (1) ◽  
pp. 96-99
Author(s):  
Bernard Friedland

A technique of quasi-optimum control, developed by the author in 1966, has as its goal to permit one to use the apparatus of optimum control theory without having to solve the two-point boundary value problem for the actual problem. This is achieved by assuming the actual problem is “near” a simplified problem the solution of which was known. In this case, the control law adds a linear correction to the costate of the simplified problem. The linear correction is obtained as the solution of a matrix Riccati equation. After a review of the theory, several new applications of the technique are provided. These include mildly nonlinear processes, processes with bounded-control, and processes with state-variable constraints.


2005 ◽  
Vol 127 (2) ◽  
pp. 323-328 ◽  
Author(s):  
Dan Simon ◽  
Donald L. Simon

Kalman filters are often used to estimate the state variables of a dynamic system. However, in the application of Kalman filters some known signal information is often either ignored or dealt with heuristically. For instance, state-variable constraints (which may be based on physical considerations) are often neglected because they do not fit easily into the structure of the Kalman filter. This paper develops an analytic method of incorporating state-variable inequality constraints in the Kalman filter. The resultant filter is a combination of a standard Kalman filter and a quadratic programming problem. The incorporation of state-variable constraints increases the computational effort of the filter but significantly improves its estimation accuracy. The improvement is proven theoretically and shown via simulation results obtained from application to a turbofan engine model. This model contains 16 state variables, 12 measurements, and 8 component health parameters. It is shown that the new algorithms provide improved performance in this example over unconstrained Kalman filtering.


Author(s):  
Dan Simon ◽  
Donald L. Simon

Kalman filters are often used to estimate the state variables of a dynamic system. However, in the application of Kalman filters some known signal information is often either ignored or dealt with heuristically. For instance, state variable constraints (which may be based on physical considerations) are often neglected because they do not fit easily into the structure of the Kalman filter. This paper develops an analytic method of incorporating state variable inequality constraints in the Kalman filter. The resultant filter is a combination of a standard Kalman filter and a quadratic programming problem. The incorporation of state variable constraints increases the computational effort of the filter but significantly improves its estimation accuracy. The improvement is proven theoretically and shown via simulation results obtained from application to a turbofan engine model. This model contains 16 state variables, 12 measurements, and 8 component health parameters. It is shown that the new algorithms provide improved performance in this example over unconstrained Kalman filtering.


Sign in / Sign up

Export Citation Format

Share Document