• 제목/요약/키워드: Multiple robotics

검색결과 603건 처리시간 0.021초

로보트 매니풀레이터의 시변 지연 시간을 고려한 분산 감소 임플리시트 자기동조 알고리즘 (Reduced variance implicit self-tuning a;gorithm with variable time-delays for robot manipulator)

  • 이희진;박민용;이상배
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 1988년도 한국자동제어학술회의논문집(국내학술편); 한국전력공사연수원, 서울; 21-22 Oct. 1988
    • /
    • pp.12-15
    • /
    • 1988
  • A controller described in this paper is designed for implicit generalised minimum varience controller with variable time delays in which the weighting polynominals are calculated to reduce the output and control signals variances. This paper is based on the fact that the pole-assigment equation may have multiple solutions if the weighting polynominals are not of minimal order. It is shown that the larger order of the weighting polynominals increment the better is the stochastic behavior of the closed-loop system with variable time delays without changs in the deterministic behavior of the system. Based on this theory, the controller is applied to position control of a three-link manipulater with parameter uncertainty.

  • PDF

토큰 버스 네트워크의 동적 타이머 제어방식 및 성능해석에 관한 연구 (Dynamic timer-controlled algorithm and its performance analysis on the token bus network)

  • 정범진;권욱현
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 1992년도 한국자동제어학술회의논문집(국내학술편); KOEX, Seoul; 19-21 Oct. 1992
    • /
    • pp.55-60
    • /
    • 1992
  • The IEEE 802.4 priority mechanism can be used to handle multiple data access classes of traffic. Several timers are used to realize the priority mechanism. The performance and stability of a token bus network depend on the assignment of such timers. In this peper, we present a dynamic timer assignment algorithm for the token passing bus network. The presented algorithm has simple structure for real-time applications and adaptively controls the set of initial timer values according to the offered traffic load. The assignment of the set of timers becomes easy due to the presented algorithm. Based on the iterative algorithm, some solutions such as mean waiting time are derived.

  • PDF

Mixed $\textrm{H}_2/\textrm{H}_\infty$ Robust Control with Diagonal Structured Uncertainty

  • Bambang, Riyanto;Uchida, Kenko;Shimemura, Etsujiro
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 1992년도 한국자동제어학술회의논문집(국제학술편); KOEX, Seoul; 19-21 Oct. 1992
    • /
    • pp.575-580
    • /
    • 1992
  • Mixed H$_{2}$/H$_{\infty}$ robust control synthesis is considered for finite dimensional linear time-invariant systems under the presence of diagonal structured uncertainties. Such uncertainties arise for instance when there is real perturbation in the nominal model of the state space system or when modeling multiple (unstructured) uncertainty at different locations in the feedback loop. This synthesis problem is reduced to convex optimization problem over a bounded subset of matrices as well as diagonal matrix having certain structure. For computational purpose, this convex optimization problem is further reduced into Generalized Eigenvalue Minimization Problem where a powerful algorithm based on interior point method has been recently developed..

  • PDF

Robust $L_2$Optimization for Uncertain Systems

  • Kim, Kyung-Soo;Park, Youngjin
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 1995년도 Proceedings of the Korea Automation Control Conference, 10th (KACC); Seoul, Korea; 23-25 Oct. 1995
    • /
    • pp.348-351
    • /
    • 1995
  • This note proposes a robust LQR method for systems with structured real parameter uncertainty based on Riccati equation approach. Emphasis is on the reduction of design conservatism in the sense of quadratic performance by utilizing the uncertainty structure. The class of uncertainty treated includes all the form of additive real parameter uncertainty, which has the multiple rank structure. To handle the structure of uncertainty, the scaling matrix with block diagonal structure is introduced. By changing the scaling matrix, all the possible set of uncertainty structures can be represented. Modified algebraic Riccati equation (MARE) is newly proposed to obtain a robust feedback control law, which makes the quadratic cost finite for an arbitrary scaling matrix. The remaining design freedom, that is, the scaling matrix is used for minimizing the upper bound of the quadratic cost for all possible set of uncertainties within the given bounds. A design example is shown to demonstrate the simplicity and the effectiveness of proposed method.

  • PDF

Realization of Point-Listening Characteristics by Enclosed Microphone Array System with Optimal Complex Weighting

  • Ohyama, Shinji;Sasagawa, Yukifumi;Cao, Li;Kobayashi, Akira
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 1999년도 제14차 학술회의논문집
    • /
    • pp.266-269
    • /
    • 1999
  • An electronically Scannable microphone system is in the Planning stage. For this Purpose, a multiple microphone array with controllable delay is available. To achieve effective point-listening characteristics, we proposed an enclosed microphone array system with a complex weighting method. In this system, both the microphone arrangement and the value of the complex weighting are important. In this report, the construction of microphone array system and the signal-processing method are explained, and the calculation method for optimal complex weighting is also presented. A prototype experimental setup is designed and fabricated to verify the expected characteristics.

  • PDF

