Abstract:
According to an embodiment of the present invention, a method for performing an RILS (Robot-in-the-loop simulation) of an OPRoS (Open platform robotic services)-based robot system comprises the steps of: generating a virtual avatar robot including multiple components corresponding to a real robot; selecting at least one component relative to an hardware among the multiple components; inserting information on an HIL (Hardware-in-the-loop-simulation) driver in a component profile corresponding to the at least one component relative to the hardware; and controlling the real robot or the avatar robot based on the operational results of the real robot and the avatar robot relative to a specific motion using the HIL driver. [Reference numerals] (611) Synchronizing module; (612) Real H/W control module; (613) Virtual H/W control module; (620) Real module; (630) OPRoS simulator
Abstract:
본 발명의 실시예들은 실시간 시스템에서 태스크들을 스케줄링하여 처리하는 기술에 관한 것으로, 특히 태스크들의 특성을 고려하여 태스크들 각각을 효율적으로 스케줄링하여 처리하는 알고리즘에 관련된다. 특히, 본 발명의 실시에에 의하면, 하나의 시스템에서 주기 태스크들 및 비주기 실시간 태스크를 함께 수행할 수 있고, 주기 태스크들 간의 선행 관계를 만족시키는 스케줄링 및 주기 태스크들의 스케줄링 시간에 의해 남는 잉여 시간에 비주기 실시간 태스크를 효율적으로 실행시킬 수 있는 스케줄링이 가능하다.
Abstract:
본발명의실시예는소프트웨어를테스트하기위하여, 소프트웨어를컴포넌트단위로분리하고각 컴포넌트별테스트케이스들을생성하여, 소프트웨어를자동으로테스팅하는기술에관련된다. 특히, 본발명의실시예에의하면, 소프트웨어의테스팅을위하여, 단위소프트웨어의제공인터페이스의명세정보뿐아니라요구인터페이스의명세정보를고려하여효율적으로조합된테스트케이스를생성하고실행할수 있다.
Abstract:
PURPOSE: A periodic and non-periodic real time task scheduling algorithm based on phase ordering and remaining time is provided to perform scheduling which satisfies preceding relations between periodic tasks and to perform scheduling for executing non-periodic real time tasks in remaining time. CONSTITUTION: A periodic task scheduler(610) performs scheduling of periodic tasks by considering preceding relations between the periodic tasks. A scheduling request receiving unit(620) receives a scheduling request of a non-periodic real time task from a system. A non-periodic real time task scheduler(630) performs the scheduling of the non-periodic real time task in remaining time of scheduling time of the periodic tasks. The periodic task scheduler preferentially schedules a task of which the entry degree is low on a graph structure based on a period and performance order of the periodic tasks. [Reference numerals] (610) Periodic task scheduler; (620) Scheduling request receiving unit; (630) Non-periodic real time task scheduler
Abstract:
본 발명은 로봇이 이동 또는 내부 고장 등의 의해 변경되는 외부 또는 내부의 환경 변화 및 상황 조건들에 적합한 반응 및 적절한 동작을 자율적으로 수행가능하도록 하기 위해 로봇 내부에 구비된 소프트웨어 컴포넌트 또는 외부의 서버로부터 다운받아 동적으로 재구성하는 로봇 소프트웨어 컴포넌트 동적 재구성 장치 및 방법을 제공하고자 한다.
Abstract:
PURPOSE: A mobility component test system and method are provided to reduce the costs and time for a test by providing evaluation metrics of a mobility component and calculation references of test cases according to performance evaluation indexes. CONSTITUTION: A mobility component test system comprises a test agent(100) and a mobile rotor(200). The test agent comprises a transceiver unit(110) which transmits test data on test cases according to evaluation metrics to a mobile robot and a test unit(130) which receives test result data from the mobile robot and calculates the results of evaluation metrics based on the receives test result data.
Abstract:
PURPOSE: A mutual message conversion method of a heterogeneous network is provided to automatically convert a mutually transmitted and received through different kind of communication methods to enable a heterogeneous network. CONSTITUTION: The start and termination position of each file of a payload corresponding to an analyzed non-IP message type is analyzed(S711), and a payload filed value of a corresponding position is extracted(S713). The extracted payload filed values are converted into an UPnP(Universal Plug and Play) message format corresponding to a non-IP message type value(S715). The payload field value is converted into the UPnP message value corresponding to the payload field value(S719), and a message of the UPnP device is created(S721).
Abstract:
PURPOSE: A UPnP bridge apparatus for interworking with UPnP and an embedded non-IP device for reducing the waste of the memory are provided to dynamically interwork with UPnP without an execution program within a bridge. CONSTITUTION: A UPnP bridge apparatus for interworking with UPnP and an embedded non-IP device for reducing the waste of the memory includes a plug and play manager(130), a message conversion module(110), a device information storage(180) and a virtual UPnP device manager(140). The plug and play manager recognizes a connection and release of the Non-IP device. The message translation module performs the message conversion of the Non-IP apparatus for being recognized through plug and play manager. The apparatus information depository transmits the pertinent information to plug and play manager the connection or the deactivation event of the Non-IP apparatus the apparatus information storage.
Abstract:
본 발명은 지그비 네트워크에서 질의 기반의 경로 탐색을 수행하는 지그비 메쉬 라우팅 방법에 관한 것으로, 지그비(ZigBee) 네트워크를 구성하고 있는 노드들이 라우팅시에 지그비 코디네이터(ZC)와 지그비 라우터(ZR) 간에 질의를 기반으로 경로 탐색을 수행하는 지그비 메쉬 라우팅 방법을 제공하고자 한다. 이를 위하여, 본 발명은 지그비 네트워크에서 경로 탐색을 수행하는 지그비 메쉬 라우팅 방법에 있어서, 지그비 코디네이터에서 지그비 네트워크 토폴로지에 대한 관리를 수행하는 네트워크 토폴로지 관리 단계; 및 소스 노드가 목적지 노드로 데이터 전송을 위한 최적 경로를 상기 지그비 코디네이터에게 질의하여, 상기 지그비 코디네이터로부터 전달받은 최적 경로를 기반으로 상기 목적지 노드로 데이터를 전송하는 라우팅 단계를 포함한다.
Abstract:
A method for setting packet TTL in initializing route discovery in zigbee mesh networks is provided to apply the optimal maximum value to the maximum TTL value settings, thereby reducing the load of the networks caused by broadcasting and reducing participation in the unnecessary route discovery of a node. A method for setting packet TTL(Time-To-Live) in initializing route discovery in zigbee mesh networks comprises the following steps of: receiving information about SrcDepth(Depth of Source node), ScrAddr(Address of Source node), and DstAddr(Address of Destination node)(S110); initializing and setting CurDepth(Current Depth), upper bound and lower bound values of a destination node depth, a RouterIndex(repeated Router Index) with the upper bound of a Rm(Maximum Router number), and inhValue(the number of branches between source node and destination node) into temporary variables(S120); detecting the depth of a destination node using the inputted information and set variables(S130~S170) and setting the packet TTL using an expression if the depth of the destination node is determined(S180). The expression is maxTTL=Ds+Dd-2xVi. Ds is depth from a coordinator to a source node. Dd is depth from the coordinator to the destination node. Vi is the number of branches between the source node and the destination node on the tree structure of the zigbee mesh networks.