Results 91 to 100 of about 1,320,893 (348)
New variants of fuzzy optimal control problems
Asian Journal of Control, EarlyView.Abstract This study introduces a groundbreaking approach to optimal control problems by incorporating fuzzy conformable derivatives. Our primary goal is to identify the optimal control strategy that maximizes fuzzy performance indices while adhering to fuzzy conformable dynamical systems.
Awais Younus +3 more
wiley +1 more source
Full‐order observer design for quadratic port‐controlled Hamiltonian systems
Asian Journal of Control, EarlyView.Abstract The full‐order observer design problem for a particular class of port‐controlled Hamiltonian systems is approached in this paper. The proposed full‐order observer scheme belongs to the structure preserving class of dynamic estimators as it preserves the natural stability properties of the approached class of systems that are useful for the ...
Michael Rojas +2 more
wiley +1 more source
Compact Tree Encodings for Planning as QBF
Inteligencia Artificial, 2018 Considerable improvements in the technology and performance of SAT solvers has made their use possible for the resolution of various problems in artificial intelligence, and among them that of generating plans.
Olivier Gasquet +4 more
doaj +1 more source
No‐regret and low‐regret control for a weakly coupled abstract hyperbolic system
Asian Journal of Control, EarlyView.Abstract This paper explores an optimal control problem of weakly coupled abstract hyperbolic systems with missing initial data. Hyperbolic systems, known for their wave‐like phenomena and complexity, become even more challenging with weak coupling between subsystems.
Meriem Louafi +3 more
wiley +1 more source
The Impact of Entropy and Solution Density on Selected SAT Heuristics
Entropy, 2018 We present a new characterization of propositional formulas called entropy, which approximates the freedom we have in assigning the variables. Like several other such measures (e.g., back-door and back-door-key variables), it is computationally expensive
Dor Cohen, Ofer Strichman
doaj +1 more source
Asian Journal of Control, EarlyView.Abstract This study presents a non‐iterative tuning technique for a linear fractional‐order (FO) controller, based on the integral of the time‐weighted absolute error (ITAE) criterion. Minimizing the ITAE is a traditional approach for tuning FO controllers. This technique reduces the over/undershoot and suppresses the steady‐state error. In contrast to
Ansei Yonezawa +4 more
wiley +1 more source
Complexity of Propositional Proofs under a Promise [PDF]
, 2007 We study -- within the framework of propositional proof complexity -- the problem of certifying unsatisfiability of CNF formulas under the promise that any satisfiable formula has many satisfying assignments, where ``many'' stands for an explicitly ...
Dershowitz, Nachum, Tzameret, Iddo
core +3 more sources
Risk‐aware safe reinforcement learning for control of stochastic linear systems
Asian Journal of Control, EarlyView.Abstract This paper presents a risk‐aware safe reinforcement learning (RL) control design for stochastic discrete‐time linear systems. Rather than using a safety certifier to myopically intervene with the RL controller, a risk‐informed safe controller is also learned besides the RL controller, and the RL and safe controllers are combined together ...
Babak Esmaeili +2 more
wiley +1 more source
Switching Systems Synthesis Method Using Permuted Gray Code Tables (PGC Method)
Latin-American Journal of Computing, 2021 Finding the shortest function on switching systems is a necessity for the development of efficient automatic systems. Currently, several methodologies aim to solve this need with different techniques.
Cesar Troya-Sherdek +3 more
doaj
Redundancy in logic I: CNF propositional formulae
Artificial Intelligence, 2005 A knowledge base is redundant if it contains parts that can be inferred from the rest of it. We study the problem of checking whether a CNF formula (a set of clauses) is redundant, that is, it contains clauses that can be derived from the other ones. Any CNF formula can be made irredundant by deleting some of its clauses: what results is an irredundant
openaire +4 more sources