• 제목/요약/키워드: search robot

검색결과 242건 처리시간 0.026초

에너지 효율을 이용한 이동 로봇의 최적 이동 경로 탐색 (Optimal Path Search of Mobile Robot using Energy efficiency)

  • 정경권;이용구;엄기환
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 2006년도 하계종합학술대회
    • /
    • pp.1007-1008
    • /
    • 2006
  • This paper presents a optimal path search of mobile robot using energy efficiency. Proposed method has two goals that determining the velocity of mobile robot and finding the optimal path. We model the relationship of motors' speed and power consumption with quadratic polynomials. In order to verify the effectiveness of the proposed method, we performed simulations on the energy consumption of different paths.

  • PDF

여유자유도 로봇에 있어서 광역의 경로정보를 이용한 주기작업의 최적해 (Optimal Solution of a Cyclic Task Using the Global Path Information for a Redundant Robot)

  • 최병욱;원종화;정명진
    • 전자공학회논문지B
    • /
    • 제29B권3호
    • /
    • pp.6-15
    • /
    • 1992
  • This paper proposes a method for the global optimization of redundancy over the whole task period for a kinematically redundant robot. The necessary conditions based on the calculus of variations for an integral type cost criterion result in a second-order differential equation. For a cyclic task, the periodic boundary conditions due to conservativity requirements are discussed. We refine the two-point boundary value problem to an initial value adjustment problem and suggest a numerical search method for providing the conservative global optimal solution using the gradient projection method. Since the initial joint velocity is parameterized with the number of the redundancy, we only search the parameter value in the space of as many dimensions as the number of degrees of redundancy. We show through numerical examples that multiple nonhomotopic extremal solutions and the generality of the proposed method by considering the dynamics of a robot.

  • PDF

로봇의 최단경로탐색을 위한 미로의 순회 및 표현방법 설계 (A Design of Traverse and Representation Method of Maze for Shortest Path Search with Robots)

  • 홍기천
    • 한국정보교육학회:학술대회논문집
    • /
    • 한국정보교육학회 2010년도 하계학술대회
    • /
    • pp.227-233
    • /
    • 2010
  • 그래프는 현재 GIS, 네트워크, 인공지능 등과 같은 다양한 분야에 응용되고 있다. 우리의 일상에서도 여행등과 같은 상황에서 무의식중에 그래프의 개념을 사용하고 있다. 그래서 본 논문에서는 미로내에서 로봇이 서로다른 두 개의 정점간 최단경로를 탐색할 때, 그래프라는 개념이 어떻게 사용되는지에 대해서 알아보고자한다. 우리가 자료구조 과목에서 배웠던 내용처럼 이상적인 상황이 아니고 좀더 현실적인 상황이다. 로봇이 최단경로탐색이라는 미션을 수행하기 위해서는 미로순회, 그래프 생성, 최단경로탐색의 세 단계를 거친다. 미로순회 단계는 로봇이 직접 미로를 탐색해야하는 단계로서 가장 어려움이 많은 단계라고 볼 수 있다. 그래프 생성 단계는 로봇이 미로가 가지는 구조적인 정보를 그래프로 표현하고, 이를 2차원 배열에 저장하는 단계이다. 최단경로탐색단계는 서로 다른 두 개의 정점을 입력하여 로봇이 실제로 이동하도록 하는 단계이다. 아직 구현이 완료된 상황이 아니기 때문에 로봇의 최단경로탐색을 위한 전체 과정의 설계에 대해서만 기술하기로 한다.

  • PDF

미지의 환경에서 트리구조를 이용한 군집로봇의 분산 탐색 (Distributed Search of Swarm Robots Using Tree Structure in Unknown Environment)

  • 이기수;주영훈
    • 전기학회논문지
    • /
    • 제67권2호
    • /
    • pp.285-292
    • /
    • 2018
  • In this paper, we propose a distributed search of a cluster robot using tree structure in an unknown environment. In the proposed method, the cluster robot divides the unknown environment into 4 regions by using the LRF (Laser Range Finder) sensor information and divides the maximum detection distance into 4 regions, and detects feature points of the obstacle. Also, we define the detected feature points as Voronoi Generators of the Voronoi Diagram and apply the Voronoi diagram. The Voronoi Space, the Voronoi Partition, and the Voronoi Vertex, components of Voronoi, are created. The generated Voronoi partition is the path of the robot. Voronoi vertices are defined as each node and consist of the proposed tree structure. The root of the tree is the starting point, and the node with the least significant bit and no children is the target point. Finally, we demonstrate the superiority of the proposed method through several simulations.

