China
Africa
Explore chapters and articles related to this topic
Search Techniques
Published in C.S. Krishnamoorthy, S. Rajeev, Artificial Intelligence and Expert Systems for Artificial Intelligence Engineers, 2018
C.S. Krishnamoorthy, S. Rajeev
Most AI books use the standard 8-puzzle problem to illustrate different search techniques. A simple search problem of configuration of bridge components is used here for better understanding of the working of different types of search techniques. The bridge configuration shown in Figure 2.1 has four components, viz., girder(G), deck(D), pier(P) and foundation(F). The components are represented by the letters G, D, P and F, respectively. An acceptable configuration is DGPF, showing the load flow pattern; i.e., load flows from deck to girder, girder to pier and pier to foundation. Any other sequence such as PDGF is not acceptable. The search is to arrive at an acceptable sequence, from a given initial sequence, say PDFG. Each of such sequences represents a state. PDFG is the given initial state and GDPF is the goal state. The search process has to carry out a search through the different states from the initial to the goal. Such searches are termed state-space-search, since they search in a space represented by different states which form solutions to a problem. To carry out the search, it is required to generate new states from the current state by applying some rules. The rule applied in the current problem is, swap two position values to generate a new state. For instance, DPFG, FDPG and GDFP are three states obtained by swapping the first position value with the other three values of the initial state PDFG. It should also be noted that the next swapping should not lead to the original values, which are already evaluated. The state space formed by all the possible 16 combinations along with the rules used for swapping position values are given in Figure 2.2. The root node of the tree is the given initial state. By swapping the values at the first position with the other three positions, three successor states of the state at root node are generated. The positions swapped to get each successor state are also shown in the figure. Each node at this level can have two successor nodes. The states at these nodes are generated by swapping values at positions such that the state at the parent node is not generated again. This process is repeated until all the possible combinations are generated.
Disassembly sequence planning validated thru augmented reality for a speed reducer
Published in Cogent Engineering, 2022
Leonardo Frizziero, Giampiero Donnici, Gian Maria Santi, Christian Leon-Cardenas, Patrich Ferretti, Gaia Pascucci, Alfredo Liverani
Moreover, the disassembly sequence was obtained as a “state space search” problem. State space search is a process in which successive configurations or states of an instance are considered, with the intention of finding an objective configuration (or state) with a certain property defined previously (Poole & Mackworth, 2010). This procedure is described in the flow diagram of Figure 5.