• Title/Summary/Keyword: Searching robot

Search Result 85, Processing Time 0.034 seconds

Efficient Design of Web Searching Robot Engine Using Distributed Processing Method with Javascript Function (자바스크립트 함수처리 기능을 포함한 분산처리 방식의 웹 수집 로봇의 설계)

  • Kim, Dae-Yu;Kim, Jung-Tae
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.13 no.12
    • /
    • pp.2595-2602
    • /
    • 2009
  • In this paper, we proposed and implemented web robot using active script engine with internet explore to process javascript function link, which is not processing in conventional web searching robot. This web searching robot is developed to measure collecting amount of web searching robot with processing of javascript function link. We analysed the architecture of web searching robot with google and naybot to develope web searching robot, implemented element of configuration applicable to searching robot and designed with distributed processing type. In addition to, we estimated the proposed web robot employing javascript processing model and analysed the comparison of collecting amount of web site board using javascript. We obtained the result of 1,000 web page collecting compared to conventional method in case of 1,000 web site board.

A Local Path Planning Algorithm of Free Ranging Mobile Robot Using a Laser Range Finder (레이저거리계를 이용한 자율 주행로봇의 국부 경로계획 알고리즘)

  • 차영엽;권대갑
    • Transactions of the Korean Society of Mechanical Engineers
    • /
    • v.19 no.4
    • /
    • pp.887-895
    • /
    • 1995
  • Considering that the laser range finder has the excellent resolution with respect to angular and distance measurements, a sophisticated local path planning algorithm is achieved by subgoal and sub-subgoal searching methods. The subgoal searching finds the passable ways between obstacles and selects the optimal pathway in order to reduce the moving distanced from start point to given to given goal. On the other hand, the sub-subgoal searching corrects the path given in subgoal searching in the case of which the mobile robot will collide with obstacles. Also, the effectiveness of the established local path planning and local minimum avoiding algorithm are estimated by computer simulation and experimentation in complex environment.

A Multi-Sensor Module of Snake Robot for Searching Survivors in Narrow Space (협소 공간 생존자 탐색을 위한 뱀형 로봇의 다중 센서 모듈)

  • Kim, Sungjae;Shin, Dong-Gwan;Pyo, Juhyun;Shin, Juseong;Jin, Maolin;Suh, Jinho
    • The Journal of Korea Robotics Society
    • /
    • v.16 no.4
    • /
    • pp.291-298
    • /
    • 2021
  • In this study, we present a multi-sensor module for snake robot searching survivors in a narrow space. To this end, we integrated five sensor systems by considering the opinions of the first responders: a gas sensor to detect CO2 gases from the exhalation of survivors, a CMOS camera to provide the image of survivors, an IR camera to see in the dark & smoky environment, two microphones to detect the voice of survivors, and an IMU to recognize the approximate location and direction of the robot and survivors. Furthermore, we integrated a speaker into the sensor module system to provide a communication channel between the first responders and survivors. To integrated all these mechatronics systems in a small, compact snake head, we optimized the positions of the sensors and designed a stacked structure for the whole system. We also developed a user-friendly GUI to show the information from the proposed sensor systems visually. Experimental results verified the searching function of the proposed sensor module system.

Design of Web Robot Engine Using Distributed Collection Model Processing (분산수집 모델을 이용한 웹 로봇의 설계 및 구현)

  • Kim, Dae-Yu;Kim, Jung-Tae
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.14 no.1
    • /
    • pp.115-121
    • /
    • 2010
  • As internet becomes widespread, a lot of information is opened to public and users of Internet can access effectively information using web searching service. To construct web searching service, the web searching method for collecting of information is needed to obtain web page view. As a number of web page view increases, it is necessary to collect information of high quality information to be searched, therefore, a variety of web engine for searching mechanism is developed. Method of link extraction with javascript in dynamic web page and design of web searching robot are presented m this paper. To evaluate performance analyzes, we fixed one searching model with the proposed method. The searching time takes 2 minute 67 sec for 299 web pages and 12.33 sec for 10 searching model.

Searching Methods of Corresponding Points Robust to Rotational Error for LRF-based Scan-matching (LRF 기반의 스캔매칭을 위한 회전오차에 강인한 대응점 탐색 기법)

  • Jang, Eunseok;Cho, Hyunhak;Kim, Eun Kyeong;Kim, Sungshin
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.26 no.6
    • /
    • pp.505-510
    • /
    • 2016
  • This paper presents a searching method of corresponding points robust to rotational error for scan-matching used for SLAM(Simultaneous Localization and Mapping) in mobile robot. A differential driving mechanism is one of the most popular type for mobile robot. For driving curved path, this type controls the velocities of each two wheels independently. This case increases a wheel slip of the mobile robot more than the case of straight path driving. And this is the reason of a drifting problem. To handle this problem and improves the performance of scan-matching, this paper proposes a searching method of corresponding points using extraction of a closest point based on rotational radius of the mobile robot. To verify the proposed method, the experiment was conducted using LRF(Laser Range Finder). Then the proposed method is compared with an existing method, which is an existing method based on euclidian closest point. The result of our study reflects that the proposed method can improve the performance of searching corresponding points.

