• 제목/요약/키워드: J-graph

검색결과 230건 처리시간 0.018초

스마트폰 로봇의 위치 인식을 위한 준 지도식 학습 기법 (Semi-supervised Learning for the Positioning of a Smartphone-based Robot)

  • 유재현;김현진
    • 제어로봇시스템학회논문지
    • /
    • 제21권6호
    • /
    • pp.565-570
    • /
    • 2015
  • Supervised machine learning has become popular in discovering context descriptions from sensor data. However, collecting a large amount of labeled training data in order to guarantee good performance requires a great deal of expense and time. For this reason, semi-supervised learning has recently been developed due to its superior performance despite using only a small number of labeled data. In the existing semi-supervised learning algorithms, unlabeled data are used to build a graph Laplacian in order to represent an intrinsic data geometry. In this paper, we represent the unlabeled data as the spatial-temporal dataset by considering smoothly moving objects over time and space. The developed algorithm is evaluated for position estimation of a smartphone-based robot. In comparison with other state-of-art semi-supervised learning, our algorithm performs more accurate location estimates.

지도의 의미 정보를 이용한 개선된 차량 위치 추정 알고리즘 (An Improved Position Estimation Algorithm of Vehicles Using Semantic Information of Maps)

  • 이창길;최윤호;박진배
    • 제어로봇시스템학회논문지
    • /
    • 제22권9호
    • /
    • pp.753-758
    • /
    • 2016
  • In this paper, we propose a novel method for estimating a vehicle's current position, even on roads that have similar patterns. In the proposed method, we classified the semantic information of the nodes in detail and added the semantic information of the link to solve the problem due to similar and repeated patterns. We also improved the mapping method by comparing the result of the duplicated matching with that of the only matching obtained just before corresponding duplicated matching. From the simulation results, we verify that the performance of the proposed method is better than that of the existing method.

ROS 토픽과 결합 가능한 OPRoS 프레임워크의 이벤트 포트 확장 개발 (Event Port Extension of OPRoS Framework for Inter-connecting with ROS Topic)

  • 장철수;송병열;김성훈
    • 제어로봇시스템학회논문지
    • /
    • 제20권12호
    • /
    • pp.1252-1258
    • /
    • 2014
  • ROS is based on a graph architecture where processing takes place in nodes. Nodes communicate together by passing messages through topics based on the publish/subscribe model. On the other hand, OPRoS components know each other and are tightly-coupled via port connections, and different coupling schemes make the interoperation between two platforms difficult. This paper describes an extension of OPRoS framework to support the interoperation with the ROS topic.

악력 세기와 뇌파의 상관관계에 관한 연구 (Study on the Correlation between Grip Strength and EEG)

  • 김동은;박승민;심귀보
    • 제어로봇시스템학회논문지
    • /
    • 제19권9호
    • /
    • pp.853-859
    • /
    • 2013
  • The purpose of this study was to identify the correlation between electroencephalography (EEG) and strength, using grip strength. 64-channel EEG data were recorded from five healthy subjects in tasks requiring handgrip contractions of nine levels of MVC (Maximal Voluntary Contraction). We found the ERS (Event-Related Synchronization)/ERD (Event-Related Desynchronization) at the measured EEG data using STFT (Short-Time Furier Transform) and spectral power in the EEG of each frequency range displayed in the graph. In this paper, we identified that the stronger we contracted, the greater the spectral power was increased in the ${\beta}$, ${\gamma}$ wave.

Efficient Computations for Evaluating Extended Stochastic Petri Nets using Algebraic Operations

  • Kim, Dong-Sung;Moon, Hong-Ju;Bahk, Je-Hyeong;Kwon, Wook-Hyun;Zygmunt J. Haas
    • International Journal of Control, Automation, and Systems
    • /
    • 제1권4호
    • /
    • pp.431-443
    • /
    • 2003
  • This paper presents an efficient method to evaluate the performance of an extended stochastic Petri net by simple algebraic operations. The reachability graph is derived from an extended stochastic Petri net, and then converted to a timed stochastic state machine, using a semi-Markov process. The n-th moments of the performance index are derived by algebraic manipulations with each of the n-th moments of transition time and transition probability. For the derivation, three reduction rules are introduced on the transition trajectories in a well-formed regular expression. Efficient computation algorithms are provided to automate the suggested method. The presented method provides a proficient means to derive both the numerical and the symbolic solutions for the performance of an extended stochastic Petri net by simple algebraic manipulations.

