this paper introduces a technique for controlling a class of uncertain chaotic systems using an adaptive fuzzy proportional-integrator-derivative (pid) controller with h∞ tracking performance. the purpose of this work is to achieve optimal tracking performance of the controller using backtracking search algorithm (bsa). bsa, which is a novel heuristic algorithm, has an easy structure with singl...

The ATMS (A ssumption-Based Truth Maintenance Systern) provides a very general futility ior all types of default reasoning. One of the principal advantages of the ATMS is that cl11 of the possible (usually mutually inconsistent) solutions or partial solutions are directly available to the problem solver. By exploiting this capability of the ATMS, the problem solver can eficiently work on all so...

This paper presents VEC-NBT, a variation on the unsupervised graph clustering technique VEC, which improves upon the performance of the original algorithm significantly for sparse graphs. VEC employs a novel application of the state-ofthe-art word2vec model to embed a graph in Euclidean space via random walks on the nodes of the graph. In VEC-NBT, we modify the original algorithm to use a non-b...

Multi-Point Constructive Search maintains a small set of “elite solutions” that are used to heuristically guide constructive search through periodically restarting search from an elite solution. Empirical results indicate that for job shop scheduling optimization problems, multi-point constructive search leads to significantly better solutions for equivalent search effort when compared to chron...

Extending functional Lisp with McCarthy’s nondeterministic operator AHFJ yields a language which can concisely express search problems. Dependencydirected backtracking is a powerful search strategy. We describe a non-deterministic Lisp dialect called SCHEMER and show that it can provide automatic dependency-directed backtracking. The resulting language provides a convenient interface to this ef...

Backtracking search algorithm is a novel population-based stochastic technique. This paper proposes an improved backtracking search algorithm for constrained optimization problems. The proposed algorithm is combined with differential evolution algorithm and the breeder genetic algorithm mutation operator. The differential evolution algorithm is used to accelerate convergence at later iteration ...

Empirical evidence indicates that the most successful backtracking algorithms for solving constraint satisfaction problems do some level of forward constraint propagation. That is they check constraints against the as yet uninstantiated variables in the search tree. Two popular examples are the forward checking and maintaining arc-consistency algorithms. Although there is a growing body of empi...

Recent works on constraint relaxation [Jussien, 1997; Jussien and Boizumault, 1997b] provided the decorum system (Deduction-based Constraint Relaxation Management). In this paper, we show how the ideas developed in that system can be used in order to integrate Constraint Propagation within the Dynamic Backtracking algorithm [Ginsberg, 1993]. Dynamic Backtracking replaces the backtracking proces...

We present here a discipline for job shop reschedub ing based on partial order backtracking. We show that partial order backtracking offers the rescheduler a framework for schedule repair, based upon a set of nocdoods, which impose a systematic paxtial order on the set of activities to be repaired but allows non systematic techniques to be used within that framework. We present rescheduling as ...

We present a parallel graph narrowing machine, which is used to implement a functional logic language on a shared memory multiprocessor. It is an extension of an abstract machine for a purely functional language. The result is a programmed graph reduction machine which integrates the mechanisms of uniication, backtracking, and independent and-parallelism. In the machine, the subexpressions of a...