변형된 점증 깊이 우선 탐색 방법을 사용한 로봇 계획 시스템 (A Robot Planning System Based on a Modified DFID Search Method)

  • 임재걸
    • 한국정보처리학회논문지
    • /
    • 제2권3호
    • /
    • pp.354-363
    • /
    • 1995
  • 본 논문은 목적 상태를 구성하는 부분목적들 사이의 선취관계를 이요하는 새로운 탐색방법을 제안한다.제안된 방법은 기존의 인공지능 탐색 방법에 부분 목적들간의 선취관계를 이용하여 분지인수(branching factor)와 탐색 공간의 깊이를 줄이고,직접 성취 가능한 극대 부분 목적과 필연적인 작업들을 즉시 실행하는 전략을 사용하여 효율성을 더육 제고 시킨다. 이러한 전략을 사용하는 제안된 알고리즘의 효율성을 이론적으로 보일 뿐 아니라,점증깊이 우선 탐색(DFID:Depth-First Iterative Deepening Search)방법과 IDA(Iteratice Deepening A)알고리즘에 제안도니 방법을 적용하여 얻은 변형된 탐색 알고리즘을 이용하는 로봇 계획 시스템을 구현하여 제안된 전략의 효율성을 실험적으로도 보인다.

  • PDF

Cooperative Behavior of Distributed Autonomous Robotic Systems Based on Schema Co-Evolutionary Algorithm

  • Sim, Kwee-Bo
    • International Journal of Fuzzy Logic and Intelligent Systems
    • /
    • 제2권3호
    • /
    • pp.185-190
    • /
    • 2002
  • In distributed autonomous robotic systems (DARS), each robot must behave by itself according to its states ad environments, and if necessary, must cooperate with other robots in order to carry out their given tasks. Its most significant merit is that they determine their behavior independently, and cooperate with other robots in order to perform the given tasks. Especially, in DARS, it is essential for each robot to have evolution ability in order to increase the performance of system. In this paper, a schema co-evolutionary algorithm is proposed for the evolution of collective autonomous mobile robots. Each robot exchanges the information, chromosome used in this algorithm, through communication with other robots. Each robot diffuses its chromosome to two or more robots, receives other robot's chromosome and creates new species. Therefore if one robot receives another robot's chromosome, the robot creates new chromosome. We verify the effectiveness of the proposed algorithm by applying it to cooperative search problem.

KT 몽이(유아용 에듀테인먼트 로봇)의 영상전화 기반 응용 서비스 개발 (Development of Videophone-based Application Services for KT Mon-e(KT Edutainment Robot for Young Children))

  • 박귀홍;김종철;안희준
    • 로봇학회논문지
    • /
    • 제5권2호
    • /
    • pp.93-101
    • /
    • 2010
  • This paper presents the system design and implementation of 'Mon-e', the KT's edutainment robot for young children. We paid our special attention to the computer- illiterate young children, and the provision of the physical and friendly human interface of robots. Specifically, the paper focuses on the video telephony and home monitoring service using the Mon-e robot. RFID cards -based calling makes it possible for the computer-illiterate children to make a phone call to their parents. The SIP and DTMF based remote control of the robot enables the search and track of the children. This experimental development shows the potentialities and values of the convergence service of telecommunication and robotics.

크롤러 방식 터널로봇의 모션제어 알고리즘 (Motion Control Algorithm for Crawler Type In-Pipe Robot)

  • 배기만;이상룡;이상일;이춘영
    • 대한임베디드공학회논문지
    • /
    • 제3권2호
    • /
    • pp.66-73
    • /
    • 2008
  • The pipes have been laid underground while the industry is developing. We have to take maintenance procedure when the pipes are cracked or ruptured. It is very difficult jop to check pipe's crack because the pipes are narrow and laid underground. Using in-pipe robot, we can check the conditions of inner section of pipes, therefore, we designed a crawler type robot to search cracked pipe. In this paper, we have made a special focus on the control of the robot using differential drive algorithm to move in curved section of pipes. The detailed design of the robot with experimental result show the effectiveness of the robot in pipe maintenance.

  • PDF

큐빅 형태의 모듈라 로봇 디자인 (Design of a Cube-Style Modular Robot)

  • 오준영;김대선;박노수;이보희;서남길;이창
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 2007년도 심포지엄 논문집 정보 및 제어부문
    • /
    • pp.345-346
    • /
    • 2007
  • This paper deals with design of a cube-style modular robot. The modular robot can change its own form according to the working environment. Therefore it is suitable to work in the search and rescue area with the shape of snake, legged robot and humanoid robot. Each of modular unit has to install its own controller on the body and driving mechanism in order to give it mobility autonomously. And also they should attach and detach each other with docking mechanism and algorithm. Using this mechanism, they can make union, separation, recombination. The other important point is that some information of each cell should be exchanged to reconfigure their shape and to make some docking of the modular cell. In this paper we suggested a design concept of our modular robot focused on the docking mechanism of the robot.

  • PDF

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

  • 장진욱
    • 한국IT서비스학회지
    • /
    • 제13권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.