Cultural Algorithm for Minimization of Binary Decision Diagram and Its Application in Crosstalk Fault Detection

The binary decision diagrams （BDDs） can give canonical representation to Boolean functions; they have wide applications in the design and verification of digital systems. A new method based on cultural algorithms for minimizing the size of BDDs is presented in this paper. First of all, the coding of an individual representing a BDDs is given, and the fitness of an individual is defined. The population is built by a set of the individuals. Second, the implementations based on cultural algorithms for the minimization of BDDs, i.e., the designs of belief space and population space, and the designs of acceptance function and influence function, are given in detail. Third, the fault detection approaches using BDDs for digital circuits are studied. A new method for the detection of crosstalk faults by using BDDs is presented. Experimental results on a number of digital circuits show that the BDDs with small number of nodes can be obtained by the method proposed in this paper, and all test vectors of a fault in digital circuits can also be produced.

Research on cultural algorithm for solving routing problem of mobile agent

The key idea behind cultural algorithm is to explicitly acquire problem-solving knowledge from the evolving population and in return apply that knowledge to guide the search. In this article, cultural algorithm-simulated annealing is proposed to solve the routing problem of mobile agent. The optimal individual is accepted to improve the belief space＇s evolution of cultural algorithms by simulated annealing. The step size in search is used as situational knowledge to guide the search of optimal solution in the population space. Because of this feature, the search time is reduced. Experimental results show that the algorithm proposed in this article can ensure the quality of optimal solutions, and also has better convergence speed. The operation efficiency of the system is considerably improved.

Efficient design method for cell allocation in hybrid CMOS/nanodevices using a cultural algorithm with chaotic behavior

The hybrid CMOS molecular （CMOL） circuit, which combines complementary metal-oxide- semiconductor （CMOS） components with nanoscale wires and switches, can exhibit significantly improved performance. In CMOL circuits, the nanodevices, which are called cells, should be placed appropriately and are connected by nanowires. The cells should be connected such that they follow the shortest path. This paper presents an efficient method of cell allocation in CMOL circuits with the hybrid CMOS/nanodevice structure; the method is based on a cultural algorithm with chaotic behavior. The optimal model of cell allocation is derived, and the coding of an individual represent- ing a cell allocation is described. Then the cultural algorithm with chaotic behavior is designed to solve the optimal model. The cultural algorithm consists of a population space, a belief space, and a protocol that describes how knowledge is exchanged between the population and belief spaces. In this paper, the evolutionary processes of the population space employ a genetic algorithm in which three populations undergo parallel evolution. The evolutionary processes of the belief space use a chaotic ant colony algorithm. Extensive experiments on cell allocation in benchmark circuits showed that a low area usage can be obtained using the proposed method, and the computation time can be reduced greatly compared to that of a conventional genetic algorithm.

A spatial orthogonal allocation and heterogeneous cultural hybrid algorithm for multirobot exploration mission planning

A spatial orthogonal allocation method is devised for multirobot tasks allocation.A 3D space model is adopted to describe exploration mission;meanwhile spatial orthogonal tentative technology is utilized to update the attractor position for load balance.Heterogeneous interactive cultural hybrid architecture is proposed to solve a robot route planning problem;it utilizes good-point-set to initialize population spaces,redefine novel evolution model and particle evolution ability,and introduce near-neighbor local search strategy in order to enhance search capability.Finally,spatial orthogonal allocation and heterogeneous cultural hybrid algorithm (SOAHCHA) are verified by simulation analysis and MORCS2 planning experiments;those results show that the proposed algorithm is efficient because of its successful performance and balanced allocation.

Multi-robot exploration mission planning and stochastic increment replanning for load balance

Multi-robot mission planning is composed of assignment allocation and mobile-robot route planning in this paper.Multi-robot exploration missions adopts fuzzy c-mean(FCM)algorithm to allocate,and then,heterogeneous interactive cultural hybrid algorithm(HICHA)is devised for route planning in order to optimize mobilerobot execution path.Meanwhile,we design multi-robot mission replanning mechanism based on the rules system of greedy algorithm for dynamic stochastic increment missions.Finally,extensive simulation experiments were shown that FCM for assignment allocation and HICHA for route planning were efficacious for mobile-robot exploration mission planning.Furthermore,the improved greedy algorithm based on experience rules met dynamic stochastic increment missions replanning requirement for load balance.