• Title/Summary/Keyword: Multiple Solution Task

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

공리적설계 기반의 내부종속 AHP를 이용한 국방무기 해외 구매사업의 무기성능 평가방법 개발 (Development of Evaluation Method for Performance of Weapon System using Axiomatic Design based Inner Dependence AHP)

  • 조현기;김우제
    • 경영과학
    • /
    • 제29권3호
    • /
    • pp.45-65
    • /
    • 2012
  • Test and evaluation of weapon system is an important task to evaluate the performance of overseas weapon system purchasing project. Especially, quantitative evaluation of performances is hardly completed in defense projects where multiple criteria are conflicted each other. In order to solve this problem, we apply Axiomatic Design (AD) and Inner Dependence AHP method. First, finite functional requirements (FRs) are categorized in hierarchy structure by selecting proper design parameters (DPs) to implement their corresponding FRs. If there are no ways to select DPs when design is coupled between FRs and DPs, then inner dependence is allowed to overcome the strict rule of independence in AHP. Second, the weights of DPs are calculated by applying both Inner Dependence AHP method for coupled design and normal AHP method for uncoupled or decoupled design. Finally, information axiom of AD is applied to the proposed weapon systems by calculating information contents for all parameters. Weapon system with minimum sum of information contents is considered as the best solution. The proposed method in this study should be used in multiple criteria decision making problems involving various conflicting criteria.

다중에이전트 경로탐색(MAPF) 기반의 실내배송로봇 군집제어 구현 (Implementation of MAPF-based Fleet Management System)

  • 신동철;문형일;강성규;이성원;양현석;박찬욱;남문식;정길수;김영재
    • 로봇학회논문지
    • /
    • 제17권4호
    • /
    • pp.407-416
    • /
    • 2022
  • Multiple AMRs have been proved to be effective in improving warehouse productivity by eliminating workers' wasteful walking time. Although Multi-agent Path Finding (MAPF)-based solution is an optimal approach for this task, its deployment in practice is challenging mainly due to its imperfect plan-execution capabilities and insufficient computing resources for high-density environments. In this paper, we present a MAPF-based fleet management system architecture that robustly manages multiple robots by re-computing their paths whenever it is necessary. To achieve this, we defined four events that trigger our MAPF solver framework to generate new paths. These paths are then delivered to each AMR through ROS2 message topic. We also optimized a graph structure that effectively captures spatial information of the warehouse. By using this graph structure we can reduce computational burden while keeping its rescheduling functionality. With proposed MAPF-based fleet management system, we can control AMRs without collision or deadlock. We applied our fleet management system to the real logistics warehouse with 10 AMRs and observed that it works without a problem. We also present the usage statistic of adopting AMRs with proposed fleet management system to the warehouse. We show that it is useful over 25% of daily working time.

A New Multi-objective Evolutionary Algorithm for Inter-Cloud Service Composition

  • Liu, Li;Gu, Shuxian;Fu, Dongmei;Zhang, Miao;Buyya, Rajkumar
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제12권1호
    • /
    • pp.1-20
    • /
    • 2018
  • Service composition in the Inter-Cloud raises new challenges that are caused by the different Quality of Service (QoS) requirements of the users, which are served by different geo-distributed Cloud providers. This paper aims to explore how to select and compose such services while considering how to reach high efficiency on cost and response time, low network latency, and high reliability across multiple Cloud providers. A new hybrid multi-objective evolutionary algorithm to perform the above task called LS-NSGA-II-DE is proposed, in which the differential evolution (DE) algorithm uses the adaptive mutation operator and crossover operator to replace the those of the Non-dominated Sorting Genetic Algorithm-II (NSGA-II) to get the better convergence and diversity. At the same time, a Local Search (LS) method is performed for the Non-dominated solution set F{1} in each generation to improve the distribution of the F{1}. The simulation results show that our proposed algorithm performs well in terms of the solution distribution and convergence, and in addition, the optimality ability and scalability are better compared with those of the other algorithms.