Learning soccer robot using genetic programming

  • Wang, Xiaoshu;Sugisaka, Masanori
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 1999년도 제14차 학술회의논문집
    • /
    • pp.292-297
    • /
    • 1999
  • Evolving in artificial agent is an extremely difficult problem, but on the other hand, a challenging task. At present the studies mainly centered on single agent learning problem. In our case, we use simulated soccer to investigate multi-agent cooperative learning. Consider the fundamental differences in learning mechanism, existing reinforcement learning algorithms can be roughly classified into two types-that based on evaluation functions and that of searching policy space directly. Genetic Programming developed from Genetic Algorithms is one of the most well known approaches belonging to the latter. In this paper, we give detailed algorithm description as well as data construction that are necessary for learning single agent strategies at first. In following step moreover, we will extend developed methods into multiple robot domains. game. We investigate and contrast two different methods-simple team learning and sub-group loaming and conclude the paper with some experimental results.

  • PDF

An integrated system for synthesis of plant-wide control structure

  • Choi, In-Seok;Yoon, En-Sup
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 1990년도 한국자동제어학술회의논문집(국제학술편); KOEX, Seoul; 26-27 Oct. 1990
    • /
    • pp.1265-1270
    • /
    • 1990
  • A prototype integrated system and its theories for distributed SISO control structure synthesis of complete chemical plants is developed. The scope of this work includes control structure synthesis not only of simple units with unspecified control loops but also of the complex process at preliminary and basic design stage. Hierarchical approach and dual-decomposition strategy (that is multi-layer decomposition and multi-echelon decomposition) is applied to this system. Because automatic control structure synthesis of complex plants is a problem defined as a series of knowledge-intensive tasks within multiple spaces, the established methodology is complemented by not only techniques from knowledge-based expert systems but also shortcut and rigorous control theories. This system is used for education of control designers, process engineers, operators and students as well as for operability studying, in-line and on-line process control structure synthesis.

  • PDF

A geometric approach to fault diagnosis algorithm in linear systems

  • Kim, Jee-Hong;Bien, Zeungnam
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 1990년도 한국자동제어학술회의논문집(국제학술편); KOEX, Seoul; 26-27 Oct. 1990
    • /
    • pp.1216-1221
    • /
    • 1990
  • An algorithm for multiple fault diagnosis of linear dynamic systems is proposed. The algorithm is constructed by using of the geometric approach based on observation that, when the number of faulty units of the system is known, the set of faulty units can be differentiated from other sets by checking linear varieties in the measurement data space. It is further shown that the system with t number of faults can be diagnosed within (t+1) sample-time units if the input-output measurements are rich and that the algorithm can be used for diagnosis even when the number of faults is not known in advance.

  • PDF

포토메트릭 스테레오를 이용한 물체표면방향의 인식 (Recognition of surface orientations in an object using photomeric stereo method)

  • 이종훈;전태현;김도성;이명호
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 1990년도 한국자동제어학술회의논문집(국내학술편); KOEX, Seoul; 26-27 Oct. 1990
    • /
    • pp.816-820
    • /
    • 1990
  • This paper is pre-stage for getting EGI which can be used for modeling of an object. It discusses the construction of the vision processing system and its algorithm for getting needle diagram from tie object image. We realize the algorithm with monocular camera system, using Reflectance Map theory and photometric stereo method. We can calculate the surface normal at any point in the image if we take multiple images at the different lighting conditions. From the 3 images taken from different lighting conditions through the experiment, we get the needle diagrams of the sphere and the object. We confirm the validness of the surface, normal acquisition algorithm comparing the experimental needle diagram with the ideal one obtained from the surface normal of the known object.

  • PDF

Multi-Sensor Multi-Target Passive Locating and Tracking

  • Liu, Mei;Xu, Nuo;Li, Haihao
    • International Journal of Control, Automation, and Systems
    • /
    • 제5권2호
    • /
    • pp.200-207
    • /
    • 2007
  • The passive direction finding cross localization method is widely adopted in passive tracking, therefore there will exist masses of false intersection points. Eliminating these false intersection points correctly and quickly is a key technique in passive localization. A new method is proposed for passive locating and tracking multi-jammer target in this paper. It not only solves the difficulty of determining the number of targets when masses of false intersection points existing, but also solves the initialization problem of elastic network. Thus this method solves the problem of multi-jammer target correlation and the elimination of static false intersection points. The method which dynamically establishes multiple hypothesis trajectory trees solves the problem of eliminating the remaining false intersection points. Simulation results show that computational burden of the method is lower, the elastic network can more quickly find all or most of the targets and have a more probability of locking the real targets. This method can eliminate more false intersection points.