When deploying autonomous agents in unstructured environments over sustained periods of time, adaptability and robustness oftentimes outweigh optimality as a primary consideration. In other words, safety survivability constraints play key role this paper, we present novel, constraint-learning framework for control tasks built on the idea constraints-driven control. However, since policies that ...

The intent of this paper is to provide the basic ideas and the possible alternatives underlying the task of giving a semantics to a concurrent system/language, and to describe a particular approach which makes some speciic choices in order to give a semantics to the class of CC languages. In particular, we will discuss how to handle the issues of concurrency and nondeterminism, and we will exam...

We consider constrained Model Predictive Control (MPC) as a local control law for application in coordinated control of a group of distributed autonomous systems. Interactions between the systems are captured via constraints. Restricted communication bandwidth is available and forces the subsystems to avail themselves of limited-quality estimates of their neighbors’ states in computing this con...

The popular use of backtracking as a control strategy for theorem proving in PROLOG and in Truth-MaintenanceSystems (TMS) led to increased interest in various schemes for enhancing the efficiency of backtrack search. Researchers have referred to these enhancement schemes by the names ‘ ‘Intelligent Backtracking’ ’ (in PROLOG), ‘ ‘Dependencydirected-backtracking” (in TMS) and others. Those impro...

For some optimal control problems with pathwise state constraints the standard versions of the necessary conditions of optimality are unable to provide useful information to select minimizers. There exist some literature on stronger forms of the maximum principle, the so-called nondegenerate necessary conditions, that can be informative for those problems. These conditions can be applied when c...

Taking control limits, ubiquitous in the real world, into consideration is crucial for achieving high performance of designed control systems. There are two ways in which one can consider possible constraints during the synthesis of controllers. In the first approach, imposing constraints during the design procedure of the controller usually leads to difficulties with obtaining explicit forms o...

The most difficult aspect of concurrent discrete-event control is the handling of errors. Most present day languages for concurrent control system specification do not provide adequate mechanisms for exception handling, which is a major limitation on their effectiveness. In this paper, a new mechanism for exception handling in concurrently executing discrete-event control processes is treated, ...

With the increasing complexity of software, new access control methods have emerged to deal with attributebased authorization. As a standard language for attribute-based access control policies, XACML offers a number of rule and policy combining algorithms to meet different needs of policy composition. Due to their variety and complexity, however, it is not uncommon to apply combining algorithm...

‎in this paper, using the idea of convexificators, we study boundedness and nonemptiness of lagrange multipliers satisfying the first order necessary conditions. we consider a class of nons- mooth fractional programming problems with equality, inequality constraints and an arbitrary set constraint. within this context, define generalized mangasarian-fromovitz constraint qualification and show t...