상지 외골격 로봇 제어를 위한 인체 팔 동작의 기구학 및 동역학적 분석 - 파트 1: 시스템 모델 및 기구학적 제한 (Analysis on Kinematics and Dynamics of Human Arm Movement Toward Upper Limb Exoskeleton Robot Control Part 1: System Model and Kinematic Constraint)

  • 김현철;이춘영
    • 제어로봇시스템학회논문지
    • /
    • 제18권12호
    • /
    • pp.1106-1114
    • /
    • 2012
  • To achieve synchronized motion between a wearable robot and a human user, the redundancy must be resolved in the same manner by both systems. According to the seven DOF (Degrees of Freedom) human arm model composed of the shoulder, elbow, and wrist joints, positioning and orientating the wrist in space is a task requiring only six DOFs. Due to this redundancy, a given task can be completed by multiple arm configurations, and thus there exists no unique mathematical solution to the inverse kinematics. This paper presents analysis on the kinematic and dynamic aspect of the human arm movement and their effect on the redundancy resolution of the human arm based on a seven DOF manipulator model. The redundancy of the arm is expressed mathematically by defining the swivel angle. The final form of swivel angle can be represented as a linear combination of two different swivel angles achieved by optimizing different cost functions based on kinematic and dynamic criteria. The kinematic criterion is to maximize the projection of the longest principal axis of the manipulability ellipsoid for the human arm on the vector connecting the wrist and the virtual target on the head region. The dynamic criterion is to minimize the mechanical work done in the joint space for each two consecutive points along the task space trajectory. As a first step, the redundancy based on the kinematic criterion will be thoroughly studied based on the motion capture data analysis. Experimental results indicate that by using the proposed redundancy resolution criterion in the kinematic level, error between the predicted and the actual swivel angle acquired from the motor control system is less than five degrees.

Adaptive Call Admission Control Scheme for Heterogeneous Overlay Networks

  • Kim, Sung-Wook
    • Journal of Communications and Networks
    • /
    • 제14권4호
    • /
    • pp.461-466
    • /
    • 2012
  • Any future heterogeneous overlay network system must be able to support ubiquitous access across multiple wireless networks. To coordinate these diverse network environments, one challenging task is a call admission decision among different types of network. In this paper, we propose a new call admission control scheme to provide quality of service (QoS) while ensuring system efficiency. Based on the interplay between network structure and dynamics, we estimate the network's QoS level and adjust the service price adaptively with the aim of maximizing the network performance. A simulation shows that the proposed scheme can approximate an optimized solution while ensuring a well-balanced network performance in widely different network environments.

분산다중센서로 구현된 지능화공간의 색상정보를 이용한 실시간 물체추적 (Real-Time Objects Tracking using Color Configuration in Intelligent Space with Distributed Multi-Vision)

  • 진태석;이장명;하시모토히데키
    • 제어로봇시스템학회논문지
    • /
    • 제12권9호
    • /
    • pp.843-849
    • /
    • 2006
  • Intelligent Space defines an environment where many intelligent devices, such as computers and sensors, are distributed. As a result of the cooperation between smart devices, intelligence emerges from the environment. In such scheme, a crucial task is to obtain the global location of every device in order to of for the useful services. Some tracking systems often prepare the models of the objects in advance. It is difficult to adopt this model-based solution as the tracking system when many kinds of objects exist. In this paper the location is achieved with no prior model, using color properties as information source. Feature vectors of multiple objects using color histogram and tracking method are described. The proposed method is applied to the intelligent environment and its performance is verified by the experiments.

다관절 로봇의 계층적 제어를 위한 HQP의 연산 비용 감소 방법 (Computational Cost Reduction Method for HQP-based Hierarchical Controller for Articulated Robot)

  • 박민규;김동환;오용환;이이수
    • 로봇학회논문지
    • /
    • 제17권1호
    • /
    • pp.16-24
    • /
    • 2022
  • This paper presents a method that can reduce the computational cost of the hierarchical quadratic programming (HQP)-based robot controller. Hierarchical controllers can effectively manage articulated robots with many degrees of freedom (DoFs) to perform multiple tasks. The HQP-based controller is one of the generic hierarchical controllers that can provide a control solution guaranteeing strict task priority while handling numerous equality and inequality constraints. However, according to a large amount of computation, it can be a burden to use it for real-time control. Therefore, for practical use of the HQP, we propose a method to reduce the computational cost by decreasing the size of the decision variable. The computation time and control performance of the proposed method are evaluated by real robot experiments with a 15 DoFs dual-arm manipulator.

