At evaluating the combat effectiveness of the defense system, target′s probability to penetrate the defended area is a primary care taking index. In this paper, stochastic model to compete the probability that targe...At evaluating the combat effectiveness of the defense system, target′s probability to penetrate the defended area is a primary care taking index. In this paper, stochastic model to compete the probability that target penetrates the defended area along any flight path is established by the state analysis and statistical equilibrium analysis of stochastic service system theory. The simulated annealing algorithm is an enlightening random search method based on Monte Carlo recursion, and it can find global optimal solution by simulating annealing process. Combining stochastic model to compete the probability and simulated annealing algorithm, this paper establishes the method to solve problem quantitatively about combat configuration optimization of weapon systems. The calculated result shows that the perfect configuration for fire cells of the weapon is fast found by using this method, and this quantificational method for combat configuration is faster and more scientific than previous one based on principle via map fire field.展开更多
The problem of path planning is studied for t he case for a mobile robot moving in a known environment. An aggressive algorith m using a description of the obstacles based on a neural network is proposed. Th e algorit...The problem of path planning is studied for t he case for a mobile robot moving in a known environment. An aggressive algorith m using a description of the obstacles based on a neural network is proposed. Th e algorithm allows to construct an optimal path which is piecewise linear with c hanging directions of the obstacles and the calculation speed for the proposed a lgorithm is comparatively fast. Simulation results and an application to a car_l ike robot 'Khepera' show the effectiveness of the proposed algorithm.展开更多
Based on the smart home and facial expression recognition, this paper presents a cognitive emotional model for eldercare robot. By combining with Gabor filter, Local Binary Pattern algorithm(LBP) and k-Nearest Neighbo...Based on the smart home and facial expression recognition, this paper presents a cognitive emotional model for eldercare robot. By combining with Gabor filter, Local Binary Pattern algorithm(LBP) and k-Nearest Neighbor algorithm(KNN) are facial emotional features extracted and recognized. Meanwhile, facial emotional features put influence on robot's emotion state, which is described in AVS emotion space. Then the optimization of smart home environment on the cognitive emotional model is specially analyzed using simulated annealing algorithm(SA). Finally, transition probability from any emotional state to a state of basic emotions is obtained based on the cognitive reappraisal strategy and Euclidean distance. The simulation and experiment have tested and verified the effective in reducing negative emotional state.展开更多
In recent years, sinmlated annealing algo-rithms have been extensively developed and uti-lized to solve nmlti-objective optimization problems. In order to obtain better optimization perfonmnce, this paper proposes a N...In recent years, sinmlated annealing algo-rithms have been extensively developed and uti-lized to solve nmlti-objective optimization problems. In order to obtain better optimization perfonmnce, this paper proposes a Novel Adaptive Simulated Annealing （NASA） algorithm for constrained multi-objective optimization based on Archived Multi-objective Simulated Annealing （AMOSA）. For han-dling multi-objective, NASA makes improverrents in three aspects： sub-iteration search, sub-archive and adaptive search, which effectively strengthen the stability and efficiency of the algorithnm For handling constraints, NASA introduces corresponding solution acceptance criterion. Furtherrrore, NASA has also been applied to optimize TD-LTE network perform-ance by adjusting antenna paranleters; it can achieve better extension and convergence than AMOSA, NS-GAII and MOPSO. Analytical studies and simulations indicate that the proposed NASA algorithm can play an important role in improving multi-objective optimi-zation performance.展开更多
Coverage challenge for small considered to be a optlmlzation is a main cell clusters which are promising solution to provide seamless cellular coverage for large indoor or outdoor areas. This paper focuses on small ce...Coverage challenge for small considered to be a optlmlzation is a main cell clusters which are promising solution to provide seamless cellular coverage for large indoor or outdoor areas. This paper focuses on small cell cluster coverage problems and proposes both centralized and distributed self-optimization methods. Modified Particle swarm optimization （MPSO） is introduced to centralized optimization which employs particle swarm optimization （PSO） and introduces a heuristic power control scheme to accelerate the algorithm to search tbr the global optimum solution. Distributed coverage optimization is modeled as a non-cooperative game, with a utility function considering both throughput and interference. An iterative power control algorithm is then proposed using game theory （DGT） which converges to Nash Equilibrium （NE）. Simulation results show that both MPSO and DGT have excellent performance in coverage optimization and outperform optimization using simulated annealing algorithm （SA）, reaching higher coverage ratio and throughput while with less iterations.展开更多
This paper explores the multi-frequency independent channel interference alignment(MFC-IA) system of 3 channels and4 users,and single data stream transmit,i.e.(3×3,1)~4 system.We derive the analytic solution for(...This paper explores the multi-frequency independent channel interference alignment(MFC-IA) system of 3 channels and4 users,and single data stream transmit,i.e.(3×3,1)~4 system.We derive the analytic solution for(3×3,1)~4 MFC-IA system.Based on the analytic solution,an optimization problem is proposed aim at the optimal IA solution.Then based on such a math model,we propose a simulated annealing(SA) algorithm to search optimal IA solution.The simulation results show that the simulated annealing IA algorithm has a better sum rate performance than iterative maximize signal to interference plus noise ratio(Max-SINR) algorithm.This result can be extended to single data stream multi-antenna IA system with 3 antennas and4 users.展开更多
Hidden Maxkov models （HMMs） have been used to model burst error sources of wireless channels. This paper proposes a hybrid method of using genetic algorithm （GA） and simulated annealing （SA） to train HMM for dis...Hidden Maxkov models （HMMs） have been used to model burst error sources of wireless channels. This paper proposes a hybrid method of using genetic algorithm （GA） and simulated annealing （SA） to train HMM for discrete channel modelling. The proposed method is compared with pure GA, and experimental results show that the HMMs trained by the hybrid method can better describe the error sequences due to SA＇s ability of facilitating hill-climbing at the later stage of the search. The burst error statistics of the HMMs trained by the proposed method and the corresponding error sequences are also presented to validate the proposed method.展开更多
In this paper, recent developments of some heuristic algorithms were discussed. The focus was laid on the improvements of ant-cycle (AC) algorithm based on the analysis of the performances of simulated annealing (SA) ...In this paper, recent developments of some heuristic algorithms were discussed. The focus was laid on the improvements of ant-cycle (AC) algorithm based on the analysis of the performances of simulated annealing (SA) and AC for the traveling salesman problem (TSP). The Metropolis rules in SA were applied to AC and turned out an improved AC. The computational results obtained from the case study indicated that the improved AC algorithm has advantages over the sheer SA or unmixed AC.展开更多
文摘At evaluating the combat effectiveness of the defense system, target′s probability to penetrate the defended area is a primary care taking index. In this paper, stochastic model to compete the probability that target penetrates the defended area along any flight path is established by the state analysis and statistical equilibrium analysis of stochastic service system theory. The simulated annealing algorithm is an enlightening random search method based on Monte Carlo recursion, and it can find global optimal solution by simulating annealing process. Combining stochastic model to compete the probability and simulated annealing algorithm, this paper establishes the method to solve problem quantitatively about combat configuration optimization of weapon systems. The calculated result shows that the perfect configuration for fire cells of the weapon is fast found by using this method, and this quantificational method for combat configuration is faster and more scientific than previous one based on principle via map fire field.
文摘The problem of path planning is studied for t he case for a mobile robot moving in a known environment. An aggressive algorith m using a description of the obstacles based on a neural network is proposed. Th e algorithm allows to construct an optimal path which is piecewise linear with c hanging directions of the obstacles and the calculation speed for the proposed a lgorithm is comparatively fast. Simulation results and an application to a car_l ike robot 'Khepera' show the effectiveness of the proposed algorithm.
基金supported by National Natural Science Foundation of China (Normal Project No. 61170115), (Key Project No.61432004)National Key Technologies R&D Program of China (No.2014BAF08B04)the Foundation of Beijing Engineering and Technology Center for Convergence Networks and Ubiquitous Services
文摘Based on the smart home and facial expression recognition, this paper presents a cognitive emotional model for eldercare robot. By combining with Gabor filter, Local Binary Pattern algorithm(LBP) and k-Nearest Neighbor algorithm(KNN) are facial emotional features extracted and recognized. Meanwhile, facial emotional features put influence on robot's emotion state, which is described in AVS emotion space. Then the optimization of smart home environment on the cognitive emotional model is specially analyzed using simulated annealing algorithm(SA). Finally, transition probability from any emotional state to a state of basic emotions is obtained based on the cognitive reappraisal strategy and Euclidean distance. The simulation and experiment have tested and verified the effective in reducing negative emotional state.
基金supported by the Major National Science & Technology Specific Project of China under Grants No.2010ZX03002-007-02,No.2009ZX03002-002,No.2010ZX03002-002-03
文摘In recent years, sinmlated annealing algo-rithms have been extensively developed and uti-lized to solve nmlti-objective optimization problems. In order to obtain better optimization perfonmnce, this paper proposes a Novel Adaptive Simulated Annealing （NASA） algorithm for constrained multi-objective optimization based on Archived Multi-objective Simulated Annealing （AMOSA）. For han-dling multi-objective, NASA makes improverrents in three aspects： sub-iteration search, sub-archive and adaptive search, which effectively strengthen the stability and efficiency of the algorithnm For handling constraints, NASA introduces corresponding solution acceptance criterion. Furtherrrore, NASA has also been applied to optimize TD-LTE network perform-ance by adjusting antenna paranleters; it can achieve better extension and convergence than AMOSA, NS-GAII and MOPSO. Analytical studies and simulations indicate that the proposed NASA algorithm can play an important role in improving multi-objective optimi-zation performance.
基金supported by the National High-Tech Development 863 Program of China (Grant DOS. 2012AA012801)National Natural Science Foundation of China(No.61331009)
文摘Coverage challenge for small considered to be a optlmlzation is a main cell clusters which are promising solution to provide seamless cellular coverage for large indoor or outdoor areas. This paper focuses on small cell cluster coverage problems and proposes both centralized and distributed self-optimization methods. Modified Particle swarm optimization （MPSO） is introduced to centralized optimization which employs particle swarm optimization （PSO） and introduces a heuristic power control scheme to accelerate the algorithm to search tbr the global optimum solution. Distributed coverage optimization is modeled as a non-cooperative game, with a utility function considering both throughput and interference. An iterative power control algorithm is then proposed using game theory （DGT） which converges to Nash Equilibrium （NE）. Simulation results show that both MPSO and DGT have excellent performance in coverage optimization and outperform optimization using simulated annealing algorithm （SA）, reaching higher coverage ratio and throughput while with less iterations.
基金supported by the 863 Program of China under Grant No.2015AA01A703the Fundamental Research Funds for the Central Universities under Grant No.2014ZD03-02+1 种基金the National Natural Science Foundation of China(NSFC,No.61171104,61571055)fund of State Key Laboratory of Millimeter Wave(SKL of MMW,No.K201501)
文摘This paper explores the multi-frequency independent channel interference alignment(MFC-IA) system of 3 channels and4 users,and single data stream transmit,i.e.(3×3,1)~4 system.We derive the analytic solution for(3×3,1)~4 MFC-IA system.Based on the analytic solution,an optimization problem is proposed aim at the optimal IA solution.Then based on such a math model,we propose a simulated annealing(SA) algorithm to search optimal IA solution.The simulation results show that the simulated annealing IA algorithm has a better sum rate performance than iterative maximize signal to interference plus noise ratio(Max-SINR) algorithm.This result can be extended to single data stream multi-antenna IA system with 3 antennas and4 users.
文摘Hidden Maxkov models （HMMs） have been used to model burst error sources of wireless channels. This paper proposes a hybrid method of using genetic algorithm （GA） and simulated annealing （SA） to train HMM for discrete channel modelling. The proposed method is compared with pure GA, and experimental results show that the HMMs trained by the hybrid method can better describe the error sequences due to SA＇s ability of facilitating hill-climbing at the later stage of the search. The burst error statistics of the HMMs trained by the proposed method and the corresponding error sequences are also presented to validate the proposed method.
文摘In this paper, recent developments of some heuristic algorithms were discussed. The focus was laid on the improvements of ant-cycle (AC) algorithm based on the analysis of the performances of simulated annealing (SA) and AC for the traveling salesman problem (TSP). The Metropolis rules in SA were applied to AC and turned out an improved AC. The computational results obtained from the case study indicated that the improved AC algorithm has advantages over the sheer SA or unmixed AC.
