• 제목/요약/키워드: Burden tasks

검색결과 82건 처리시간 0.025초

유전알고리즘을 이용한 로보트 매니퓰레이터의 최적 시간 경로 계획 (Planning a minimum time path for robot manipulator using genetic algorithm)

  • 김용호;강훈;전홍태
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 1992년도 한국자동제어학술회의논문집(국내학술편); KOEX, Seoul; 19-21 Oct. 1992
    • /
    • pp.698-702
    • /
    • 1992
  • In this paper, Micro-Genetic algorithms(.mu.-GAs) is proposed on a minimum-time path planning for robot manipulator, which is a kind of optimization algorithm. The minimum-time path planning, which can allow the robot system to perform the demanded tasks with a minimum execution time, may be of consequence to improve the productivity. But most of the methods proposed till now suffers from a significant computation burden and can't often find the optimal values. One way to overcome such difficulties is to apply the Micro-Genetic Algorithms, which can allow to find the optimal values, to the minimum-time problem. This paper propose an approach for solving the minimum-time path planning by using Micro-Genetic Algorithms. The effectiveness of the proposed method is demonstrated using the 2 d.o.f plannar Robot manipulator.

  • PDF

다작업 로보트 매니퓰레이터의 최적 시간 경로 계획을 위한 미소유전알고리즘의 적용 (Planning a Minimum Time Path for Multi-task Robot Manipulator using Micro-Genetic Algorithm)

  • 김용호;심귀보;조현찬;전홍태
    • 전자공학회논문지B
    • /
    • 제31B권4호
    • /
    • pp.40-47
    • /
    • 1994
  • In this paper, Micro-Genetic algorithms($\mu$-GAs) is proposed on a minimum-time path planning for robot manipulator. which is a kind of optimization algorithm. The minimum-time path planning, which can allow the robot system to perform the demanded tasks with a minimum execution time, may be of consequence to improve the productivity. But most of the methods proposed till now suffers from a significant computation burden and can`t often find the optimaul values. One way to overcome such difficulties is to apply the Micro-Genetic Algorithms, which can allow to find the optimul values, to the minimum-time problem. This paper propose an approach for solving the minimum-time path planning by using Micro-Genetic Algorithms. The effectiveness of the proposed method is demonstrated using the 2 d.o.f plannar Robot manipulator.

  • PDF

근골격계질환예방을 위한 국내외 제도 (A Study on the Prevention System of Musculoskeletal Disorders in Korea and Other Countries)

  • 이동경;김증호
    • 대한인간공학회지
    • /
    • 제29권4호
    • /
    • pp.423-433
    • /
    • 2010
  • The presence of musculoskeletal burden tasks and work related musculoskeletal disorders (WMSDs) at Industrial workers was not well-known until 2000 in Korea. Since The Occupational Safety & Health Law was registered a business of proprietor duty in preventing work-related MSDs of workers In July of 2003 WMSDs became a big issue in Korea. A social previous interest was focused on the manufacturing industry just like auto and shipping industry in manufacturing sectors but nowadays it is spreading out to non-manufacturing fields gradually. Nevertheless, we have WMSD prevention Law and System in Korea to reduce WMSDs effectively and systematically we recognized some mistakes and problems of WMSD Law and System. In this paper we study these recent problems in Korea from about 10 years experience and proposed some proposals as discussion.

홉필드 신경 회로망을 이용한 로보트 매니퓰레이터의 최적 시간 경로 계획 (Planning a minimum time path for robot manipullator using Hopfield neural network)

  • 김영관;조현찬;이홍기;전홍태
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 1990년도 하계학술대회 논문집
    • /
    • pp.485-491
    • /
    • 1990
  • We propose a minimum-time path planning soheme for the robot manipulator using Hopfield neural network. The minimum-time path planning, which can allow the robot system to perform the demanded tasks with a minimum execution time, may be of consequence to improve the productivity. But most of the methods proposed till now suffers from a significant computational burden and thus limits the on-line application. One way to avoid such a difficulty is to apply the neural network technique, which can allow the parallel computation, to the minimum-time problem. This paper propose an approach for solving the minimum-time path planning by using Hopfield neural network. The effectiveness of the proposed method is demonstrarted using the PUMA 560 manipulator.

  • PDF

의사결정지원시스템에서 직관적이고 사용자 친숙한 모델 해결을 위한 모델과 솔버의 유연한 통합에 대한 연구 (Flexible Integration of Models and Solvers for Intuitive and User-Friendly Model-Solution in Decision Support Systems)

  • 이근우;허순영
    • 한국경영과학회지
    • /
    • 제30권1호
    • /
    • pp.75-94
    • /
    • 2005
  • Research in the decision sciences has continued to develop a variety of mathematical models as well as software tools supporting corporate decision-making. Yet. in spite of their potential usefulness, the models are little used in real-world decision making since the model solution processes are too complex for ordinary users to get accustomed. This paper proposes an intelligent and flexible model-solver integration framework that enables the user to solve decision problems using multiple models and solvers without having precise knowledge of the model-solution processes. Specifically, for intuitive model-solution, the framework enables a decision support system to suggest the compatible solvers of a model autonomously without direct user intervention and to solve the model by matching the model and solver parameters intelligently without any serious conflicts. Thus, the framework would improve the productivity of institutional model solving tasks by relieving the user from the burden of leaning model and solver semantics requiring considerable time and efforts.

홉필드 신경 회로망을 이용한 로보트 매니퓰레이터의 최적시간 경로 계획 (Planning a Time-optimal path for Robot Manipulator Using Hopfield Neural Network)

  • 조현찬;김영관;전홍태;이홍기
    • 대한전자공학회논문지
    • /
    • 제27권9호
    • /
    • pp.1364-1371
    • /
    • 1990
  • We propose a time-optimal path planning scheme for the robot manipulator using Hopfield neural network. The time-optimal path planning, which can allow the robot system to perform the demanded tasks with a minimum execution time, may be of consequence to improve the productivity. But most of the methods proposed till now suffers from a significant computational burden and thus limits the on-line application. One way to avoid such a difficulty is to apply the neural networke technique, which can allow the parallel computation, to the minimum time problem. This paper proposes an approach for solving the time-optimal path planning by using Hopfield neural network. The effectiveness of the proposed method is demonstrarted using a PUMA 560 manipulator.

  • PDF

Analyzing Public Transport Network Accessibility

  • Jun, Chulmin
    • Korean Journal of Geomatics
    • /
    • 제4권2호
    • /
    • pp.53-57
    • /
    • 2004
  • Due to the traffic congestion and public-oriented transportation policies of Seoul, public transportation is receiving attention and being used increasingly. However, current transport routes configuration is showing unbalanced accessibility throughout the city area creating differences in time, expenses and metal burden of users who travel the same distances. One of the reasons is that transport route planning has been partially empirical and non-quantitative tasks due to lack of relevant methods for assessing the complexity of the transport routes. This paper presents a method to compute the connectivity of public transport system based on the topological structure of the network of transport routes. The main methodological issue starts from the fact that the more transfers take place, the deeper the connectivity becomes making that area evaluated as less advantageous as for public transport accessibility. By computing the connectivity of each bus or subway station with all others in a city, we can quantify the differences in the serviceability of city areas based on the public transportation. This paper is based on the topological interpretation of the routes network and suggests an algorithm that can automate the computation process. The process is illustrated using a simple artificial network data built in a GIS.

  • PDF

공학교육인증 프로그램의 효과적인 운영 데이터 관리 방법 (Effective Data Management Method for Operational Data on Accredited Engineering Programs)

  • 한경수
    • 공학교육연구
    • /
    • 제17권5호
    • /
    • pp.51-58
    • /
    • 2014
  • This study proposes an effective data management method for easing the burden on self-study report by analyzing operational data on accredited engineering programs. Four analysis criteria are developed: variability, difficulty level of collecting, urgency of analysis, timeliness. After the operational data are analyzed in terms of the analysis criteria, the data which should be managed in time are extracted according to the analysis results. This study proposes a data management method in which tasks of managing the timely-managed data are performed based on the regular academic schedule, so that the result of this study may be used as a working-level reference material.

보건계열 대학생의 실습 스트레스에 관한 질적 연구 (A Qualitative Study on Job Training Stress for University Students Majoring Healthcare)

  • 오은환
    • 한국학교ㆍ지역보건교육학회지
    • /
    • 제18권2호
    • /
    • pp.83-95
    • /
    • 2017
  • Objectives: The study was performed to investigate job training stress for university students who have a major in healthcare. Methods: For the analysis, 11 fourth-year students who have experienced job training at healthcare-related agencies were interviewed. Interviews were conducted from May 2016 to June 2016 for 3 weeks. The data were collected with semi-structured open-ended questions and analysed by the method of Consensual Qualitative Research(CQR). Results: The main reasons for the job training stress for students fell into two personal and environmental domains. And the domains were analyzed by 12 categories in-depth. Students felt stress by tasks, personal relationship, and burden of duties. Conclusions: To deal with job training stress, students took emotional and behavioral treatments such as positive thinking, communication, and so on. Universities should provide sufficient information on the characteristics of training agencies and training programs to lighten the stress for students.

  • PDF

Detection of Political Manipulation through Unsupervised Learning

  • Lee, Sihyung
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제13권4호
    • /
    • pp.1825-1844
    • /
    • 2019
  • Political campaigns circulate manipulative opinions in online communities to implant false beliefs and eventually win elections. Not only is this type of manipulation unfair, it also has long-lasting negative impacts on people's lives. Existing tools detect political manipulation based on a supervised classifier, which is accurate when trained with large labeled data. However, preparing this data becomes an excessive burden and must be repeated often to reflect changing manipulation tactics. We propose a practical detection system that requires moderate groundwork to achieve a sufficient level of accuracy. The proposed system groups opinions with similar properties into clusters, and then labels a few opinions from each cluster to build a classifier. It also models each opinion with features deduced from raw data with no additional processing. To validate the system, we collected over a million opinions during three nation-wide campaigns in South Korea. The system reduced groundwork from 200K to nearly 200 labeling tasks, and correctly identified over 90% of manipulative opinions. The system also effectively identified transitions in manipulative tactics over time. We suggest that online communities perform periodic audits using the proposed system to highlight manipulative opinions and emerging tactics.