실시간 데이터 예측을 위한 인공지능 분석 방법 연구 (A Study on the Analysis Method of Artificial Intelligence for Real-Time Data Prediction.)

  • 홍필두
    • 한국정보통신학회:학술대회논문집
    • /
    • 한국정보통신학회 2021년도 춘계학술대회
    • /
    • pp.547-549
    • /
    • 2021
  • 인공지능 분석에서 모델을 만들고 이를 검증하는 과정은 이미 생성된 데이터를 가지고 수행하는 Batch Processing이기에 연산 처리시간이 필요한 작업이다. 우리는 주식이나 국방 정보와 같은 실시간으로 발생하는 데이터를 바로 앞에서 발생한 데이터를 가지고 실시간으로 모델을 세우고 검증하여 예측하는 것이 필요하다. 이를 위한 해결책으로, 인공지능 모델링 작업에 필요한 데이터를 시간 처리 순으로 분할하고 데이터를 여러 프로세스에서 분산 처리하는 기법을 적용하여 해결하였다.

  • PDF

SPMLD: Sub-Packet based Multipath Load Distribution for Real-Time Multimedia Traffic

  • Wu, Jiyan;Yang, Jingqi;Shang, Yanlei;Cheng, Bo;Chen, Junliang
    • Journal of Communications and Networks
    • /
    • 제16권5호
    • /
    • pp.548-558
    • /
    • 2014
  • Load distribution is vital to the performance of multipath transport. The task becomes more challenging in real-time multimedia applications (RTMA), which impose stringent delay requirements. Two key issues to be addressed are: 1) How to minimize end-to-end delay and 2) how to alleviate packet reordering that incurs additional recovery time at the receiver. In this paper, we propose sub-packet based multipath load distribution (SPMLD), a new model that splits traffic at the granularity of sub-packet. Our SPMLD model aims to minimize total packet delay by effectively aggregating multiple parallel paths as a single virtual path. First, we formulate the packet splitting over multiple paths as a constrained optimization problem and derive its solution based on progressive approximation method. Second, in the solution, we analyze queuing delay by introducing D/M/1 model and obtain the expression of dynamic packet splitting ratio for each path. Third, in order to describe SPMLD's scheduling policy, we propose two distributed algorithms respectively implemented in the source and destination nodes. We evaluate the performance of SPMLD through extensive simulations in QualNet using real-time H.264 video streaming. Experimental results demonstrate that: SPMLD outperforms previous flow and packet based load distribution models in terms of video peak signal-to-noise ratio, total packet delay, end-to-end delay, and risk of packet reordering. Besides, SPMLD's extra overhead is tiny compared to the input video streaming.

복수 트랜스퍼 크레인을 활용하는 블록 내 재정돈 계획 탐색 (Searching for an Intra-block Remarshalling Plan for Multiple Transfer Cranes)

  • 오명섭;강재호;류광렬;김갑환
    • 한국정보과학회논문지:소프트웨어및응용
    • /
    • 제33권7호
    • /
    • pp.624-635
    • /
    • 2006
  • 본 논문에서는 담금질 알고리즘을 이용하여 블록 내 재정돈 계획을 수립하는 방안을 제안한다. 블록 내 재정돈이란 컨테이너를 선박에 싣는 적하 작업을 효율적으로 수행하기 위하여 하나의 장치장 블록 여기저기에 흩어져 있는 대상 컨테이너들을 적하 순서에 맞춰 몇 개의 베이로 모으는 작업이다. 유효하면서 좋은 재정돈 계획을 수립하기 위해서는 적하 순서를 충분히 고려하는 동시에 재정돈에 소요되는 시간을 가능한 줄여야 한다. 본 제안 방안은 대상 컨테이너들의 목표 위치를 탐색할 대상으로 두어 해로 표현하고, 대상 컨테이너들의 초기 위치 , 목표 위치 및 적하 순서를 함께 고려하여 컨테이너 이동을 위한 부분 순서를 생성한다 생성한 부분 순서의 제약하에 트랜스퍼 크레인간의 간섭을 고려하여 구체적인 재정돈 계획을 수립하고 그 예상 작업 시간으로 해를 평가한다. 시뮬레이션 실험 결과 본 제안 방안이 다양한 환경에서 유효하면서 효율적인 재정돈 계획을 수립할 수 있음을 확인하였다.