scholarly journals Target Object Search Algorithm under Dynamic Programming in the Tree-Type Maze

2005 ◽  
Vol 15 (5) ◽  
pp. 626-631
Author(s):  
Dong-Hoon Lee ◽  
Han-Ul Yoon ◽  
Kwee-Bo Sim
2019 ◽  
Vol 2 (2) ◽  
pp. 114
Author(s):  
Insidini Fawwaz ◽  
Agus Winarta

<p class="8AbstrakBahasaIndonesia"><em>Games have the basic meaning of games, games in this case refer to the notion of intellectual agility. In its application, a Game certainly requires an AI (Artificial Intelligence), and the AI used in the construction of this police and thief game is the dynamic programming algorithm. This algorithm is a search algorithm to find the shortest route with the minimum cost, algorithm dynamic programming searches for the shortest route by adding the actual distance to the approximate distance so that it makes it optimum and complete. Police and thief is a game about a character who will try to run from </em><em>police.</em><em> The genre of this game is arcade, built with microsoft visual studio 2008, the AI used is the </em><em>Dynamic Programming</em> <em>algorithm which is used to search the path to attack players. The results of this test are police in this game managed to find the closest path determined by the </em><em>Dynamic Programming</em> <em>algorithm to attack players</em></p>


2018 ◽  
Vol 71 (6) ◽  
pp. 1457-1468
Author(s):  
Péter Pongrácz ◽  
András Péter ◽  
Ádám Miklósi

A central problem of behavioural studies providing artificial visual stimuli for non-human animals is to determine how subjects perceive and process these stimuli. Especially in the case of videos, it is important to ascertain that animals perceive the actual content of the images and are not just reacting to the motion cues in the presentation. In this study, we set out to investigate how dogs process life-sized videos. We aimed to find out whether dogs perceive the actual content of video images or whether they only react to the videos as a set of dynamic visual elements. For this purpose, dogs were presented with an object search task where a life-sized projected human was hiding a target object. The videos were either normally oriented or displayed upside down, and we analysed dogs’ reactions towards the projector screen after the video presentations, and their performance in the search task. Results indicated that in the case of the normally oriented videos, dogs spontaneously perceived the actual content of the images. However, the ‘Inverted’ videos were first processed as a set of unrelated visual elements, and only after some exposure to these videos did the dogs show signs of perceiving the unusual configuration of the depicted scene. Our most important conclusion was that dogs process the same type of artificial visual stimuli in different ways, depending on the familiarity of the depicted scene, and that the processing mode can change with exposure to unfamiliar stimuli.


Author(s):  
Yoshio Fukuda ◽  
Maria Feng ◽  
Yuto Narita ◽  
Shun'ichi Kaneko ◽  
Takayuki Tanaka

2012 ◽  
Vol 487 ◽  
pp. 395-400
Author(s):  
Zhong Qi Sheng ◽  
Yu Chang Liu ◽  
Yan Jin ◽  
Yong Xian Liu

For the modular design in manufacturing paradigm of mass customization (MC), module combination is a complex process. To the study on this problem, this paper put forward a module combination method based on module family model. Based on the module family model and tree-type storage structure, this method used a “most similar module" search algorithm to carry out the module search, and applied analytic hierarchy process(AHP) to construct the hierarchy model for the evaluation of module combination configuration program. This module combination method has some theoretical and practical ignificance.


2011 ◽  
Vol 19 (1) ◽  
pp. 33-60 ◽  
Author(s):  
CHRISTOPH TILLMANN ◽  
SANJIKA HEWAVITHARANA

AbstractThe paper presents a novel unified algorithm for aligning sentences with their translations in bilingual data. With the help of ideas from a stack-based dynamic programming decoder for speech recognition (Ney 1984), the search is parametrized in a novel way such that the unified algorithm can be used on various types of data that have been previously handled by separate implementations: the extracted text chunk pairs can be either sub-sentential pairs, one-to-one, or many-to-many sentence-level pairs. The one-stage search algorithm is carried out in a single run over the data. Its memory requirements are independent of the length of the source document, and it is applicable to sentence-level parallel as well as comparable data. With the help of a unified beam-search candidate pruning, the algorithm is very efficient: it avoids any document-level pre-filtering and uses less restrictive sentence-level filtering. Results are presented on a Russian–English, a Spanish–English, and an Arabic–English extraction task. Based on simple word-based scoring features, text chunk pairs are extracted out of several trillion candidates, where the search is carried out on 300 processors in parallel.


Sign in / Sign up

Export Citation Format

Share Document