골격지도에서 개별 목표를 갖는 두 이동로봇의 충돌 회피 알고리즘 (A Collision Avoidance Algorithm for Two Mobile Robots with Independent Goals in Skeleton Map)

  • 양동훈;홍석교
    • 제어로봇시스템학회논문지
    • /
    • 제12권7호
    • /
    • pp.700-705
    • /
    • 2006
  • This paper proposes a collision avoidance algorithm for two mobile robots with independent goals in a same workspace. Using skeleton map, an environment is presented as a graph consisting of nodes and arcs. Robots generate the shortest set of paths using the combination of objective functions of the two robots. Path for collision avoidance of a robot can be selected among three class; the shortest path, detour, paths with a waiting time at safety points around crossing points. Simulation results are presented to verify the efficiency of the proposed algorithms.

LQ-역최적 2차 일치제어에 기반한 이동로봇에 대한 대형·속도일치 프로토콜의 역최적 설계 (Inverse Optimal Design of Formation/Velocity Consensus Protocol for Mobile Robots Based on LQ Inverse Optimal Second-order Consensus)

  • 이재영;최윤호
    • 제어로봇시스템학회논문지
    • /
    • 제21권5호
    • /
    • pp.434-441
    • /
    • 2015
  • In this paper, we propose an inverse optimal distributed protocol for the formation and velocity consensus of nonholonomic mobile robots. The communication among mobile robots is described by a simple undirected graph, and the mobile robots' kinematics are considered. The group of mobile robots driven by the proposed protocols asymptotically achieves the desired formation and group velocity in an inverse optimal fashion. The design of the protocols is based on dynamic feedback linearization and the proposed linear quadratic (LQ) inverse optimal second-order consensus protocol. A numerical simulation is given to verify the effectiveness of the proposed scheme.

페트리네트 모델을 이용한 냉동시스템의 고장 진단 (Fault Diagnosis of a Refrigeration System Based on Petri Net Model)

  • 정석권;윤종수
    • 동력기계공학회지
    • /
    • 제9권4호
    • /
    • pp.187-193
    • /
    • 2005
  • In this paper, we proposes a man-machine interface design for fault diagnosis system with inter-node search method in a Petri net model. First, complicated fault cases are modeled as the Petri net graph expressions. Next, to find out causes of the faults on which we focus, a Petri net model is analyzed using the backward reasoning of transition-invariance in the Petri net. In this step, the inter-node search method algorithm is applied to the Petri net model for reducing the range of sources in faults. Finally, the proposed method is applied to a fault diagnosis of a refrigeration system to confirm the validity of the proposed method.

  • PDF

이동로봇의 위치인식을 위한 공분산 행렬 예측 기법 (An Estimation Method of the Covariance Matrix for Mobile Robots' Localization)

  • 도낙주;정완균
    • 제어로봇시스템학회논문지
    • /
    • 제11권5호
    • /
    • pp.457-462
    • /
    • 2005
  • An empirical way of a covariance matrix which expresses the odometry uncertainty of mobile robots is proposed. This method utilizes PC-method which removes systematic errors of odometry. Once the systematic errors are removed, the odometry error can be modeled using the Gaussian probability distribution, and the parameters of the distribution can be represented by the covariance matrix. Experimental results show that the method yields $5{\%}$ and $2.3{\%}$ offset for the synchro and differential drive robots.

동적프로그래밍을 이용한 자율이동로봇의 동작계획 (Motion Planning of Autonomous Mobile Robot using Dynamic Programming)

  • 윤희상;박태형
    • 제어로봇시스템학회논문지
    • /
    • 제16권1호
    • /
    • pp.53-60
    • /
    • 2010
  • We propose a motion planning method for autonomous mobile robots. In order to minimize traveling time, a smooth path and a time optimal velocity profile should be generated under kinematic and dynamic constraints. In this paper, we develop an effective and practical method to generate a good solution with lower computation time. The initial path is obtained from voronoi diagram by Dijkstra's algorithm. Then the path is improved by changing the graph and path simultaneously. We apply the dynamic programming algorithm into the stage of improvement. Simulation results are presented to verify the performance of the proposed method.