Implementation of Web Searching Robot for Detecting of Phishing and Pharming in Homepage (홈페이지에 삽입된 악성코드 및 피싱과 파밍 탐지를 위한 웹 로봇의 설계 및 구현)

  • Kim, Dae-Yu;Kim, Jung-Tae
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.12 no.11
    • /
    • pp.1993-1998
    • /
    • 2008
  • Web robot engine for searching web sever vulnerability and malicious code is proposed in this paper. The main web robot function is based on searching technology which is derived from analyses of private information threat. We implemented the detecting method for phishing, pharming and malicious code on homepage under vulnerable surroundings. We proposed a novel approachm which is independent of any specific phishing implementation. Our idea is to examine the anomalies in web pages.

A Study on Design and Development of Web Information Collection System Based Compare and Merge Method (웹 페이지 비교통합 기반의 정보 수집 시스템 설계 및 개발에 대한 연구)

  • Jang, Jin-Wook
    • Journal of Information Technology Services
    • /
    • v.13 no.1
    • /
    • pp.147-159
    • /
    • 2014
  • Recently, the quantity of information that is accessible from the Internet is being dramatically increased. Searching the Web for useful information has therefore become increasingly difficult. Thus, much research has been done on web robots which perform internet information filtering based on user interest. If a web site which users want to visit is found, its content is searched by following the searching list or Web sites links in order. This search process takes a long time according as the number of page or site increases so that its performance need to be improved. In order to minimize unnecessary search with web robots, this paper proposes an efficient information collection system based on compare and merge method. In the proposed system, a web robot initially collects information from web sites which users register. From the next visit to the web sites, the web robot compares what it collected with what the web sites have currently. If they are different, the web robot updates what it collected. Only updated web page information is classified according to subject and provided to users so that users can access the updated information quickly.

A Study on the Implementation of Wireless Searching Robot through the Capstone design courses (캡스톤 디자인 과목을 통한 무선탐사 로봇 제작 연구)

  • Cho, Kyoung-Woo;Chang, Eun-Young
    • Journal of Practical Engineering Education
    • /
    • v.6 no.1
    • /
    • pp.23-29
    • /
    • 2014
  • In this study, there is a modeling for the procedure and operational method of the project based capstone design and related products which are a certificate of graduate qualification, and those results were evaluated by self-review and the performance assessment. Processing of research based on wireless searching robot is described according to the model. Before one semester by the end of to the assessment, the design thesis of capstone results was fixed to 18 groups with two people in each group. 13 teams out of 18 teams are satisfied the criteria of evaluation, and they all got a grade over 60 points and the other teams are not qualified at the first stage of final judgment. The total team mean average is 71.79. The research based on wireless searching robot was earned the highest average point among the other teams which is 96.1.

The Target Searching Method in the Chaotic Mobile Robot Embedding BVP Model (BVP 모델을 내장한 카오스 로봇에서의 목표물 탐색)

  • Bae, Young-Chul;Kim, Yi-Gon;Koo, Young-Duk
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.17 no.2
    • /
    • pp.259-264
    • /
    • 2007
  • In this paper, we composed chaos mobile robot by embedding many type of chaos circuit including Arnold Equation and Chua's Equation and proposed method of evaluation of obstacles when it meets or approaches an obstacle while the mobile robot searches an any plane with chaos trajectory and method of concentrating search when it faces target and verified these results. For obstacles avoidance, we developed algorithm that evades an obstacles with chaos trajectory by assuming fixed obstacle, obstacles using VDP model, hidden obstacles using BVP model as obstacles and for searching an object, we developed algorithm of searching with a chaos trajectory by assuming BVP model as an object, verified the results and confirmed reasonability of them.

Optimal Gait Trajectory Generation and Optimal Design for a Biped Robot Using Genetic Algorithm (유전자 알고리즘을 이용한 이족 보행 로봇의 최적 설계 및 최적 보행 궤적 생성)

  • Kwon Ohung;Kang Minsung;Park Jong Hyeon;Choi Moosung
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.10 no.9
    • /
    • pp.833-839
    • /
    • 2004
  • This paper proposes a method that minimizes the consumed energy by searching the optimal locations of the mass centers of links composing of a biped robot using Real-Coded Genetic Algorithm. Generally, in order to utilize optimization algorithms, the system model and design variables must be defined. Firstly, the proposed model is a 6-DOF biped robot composed of seven links, since many of the essential characteristics of the human walking motion can be captured with a seven-link planar biped walking in the saggital plane. Next, Fourth order polynomials are used for basis functions to approximate the walking gait. The coefficients of the fourth order polynomials are defined as design variables. In order to use the method generating the optimal gait trajectory by searching the locations of mass centers of links, three variables are added to the total number of design variables. Real-Coded GA is used for optimization algorithm by reason of many advantages. Simulations and the comparison of three methods to generate gait trajectories including the GCIPM were performed. They show that the proposed method can decrease the consumed energy remarkably and be applied during the design phase of a robot actually.