Heuristic Search Algorithm Based on “HowNet” in P2P Network

A heuristic search algorithm is given that determines and resolves the Hamiltonian circuit problem in directed graphs. The heuristic information of each vertex is a set composed of its possible path length values from the starting vertex, which is obtained by the path length extension algorithm. A detailed analysis of algorithm examples shows that the heuristic algorithm can greatly reduce the number of processing nodes compared to the backtracking algorithm without information; meanwhile, the algorithm’s time complexity is related to the number of loops in the directed graph. If a directed graph G(V, E) only contains loops that contain the starting point, then the Hamiltonian problem of G can be determined in polynomial time. The algorithm is implemented using C++ and Python programming, and all of the test graphs are generated by the random graph algorithm. The experiments show that the heuristic algorithm can reduce the number of extended nodes by at least 10% in directed random graphs with no or only a few loops. This heuristic algorithm can save time in applications that perform tasks while extending nodes because it reduce the number of extended nodes.

Many problems of interest can be solved using heuristic search algorithms. When solving a heuristic search problem, we are often interested in estimating search progress, that is, how much longer until we have a solution. Previous work on search progress estimation derived formulas based on some relevant features that can be observed from the behavior of the search algorithm. In this paper, rather than manually deriving such formulas we leverage machine learning to learn more accurate search progress predictors automatically. We train a Long Short-Term Memory (LSTM) network, which takes as input sequences of nodes expanded by the search algorithm, and predicts how far along with the search we are. Importantly, our approach still treats the search algorithm as a black box and does not look into the contents of search nodes. An empirical evaluation shows our technique outperforms previous search progress estimation techniques.

However, most heuristic algorithms are solely based on image features, due to the lack of diverse attributes of samples. Rather than rely on the existing datasets, this paper fully processes the original data. Firstly, the original videos were collected from several intelligent traffic surveillance cameras (monitoring nodes). Then, the three categories of objects in all videos were classified by a video image classifier. For each object in the critical class of cars, four attributes were identified, including ID, region of interest (ROI), sampling time and sampling position (position of sampling node). Next, the moving attitude (i.e. moving direction and speed) of each object was estimated through moving target tracking, and added to the preprocessed data. On this basis, a basic hyper-spherical hash search algorithm was created for the initial identification of similar objects. Furthermore, 93% of the objects were accurately identified through the recognition of license plate. Thereafter, a spatiotemporal correlation Bayesian network (STCBN) was established to predict the probability of each object to appear at a certain node in a period of time. Based on the probability, the heuristic factor was designed and used to enhance the basic hyper-spherical hash search algorithm. The enhancement improves the search performance, while reducing the environmental requirements of a single node. Therefore, the enhanced algorithm can be deployed effectively in edge computing systems. Our method was proved effective through experiment on a number of actual monitoring nodes.

Hybrid method integrating agent-based modeling and heuristic tree search for scheduling of complex batch processes

Artificial Intelligence: Search

Quantum cooperative search algorithm for 3-SAT

Nowadays, utilizing heuristic algorithms is highly appreciated in solving optimization problems. The fundamental of these algorithms are inspired by nature. The gravitational search algorithm (GSA) is a novel heuristic search algorithm which is invented by using law of gravity and mass interactions. In this paper, a new operator is presented which is called “the black hole”. This operator is inspired by the concept of an astronomy phenomenon. By adding the black hole operator, the exploitation of the GSA is improved. The proposed algorithm is evaluated by seven standard unimodal benchmarks. The results obtained demonstrate better performance of the proposed algorithm in comparison with those of the standard GSA and other version of GSA which is equipped with the disruption operator.

This paper describes an upgraded version of the SemIndex prototype system for semantic-aware search in textual SQL databases. Semantic-aware querying has emerged as a required extension of the standard containment keyword-based query to meet user needs in textual databases and IR applications. Here, we build on top of SemIndex, a semantic-aware inverted index previously developed by our team, to allow semantic-aware search, result selection, and result ranking functionality. Various weighting functions and intelligent search algorithms have been developed for that purpose and will be presented here. A graphical interface was also added to help end-users write and execute queries. Preliminary experiments highlight SemIndex querying effectiveness and efficiency, considering different querying algorithms, different semantic coverages, and a varying number of query keywords.

Path planning algorithms are widely used in the fields of robotics and robotic arms, unmanned devices, automatic navigation, etc., and are an important technical basis for promoting the development of automation as well as the popularisation of artificial intelligence technology. This paper will briefly introduce various path planning algorithms implemented by mathematical models or inspired by biological features or genetics from the aspects of geometric search algorithms, intelligent search algorithms, artificial intelligence algorithms, and hybrid algorithms, including the characteristics, advantages and disadvantages, and important improvements of typical path planning algorithms as well as hybrid algorithms which are made by imitating and improving each other of several algorithms. Meanwhile, the development trend of path planning algorithms is also summarised, and the outlook of its development is made to provide reference for related fields.

Heuristic search algorithms (MOA*, NAMOA* etc) for multiobjective optimization problems, when run with admissible heuristics, typically spend a lot of time and require huge amount of memory for generating the Pareto optimal solution frontier due to the fact that these algorithms expand all nodes/paths whose cost is not dominated by any other optimal solution. In this paper, we present an anytime heuristic search framework for biobjective optimization problems named Anytime Biobjective Search (ABS) which quickly finds a set of nondominated solutions and keeps on improving the solution frontier with time. The proposed framework uses the upper and lower limit estimates on one of the objectives to split the search space into a given number of segments and independently runs a particular search algorithm (branch-and-bound, beam search etc.) within each of the segments. In this paper, we present how existing search strategies, branch-and-bound, beam, and beam-stack, can be used within the proposed framework. Experimental results reveal that our proposed framework achieves good anytime performance.

With the proliferation of Web services and the evolution towards the Semantic Web comes the opportunity to automate various Web services tasks. A number of approaches have been proposed to tackle the problem of automatic web service composition. Most of them are inspired by the researches in AI planning. As heuristics plays a key role in the promotion of planning efficiency, the selection of heuristic mechanism is very important. In this paper, we propose the conception of composition distance, and propose a heuristic bidirectional search algorithm based on composition distance. The most contribution of this paper is : (1)propose the conception of composition distance; (2)a heuristic bidirectional search algorithm. The algorithm we proposed is effective and efficiency when applied in web service composition engine.

Generative models for grid-based and image-based pathfinding

Planning of distribution substations, feeders and sectionalizing switches using heuristic algorithms

Heuristic search algorithm has been widely used in the fields of geographic information system, intelligent robot path planning, etc. This paper proposes a heuristic search algorithm based on artificial neural network, which is named ANN*. The architecture of the ANN* algorithm is similar to the A* algorithm, but it contains a novel heuristic function of the new design. This novel heuristic function utilizes the regression network, which is a kind of classical artificial neural network. In the ANN* algorithm, the artificial neural network is used to learn the features of massive map data and predict the path search difficulty of the map. In order to guarantee the diversity of the training data, this paper designs a random map generation framework, which is able to generate random grid maps according to the length, width and density. The experiments show that the ANN* algorithm can accomplish the task of path planning in the grid map with high quality. This paper provides a new scheme of exploring the applications of artificial neural network for heuristic search algorithm.

Retracted: Application of Artificial Intelligence Computer Intelligent Heuristic Search Algorithm